← 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

Dual Iterative Hard Thresholding JMLR 2020
Maximum Nash Welfare and Other Stories About EFX IJCAI 2020
Combinatorial Multi-Armed Bandits with Concave Rewards and Fairness Constraints IJCAI 2020
Learning Optimal Decision Trees using Constraint Programming (Extended Abstract) IJCAI 2020
Generating Weighted MAX-2-SAT Instances with Frustrated Loops: an RBM Case Study JMLR 2020
Dynamic Assortment Optimization with Changing Contextual Information JMLR 2020
Ddo, a Generic and Efficient Framework for MDD-Based Optimization IJCAI 2020
Harmless Overfitting: Using Denoising Autoencoders in Estimation of Distribution Algorithms JMLR 2020
Learning for Graph Matching and Related Combinatorial Optimization Problems IJCAI 2020
Two Reformulation Approaches to Maximum-A-Posteriori Inference in Sum-Product Networks PGM 2020
Learning decomposable models by coarsening PGM 2020
GOBNILP: Learning Bayesian network structure with integer programming PGM 2020
Sample Complexity Bounds for RNNs with Application to Combinatorial Graph Problems (Student Abstract) AAAI 2020
Kidney Exchange with Inhomogeneous Edge Existence Uncertainty UAI 2020
An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NIPS 2020
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time NIPS 2020
A Primal-Dual Solver for Large-Scale Tracking-by-Assignment AISTATS 2020
Optimal Adaptive Electrode Selection to Maximize Simultaneously Recorded Neuron Yield NIPS 2020
Language Generation via Combinatorial Constraint Satisfaction: A Tree Search Enhanced Monte-Carlo Approach EMNLP 2020
“Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack AISTATS 2020
On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness AISTATS 2020
Sparse Layered Graphs for Multi-Object Segmentation CVPR 2020
Recent Developments in Boolean Matrix Factorization IJCAI 2020
Fair Division: The Computer Scientist’s Perspective IJCAI 2020
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory IJCAI 2020