Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1703.08729
Cited By
v1
v2 (latest)
Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality
25 March 2017
Song Mei
Theodor Misiakiewicz
Andrea Montanari
R. Oliveira
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality"
28 / 28 papers shown
Title
Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs
Faniriana Rakoto Endor
Irène Waldspurger
72
5
0
05 Nov 2024
Local Geometry Determines Global Landscape in Low-rank Factorization for Synchronization
Shuyang Ling
49
6
0
30 Nov 2023
Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective
Yuetian Luo
Nicolas García Trillos
52
7
0
29 Sep 2022
Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization
Tianyi Lin
Zeyu Zheng
Michael I. Jordan
114
55
0
12 Sep 2022
Inference and Optimization for Engineering and Physical Systems
M. Krechetov
65
0
0
29 Aug 2022
Dynamic Ranking and Translation Synchronization
E. Araya
Eglantine Karlé
Hemant Tyagi
103
4
0
04 Jul 2022
Efficient semidefinite bounds for multi-label discrete graphical models
Valentin Durante
G. Katsirelos
T. Schiex
13
0
0
24 Nov 2021
Momentum-inspired Low-Rank Coordinate Descent for Diagonally Constrained SDPs
Junhyung Lyle Kim
Jose Antonio Lara Benitez
Taha Toghani
Cameron R. Wolfe
Zhiwei Zhang
Anastasios Kyrillidis
62
0
0
16 Jun 2021
Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
Minhui Huang
69
6
0
04 Feb 2021
Riemannian Langevin Algorithm for Solving Semidefinite Programs
Mufan Li
Murat A. Erdogdu
118
29
0
21 Oct 2020
Near-Optimal Performance Bounds for Orthogonal and Permutation Group Synchronization via Spectral Methods
Shuyang Ling
99
34
0
12 Aug 2020
From Symmetry to Geometry: Tractable Nonconvex Problems
Yuqian Zhang
Qing Qu
John N. Wright
87
45
0
14 Jul 2020
An Analysis of Constant Step Size SGD in the Non-convex Regime: Asymptotic Normality and Bias
Lu Yu
Krishnakumar Balasubramanian
S. Volgushev
Murat A. Erdogdu
106
52
0
14 Jun 2020
Escaping Saddle Points Efficiently with Occupation-Time-Adapted Perturbations
Xin Guo
Jiequn Han
Mahan Tajrobehkar
Wenpin Tang
38
2
0
09 May 2020
Replica Exchange for Non-Convex Optimization
Jing-rong Dong
Xin T. Tong
108
21
0
23 Jan 2020
Robust Group Synchronization via Cycle-Edge Message Passing
Gilad Lerman
Yunpeng Shi
91
31
0
24 Dec 2019
Polynomial time guarantees for the Burer-Monteiro method
Diego Cifuentes
Ankur Moitra
162
37
0
03 Dec 2019
A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics
Anirudha Majumdar
G. Hall
Amir Ali Ahmadi
115
102
0
14 Aug 2019
On Stationary-Point Hitting Time and Ergodicity of Stochastic Gradient Langevin Dynamics
Xi Chen
S. Du
Xin T. Tong
77
33
0
30 Apr 2019
On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points
Chi Jin
Praneeth Netrapalli
Rong Ge
Sham Kakade
Michael I. Jordan
97
61
0
13 Feb 2019
A Deterministic Gradient-Based Approach to Avoid Saddle Points
L. Kreusser
Stanley J. Osher
Bao Wang
ODL
114
3
0
21 Jan 2019
Convex Relaxation Methods for Community Detection
Xiaodong Li
Yudong Chen
Jiaming Xu
131
51
0
30 Sep 2018
Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDPs
Murat A. Erdogdu
Asuman Ozdaglar
P. Parrilo
N. D. Vanli
85
33
0
12 Jul 2018
Smoothed analysis of the low-rank approach for smooth semidefinite programs
Thomas Pumir
Samy Jelassi
Nicolas Boumal
121
27
0
11 Jun 2018
Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form
Srinadh Bhojanapalli
Nicolas Boumal
Prateek Jain
Praneeth Netrapalli
106
44
0
01 Mar 2018
Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent
Chi Jin
Praneeth Netrapalli
Michael I. Jordan
ODL
94
263
0
28 Nov 2017
Inference in Graphical Models via Semidefinite Programming Hierarchies
Murat A. Erdogdu
Y. Deshpande
Andrea Montanari
TPM
39
29
0
19 Sep 2017
The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
Po-Wei Wang
Wei-Cheng Chang
J. Zico Kolter
52
18
0
01 Jun 2017
1