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)

Bisection-Based Pricing for Repeated Contextual Auctions against Strategic Buyer ICML 2020 Black-box continuous-time transfer function estimation with stability guarantees: a kernel-based approach L4DC 2020 Black-Box Methods for Restoring Monotonicity ICML 2020 Black-Box Optimization with Local Generative Surrogates NeurIPS 2020 Black-Box Ripper: Copying black-box models using generative evolutionary algorithms NeurIPS 2020 Blur Aware Calibration of Multi-Focus Plenoptic Camera CVPR 2020 Boolean Games: Inferring Agents' Goals Using Taxation Queries IJCAI 2020 Boosting First-Order Methods by Shifting Objective: New Schemes with Faster Worst-Case Rates NeurIPS 2020 Boosting Frank-Wolfe by Chasing Gradients ICML 2020 BOSS: Bayesian Optimization over String Spaces NeurIPS 2020 BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization NeurIPS 2020 Bounded Incentives in Manipulating the Probabilistic Serial Rule AAAI 2020 Bounded Rationality in Las Vegas: Probabilistic Finite Automata Play Multi-Armed Bandits UAI 2020 Bounding Regret in Empirical Games AAAI 2020 Bounding the expected run-time of nonconvex optimization with early stopping UAI 2020 Breaking Reversibility Accelerates Langevin Dynamics for Non-Convex Optimization NeurIPS 2020 “Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack AISTATS 2020 Budget-Constrained Bandits over General Cost and Reward Distributions AISTATS 2020 Budgeted Facility Location Games with Strategic Facilities IJCAI 2020 Budgeted Online Influence Maximization ICML 2020 Building Scalable and Flexible Cluster Managers Using Declarative Programming OSDI 2020 Bundle Adjustment on a Graph Processor CVPR 2020 Cakewalk Sampling AAAI 2020 Calibrated Surrogate Maximization of Linear-fractional Utility in Binary Classification AISTATS 2020 Can Stochastic Zeroth-Order Frank-Wolfe Method Converge Faster for Non-Convex Problems? ICML 2020