default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Foucart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j22]Mareike Dressler, Simon Foucart
, Mioara Joldes, Etienne de Klerk, Jean B. Lasserre, Yuan Xu:
Optimization-aided construction of multivariate Chebyshev polynomials. J. Approx. Theory 305: 106116 (2025)- [j21]Simon Foucart, Nicolas Hengartner:
Worst-Case Learning under a Multifidelity Model. SIAM/ASA J. Uncertain. Quantification 13(1): 171-194 (2025) - 2024
- [j20]Simon Foucart, Chunyang Liao:
Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data. J. Complex. 83: 101841 (2024) - [i16]Mareike Dressler, Simon Foucart, Etienne de Klerk, Mioara Joldes, Jean-Bernard Lasserre, Yuan Xu:
Optimization-Aided Construction of Multivariate Chebyshev Polynomials. CoRR abs/2405.10438 (2024) - [i15]Simon Foucart, Nicolas Hengartner:
Worst-Case Learning under a Multi-fidelity Model. CoRR abs/2406.14418 (2024) - 2023
- [j19]Simon Foucart:
Full recovery from point values: an optimal algorithm for Chebyshev approximability prior. Adv. Comput. Math. 49(4): 57 (2023) - [i14]Simon Foucart, Chunyang Liao, Nate Veldt:
On the Optimal Recovery of Graph Signals. CoRR abs/2304.00474 (2023) - [i13]Simon Foucart, Chunyang Liao:
S-Procedure Relaxation: a Case of Exactness Involving Chebyshev Centers. CoRR abs/2310.09677 (2023) - [i12]Simon Foucart:
Linearly Embedding Sparse Vectors from 𝓁2 to 𝓁1 via Deterministic Dimension-Reducing Maps. CoRR abs/2310.18565 (2023) - 2022
- [i11]Simon Foucart:
Full Recovery from Point Values: an Optimal Algorithm for Chebyshev Approximability Prior. CoRR abs/2209.04985 (2022) - [i10]Simon Foucart:
The Sparsity of LASSO-type Minimizers. CoRR abs/2209.04986 (2022) - 2021
- [j18]Simon Foucart:
Instances of computational optimal recovery: Refined approximability models. J. Complex. 62: 101503 (2021) - [j17]Mahmood Ettehad, Simon Foucart:
Instances of Computational Optimal Recovery: Dealing with Observation Errors. SIAM/ASA J. Uncertain. Quantification 9(4): 1438-1456 (2021) - [j16]Simon Foucart:
Facilitating OWL norm minimizations. Optim. Lett. 15(1): 263-269 (2021) - [j15]Simon Foucart, Deanna Needell, Reese Pathak, Yaniv Plan, Mary Wootters:
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns. IEEE Trans. Inf. Theory 67(2): 1264-1290 (2021) - [i9]Simon Foucart, Chunyang Liao:
Optimal Recovery from Inaccurate Data in Hilbert Spaces: Regularize, but what of the Parameter? CoRR abs/2111.02601 (2021) - 2020
- [j14]Simon Foucart:
Sampling schemes and recovery algorithms for functions of few coordinate variables. J. Complex. 58: 101457 (2020) - [j13]Mahmood Ettehad, Simon Foucart:
Approximability models and optimal system identification. Math. Control. Signals Syst. 32(1): 19-41 (2020) - [c1]Simon Foucart, David Koslicki:
Finer Metagenomic Reconstruction via Biodiversity Optimization. NeurIPS 2020 - [i8]Simon Foucart:
Instances of Computational Optimal Recovery: Refined Approximability Models. CoRR abs/2004.00195 (2020) - [i7]Simon Foucart, Chunyang Liao, Shahin Shahrampour, Yinsong Wang:
Learning from Non-IID Data in Hilbert Spaces: An Optimal Recovery Perspective. CoRR abs/2006.03706 (2020)
2010 – 2019
- 2019
- [i6]Simon Foucart, Laurent Jacques:
One-Bit Sensing of Low-Rank and Bisparse Matrices. CoRR abs/1901.06527 (2019) - [i5]Ingrid Daubechies, Ronald A. DeVore, Simon Foucart, Boris Hanin, Guergana Petrova:
Nonlinear Approximation and (Deep) ReLU Networks. CoRR abs/1905.02199 (2019) - [i4]Simon Foucart, Deanna Needell, Reese Pathak, Yaniv Plan, Mary Wootters:
Weighted matrix completion from non-random, non-uniform sampling patterns. CoRR abs/1910.13986 (2019) - 2018
- [j12]Simon Foucart, Jean B. Lasserre:
Determining projection constants of univariate polynomial spaces. J. Approx. Theory 235: 74-91 (2018) - [j11]Simon Foucart:
Concave Mirsky Inequality and Low-Rank Recovery. SIAM J. Matrix Anal. Appl. 39(1): 99-103 (2018) - 2017
- [j10]Simon Foucart, Guillaume Lecué:
An IHT Algorithm for Sparse Recovery From Subexponential Measurements. IEEE Signal Process. Lett. 24(9): 1280-1283 (2017) - [j9]Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters:
Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals. IEEE Trans. Inf. Theory 63(6): 3368-3385 (2017) - 2016
- [i3]Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters:
One-Bit Compressive Sensing of Dictionary-Sparse Signals. CoRR abs/1606.07531 (2016) - 2014
- [j8]Simon Foucart, David Koslicki:
Sparse Recovery by Means of Nonnegative Least Squares. IEEE Signal Process. Lett. 21(4): 498-502 (2014) - [i2]Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters:
Exponential decay of reconstruction error from binary measurements of sparse signals. CoRR abs/1407.8246 (2014) - 2013
- [b1]Simon Foucart, Holger Rauhut:
A Mathematical Introduction to Compressive Sensing. Applied and Numerical Harmonic Analysis, Birkhäuser 2013, ISBN 978-0-8176-4947-0, pp. I-XVIII, 1-625 - [j7]David Koslicki, Simon Foucart, Gail Rosen:
Quikr: a method for rapid reconstruction of bacterial communities via compressive sensing. Bioinform. 29(17): 2096-2102 (2013) - 2011
- [j6]Simon Foucart:
Hard Thresholding Pursuit: An Algorithm for Compressive Sensing. SIAM J. Numer. Anal. 49(6): 2543-2563 (2011) - 2010
- [j5]Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich:
The Gelfand widths of lp-balls for 0p<=1. J. Complex. 26(6): 629-640 (2010) - [i1]Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich:
The Gelfand widths of ℓp-balls for 0<p≤1. CoRR abs/1002.0672 (2010)
2000 – 2009
- 2009
- [j4]Simon Foucart:
Allometry constants of finite-dimensional spaces: theory and computations. Numerische Mathematik 112(4): 535-564 (2009) - 2006
- [j3]Simon Foucart:
On the value of the max-norm of the orthogonal projector onto splines with multiple knots. J. Approx. Theory 140(2): 154-177 (2006) - 2005
- [j2]Simon Foucart:
Interlacing property for B-splines. J. Approx. Theory 135(1): 1-21 (2005) - 2004
- [j1]Simon Foucart:
On the best conditioned bases of quadratic polynomials. J. Approx. Theory 130(1): 46-56 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-11 20:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
