Skip to content
conftrace_

Optimization

14,850 papers (55 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Continuous Optimization (4,424) Stochastic Methods (2,991) Combinatorial Optimization (2,615) Online Algorithms (2,404) Optimization (1,521) Game Theory (1,046) Convex Optimization (864) Discrete Optimization (721) Optimal Transport (474) Sparse Optimization (416) Optimal Control (271) Global Optimization (200) Non-Convex Optimization (182) Distributed Learning (164) Approximation Algorithms (162) Multi-Objective Optimization (151) Distributed Optimization (136) Bayesian Optimization (132) Theory (109) Compressed Sensing (102) Algorithms (89) Robust Optimization (86) Submodular Optimization (77) Kernel Methods (75) Evolutionary Algorithm (72) Linear Programming (54) Tensor Decomposition (48) Bilevel Optimization (42) Integer Programming (38) Matrix Completion (33) Algorithm (21) Regularization (11)

Papers per year

1
16
133
440
1,353
1,441
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search IJCAI 2019 Improved Path-length Regret Bounds for Bandits COLT 2019 Improved Regret Bounds for Bandit Combinatorial Optimization NeurIPS 2019 Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization ICML 2019 Improving Generalization and Stability of Generative Adversarial Networks ICLR 2019 Improving Textual Network Embedding with Global Attention via Optimal Transport ACL 2019 Improvisation through Physical Understanding: Using Novel Objects As Tools with Visual Foresight RSS 2019 Incomplete Label Multi-Task Deep Learning for Spatio-Temporal Event Subtype Forecasting AAAI 2019 Incorporating Behavioral Constraints in Online AI Systems AAAI 2019 Indirect Trust is Simple to Establish IJCAI 2019 Integrating Learning with Game Theory for Societal Challenges IJCAI 2019 Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms IJCAI 2019 Interaction Hard Thresholding: Consistent Sparse Quadratic Regression in Sub-quadratic Time and Space NeurIPS 2019 Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem NeurIPS 2019 Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time NeurIPS 2019 Interpolated Spectral NGram Language Models ACL 2019 Interpolating between Optimal Transport and MMD using Sinkhorn Divergences AISTATS 2019 Interpretable Almost-Exact Matching for Causal Inference AISTATS 2019 Inverse Path Tracing for Joint Material and Lighting Estimation CVPR 2019 Isospectralization, or How to Hear Shape, Style, and Correspondence CVPR 2019 iSplit LBI: Individualized Partial Ranking with Ties via Split LBI NeurIPS 2019 Iterative Budgeted Exponential Search IJCAI 2019 Iterative Least Trimmed Squares for Mixed Linear Regression NeurIPS 2019 Iterative Linearized Control: Stable Algorithms and Complexity Guarantees ICML 2019 Jointly Multiple Hash Learning AAAI 2019