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)

MetaGrad: Adaptation using Multiple Learning Rates in Online Learning JMLR 2021 MetricOpt: Learning To Optimize Black-Box Evaluation Metrics CVPR 2021 MFVFD: A Multi-Agent Q-Learning Approach to Cooperative and Non-Cooperative Tasks IJCAI 2021 Mind the Gap: Cake Cutting With Separation AAAI 2021 Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization NeurIPS 2021 Minimal Cases for Computing the Generalized Relative Pose Using Affine Correspondences ICCV 2021 Minimax Adaptive Control for a Finite Set of Linear Systems L4DC 2021 Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers NeurIPS 2021 Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition COLT 2021 Minimizing Energy Use of Mixed-Fleet Public Transit for Fixed-Route Service AAAI 2021 Minimizing Polarization and Disagreement in Social Networks via Link Recommendation NeurIPS 2021 Minimum Robust Multi-Submodular Cover for Fairness AAAI 2021 Mirror Descent and the Information Ratio COLT 2021 Mirror Descent View for Neural Network Quantization AISTATS 2021 Mirror Langevin Monte Carlo: the Case Under Isoperimetry NeurIPS 2021 Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent AISTATS 2021 Misspecified Gaussian Process Bandit Optimization NeurIPS 2021 Mixability made efficient: Fast online multiclass logistic regression NeurIPS 2021 Mixed-Features Vectors and Subspace Splitting ICLR 2021 Mixed variable Bayesian optimization with frequency modulated kernels UAI 2021 Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals JMLR 2021 Modality-Agnostic Topology Aware Localization NeurIPS 2021 Modeling Precomputation In Games Played Under Computational Constraints IJCAI 2021 Modelling Behavioural Diversity for Learning in Open-Ended Games ICML 2021 Model-sharing Games: Analyzing Federated Learning Under Voluntary Participation AAAI 2021