conftrace_

semi-definite programming

37 papers

Explore in graph

Also known as

SDP

Co-occurring keywords

convex optimization (1321) community detection (276) combinatorial optimization (1039) semi-definite program (3) convex relaxation (112) semidefinite programming (147) semi-supervised learning (2341) regret bound (1926) dynamical system (398) spectral method (204)

Papers

RedEx: Beyond Fixed Representation Methods via Convex Optimization ALT 2024
Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming ICML 2023
Data-driven Control of Unknown Linear Systems via Quantized Feedback L4DC 2022
Handling Hard Affine SDP Shape Constraints in RKHSs JMLR 2022
Efficient Low Rank Convex Bounds for Pairwise Discrete Graphical Models ICML 2022
A Data Driven, Convex Optimization Approach to Learning Koopman Operators L4DC 2021
Learning Stabilizing Controllers for Unstable Linear Quadratic Regulators from a Single Trajectory L4DC 2021
Exploiting Sparsity for Neural Network Verification L4DC 2021
Stable Online Control of Linear Time-Varying Systems L4DC 2021
Minimax Adaptive Control for a Finite Set of Linear Systems L4DC 2021
Learning with semi-definite programming: statistical bounds based on fixed point analysis and excess risk curvature JMLR 2021
Robust error bounds for quantised and pruned neural networks L4DC 2021
Near-Optimal Comparison Based Clustering NIPS 2020
A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates COLT 2020
Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networks ICML 2020
Multi-Criteria Dimensionality Reduction with Applications to Fairness NIPS 2019
Transductive Episodic-Wise Adaptive Metric for Few-Shot Learning ICCV 2019
Inductive Two-Layer Modeling with Parametric Bregman Transfer ICML 2018
Provable Estimation of the Number of Blocks in Block Models AISTATS 2018
A New and Flexible Approach to the Analysis of Paired Comparison Data JMLR 2018
Subspace Clustering With Priors via Sparse Quadratically Constrained Quadratic Programming CVPR 2016
Sum-of-Squares Lower Bounds for Sparse PCA NIPS 2015
Efficient SDP Inference for Fully-Connected CRFs Based on Low-Rank Decomposition CVPR 2015
Spectral Norm Regularization of Orthonormal Representations for Graph Transduction NIPS 2015
Label optimal regret bounds for online local learning COLT 2015