Equivalence of synthesis and atomic formulations of sparse recovery

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The electron density is an important object in quantum chemistry that is crucial for many downstream tasks in drug design. Recent deep learning approaches predict the electron density around a molecule from atom types and atom positions. Most of these meth ...

The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...

We relate discrepancy theory with the classic scheduling problems of minimizing max flow time and total flow time on unrelated machines. Specifically, we give a general reduction that allows us to transfer discrepancy bounds in the prefix Beck-Fiala (bound ...

Starting from a strong Lattice-Free Maximum Mutual Information (LF-MMI) baseline system, we explore different autoencoder configurations to enhance Mel-Frequency Cepstral Coefficients (MFCC) features. Autoencoders are expected to generate new MFCC features ...

Implicit neural representations (INRs) have recently emerged as a promising alternative to classical discretized representations of signals. Nevertheless, despite their practical success, we still do not understand how INRs represent signals. We propose a ...

In inverse problems, the task is to reconstruct an unknown signal from its possibly noise-corrupted measurements. Penalized-likelihood-based estimation and Bayesian estimation are two powerful statistical paradigms for the resolution of such problems. They ...

We develop a novel 2D functional learning framework that employs a sparsity-promoting regularization based on second-order derivatives. Motivated by the nature of the regularizer, we restrict the search space to the span of piecewise-linear box splines shi ...

Noise is an intrinsic part of any sensor and is present, in various degrees, in any content that has been captured in real life environments. In imaging applications, several pre- and post-processing solutions have been proposed to cope with noise in captu ...

We consider distributed optimization over several devices, each sending incremental model updates to a central server. This setting is considered, for instance, in federated learning. Various schemes have been designed to compress the model updates in orde ...

Fast and accurate transmission line outage detection can help the central control unit to respond rapidly to better maintain the security and reliability of power systems. It is especially critical in the situation of multiple line outages which is more li ...

In this paper, we provide a Banach-space formulation of supervised learning with generalized total-variation (gTV) regularization. We identify the class of kernel functions that are admissible in this framework. Then, we propose a variation of supervised l ...

This paper develops a methodology for regret minimization with stochastic first-order oracle feedback in online, constrained, non-smooth, non-convex problems. In this setting, the minimization of external regret is beyond reach for first-order methods, and ...

It has been experimentally observed that the efficiency of distributed training with stochastic gradient (SGD) depends decisively on the batch size and—in asynchronous implementations—on the gradient staleness. Especially, it has been observed that the spe ...

Nowadays, image and video are the data types that consume most of the resources of modern communication channels, both in fixed and wireless networks. Thus, it is vital to compress visual data as much as possible, while maintaining some target quality leve ...

Proportional-type algorithms have attracted much attention because of their fast convergence ability for sparse system identification. To overcome the drawbacks of existing block proportional methods stemming from inadequate block partitioning, this articl ...

Theoretical and computational approaches to the study of materials and molecules have, over the last few decades, progressed at an exponential rate. Yet, the possibility of producing numerical predictions that are on par with experimental measurements is t ...

We study the limit behaviour of sequences of non-convex, vectorial, random integral functionals, defined on W1,1, whose integrands are ergodic and satisfy degenerate linear growth conditions. The latter involve suitable random, scale-dependent weight-funct ...

This paper describes a novel method for non-holonomic robots of convex shape to avoid imminent collisions with moving obstacles. The method's purpose is to assist navigation in crowds by correcting steering from the robot's path planner or driver. We evalu ...

The usual explanation of the efficacy of wavelet-based methods hinges on the sparsity of many real-world objects in the wavelet domain. Yet, standard wavelet-shrinkage techniques for sparse reconstruction are not competitive in practice, one reason being t ...

Electronic nearsightedness is one of the fundamental principles that governs the behavior of condensed matter and supports its description in terms of local entities such as chemical bonds. Locality also underlies the tremendous success of machine-learning ...

Equivalence of synthesis and atomic formulations of sparse recovery

Chat with Graph Search

Lagnet: Better Electron Density Prediction for Lcao-based Data and Drug-like Substances

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

Flow Time Scheduling and Prefix Beck-Fiala

From Undercomplete to Sparse Overcomplete Autoencoders to Improve LF-MMI Speech Recognition

A Structured Dictionary Perspective on Implicit Neural Representations

Statistical Inference for Inverse Problems: From Sparsity-Based Methods to Neural Networks

Learning of Continuous and Piecewise-Linear Functions With Hessian Total-Variation Regularization

On combining denoising with learning-based image decoding

Stochastic distributed learning with gradient quantization and double-variance reduction

Multiple Line Outage Detection in Power Systems by Sparse Recovery Using Transient Data

Multikernel Regression with Sparsity Constraint

Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach

Critical Parameters for Scalable Distributed Learning with Large Batches and Asynchronous Updates

Learning-based Image Coding: Early Solutions Reviewing and Subjective Quality Evaluation

Design of a Tap-Amplitude-Based Block Proportional Adaptive Filtering Algorithm

Physics-enhanced machine learning with symmetry-adapted and long-range representations

Stochastic homogenization of degenerate integral functionals with linear growth

Reactive Navigation in Crowds for Non-holonomic Robots with Convex Bounding Shape

The Sparsity of Cycle Spinning for Wavelet-Based Solutions of Linear Inverse Problems

Multi-scale approach for the prediction of atomic scale properties