conftrace_

cutting plane algorithm

10 papers

Explore in graph

Co-occurring keywords · papers mentioning both

support vector machine (2) convex optimization (2) combinatorial optimization (2) graph transduction (1) entropy bound (1) path connectivity (1) sub-polynomial regime (1) decision-sufficient representation (1) lifted disjoint path (1) complexity guarantee (1)

Papers

Learning Decision-Sufficient Representations for Linear Optimization COLT 2026 Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates AAAI 2024 Memory-Constrained Algorithms for Convex Optimization NeurIPS 2023 A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions NeurIPS 2022 Contextual Recommendations and Low-Regret Cutting-Plane Algorithms NeurIPS 2021 Lifted Disjoint Paths with Application in Multiple Object Tracking ICML 2020 Graph Transduction Learning with Connectivity Constraints with Application to Multiple Foreground Cosegmentation CVPR 2013 Optimized Cutting Plane Algorithm for Large-Scale Risk Minimization JMLR 2009 New Outer Bounds on the Marginal Polytope NeurIPS 2007 Large Margin Methods for Structured and Interdependent Output Variables JMLR 2005