semidefinite programming

Provable Estimation of the Number of Blocks in Block Models AISTATS 2018 Semidefinite relaxations for certifying robustness to adversarial examples NeurIPS 2018 Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form COLT 2018 Smoothed analysis of the low-rank approach for smooth semidefinite programs NeurIPS 2018 Adaptive Clustering through Semidefinite Programming NeurIPS 2017 Connected Subgraph Detection with Mirror Descent on SDPs ICML 2017 Geometry of 3D Environments and Sum of Squares Polynomials RSS 2017 Inference in Graphical Models via Semidefinite Programming Hierarchies NeurIPS 2017 Phase Retrieval Meets Statistical Learning Theory: A Flexible Convex Relaxation AISTATS 2017 Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality COLT 2017 Dropping Convexity for Faster Semi-definite Optimization COLT 2016 Exploiting Tradeoffs for Exact Recovery in Heterogeneous Stochastic Block Models NeurIPS 2016 On Robustness of Kernel Clustering NeurIPS 2016 On the Approximability of Sparse PCA COLT 2016 On the low-rank approach for semidefinite programs arising in synchronization and community detection COLT 2016 On the Statistical Limits of Convex Relaxations ICML 2016 SDP Relaxation with Randomized Rounding for Energy Disaggregation NeurIPS 2016 Semidefinite Programs for Exact Recovery of a Hidden Community COLT 2016 Solving Temporal Puzzles CVPR 2016 Subspace Clustering With Priors via Sparse Quadratically Constrained Quadratic Programming CVPR 2016 The non-convex Burer-Monteiro approach works on smooth semidefinite programs NeurIPS 2016 A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements NeurIPS 2015 Efficient SDP Inference for Fully-Connected CRFs Based on Low-Rank Decomposition CVPR 2015 Estimating Mixture Models via Mixtures of Polynomials NeurIPS 2015 Guaranteed Tensor Decomposition: A Moment Approach ICML 2015