◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Vaidehi Srinivas

6 papers hereh-index 574 citations12 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author2
  • middle author3

Across the 6 of 6 papers where every author was matched, so the position is known.

fields
  • cs.DS3
  • cs.LG2
  • math.OC1

identity via Semantic Scholar / OpenAlex

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

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

collaborators
Showing math.OCShow all

1 paper · 1 filter

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.