conftrace_
← Keywords

combinatorial optimization

1039 papers

Explore in graph

Also known as

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

GRSA: Generalized Range Swap Algorithm for the Efficient Optimization of MRFs CVPR 2015
Efficient Learning in Large-Scale Combinatorial Semi-Bandits ICML 2015
Weighted Theta Functions and Embeddings with Applications to Max-Cut, Clustering and Summarization NIPS 2015
Sparse PCA via Bipartite Matchings NIPS 2015
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's NIPS 2015
Graph-Based Simplex Method for Pairwise Energy Minimization With Binary Variables CVPR 2015
Combinatorial Cascading Bandits NIPS 2015
Pointer Networks NIPS 2015
Learning Submodular Losses with the Lovasz Hinge ICML 2015
First-order regret bounds for combinatorial semi-bandits COLT 2015
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice NIPS 2015
Smooth Interactive Submodular Set Cover NIPS 2015
Algorithms for the Hard Pre-Image Problem of String Kernels and the General Problem of String Prediction ICML 2015
Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications NIPS 2015
Efficient learning by implicit exploration in bandit problems with side observations NIPS 2014
Rounding-based Moves for Metric Labeling NIPS 2014
Beyond the Birkhoff Polytope: Convex Relaxations for Vector Permutation Problems NIPS 2014
Learning to Search in Branch and Bound Algorithms NIPS 2014
Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning NIPS 2014
Combinatorial Pure Exploration of Multi-Armed Bandits NIPS 2014
On the Convergence Rate of Decomposable Submodular Function Minimization NIPS 2014
Finding Dense Subgraphs via Low-Rank Bilinear Optimization ICML 2014
Simple MAP Inference via Low-Rank Relaxations NIPS 2014
Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability AISTATS 2014
Submodularization for Binary Pairwise Energies CVPR 2014