Publications (13)
Faster p-norm minimizing flows, via smoothed q-norm problems
Deeksha Adil, Sushant Sachdeva
We present faster high-accuracy algorithms for computing -norm minimizing flows. On a graph with edges, our algorithm can compute a -approximate u…
Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization
Deeksha Adil, Brian Bullins, Sushant Sachdeva
We provide several algorithms for constrained optimization of a large class of convex problems, including softmax, regression, and logistic regression. Central to our appr…
Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression
Deeksha Adil, Richard Peng, Sushant Sachdeva
Linear regression in -norm is a canonical optimization problem that arises in several applications, including sparse recovery, semi-supervised learning, and signal processi…
Convex optimization with -norm oracles
Deeksha Adil, Brian Bullins, Arun Jambulapati +1
In recent years, there have been significant advances in efficiently solving -regression using linear system solvers and -regression [Adil-Kyng-Peng-Sachdeva, J. AC…
Efficient and Provable Algorithms for Covariate Shift
Deeksha Adil, JarosÅaw BÅasiok
Covariate shift, a widely used assumption in tackling {\it distributional shift} (when training and test distributions differ), focuses on scenarios where the distribution of the l…
Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities
Deeksha Adil, Brian Bullins, Arun Jambulapati +1
In this work, we present new simple and optimal algorithms for solving the variational inequality (VI) problem for -order smooth, monotone operators -- a problem that gener…