← Search

Sushant Sachdeva

8 accepted papers

2022

A Convergent and Dimension-Independent Min-Max Optimization Algorithm

ICML 2022oral

We study a variant of a recently introduced min-max optimization framework where the max-player is constrained to update its parameters in a greedy manner until it reaches a first-order stationary point. Our equilibrium definition for this framework depends on a proposal distribution which the min-p…

2021

Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization

NeurIPS 2021poster

We provide several algorithms for constrained optimization of a large class of convex problems, including softmax, $\ell_p$ regression, and logistic regression. Central to our approach is the notion of width reduction, a technique which has proven immensely useful in the context of maximum flow [Chr…

Cited by 7SourcePDFScholar
2020

Faster Graph Embeddings via Coarsening

ICML 2020poster

Graph embeddings are a ubiquitous tool for machine learning tasks, such as node classification and link prediction, on graph-structured data. However, computing the embeddings for large-scale graphs is prohibitively inefficient even if we are interested only in a small subset of relevant vertices. T…

Cited by 31SourcePDFScholar
2020

Regularized linear autoencoders recover the principal components, eventually

NeurIPS 2020poster

Our understanding of learning input-output relationships with neural nets has improved rapidly in recent years, but little is known about the convergence of the underlying representations, even in the simple case of linear autoencoders (LAEs). We show that when trained with proper regularization, LA…

2019

Improved Semi-Supervised Learning with Multiple Graphs

AISTATS 2019poster

We present a new approach for graph based semi-supervised learning based on a multi-component extension to the Gaussian MRF model. This approach models the observations on the vertices as jointly Gaussian with an inverse covariance matrix that is a weighted linear combination of multiple matrices. B…

2019

Which Algorithmic Choices Matter at Which Batch Sizes? Insights From a Noisy Quadratic Model

NeurIPS 2019poster

Increasing the batch size is a popular way to speed up neural network training, but beyond some critical batch size, larger batch sizes yield diminishing returns. In this work, we study how the critical batch size changes based on properties of the optimization algorithm, including acceleration and…

Cited by 168SourcePDFScholar
2015

Fast, Provable Algorithms for Isotonic Regression in all L_p-norms

NeurIPS 2015poster

Given a directed acyclic graph $G,$ and a set of values $y$ on the vertices, the Isotonic Regression of $y$ is a vector $x$ that respects the partial order described by $G,$ and minimizes $\|x-y\|,$ for a specified norm. This paper gives improved algorithms for computing the Isotonic Regression for…