default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Lecué
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j9]Stéphane Chrétien, Mihai Cucuringu, Guillaume Lecué, Lucie Neirac:
Learning with semi-definite programming: statistical bounds based on fixed point analysis and excess risk curvature. J. Mach. Learn. Res. 22: 230:1-230:64 (2021)- 2020
- [j8]Guillaume Lecué
, Matthieu Lerasle, Timothée Mathieu:
Robust classification via MOM minimization. Mach. Learn. 109(8): 1635-1665 (2020) - [j7]Guillaume Lecué, Matthieu Lerasle, Timothée Mathieu:
Correction to: Robust classification via MOM minimization. Mach. Learn. 109(8): 1667 (2020)
2010 – 2019
- 2019
- [c3]Matthieu Lerasle, Zoltán Szabó, Timothée Mathieu, Guillaume Lecué:
MONK Outlier-Robust Mean Embedding Estimation by Median-of-Means. ICML 2019: 3782-3793 - 2018
- [j6]Sjoerd Dirksen, Guillaume Lecué, Holger Rauhut:
On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions. IEEE Trans. Inf. Theory 64(8): 5478-5487 (2018) - [i3]Matthieu Lerasle, Zoltán Szabó, Guillaume Lecué, Gaspar Massiot, Eric Moulines:
MONK - Outlier-Robust Mean Embedding Estimation by Median-of-Means. CoRR abs/1802.04784 (2018) - 2017
- [j5]Guillaume Lecué, Shahar Mendelson:
Regularization and the small-ball method II: complexity dependent error rates. J. Mach. Learn. Res. 18: 146:1-146:48 (2017) - [j4]Simon Foucart, Guillaume Lecué:
An IHT Algorithm for Sparse Recovery From Subexponential Measurements. IEEE Signal Process. Lett. 24(9): 1280-1283 (2017) - 2015
- [i2]Sjoerd Dirksen, Guillaume Lecué, Holger Rauhut:
On the gap between RIP-properties and sparse recovery conditions. CoRR abs/1504.05073 (2015) - 2011
- [j3]Stéphane Gaïffas, Guillaume Lecué:
Hyper-Sparse Optimal Aggregation. J. Mach. Learn. Res. 12: 1813-1833 (2011) - [j2]Stéphane Gaïffas, Guillaume Lecué:
Sharp Oracle Inequalities for High-Dimensional Matrix Prediction. IEEE Trans. Inf. Theory 57(10): 6942-6957 (2011) - [i1]Stéphane Gaïffas, Guillaume Lecué:
Weighted algorithms for compressed sensing and matrix completion. CoRR abs/1107.1638 (2011)
2000 – 2009
- 2007
- [c2]Guillaume Lecué:
Suboptimality of Penalized Empirical Risk Minimization in Classification. COLT 2007: 142-156 - 2006
- [j1]Guillaume Lecué:
Lower Bounds and Aggregation in Density Estimation. J. Mach. Learn. Res. 7: 971-981 (2006) - [c1]Guillaume Lecué:
Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition. COLT 2006: 364-378
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 2024-09-13 00:41 CEST 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:
