linear programming

Provable Defenses against Adversarial Examples via the Convex Outer Adversarial Polytope ICML 2018 Towards Fast Computation of Certified Robustness for ReLU Networks ICML 2018 A New Alternating Direction Method for Linear Programming NeurIPS 2017 Efficient Linear Programming for Dense CRFs CVPR 2017 Exact MAP Inference by Avoiding Fractional Vertices ICML 2017 I-dual: Solving Constrained SSPs via Heuristic Search in the Dual Space IJCAI 2017 On The Projection Operator to A Three-view Cardinality Constrained Set ICML 2017 Parametric Simplex Method for Sparse Learning NeurIPS 2017 Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement ICML 2017 Train and Test Tightness of LP Relaxations in Structured Prediction ICML 2016 A Direct Estimation of High Dimensional Stationary Vector Autoregressions JMLR 2015 Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits NeurIPS 2015 A totally unimodular view of structured sparsity AISTATS 2015 Efficient Globally Optimal Consensus Maximisation With Tree Search CVPR 2015 Efficient Training of Structured SVMs via Soft Constraints AISTATS 2015 Exactness of Approximate MAP Inference in Continuous MRFs NeurIPS 2015 Joint Vanishing Point Extraction and Tracking CVPR 2015 Low Dimensional Explicit Feature Maps ICCV 2015 Matching Bags of Regions in RGBD images CVPR 2015 Robust Nonrigid Registration by Convex Optimization ICCV 2015 Saturation-Preserving Specular Reflection Separation CVPR 2015 Sparse Linear Programming via Primal and Dual Augmented Coordinate Descent NeurIPS 2015 Threshold Influence Model for Allocating Advertising Budgets ICML 2015 An Analysis of State-Relevance Weights and Sampling Distributions on L1-Regularized Approximate Linear Programming Approximation Accuracy ICML 2014 An Integer Polynomial Programming Based Framework for Lifted MAP Inference NeurIPS 2014