Login / Signup
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound.
Liam O'Carroll
Vaidehi Srinivas
Aravindan Vijayaraghavan
Published in:
NeurIPS (2022)
Keyphrases
</>
experimental evaluation
synthetic data
computational complexity
dynamic programming
detection method
objective function
segmentation method
classification method
preprocessing
cost function
high accuracy
support vector machine
combinatorial optimization
support vector machine svm
training samples
theoretical analysis
upper bound
data sets
computational cost
lower bound
bayesian networks
clustering algorithm