← Optimization
Mathematics & Optimization › Optimization ›

Discrete Optimization

705 directly classified papers

Papers per year

Papers

Parameterized Algorithms for the Matrix Completion Problem ICML 2018
Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski $p$-Norms ICML 2018
Constrained Interacting Submodular Groupings ICML 2018
Learning a Mixture of Two Multinomial Logits ICML 2018
Approximation Guarantees for Adaptive Sampling ICML 2018
Fast Lexically Constrained Decoding with Dynamic Beam Allocation for Neural Machine Translation NAACL 2018
Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling JMLR 2018
A Note on Quickly Sampling a Sparse Matrix with Low Rank Expectation JMLR 2018
Fast MCMC Sampling Algorithms on Polytopes JMLR 2018
Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection JMLR 2018
Provably Correct Algorithms for Matrix Column Subset Selection with Selectively Sampled Data JMLR 2018
Learning to Round for Discrete Labeling Problems AISTATS 2018
Robust Maximization of Non-Submodular Objectives AISTATS 2018
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing EMNLP 2018
A Temporally Sensitive Submodularity Framework for Timeline Summarization CONLL 2018
Markov Random Field MAP as Set Partitioning PGM 2018
Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models PGM 2018
Differentiable Submodular Maximization IJCAI 2018
Discrete Interventions in Hawkes Processes with Applications in Invasive Species Management IJCAI 2018
Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving IJCAI 2018
Descriptive Clustering: ILP and CP Formulations with Applications IJCAI 2018
Socially Motivated Partial Cooperation in Multi-agent Local Search IJCAI 2018
Comparing Constraints for Taxonomic Organization NAACL 2018
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs CVPR 2018
Graph-Cut RANSAC CVPR 2018