semidefinite programming

Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints COLT 2015 Label optimal regret bounds for online local learning COLT 2015 Spectral Norm Regularization of Orthonormal Representations for Graph Transduction NeurIPS 2015 Sum-of-Squares Lower Bounds for Sparse PCA NeurIPS 2015 Weighted Theta Functions and Embeddings with Applications to Max-Cut, Clustering and Summarization NeurIPS 2015 Deterministic Symmetric Positive Semidefinite Matrix Completion NeurIPS 2014 Efficient Inference of Continuous Markov Random Fields with Polynomial Potentials NeurIPS 2014 Efficient Low-Rank Stochastic Gradient Descent Methods for Solving Semidefinite Programs AISTATS 2014 Near-Optimal Joint Object Matching via Convex Relaxation ICML 2014 Open Problem: Tightness of maximum likelihood semidefinite relaxations COLT 2014 Orientation Robust Text Line Detection in Natural Images CVPR 2014 Structured Prediction of Network Response ICML 2014 A Fast Semidefinite Approach to Solving Binary Quadratic Problems CVPR 2013 Complexity Theoretic Lower Bounds for Sparse Principal Component Detection COLT 2013 Convex Optimization of Nonlinear Feedback Controllers via Occupation Measures RSS 2013 Data-driven Distributionally Robust Polynomial Optimization NeurIPS 2013 Gauging Association Patterns of Chromosome Territories via Chromatic Median CVPR 2013 Learning with Invariance via Linear Functionals on Reproducing Kernel Hilbert Space NeurIPS 2013 Maximum Volume Clustering: A New Discriminative Clustering Approach JMLR 2013 Mean Reversion with a Variance Threshold ICML 2013 Unsupervised Link Selection in Networks AISTATS 2013 Approximate Inference by Intersecting Semidefinite Bound and Local Polytope AISTATS 2012 Approximating Concavely Parameterized Optimization Problems NeurIPS 2012 CPRL -- An Extension of Compressive Sensing to the Phase Retrieval Problem NeurIPS 2012 Regularization Paths with Guarantees for Convex Semidefinite Optimization AISTATS 2012