Online optimization for max-norm regularization

DOI10.1007/s10994-017-5628-6zbMath1454.68132arXiv1406.3190OpenAlexW2153439876MaRDI QIDQ2014582

Yanyan Li

Publication date: 25 August 2017

Published in: Machine Learning (Search for Journal in Brave)

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

zbMATH Keywords

stochastic optimizationmatrix factorizationlow-rank matrixmax-norm

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Online Schatten quasi-norm minimization for robust principal component analysis ⋮ Max-norm optimization for robust matrix recovery

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix completion via max-norm constrained optimization
• Principal component analysis.
• Noisy low-rank matrix completion with general sampling distribution
• Local minima and convergence in low-rank semidefinite programming
• Exact matrix completion via convex optimization
• A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
• Clustering, Hamming Embedding, Generalized LSH and the Max Norm
• Outlier-Robust PCA: The High-Dimensional Case
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Optimization Problems with Perturbations: A Guided Tour
• Asymptotic Statistics
• De-noising by soft-thresholding
• 1-Bit matrix completion
• Robust PCA via Outlier Pursuit
• Learning Theory

This page was built for publication: Online optimization for max-norm regularization