The DOI matches its Crossref record; 244 of the 244 references it cites were found in a registry or an index.
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Abstract
Recent years have witnessed an explosion in the volume and variety of data collected in all scientific disciplines and industrial settings. Such massive data sets present a number of challenges to researchers in statistics and machine learning. This book provides a self-contained introduction to the area of high-dimensional statistics, aimed at the first-year graduate level. It includes chapters that are focused on core methodology and theory - including tail bounds, concentration inequalities, uniform laws and empirical process, and random matrices - as well as chapters devoted to in-depth exploration of particular model classes - including sparse linear models, matrix models with rank constraints, graphical models, and various types of non-parametric models. With hundreds of worked examples and exercises, this text is intended both for courses and for self-study by graduate students and researchers in statistics, machine learning, and related fields who must understand, apply, and adapt modern statistical methods suited to large-scale data.
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
Items 201–244 of 244
Loh, P., & Wainwright, M. J. (2013) · The Annals of Statistics · doi:10.1214/13-aos1162 · Cited by 205
Self-citationEstimation of Integral Functionals of a Density
Birgé, L., & Massart, P. (1995) · The Annals of Statistics · doi:10.1214/aos/1176324452 · Cited by 203
A measure concentration inequality for contracting markov chains
Marton, K. (1996) · Geometric and Functional Analysis · doi:10.1007/bf02249263 · Cited by 202
High dimensional robust M-estimation: asymptotic variance via approximate message passing
Donoho, D., & Montanari, A. (2016) · Probability Theory and Related Fields · doi:10.1007/s00440-015-0675-z · Cited by 200
Reconstruction From Anisotropic Random Measurements
Rudelson, M., & Zhou, S. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2243201 · Cited by 199
Shannon-Theoretic Limits on Noisy Compressive Sampling
Akcakaya, M., & Tarokh, V. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034796 · Cited by 195
Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
Santhanam, N. P., & Wainwright, M. J. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191659 · Cited by 193
Self-citationThe Methods of Distances in the Theory of Probability and Statistics
Rachev, S. T., Klebanov, L. B., Stoyanov, S. V., & Fabozzi, F. (2013) · Springer eBooks · doi:10.1007/978-1-4614-4869-3 · Cited by 186
Minimax bounds for sparse PCA with noisy high-dimensional data
Birnbaum, A., Johnstone, I. M., Nadler, B., & Paul, D. (2013) · The Annals of Statistics · doi:10.1214/12-aos1014 · Cited by 180
Regularized rank-based estimation of high-dimensional nonparanormal graphical models
Xue, L., & Zou, H. (2012) · The Annals of Statistics · doi:10.1214/12-aos1041 · Cited by 180
Sparse recovery under matrix uncertainty
Rosenbaum, M., & Tsybakov, A. B. (2010) · The Annals of Statistics · doi:10.1214/10-aos793 · Cited by 177
Metric entropy and approximation
Lorentz, G. G. (1966) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1966-11586-0 · Cited by 169
Functional aggregation for nonparametric regression
Juditsky, A., & Nemirovski, A. (2000) · The Annals of Statistics · doi:10.1214/aos/1015951994 · Cited by 167
Maximum Penalized Likelihood Estimation
Eggermont, P. P. B., & LaRiccia, V. N. (2001) · Springer series in statistics · doi:10.1007/978-1-0716-1244-6 · Cited by 167
On robust regression with high-dimensional predictors
El Karoui, N., Bean, D., Bickel, P. J., Lim, C., & Yu, B. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1307842110 · Cited by 166
Randomized sketches of convex programs with sharp guarantees
Pilanci, M., & Wainwright, M. J. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6874967 · Cited by 165
Self-citationCondition numbers of random matrices
Szarek, S. J. (1991) · Journal of Complexity · doi:10.1016/0885-064x(91)90002-f · Cited by 165
Theoretical Statistics: Topics for a Core Course
Keener, R. W. (2010) · Springer Texts in Statistics · doi:10.1007/978-0-387-93839-4 · Cited by 164
Support recovery without incoherence: A case for nonconvex regularization
Loh, P.-L., & Wainwright, M. J. (2017) · The Annals of Statistics · doi:10.1214/16-aos1530 · Cited by 161
Self-citationBobkov, S. G. (1999) · The Annals of Probability · doi:10.1214/aop/1022677553 · Cited by 160
On sparse representation in pairs of bases
Feuer, A., & Nemirovski, A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.811926 · Cited by 158
Local Privacy and Minimax Bounds: Sharp Rates for Probability EstimationPreprint
Duchi, J. C., Jordan, M. I., & Wainwright, M. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.6000 · Cited by 153
Self-citationGeneralization Error Bounds for Collaborative Prediction with Low-Rank Matrices
Srebro, N., Alon, N., & Jaakkola, T. (2004) · neural information processing systems · Cited by 143
Concentration Inequalities for Sub-Additive Functions Using the Entropy Method
Bousquet, O. (2003) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-8069-5_14 · Cited by 135
Matrix concentration inequalities via the method of exchangeable pairs
Mackey, L. W., Jordan, M. I., Chen, R. Y., Farrell, B., & Tropp, J. A. (2014) · The Annals of Probability · doi:10.1214/13-aop892 · Cited by 132
High-dimensional structure estimation in Ising models: Local separation criterion
Anandkumar, A., Tan, V. Y. F., Huang, F., & Willsky, A. S. (2012) · The Annals of Statistics · doi:10.1214/12-aos1009 · Cited by 129
Negahban, S. N., & Wainwright, M. J. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2144150 · Cited by 122
Self-citationAsymptotic behavior of the eigenvalues of certain integral equations
Widom, H. (1963) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1963-0155161-0 · Cited by 121
Asymptotic behavior of the eigenvalues of certain integral equations. II
Widom, H. (1964) · Archive for Rational Mechanics and Analysis · doi:10.1007/bf00282438 · Cited by 112
A Lower Estimate for Entropy Numbers
Kühn, T. (2001) · Journal of Approximation Theory · doi:10.1006/jath.2000.3554 · Cited by 99
Optimal M-estimation in high-dimensional regression
Bean, D., Bickel, P. J., Karoui, N. E., & Yu, B. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1307845110 · Cited by 98
Information inequalities and concentration of measure
Dembo, A. (1997) · The Annals of Probability · doi:10.1214/aop/1024404424 · Cited by 91
Toward a unified theory of sparse dimensionality reduction in Euclidean space
Bourgain, J., Dirksen, S., & Nelson, J. (2015) · Geometric and Functional Analysis · doi:10.1007/s00039-015-0332-9 · Cited by 90
Lower Bounds for the Minimax Risk Using $f$-Divergences, and Applications
Guntuboyina, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2110791 · Cited by 88
Rate of convergence in probability to the Marchenko-Pastur law
Götze, F., & Tikhomirov, A. N. (2004) · Bernoulli · doi:10.3150/bj/1089206408 · Cited by 86
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
Results in statistical discriminant analysis: a review of the former Soviet Union literature
Raudys, Š., & Young, D. M. (2003) · Journal of Multivariate Analysis · doi:10.1016/s0047-259x(02)00021-0 · Cited by 74
Covering Numbers for Convex Functions
Guntuboyina, A., & Sen, B. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2235172 · Cited by 71
A note on the Lasso for Gaussian graphical model selection
Meinshausen, N. (2007) · Statistics & Probability Letters · doi:10.1016/j.spl.2007.09.014 · Cited by 66
A New Lower Bound for Multiple Hypothesis Testing
Birgé, L. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844101 · Cited by 61
Polynomial Regression and Estimating Functions in the Presence of Multiplicative Measurement Error
Iturria, S. J., Carroll, R. J., & Firth, D. (1999) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/1467-9868.00192 · Cited by 53
Weakly decomposable regularization penalties and structured sparsity
van de Geer, S. (2013) · Scandinavian Journal of Statistics · doi:10.1111/sjos.12032 · Cited by 53
Covariate Selection for Linear Errors-in-Variables Regression Models
Xu, Q., & You, J. (2007) · Communication in Statistics- Theory and Methods · doi:10.1080/03610920600974765 · Cited by 33
Discussion: Latent variable graphical model selection via convex optimization
Ren, Z., & Zhou, H. H. (2012) · The Annals of Statistics · doi:10.1214/12-aos985 · Cited by 27
Cited by
An Efficient Framework for Clustered Federated Learning
Ghosh, A., Chung, J., Yin, D., & Ramchandran, K. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3192506 · Cited by 623
On the Sample Complexity of the Linear Quadratic Regulator
Dean, S., Mania, H., Matni, N., Recht, B., & Tu, S. (2020) · Foundations of Computational Mathematics · doi:10.1007/s10208-019-09426-y · Cited by 436
LinDA: linear models for differential abundance analysis of microbiome compositional data
Zhou, H., He, K., Chen, J., & Zhang, X. (2022) · Genome Biology · doi:10.1186/s13059-022-02655-5 · Cited by 414
Policy Learning With Observational Data
Athey, S., & Wager, S. (2021) · Econometrica · doi:10.3982/ecta15732 · Cited by 372
On Mean Absolute Error for Deep Neural Network Based Vector-to-Vector Regression
Qi, J., Du, J., Siniscalchi, S. M., Ma, X., & Lee, C.-H. (2020) · IEEE Signal Processing Letters · doi:10.1109/lsp.2020.3016837 · Cited by 305
Metadata
- Authors
- Wainwright, M. J.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2019-02-12
- OpenAlex
- W3157752112
- Cited by
- 882
- References
- 244
- FWCI
- 32.99
- 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.