scientific article; zbMATH DE number 7164748

zbMath1446.62140arXiv1807.09010MaRDI QIDQ5214241

Olga Klopp, Mokhtar Z. Alaya

Publication date: 7 February 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

exponential familiesnuclear norm minimizationlow-rank matrix estimationlow-rank optimizationhigh-dimensional prediction

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Estimation in multivariate analysis (62H12)

Related Items (1)

Matrix completion under complex survey sampling

Uses Software

• PROPACK
• LowRankModels
• Pyglrm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015
• Matrix completion via max-norm constrained optimization
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Gradient methods for minimizing composite functions
• Statistics for high-dimensional data. Methods, theory and applications.
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling
• Modeling item-item similarities for personalized recommendations on Yahoo! front page
• Matrix completion by singular value thresholding: sharp bounds
• Adaptive multinomial matrix completion
• Obtaining fast error rates in nonconvex situations
• A Bennett concentration inequality and its application to suprema of empirical processes
• Flexible low-rank statistical modeling with missing data and side information
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Robust low-rank matrix estimation
• Noisy low-rank matrix completion with general sampling distribution
• Exact matrix completion via convex optimization
• Generalized Low Rank Models
• A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
• A Singular Value Thresholding Algorithm for Matrix Completion
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• 1-Bit matrix completion
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

This page was built for publication: