Swati Padmanabhan

Orcid: 0000-0002-4834-2136

According to our database1, Swati Padmanabhan authored at least 14 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improving the Bit Complexity of Communication for Distributed Convex Optimization.
CoRR, 2024

2023
Computing Approximate 𝓁<sub>p</sub> Sensitivities.
CoRR, 2023

Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱.
Proceedings of the ACM Web Conference 2023, 2023

Computing Approximate 𝓁<sub>p</sub> Sensitivities.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Online Bidding Algorithms for Return-on-Spend Constrained Advertisers.
CoRR, 2022

Computing Lewis Weights to High Precision.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Fast Scale-Invariant Algorithm for Non-negative Least Squares with Non-negative Data.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2020
Positive semidefinite programming: mixed, parallel, and width-independent.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

A Faster Interior Point Method for Semidefinite Programming.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

An $\widetilde\mathcalO(m/\varepsilon^3.5)$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints.
Proceedings of the Conference on Learning Theory, 2020

2019
An Õ(m/ε<sup>3.5</sup>)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints.
CoRR, 2019

2012
Smart rapid diagnostics test reader running on a cell-phone for real-time mapping of epidemics.
Proceedings of the Second ACM Workshop on Mobile Systems, 2012


  Loading...