Non-Convex Matrix Completion Against a Semi-Random Adversary

28 March 2018

Papers citing "Non-Convex Matrix Completion Against a Semi-Random Adversary"

3 / 3 papers shown

Title
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random Gautam Chandrasekaran Vasilis Kontonis Konstantinos Stavropoulos Kevin Tian 92 0 0 20 Jan 2025
On the Exactness of SDP Relaxation for Quadratic Assignment Problem Shuyang Ling 33 4 0 12 Aug 2024
Top- $K$ ranking with a monotone adversary Yuepeng Yang Antares Chen Lorenzo Orecchia Cong Ma 37 1 0 12 Feb 2024