Sushant Sachdeva

activity

20112026

most citedAlgorithms for Lipschitz Learning on Graphs

24 citations · 151 across the 43 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.OC2021★ 2 cited

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, $ℓ_{p}$ regression, and logistic regression. Central to our appr…

cs.DS2021

Almost-linear-time Weighted $ℓ_{p}$ -norm Solvers in Slightly Dense Graphs via Sparsification

Deeksha Adil, Brian Bullins, Rasmus Kyng +1

We give almost-linear-time algorithms for constructing sparsifiers with $n p o l y (lo g n)$ edges that approximately preserve weighted $(ℓ_{2}^{2} + ℓ_{p}^{p})$ flow or voltage obj…

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

Almost-linear-time Weighted ℓp​-norm Solvers in Slightly Dense Graphs via Sparsification

Almost-linear-time Weighted $ℓ_{p}$ -norm Solvers in Slightly Dense Graphs via Sparsification