← 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

Minimax Localization of Structural Information in Large Noisy Matrices NIPS 2011
Projection onto A Nonnegative Max-Heap NIPS 2011
Phase transition in the family of p-resistances NIPS 2011
Minimax Policies for Combinatorial Prediction Games COLT 2011
Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts NIPS 2011
Variational Inference over Combinatorial Spaces NIPS 2010
Optimal Web-Scale Tiering as a Flow Problem NIPS 2010
Non-Stochastic Bandit Slate Problems NIPS 2010
On-Line Sequential Bin Packing JMLR 2010
Efficient Minimization of Decomposable Submodular Functions NIPS 2010
Segmentation as Maximum-Weight Independent Set NIPS 2010
Learning Bayesian Network Structure using LP Relaxations AISTATS 2010
Bayesian structure discovery in Bayesian networks with less space AISTATS 2010
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching AISTATS 2010
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure JMLR 2010
MAP estimation in Binary MRFs via Bipartite Multi-cuts NIPS 2010
An Integer Projected Fixed Point Method for Graph Matching and MAP Inference NIPS 2009
An LP View of the M-best MAP problem NIPS 2009
Local Rules for Global MAP: When Do They Work ? NIPS 2009
Submodularity Cuts and Applications NIPS 2009
A Game-Theoretic Approach to Hypergraph Clustering NIPS 2009
An Analysis of Convex Relaxations for MAP Estimation of Discrete MRFs JMLR 2009
Inferring rankings under constrained sensing NIPS 2008
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies JMLR 2008
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation NIPS 2008