Papers
1,876 papers found
Matrix Completion from Noisy Entries
Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh
Composite Binary Losses
Mark D. Reid, Robert C. Williamson
The Sample Complexity of Dictionary Learning
Daniel Vainsencher, Shie Mannor, Alfred M. Bruckstein
A Simpler Approach to Matrix Completion
Benjamin Recht
A Geometric Approach to Sample Compression
Benjamin I.P. Rubinstein, J. Hyam Rubinstein
Distribution-Dependent Sample Complexity of Large Margin Learning
Sivan Sabato, Nathan Srebro, Naftali Tishby
A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
Tony Cai, Wen-Xin Zhou
Iteration Complexity of Feasible Descent Methods for Convex Optimization
Po-Wei Wang, Chih-Jen Lin
Recursive Teaching Dimension, VC-Dimension and Sample Compression
Thorsten Doliwa, Gaojian Fan, Hans Ulrich Simon et al.
Online Learning via Sequential Complexities
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
Distributed Matrix Completion and Robust Factorization
Lester Mackey, Ameet Talwalkar, Michael I. Jordan
Completing Any Low-rank Matrix, Provably
Yudong Chen, Srinadh Bhojanapalli, Sujay Sanghavi et al.
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models
Emilie Kaufmann, Olivier Cappé, Aurélien Garivier
The Optimal Sample Complexity of PAC Learning
Steve Hanneke
MOCCA: Mirrored Convex/Concave Optimization for Nonconvex Composite Functions
Rina Foygel Barber, Emil Y. Sidky
Composite Multiclass Losses
Robert C. Williamson, Elodie Vernet, Mark D. Reid
Fundamental Conditions for Low-CP-Rank Tensor Completion
Morteza Ashraphijuo, Xiaodong Wang
Rank Determination for Low-Rank Data Completion
Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal
Knowledge Graph Completion via Complex Tensor Factorization
Théo Trouillon, Christopher R. Dance, Éric Gaussier et al.
Matrix Completion with Noisy Entries and Outliers
Raymond K. W. Wong, Thomas C. M. Lee
Compact Convex Projections
Steffen Grünewälder
Local Rademacher Complexity-based Learning Guarantees for Multi-Task Learning
Niloofar Yousefi, Yunwen Lei, Marius Kloft et al.
Optimal Quantum Sample Complexity of Learning Algorithms
Srinivasan Arunachalam, Ronald de Wolf