229 citations · 547 across the 23 of their papers we have counts for
7 papers · 1 filter
Consistent Multiclass Algorithms for Complex Metrics and Constraints
Harikrishna Narasimhan, Harish G. Ramaswamy, Shiv Kumar Tavker +3
We present consistent algorithms for multiclass learning with complex performance metrics and constraints, where the objective and constraints are defined by arbitrary functions of…
Learning Minimax Estimators via Online Learning
Kartik Gupta, Arun Sai Suggala, Adarsh Prasad +2
We consider the problem of designing minimax estimators for estimating the parameters of a probability distribution. Unlike classical approaches such as the MLE and minimum distanc…
Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form
Srinadh Bhojanapalli, Nicolas Boumal, Prateek Jain +1
Semidefinite programs (SDP) are important in learning and combinatorial optimization with numerous applications. In pursuit of low-rank solutions and low complexity algorithms, we…
Leverage Score Sampling for Faster Accelerated Regression and ERM
Naman Agarwal, Sham Kakade, Rahul Kidambi +3
Given a matrix and a vector , we show how to compute an -approximate solution to the regression problem $ \min_{x\in\m…
Learning Planar Ising Models
Jason K. Johnson, Diane Oyen, Michael Chertkov +1
Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However,…
Low-rank Matrix Completion using Alternating Minimization
Prateek Jain, Praneeth Netrapalli, Sujay Sanghavi
Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem…