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)

Two-Price Equilibrium AAAI 2022 Two-Sided Matching over Social Networks IJCAI 2022 Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression COLT 2022 Unbiased and Efficient Sampling of Dependency Trees EMNLP 2022 Uncertainty Quantification for Bayesian Optimization AISTATS 2022 Uncertainty Quantification for Low-Rank Matrix Completion with Heterogeneous and Sub-Exponential Noise AISTATS 2022 Uncoupled Learning Dynamics with $O(\log T)$ Swap Regret in Multiplayer Games NeurIPS 2022 Undercover Boolean Matrix Factorization with MaxSAT AAAI 2022 UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees ICML 2022 Understanding Riemannian Acceleration via a Proximal Extragradient Framework COLT 2022 Unified Optimal Transport Framework for Universal Domain Adaptation NeurIPS 2022 Uniform Stability for First-Order Empirical Risk Minimization COLT 2022 UniRank: Unimodal Bandit Algorithms for Online Ranking ICML 2022 Universal and data-adaptive algorithms for model selection in linear contextual bandits ICML 2022 Universal and Tight Online Algorithms for Generalized-Mean Welfare AAAI 2022 Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors ICML 2022 Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation NeurIPS 2022 Uplifting Bandits NeurIPS 2022 Using Constraint Programming and Graph Representation Learning for Generating Interpretable Cloud Security Policies IJCAI 2022 Using hierarchies to efficiently combine evidence with Dempster’s rule of combination UAI 2022 Using Partial Monotonicity in Submodular Maximization NeurIPS 2022 Using Reinforcement Learning for Operating Educational Campuses Safely during a Pandemic (Student Abstract) AAAI 2022 Value Function based Difference-of-Convex Algorithm for Bilevel Hyperparameter Selection Problems ICML 2022 ValueNetQP: Learned One-step Optimal Control for Legged Locomotion L4DC 2022 Variance Reduced EXTRA and DIGing and Their Optimal Acceleration for Strongly Convex Decentralized Optimization JMLR 2022