conftrace_

convex relaxation

112 papers

Explore in graph

Co-occurring keywords

convex optimization (1321) semidefinite programming (147) combinatorial optimization (1039) neural network verification (106) linear programming (227) low-rank matrix (174) graphical model (864) adversarial robustness (1341) quadratic programming (83) matrix recovery (51)

Papers

On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm NIPS 2017
Connected Subgraph Detection with Mirror Descent on SDPs ICML 2017
Sublabel-Accurate Relaxation of Nonconvex Energies CVPR 2016
A Non-generative Framework and Convex Relaxations for Unsupervised Learning NIPS 2016
On the Statistical Limits of Convex Relaxations ICML 2016
On the low-rank approach for semidefinite programs arising in synchronization and community detection COLT 2016
Instance-Level Video Segmentation From Object Tracks CVPR 2016
A Convex Atomic-Norm Approach to Multiple Sequence Alignment and Motif Discovery ICML 2016
Convex Two-Layer Modeling with Latent Structure NIPS 2016
Fast recovery from a union of subspaces NIPS 2016
Semantic 3D Reconstruction With Continuous Regularization and Ray Potentials Using a Visibility Consistency Constraint CVPR 2016
3D Shape Estimation From 2D Landmarks: A Convex Relaxation Approach CVPR 2015
Weakly-Supervised Alignment of Video With Text ICCV 2015
A Convex Optimization Approach to Robust Fundamental Matrix Estimation CVPR 2015
Sum-of-Squares Lower Bounds for Sparse PCA NIPS 2015
Tensor principal component analysis via sum-of-square proofs COLT 2015
Membership Representation for Detecting Block-Diagonal Structure in Low-Rank or Sparse Subspace Clustering CVPR 2015
A totally unimodular view of structured sparsity AISTATS 2015
Single Image Pop-Up From Discriminatively Learned Parts ICCV 2015
Entropy Minimization for Convex Relaxation Approaches ICCV 2015
Tight convex relaxations for sparse matrix factorization NIPS 2014
Near-Optimal Joint Object Matching via Convex Relaxation ICML 2014
Open Problem: Tightness of maximum likelihood semidefinite relaxations COLT 2014
Partial Optimality by Pruning for MAP-inference with General Graphical Models CVPR 2014
Tighten after Relax: Minimax-Optimal Sparse PCA in Polynomial Time NIPS 2014