
Projection Efficient Subgradient Method and Optimal Nonsmooth FrankWolfe Method
We consider the classical setting of optimizing a nonsmooth Lipschitz co...
read it

Programming by Rewards
We formalize and study “programming by rewards” (PBR), a new approach fo...
read it

Globallyconvergent Iteratively Reweighted Least Squares for Robust Regression Problems
We provide the first global model recovery results for the IRLS (iterati...
read it

Least Squares Regression with Markovian Data: Fundamental Limits and Algorithms
We study the problem of least squares linear regression where the datap...
read it

The Pitfalls of Simplicity Bias in Neural Networks
Several works have proposed Simplicity Bias (SB)—the tendency of standar...
read it

COVID19: Strategies for Allocation of Test Kits
With the increasing spread of COVID19, it is important to systematicall...
read it

DROCC: Deep Robust OneClass Classification
Classical approaches for oneclass problems such as oneclass SVM (Schol...
read it

RNNPool: Efficient Nonlinear Pooling for RAM Constrained Inference
Pooling operators are key components in most Convolutional Neural Networ...
read it

Soft Threshold Weight Reparameterization for Learnable Sparsity
Sparsity in Deep Neural Networks (DNNs) is studied extensively with the ...
read it

RichItem Recommendations for RichUsers via GCNN: Exploiting Dynamic and Static Side Information
We study the standard problem of recommending relevant items to users; a...
read it

OASIS: ILPGuided Synthesis of Loop Invariants
Finding appropriate inductive loop invariants for a program is a key cha...
read it

Learning Functions over Sets via Permutation Adversarial Networks
In this paper, we consider the problem of learning functions over sets, ...
read it

Efficient Algorithms for Smooth Minimax Optimization
This paper studies first order methods for solving smooth minimax optimi...
read it

Making the Last Iterate of SGD Information Theoretically Optimal
Stochastic gradient descent (SGD) is one of the most widely used algorit...
read it

Adaptive Hard Thresholding for Nearoptimal Consistent Robust Regression
We study the problem of robust linear regression with response variable ...
read it

SGD without Replacement: Sharper Rates for General Smooth Convex Functions
We study stochastic gradient descent without replacement () for smooth ...
read it

FastGRNN: A Fast, Accurate, Stable and Tiny Kilobyte Sized Gated Recurrent Neural Network
This paper develops the FastRNN and FastGRNN algorithms to address the t...
read it

Nonlinear Inductive Matrix Completion based on Onelayer Neural Networks
The goal of a recommendation system is to predict the interest of a user...
read it

NeuralGuided Deductive Search for RealTime Program Synthesis from Examples
Synthesizing userintended programs from a small number of inputoutput ...
read it

On the insufficiency of existing momentum schemes for Stochastic Optimization
Momentum based stochastic gradient methods such as heavy ball (HB) and N...
read it

Smoothed analysis for lowrank solutions to semidefinite programs in quadratic penalty form
Semidefinite programs (SDP) are important in learning and combinatorial ...
read it

Differentially Private Matrix Completion, Revisited
We study the problem of privacypreserving collaborative filtering where...
read it

Nonconvex Optimization for Machine Learning
A vast majority of machine learning algorithms train their models and pe...
read it

A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)
This work provides a simplified proof of the statistical minimax optimal...
read it

Leveraging Distributional Semantics for MultiLabel Learning
We present a novel and scalable label embedding framework for largescal...
read it

Learning Mixture of Gaussians with Streaming Data
In this paper, we study the problem of learning a mixture of Gaussians w...
read it

Recovery Guarantees for Onehiddenlayer Neural Networks
In this paper, we consider regression problems with onehiddenlayer neu...
read it

Accelerating Stochastic Gradient Descent
There is widespread sentiment that it is not possible to effectively uti...
read it

Parallelizing Stochastic Approximation Through MiniBatching and TailAveraging
This work characterizes the benefits of averaging techniques widely used...
read it

Efficient and Consistent Robust Time Series Analysis
We study the problem of robust time series analysis under the standard a...
read it

Regret Bounds for Nondecomposable Metrics with Missing Labels
We consider the problem of recommending relevant labels (items) for a gi...
read it

Streaming PCA: Matching Matrix Bernstein and NearOptimal Finite Sample Guarantees for Oja's Algorithm
This work provides improved guarantees for streaming principle component...
read it

Structured Sparse Regression via Greedy HardThresholding
Several learning applications require solving highdimensional regressio...
read it

Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbations
Robust tensor CP decomposition involves decomposing a tensor into low ra...
read it

Robust Regression via Hard Thresholding
We study the problem of Robust Least Squares Regression (RLSR) where sev...
read it

Surrogate Functions for Maximizing Precision at the Top
The problem of maximizing precision at the top of a ranked list, often d...
read it

Optimizing Nondecomposable Performance Measures: A Tale of Two Classes
Modern classification problems frequently present mild to severe label i...
read it

To Drop or Not to Drop: Robustness, Consistency and Differential Privacy Properties of Dropout
Training deep belief networks (DBNs) requires optimizing a nonconvex fu...
read it

Fast Exact Matrix Completion with Finite Samples
Matrix completion is the problem of recovering a low rank matrix by obse...
read it

Nonconvex Robust PCA
We propose a new method for robust PCA  the task of recovering a lowr...
read it

Online and Stochastic Gradient Methods for Nondecomposable Loss Functions
Modern applications in sensitive domains such as biometrics and medicine...
read it

On Iterative Hard Thresholding Methods for Highdimensional MEstimation
The use of Mestimators in generalized linear regression models in high ...
read it

Tighter Lowrank Approximation via Sampling the Leveraged Element
In this work, we propose a new randomized algorithm for computing a low...
read it

Universal Matrix Completion
The problem of lowrank matrix completion has recently generated a lot o...
read it

Learning Mixtures of Discrete Product Distributions using Spectral Decompositions
We study the problem of learning a distribution from samples, when the u...
read it

Memory Limited, Streaming PCA
We consider streaming, onepass principal component analysis (PCA), in t...
read it

Provable Inductive Matrix Completion
Consider a movie recommendation system where apart from the ratings info...
read it

Phase Retrieval using Alternating Minimization
Phase retrieval problems involve solving linear equations, but with miss...
read it

On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions
In this paper, we study the generalization properties of online learning...
read it

Lowrank Matrix Completion using Alternating Minimization
Alternating minimization represents a widely applicable and empirically ...
read it