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)

Fisher Markets with Social Influence AAAI 2023 Flaws of Termination and Optimality in ADOPT-based Algorithms IJCAI 2023 Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems ALT 2023 Formalizing Preferences Over Runtime Distributions ICML 2023 Formally Verified SAT-Based AI Planning AAAI 2023 Formally Verified Solution Methods for Markov Decision Processes AAAI 2023 Framework and Benchmarks for Combinatorial and Mixed-variable Bayesian Optimization NeurIPS 2023 Free Lunch for Efficient Textual Commonsense Integration in Language Models ACL 2023 Frequency Domain-Based Dataset Distillation NeurIPS 2023 From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms JMLR 2023 Fully-Adaptive Composition in Differential Privacy ICML 2023 Fully Computer-Assisted Proofs in Extremal Combinatorics AAAI 2023 Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time NeurIPS 2023 Fully Dynamic Online Selection through Online Contention Resolution Schemes AAAI 2023 Fully Dynamic Submodular Maximization over Matroids ICML 2023 Fully Online Matching with Stochastic Arrivals and Departures AAAI 2023 Function Approximation for Solving Stackelberg Equilibrium in Large Perfect Information Games AAAI 2023 Fundamental limits and algorithms for sparse linear regression with sublinear sparsity JMLR 2023 Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits AISTATS 2023 Fused Gromov-Wasserstein Graph Mixup for Graph-level Classifications NeurIPS 2023 Future Aware Pricing and Matching for Sustainable On-Demand Ride Pooling AAAI 2023 G*: A New Approach to Bounding Curvature Constrained Shortest Paths through Dubins Gates RSS 2023 GANs as Gradient Flows that Converge JMLR 2023 Gaussian Processes on Distributions based on Regularized Optimal Transport AISTATS 2023 Gaussian Process Priors for Systems of Linear Partial Differential Equations with Constant Coefficients ICML 2023