Structured matrix estimation and completion

DOI10.3150/19-BEJ1114zbMath1428.62281arXiv1707.02090OpenAlexW2976414370MaRDI QIDQ2325396

Yu Lu, Alexandre B. Tsybakov, Harrison H. Zhou, Olga Klopp

Publication date: 25 September 2019

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.02090

zbMATH Keywords

matrix completionmixture modelstochastic block modelmatrix estimationminimax optimalitybi-clustering model

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Minimax procedures in statistical decision theory (62C20)

Related Items

The hierarchy of block models, Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets, Optimal cleaning for singular values of cross-covariance matrices, High-dimensional VAR with low-rank transition, A general framework for Bayes structured linear models, Matrix factorization for multivariate time series analysis, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Structured matrix estimation and completion

Cites Work

• Unnamed Item
• Unnamed Item
• Rate-optimal graphon estimation
• Matrix completion via max-norm constrained optimization
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Oracle inequalities for network models and sparse graphon estimation
• Exponential screening and optimal rates of sparse estimation
• Optimal selection of reduced rank estimators of high-dimensional matrices
• A spectral algorithm for learning mixture models
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• A tail inequality for quadratic forms of subgaussian random vectors
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Information-theoretic determination of minimax rates of convergence
• Rank penalized estimators for high-dimensional matrices
• Structured matrix estimation and completion
• Matrix estimation by universal singular value thresholding
• Noisy low-rank matrix completion with general sampling distribution
• Optimal Estimation and Completion of Matrices with Biclustering Structures
• Noisy Matrix Completion Under Sparse Factor Models
• Learning mixtures of spherical gaussians
• Mixed membership stochastic blockmodels
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
• Polynomial Learning of Distribution Families
• Introduction to nonparametric estimation