The DOI matches its Crossref record; 100 of the 100 references it cites were found in a registry or an index.
Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems: École d’Été de Probabilités de Saint-Flour XXXVIII-2008
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Donoho, D. L. (2004) · Cited by 16,703
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Weak Convergence and Empirical Processes
van der Vaart, A. W., & Wellner, J. A. (1996) · Springer Series in Statistics · doi:10.1007/978-1-4757-2545-2 · Cited by 5,014
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
Regression Shrinkage and Selection via The Lasso: A Retrospective
Tibshirani, R. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.00771.x · Cited by 3,589
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Bhatia, R. (1996) · Cited by 2,847
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
Convergence of Stochastic Processes.
Robinson, P. M., & Pollard, D. (1985) · Economica · doi:10.2307/2553898 · Cited by 2,184
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Trace Ideals and Their Applications
Simon, B. (2010) · Mathematical Surveys and Monographs · doi:10.1090/surv/120 · Cited by 1,976
Weak Convergence and Empirical Processes: With Applications to Statistics
Wellner, J. A. (1996) · Medical Entomology and Zoology · Cited by 1,969
(2002) · Springer eBooks · doi:10.1007/b114992 · Cited by 1,881
A Distribution-Free Theory of Nonparametric Regression
Györfi, L., Kohler, M., Krzyżak, A., & Walk, H. (2002) · Springer Series in Statistics · doi:10.1007/b97848 · Cited by 1,738
The Concentration of Measure Phenomenon
Ledoux, M. (2005) · Mathematical Surveys and Monographs · doi:10.1090/surv/089 · Cited by 1,700
(2020) · Data Mining and Machine Learning · doi:10.1017/9781108564175.026 · Cited by 1,401
Neural network learning theoretical foundations
Anthony, M., & Bartlett, P. L. (2009) · Cited by 1,310
(1976) · Lecture Notes in Mathematics · doi:10.1007/bfb0082336 · Cited by 1,297
Quantum State Tomography via Compressed Sensing
Gross, D., Liu, Y.-K., Flammia, S. T., Becker, S., & Eisert, J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.150401 · Cited by 1,093
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
1 USER-FRIENDLY TAIL BOUNDS FOR SUMS OF RANDOM MATRICES
Tropp, J. A. (2010) · Cited by 1,018
Uniform Central Limit Theorems
Dudley, R. M. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511665622 · Cited by 785
Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications
Ben-Tal, A., & Nemirovski, A. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718829 · Cited by 747
Statistical behavior and consistency of classification methods based on convex risk minimization
Zhang, T. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120130 · Cited by 711
A Simpler Approach to Matrix Completion
Recht, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.0651 · Cited by 673
Risk bounds for model selection via penalization
Barron, A., Birgé, L., & Massart, P. (1999) · Probability Theory and Related Fields · doi:10.1007/s004400050210 · Cited by 657
Convex trace functions and the Wigner-Yanase-Dyson conjecture
Lieb, E. H. (1973) · Advances in Mathematics · doi:10.1016/0001-8708(73)90011-x · Cited by 653
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20131 · Cited by 634
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Koltchinskii, V., Lounici, K., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/11-aos894 · Cited by 598
Self-citationOptimal aggregation of classifiers in statistical learning
Tsybakov, A. B. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120131 · Cited by 582
Recovering low-rank matrices from few coefficients in any basisPreprint
Gross, D. (2010) · Cited by 576
Central Limit Theorems for Empirical Measures
Dudley, R. M. (1978) · The Annals of Probability · doi:10.1214/aop/1176995384 · Cited by 571
Empirical Processes in M-Estimation
van de Geer, S. (2000) · Cited by 530
New concentration inequalities in product spaces
Talagrand, M. (1996) · Inventiones Mathematicae · doi:10.1007/s002220050108 · Cited by 501
Sharper Bounds for Gaussian and Empirical Processes
Talagrand, M. (1994) · The Annals of Probability · doi:10.1214/aop/1176988847 · Cited by 480
Near-ideal model selection by ℓ1 minimization
Candès, E. J., & Plan, Y. (2008) · Cited by 469
High-dimensional additive modeling
Meier, L., van de Geer, S., & Bühlmann, P. (2009) · The Annals of Statistics · doi:10.1214/09-aos692 · Cited by 458
Empirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers
Koltchinskii, V., & Panchenko, D. (2002) · The Annals of Statistics · doi:10.1214/aos/1015362183 · Cited by 451
Self-citationTheory of Classification: a Survey of Some Recent Advances
Boucheron, S., Bousquet, O., & Lugosi, G. (2005) · ESAIM: Probability and Statistics · doi:10.1051/ps:2005018 · Cited by 436
Some Limit Theorems for Empirical Processes
Gine, E., & Zinn, J. (1984) · The Annals of Probability · doi:10.1214/aop/1176993138 · Cited by 432
Strong converse for identification via quantum channels
Ahlswede, R., & Winter, A. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.985947 · Cited by 423
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Negahban, S. N., & Wainwright, M. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.2118 · Cited by 402
Sparsity oracle inequalities for the Lasso
Bunea, F., Tsybakov, A. B., & Wegkamp, M. H. (2007) · HAL · Cited by 389
Decoupling: from dependence to independence
(1999) · Choice Reviews Online · doi:10.5860/choice.37-0366 · Cited by 382
Smooth discrimination analysis
Mammen, E., & Tsybakov, A. B. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939240 · Cited by 377
Convergence Rate of Sieve Estimates
Shen, X., & Wong, W. H. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325486 · Cited by 373
Rademacher penalties and structural risk minimization
Koltchinskii, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930926 · Cited by 373
Self-citationRandom Vectors in the Isotropic Position
Rudelson, M. (1999) · Journal of Functional Analysis · doi:10.1006/jfan.1998.3384 · Cited by 371
Characterization of the subdifferential of some matrix norms
Watson, G. A. (1992) · Linear Algebra and its Applications · doi:10.1016/0024-3795(92)90407-2 · Cited by 364
Local Rademacher complexities and oracle inequalities in risk minimization
Koltchinskii, V. I. (2006) · The Annals of Statistics · doi:10.1214/009053606000001019 · Cited by 364
Self-citationZhang, X. (2016) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7502-7_79-1 · Cited by 350
From Model Selection to Adaptive Estimation
Birgé, L., & Massart, P. (1997) · Festschrift for Lucien Le Cam · doi:10.1007/978-1-4612-1880-7_4 · Cited by 344
Estimation of high-dimensional low-rank matrices
Rohde, A., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/10-aos860 · Cited by 330
Talagrand, M. (1996) · The Annals of Probability · doi:10.1214/aop/1042644705 · Cited by 325
Minimal Penalties for Gaussian Model Selection
Birgé, L., & Massart, P. (2007) · Probability Theory and Related Fields · doi:10.1007/s00440-006-0011-8 · Cited by 299
Model Selection and Error Estimation
Bartlett, P. L., Boucheron, S., & Lugosi, G. (2002) · Machine Learning · doi:10.1023/a:1013999503812 · Cited by 297
Non-asymptotic Theory of Random Matrices: Extreme Singular Values
Rudelson, M., & Vershynin, R. (2011) · Proceedings of the International Congress of Mathematicians 2010 (ICM 2010) · doi:10.1142/9789814324359_0111 · Cited by 296
Aggregation for Gaussian regressionPreprint
Bunea, F., Tsybakov, A. B., & Wegkamp, M. H. (2016) · Cited by 296
A Bennett concentration inequality and its application to suprema of empirical processes
Bousquet, O. (2002) · Comptes Rendus. Mathématique · doi:10.1016/s1631-073x(02)02292-6 · Cited by 262
Fast rates for support vector machines using Gaussian kernels
Steinwart, I., & Scovel, C. (2007) · The Annals of Statistics · doi:10.1214/009053606000001226 · Cited by 258
Risk bounds for statistical learning
Massart, P., & Nédélec, É. (2006) · The Annals of Statistics · doi:10.1214/009053606000000786 · Cited by 253
Error correction via linear programming
Candes, E., Rudelson, M., Tao, T., & Vershynin, R. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.5464411 · Cited by 251
Some applications of concentration inequalities to statistics
Massart, P. (2000) · Annales de la Faculté des sciences de Toulouse : Mathématiques · doi:10.5802/afst.961 · Cited by 240
Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
Steinwart, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839514 · Cited by 225
Tsybakov, A. B. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_23 · Cited by 223
Rademacher Processes and Bounding the Risk of Function Learning
Koltchinskii, V., & Panchenko, D. (2000) · High Dimensional Probability II · doi:10.1007/978-1-4612-1358-1_29 · Cited by 209
Self-citationAn Empirical Process Approach to the Uniform Consistency of Kernel-Type Function Estimators
Einmahl, U., & Mason, D. M. (2000) · Journal of Theoretical Probability · doi:10.1023/a:1007769924157 · Cited by 186
On the Bayes-risk consistency of regularized boosting methods
Lugosi, G., & Vayatis, N. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120129 · Cited by 185
A sharp concentration inequality with applications
Boucheron, S., Lugosi, G., & Massart, P. (2000) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(200005)16:3<277::aid-rsa4>3.0.co;2-1 · Cited by 185
Statistical performance of support vector machines
Blanchard, G., Bousquet, O., & Massart, P. (2008) · The Annals of Statistics · doi:10.1214/009053607000000839 · Cited by 167
From ɛ-entropy to KL-entropy: Analysis of minimum information complexity density estimation
Zhang, T. (2006) · The Annals of Statistics · doi:10.1214/009053606000000704 · Cited by 162
Data-driven calibration of penalties for least-squares regressionPreprint
Arlot, S., & Massart, P. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0802.0837 · Cited by 159
Efficient agnostic learning of neural networks with bounded fan-in
Lee, W. S., Bartlett, P. L., & Williamson, R. C. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556601 · Cited by 150
Adamczak, R., Litvak, A. E., Pajor, A., & Tomczak-Jaegermann, N. (2010) · Constructive Approximation · doi:10.1007/s00365-010-9117-4 · Cited by 150
Sparsity in penalized empirical risk minimization
Koltchinskii, V. I. (2009) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/07-aihp146 · Cited by 134
Self-citationA central limit theorem for empirical processes
Pollard, D. (1982) · Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics · doi:10.1017/s1446788700018371 · Cited by 134
Moment Inequalities for Functions of Independent Random Variables
Boucheron, S., Bousquet, O., Lugosi, G., & Massart, P. (2005) · Cited by 133
Model selection for regression on a random design
Baraud, Y. (2002) · ESAIM Probability and Statistics · doi:10.1051/ps:2002007 · Cited by 121
Concentration inequalities and asymptotic results for ratio type empirical processes
Evarist Gine, M., & Koltchinskii, V. I. (2006) · The Annals of Probability · doi:10.1214/009117906000000070 · Cited by 115
Self-citationRandom projections of regular simplices
Affentranger, F., & Schneider, R. (1992) · Discrete & Computational Geometry · doi:10.1007/bf02187839 · Cited by 114
Mixing strategies for density estimation
Yang, Y. (2000) · The Annals of Statistics · doi:10.1214/aos/1016120365 · Cited by 104
On the rate of convergence of regularized boosting classifiers
Blanchard, G., Lugosi, G., & Vayatis, N. (2003) · doi:10.5555/945365.964298 · Cited by 100
RATES OF CONVERGENCE IN ACTIVE LEARNING
Hanneke, S. (2010) · Cited by 96
Aggregation by Exponential Weighting and Sharp Oracle Inequalities
Dalalyan, A. S., & Tsybakov, A. B. (2007) · Springer eBooks · doi:10.1007/978-3-540-72927-3_9 · Cited by 95
Rates of growth and sample moduli for weighted empirical processes indexed by sets
Alexander, K. S. (1987) · Probability Theory and Related Fields · doi:10.1007/bf00318708 · Cited by 85
Complexity Regularization via Localized Random PenaltiesPreprint
Lugosi, G., & Wegkamp, M. H. (2002) · Cited by 66
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Koltchinskii, V. I. (2010) · Cited by 63
Self-citationComplexities of convex combinations and bounding the generalization error in classification
Koltchinskii, V. I., & Panchenko, D. (2005) · The Annals of Statistics · doi:10.1214/009053605000000228 · Cited by 49
Self-citationKöhler, M. (2000) · Journal of Statistical Planning and Inference · doi:10.1016/s0378-3758(99)00215-3 · Cited by 43
A high-dimensional Wilks phenomenon
Boucheron, S., & Massart, P. (2010) · Probability Theory and Related Fields · doi:10.1007/s00440-010-0278-7 · Cited by 35
Zhang, T. (2000) · Cited by 35
Sparse recovery in convex hulls via entropy penalization
Koltchinskii, V. I. (2009) · The Annals of Statistics · doi:10.1214/08-aos621 · Cited by 27
Self-citationModel selection by bootstrap penalization for classification
Fromont, M. (2006) · Machine Learning · doi:10.1007/s10994-006-7679-y · Cited by 24
Koltchinskii, V. I., Panchenko, D., & Lozano, F. (2003) · The Annals of Applied Probability · doi:10.1214/aoap/1042765667 · Cited by 21
Self-citationAn l1-Oracle Inequality for the LassoPreprint
Massart, P., & Meynet, C. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1007.4791 · Cited by 11
Cited by
Statistical guarantees for the EM algorithm: From population to sample-based analysis
Balakrishnan, S., Wainwright, M. J., & Yu, B. (2017) · The Annals of Statistics · doi:10.1214/16-aos1435 · Cited by 384
Estimation of high-dimensional low-rank matrices
Rohde, A., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/10-aos860 · Cited by 330
Deep Neural Networks for Estimation and Inference
Farrell, M. H., Liang, T., & Misra, S. (2021) · Econometrica · doi:10.3982/ecta16901 · Cited by 327
Geometric median and robust estimation in Banach spaces
Minsker, S. (2015) · Bernoulli · doi:10.3150/14-bej645 · Cited by 261
Metadata
- Authors
- Koltchinskii, V.
- Venue
- Lecture Notes in Mathematics
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- ISSN
- 0075-8434 (ISSN-L)
- 1617-9692
- OpenAlex
- W648260396
- Cited by
- 346
- References
- 100
- FWCI
- 6.43
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.