activity
20222025
most citedThe Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound

1 citations · 1 across the 9 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Competitive strategies to use "warm start" algorithms with predictions

Vaidehi Srinivas, Avrim Blum

We consider the problem of learning and using predictions for warm start algorithms with predictions. In this setting, an algorithm is given an instance of a problem, and a predict…

cs.DS2024

New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries

Aditya Bhaskara, Eric Evert, Vaidehi Srinivas +1

We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by p…