Misclassification excess risk bounds for 1-bit matrix completion

DOI10.1002/STA4.70003MaRDI QIDQ6963062zbMATH OpenFDO

Authors The Tien Mai

Publication date 8 July 2025

Published in Stat (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1002/STA4.70003

zbMATH Keywords

binary classificationlogistic modelmatrix completionmisclassification excess riskoptimal rate

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• 1-bit matrix completion
• 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
• A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution
• A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
• Adaptive multinomial matrix completion
• Collective matrix completion
• Concentration of tempered posteriors and of their variational approximations
• Convexity, Classification, and Risk Bounds
• Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions
• Exact matrix completion via convex optimization
• High-Dimensional Classification by Sparse Logistic Regression
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• scientific article; zbMATH DE number 1391397 (Why is no real title available?)
• Inference and uncertainty quantification for noisy matrix completion
• Introduction to High-Dimensional Statistics
• Linear total variation approximate regularized nuclear norm optimization for matrix completion
• Matrix estimation by universal singular value thresholding
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• Optimal aggregation of classifiers in statistical learning.
• Parallel stochastic gradient algorithms for large-scale matrix completion
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Smooth discrimination analysis
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Statistics for high-dimensional data. Methods, theory and applications.
• The Elements of Statistical Learning
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Theory of Classification: a Survey of Some Recent Advances

This page was built for publication: Misclassification excess risk bounds for 1-bit matrix completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963062)