Low rank estimation of smooth kernels on graphs

DOI10.1214/13-AOS1088zbMath1360.62272arXiv1207.4819OpenAlexW3103709271MaRDI QIDQ355091

Pedro Rangel, Vladimir I. Koltchinskii

Publication date: 24 July 2013

Published in: The Annals of Statistics (Search for Journal in Brave)

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

zbMATH Keywords

matrix completionnuclear normgraph Laplaciandiscrete Sobolev normlow-rank matrix estimationmatrix Lassominimax error boundoptimal error rate

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Inequalities; stochastic orderings (60E15) Linear inference, regression (62J99) Random matrices (probabilistic aspects) (60B20)

Related Items (1)

Estimation of low-rank covariance function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
• Noisy low-rank matrix completion with general sampling distribution
• Exact matrix completion via convex optimization
• Low Rank Estimation of Similarities on Graphs
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• 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
• Introduction to nonparametric estimation

This page was built for publication: Low rank estimation of smooth kernels on graphs