1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
math.OC2022★ 1 cited
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound
Liam O'Carroll, Vaidehi Srinivas, Aravindan Vijayaraghavan
The most widely used technique for solving large-scale semidefinite programs (SDPs) in practice is the non-convex Burer-Monteiro method, which explicitly maintains a low-rank SDP s…
cs.DS2022
Memory Bounds for the Experts Problem
Vaidehi Srinivas, David P. Woodruff, Ziyu Xu +1
Online learning with expert advice is a fundamental problem of sequential prediction. In this problem, the algorithm has access to a set of "experts" who make predictions on ea…