Simon Foucart

Orcid: 0000-0001-7027-5323

According to our database1, Simon Foucart authored at least 31 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Full recovery from point values: an optimal algorithm for Chebyshev approximability prior.
Adv. Comput. Math., August, 2023

Linearly Embedding Sparse Vectors from 𝓁<sub>2</sub> to 𝓁<sub>1</sub> via Deterministic Dimension-Reducing Maps.
CoRR, 2023

S-Procedure Relaxation: a Case of Exactness Involving Chebyshev Centers.
CoRR, 2023

On the Optimal Recovery of Graph Signals.
CoRR, 2023

2022
The Sparsity of LASSO-type Minimizers.
CoRR, 2022

2021
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns.
IEEE Trans. Inf. Theory, 2021

Facilitating OWL norm minimizations.
Optim. Lett., 2021

Instances of Computational Optimal Recovery: Dealing with Observation Errors.
SIAM/ASA J. Uncertain. Quantification, 2021

Instances of computational optimal recovery: Refined approximability models.
J. Complex., 2021

Optimal Recovery from Inaccurate Data in Hilbert Spaces: Regularize, but what of the Parameter?
CoRR, 2021

2020
Approximability models and optimal system identification.
Math. Control. Signals Syst., 2020

Sampling schemes and recovery algorithms for functions of few coordinate variables.
J. Complex., 2020

Learning from Non-IID Data in Hilbert Spaces: An Optimal Recovery Perspective.
CoRR, 2020

Finer Metagenomic Reconstruction via Biodiversity Optimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Nonlinear Approximation and (Deep) ReLU Networks.
CoRR, 2019

One-Bit Sensing of Low-Rank and Bisparse Matrices.
CoRR, 2019

2018
Concave Mirsky Inequality and Low-Rank Recovery.
SIAM J. Matrix Anal. Appl., 2018

Determining projection constants of univariate polynomial spaces.
J. Approx. Theory, 2018

2017
Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals.
IEEE Trans. Inf. Theory, 2017

An IHT Algorithm for Sparse Recovery From Subexponential Measurements.
IEEE Signal Process. Lett., 2017

2016
One-Bit Compressive Sensing of Dictionary-Sparse Signals.
CoRR, 2016

2014
Sparse Recovery by Means of Nonnegative Least Squares.
IEEE Signal Process. Lett., 2014

2013
Quikr: a method for rapid reconstruction of bacterial communities via compressive sensing.
Bioinform., 2013

A Mathematical Introduction to Compressive Sensing.
Applied and Numerical Harmonic Analysis, Birkhäuser, ISBN: 978-0-8176-4947-0, 2013

2011
Hard Thresholding Pursuit: An Algorithm for Compressive Sensing.
SIAM J. Numer. Anal., 2011

2010
The Gelfand widths of <i>l</i><sub>p</sub>-balls for 0p<=1.
J. Complex., 2010

The Gelfand widths of ℓ<sub>p</sub>-balls for 0<p≤1
CoRR, 2010

2009
Allometry constants of finite-dimensional spaces: theory and computations.
Numerische Mathematik, 2009

2006
On the value of the max-norm of the orthogonal projector onto splines with multiple knots.
J. Approx. Theory, 2006

2005
Interlacing property for B-splines.
J. Approx. Theory, 2005

2004
On the best conditioned bases of quadratic polynomials.
J. Approx. Theory, 2004


  Loading...