Online performance guarantees for 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.

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

This paper studies kernel ridge regression in high dimensions under covariate shifts and analyzes the role of importance re-weighting. We first derive the asymptotic expansion of high dimensional kernels under covariate shifts. By a bias-variance decomposi ...

The remarkable ability of deep learning (DL) models to approximate high-dimensional functions from samples has sparked a revolution across numerous scientific and industrial domains that cannot be overemphasized. In sensitive applications, the good perform ...

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 ...

In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...

The use of meteorological radars to study snowfall microphysical properties and processes is well established, in particular via a few distinct techniques: the use of radar polarimetry, of multi-frequency radar measurements, and of the radar Doppler spectr ...

Speech recognition-based applications upon the advancements in artificial intelligence play an essential role to transform most aspects of modern life. However, speech recognition in real-life conditions (e.g., in the presence of overlapping speech, varyin ...

Principal component analysis (PCA) is an essential algorithm for dimensionality reduction in many data science domains. We address the problem of performing a federated PCA on private data distributed among multiple data providers while ensuring data confi ...

Reduced-order models are indispensable for multi-query or real-time problems. However, there are still many challenges to constructing efficient ROMs for time-dependent parametrized problems. Using a linear reduced space is inefficient for time-dependent n ...

This study presents a self-supervised Bayesian Neural Network (BNN) framework using air-borne Acoustic Emission (AE) to identify different Laser Powder Bed Fusion (LPBF) process regimes such as Lack of Fusion, conduction mode, and keyhole without ground-tr ...

We present a general framework for portfolio risk management in discrete time, based on a replicating martingale. This martingale is learned from a finite sample in a supervised setting. Our method learns the features necessary for an effective low-dimensi ...

The quantification of uncertainties can be particularly challenging for problems requiring long-time integration as the structure of the random solution might considerably change over time. In this respect, dynamical low-rank approximation (DLRA) is very a ...

When learning from data, leveraging the symmetries of the domain the data lies on is a principled way to combat the curse of dimensionality: it constrains the set of functions to learn from. It is more data efficient than augmentation and gives a generaliz ...

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 ...

A simple model to study subspace clustering is the high-dimensional k -Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction error in this model i ...

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 ...

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast with most existin ...

Finding a reduction of complex, high-dimensional dynamics to its essential, low-dimensional "heart" remains a challenging yet necessary prerequisite for designing efficient numerical approaches. Machine learning methods have the potential to provide a gene ...

Dynamical Systems (DS) are fundamental to the modeling and understanding time evolving phenomena, and have application in physics, biology and control. As determining an analytical description of the dynamics is often difficult, data-driven approaches are ...

We propose a principled method for projecting an arbitrary square matrix to the non- convex set of asymptotically stable matrices. Leveraging ideas from large deviations theory, we show that this projection is optimal in an information-theoretic sense and ...

Online performance guarantees for sparse recovery

Chat with Graph Search

Spectral Estimators for High-Dimensional Matrix Inference

High-Dimensional Kernel Methods under Covariate Shift: Data-Dependent Implicit Regularization

Towards Trustworthy Deep Learning for Image Reconstruction

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

Randomized low-rank approximation and its applications

Dual-frequency spectral radar retrieval of snowfall microphysics: a physics-driven deep-learning approach

Sparse Autoencoders for Speech Modeling and Recognition

Scalable and Privacy-Preserving Federated Principal Component Analysis

Non-intrusive data-driven reduced-order modeling for time-dependent parametrized problems

Self-Supervised Bayesian representation learning of acoustic emissions from laser powder bed Fusion process for in-situ monitoring

A machine learning approach to portfolio pricing and risk management for high-dimensional problems

Dynamical low rank approximation for uncertainty quantification of time-dependent problems

Leveraging topology, geometry, and symmetries for efficient Machine Learning

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

Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap

Flow Time Scheduling and Prefix Beck-Fiala

Statistical limits of dictionary learning: Random matrix theory and the spectral replica method

Discovery of Slow Variables in a Class Of Multiscale Stochastic Systems Via Neural Networks

Linearization and Identification of Multiple-Attractor Dynamical Systems through Laplacian Eigenmaps

Efficient Learning of a Linear Dynamical System with Stability Guarantees