Online performance guarantees for sparse recovery

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantitie ...

Training models that perform well under distribution shifts is a central challenge in machine learning. In this paper, we introduce a modeling framework where, in addition to training data, we have partial structural knowledge of the shifted test distribut ...

We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good trade-off between algorithmic simplici ...

Easy-to-use and accurate heart rate variability (HRV) assessments are essential in athletes??? follow-up, but artifacts may lead to erroneous analysis. Artifact detection and correction are the purpose of extensive literature and implemented in dedicated a ...

Many decision problems in science, engineering, and economics are affected by uncertainty, which is typically modeled by a random variable governed by an unknown probability distribution. For many practical applications, the probability distribution is onl ...

The number of materials or molecules that can be created by combining different chemical elements in various proportions and spatial arrangements is enormous. Computational chemistry can be used to generate databases containing billions of potential struct ...

Kernel methods are fundamental tools in machine learning that allow detection of non-linear dependencies between data without explicitly constructing feature vectors in high dimensional spaces. A major disadvantage of kernel methods is their poor scalabili ...

Popular clustering algorithms based on usual distance functions (e.g., the Euclidean distance) often suffer in high dimension, low sample size (HDLSS) situations, where concentration of pairwise distances and violation of neighborhood structure have advers ...

Graph learning methods have recently been receiving increasing interest as means to infer structure in datasets. Most of the recent approaches focus on different relationships between a graph and data sample distributions, mostly in settings where all avai ...

This paper introduces Memory-limited Online Subspace Estimation Scheme (MOSES) for both estimating the principal components of streaming data and reducing its dimension. More specifically, in various applications such as sensor networks, the data vectors a ...

Randomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of x(T) Bx for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number ...

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...

Online performance guarantees for sparse recovery

Chattez avec Graph Search

Manifold Learning-Based Polynomial Chaos Expansions For High-Dimensional Surrogate Models

Robust Generalization despite Distribution Shift via Minimum Discriminating Information

Dictionary Learning for Two-Dimensional Kendall Shapes

RMSSD Is More Sensitive to Artifacts Than Frequency-Domain Parameters: Implication in Athletes? Monitoring

Wasserstein Distributionally Robust Learning

Chemiscope: interactive structure-property explorer for materials and molecules

Oblivious Sketching of High-Degree Polynomial Kernels

On Perfect Clustering of High Dimension, Low Sample Size Data

Graph Laplacian Mixture Model

MOSES: A Streaming Algorithm for Linear Dimensionality Reduction

On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

Convex optimization in sums of Banach spaces

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations