Skip to content
conftrace_

Discrete Optimization

721 papers

10
26
66
59
'10
'15
'20
'25

Papers

Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs CVPR 2018 Discrete Interventions in Hawkes Processes with Applications in Invasive Species Management IJCAI 2018 Distributed Pareto Optimization for Subset Selection IJCAI 2018 Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing EMNLP 2018 Experimental Design under the Bradley-Terry Model IJCAI 2018 Fair Division Under Cardinality Constraints IJCAI 2018 Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity NeurIPS 2018 Fast Lexically Constrained Decoding with Dynamic Beam Allocation for Neural Machine Translation NAACL 2018 Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice ICML 2018 Fast MCMC Sampling Algorithms on Polytopes JMLR 2018 Found Graph Data and Planted Vertex Covers NeurIPS 2018 Generalizing Graph Matching beyond Quadratic Assignment Model NeurIPS 2018 Gradient Coding from Cyclic MDS Codes and Expander Graphs ICML 2018 Graph-Cut RANSAC CVPR 2018 High Dimensional Linear Regression using Lattice Basis Reduction NeurIPS 2018 Inference in Higher Order MRF-MAP Problems With Small and Large Cliques CVPR 2018 Learning a Mixture of Two Multinomial Logits ICML 2018 Learning to Round for Discrete Labeling Problems AISTATS 2018 Learning to Solve SMT Formulas NeurIPS 2018 Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski p-Norms ICML 2018 Limited Memory Kelley's Method Converges for Composite Convex and Submodular Objectives NeurIPS 2018 Linear Satisfiability Preserving Assignments (Extended Abstract) IJCAI 2018 Markov Random Field MAP as Set Partitioning PGM 2018 Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint NeurIPS 2018 Multi-Robot Motion Planning with Dynamics Guided by Multi-Agent Search IJCAI 2018