Low Rank Estimation of Similarities on Graphs
From MaRDI portal
Publication:2840345
DOI10.1007/978-3-0348-0490-5_19zbMath1329.62261arXiv1205.1868OpenAlexW1827547166MaRDI QIDQ2840345
Pedro Rangel, Vladimir I. Koltchinskii
Publication date: 18 July 2013
Published in: Progress in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.1868
matrix completiongraph Laplacianlow-rank matrix estimationnoncommutative Bernstein inequalitynuclear norm penalizationSobolev type normsestimation of similarities on graphs
Related Items (1)
Cites Work
- Unnamed Item
- Von Neumann entropy penalization and low-rank matrix estimation
- Estimation of high-dimensional low-rank matrices
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- User-friendly tail bounds for sums of random matrices
- Sums and Gaussian vectors
- Exact matrix completion via convex optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Strong converse for identification via quantum channels
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- 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
- A remark on low rank matrix recovery and noncommutative Bernstein type inequalities
This page was built for publication: Low Rank Estimation of Similarities on Graphs