← Keywords

combinatorial optimization

1039 papers

Explore in graph

Also known as

CUCB COP CO

Co-occurring keywords

approximation algorithm (630) graph neural network (3945) multi-armed bandit (1091) regret bound (1918) graph algorithm (177) neural network (6616) reinforcement learning (4122) submodular optimization (261) graph theory (249) discrete optimization (145)

Papers

GrabCut in One Cut ICCV 2013
Prediction by random-walk perturbation COLT 2013
Monochromatic Bi-Clustering ICML 2013
Adaptive Anonymity via $b$-Matching NIPS 2013
Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization CVPR 2013
Bethe Bounds and Approximating the Global Optimum AISTATS 2013
A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles CVPR 2013
Globally Optimizing Graph Partitioning Problems Using Message Passing AISTATS 2012
Efficient Sampling from Combinatorial Space via Bridging AISTATS 2012
The Lovász ϑ function, SVMs and finding large dense subgraphs NIPS 2012
An Integer Optimization Approach to Associative Classification NIPS 2012
Submodular-Bregman and the Lovász-Bregman Divergences with Applications NIPS 2012
Minimizing Sparse High-Order Energies by Submodular Vertex-Cover NIPS 2012
High-Rank Matrix Completion AISTATS 2012
A Distributable and Computation-flexible Assignment Algorithm: From Local Task Swapping to Global Optimality RSS 2012
GenDeR: A Generic Diversified Ranking Algorithm NIPS 2012
Learning Valuation Functions COLT 2012
Topology Constraints in Graphical Models NIPS 2012
Clustering Aggregation as Maximum-Weight Independent Set NIPS 2012
Efficient and Exact MAP-MRF Inference using Branch and Bound AISTATS 2012
Submodular Multi-Label Learning NIPS 2011
Prismatic Algorithm for Discrete D.C. Programming Problem NIPS 2011
Reconstructing Patterns of Information Diffusion from Incomplete Observations NIPS 2011
On fast approximate submodular minimization NIPS 2011
Fast $b$-matching via Sufficient Selection Belief Propagation AISTATS 2011