arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.12945cs.LG
收藏

1比特矩阵补全的误分类超额风险界

Misclassification excess risk bounds for 1-bit matrix completion

Norwegian University of Science and Technology(挪威科技大学)

The Tien Mai

AI总结:

本文研究1比特矩阵补全的预测误差,证明基于核范数惩罚的逻辑回归方法无需额外对数项即可达到极小极大最优速率。

摘要:

本研究探讨了1比特矩阵补全背景下的误分类超额风险界,这是机器学习中的一个重要问题,涉及从矩阵条目的有限子集中恢复未知矩阵。在过去二十年中,矩阵补全因其在各个领域的广泛应用而受到大量关注。与处理实值样本的传统方法不同,1比特矩阵补全关注的是二值观测。先前的研究主要集中于所提出估计器的估计误差,而我们的研究将注意力转向预测误差。本文对两项利用逻辑回归模型的先前工作进行了理论分析:一项采用最大范数约束最小化,另一项采用核范数惩罚。重要的是,我们的研究结果表明,后者在不需额外对数项的情况下达到了极小极大最优速率。这些新颖的结果通过阐明特定方法的预测性能,有助于更深入地理解1比特矩阵补全。

英文摘要:

This study investigates the misclassification excess risk bound in the context of 1-bit matrix completion, a significant problem in machine learning involving the recovery of an unknown matrix from a limited subset of its entries. Matrix completion has garnered considerable attention in the last two decades due to its diverse applications across various fields. Unlike conventional approaches that deal with real-valued samples, 1-bit matrix completion is concerned with binary observations. While prior research has predominantly focused on the estimation error of proposed estimators, our study shifts attention to the prediction error. This paper offers theoretical analysis regarding the prediction errors of two previous works utilizing the logistic regression model: one employing a max-norm constrained minimization and the other employing nuclear-norm penalization. Significantly, our findings demonstrate that the latter achieves the minimax-optimal rate without the need for an additional logarithmic term. These novel results contribute to a deeper understanding of 1-bit matrix completion by shedding light on the predictive performance of specific methodologies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑