Swati Padmanabhan

According to our database, Swati Padmanabhan authored at least 15 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Improved Sample Complexity of Imitation Learning for Barrier Model Predictive Control.

Daniel Pfrommer, Swati Padmanabhan, Kwangjun Ahn, Jack Umenberger, Tobia Marcucci, Zakaria Mhammedi, Ali Jadbabaie

CoRR, 2024

On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization.

Guy Kornowski, Swati Padmanabhan, Ohad Shamir

CoRR, 2024

First-Order Methods for Linearly Constrained Bilevel Optimization.

Guy Kornowski, Swati Padmanabhan, Kai Wang, Zhe Zhang, Suvrit Sra

CoRR, 2024

Improving the Bit Complexity of Communication for Distributed Convex Optimization.

Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱.

Zhe Feng, Swati Padmanabhan, Di Wang

Proceedings of the ACM Web Conference 2023, 2023

Computing Approximate 𝓁_p Sensitivities.

Swati Padmanabhan, David P. Woodruff, Richard Zhang

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Computing Lewis Weights to High Precision.

Maryam Fazel, Yin Tat Lee, Swati Padmanabhan, Aaron Sidford

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity.

Sally Dong, Haotian Jiang, Yin Tat Lee, Swati Padmanabhan, Guanghao Ye

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.

Jelena Diakonikolas, Chenghui Li, Swati Padmanabhan, Chaobing Song

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.

Damek Davis, Dmitriy Drusvyatskiy, Yin Tat Lee, Swati Padmanabhan, Guanghao Ye

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.

Arun Jambulapati, Yin Tat Lee, Jerry Li, Swati Padmanabhan, Kevin Tian

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

A Faster Interior Point Method for Semidefinite Programming.

Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, Zhao Song

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.

Yin Tat Lee, Swati Padmanabhan

Proceedings of the Conference on Learning Theory, 2020

2019

An Õ(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints.

Yin Tat Lee, Swati Padmanabhan

CoRR, 2019

2012

Smart rapid diagnostics test reader running on a cell-phone for real-time mapping of epidemics.

Onur Mudanyali, Swati Padmanabhan, Stoyan Dimitrov, Isa Navruz, Uzair Sikora, Aydogan Ozcan

Proceedings of the Second ACM Workshop on Mobile Systems, 2012