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)

On the Power of Learning-Augmented Search Trees ICML 2025 On the Power of Optimism in Constrained Online Convex Optimization IJCAI 2025 On the Power of Randomization for Obviously Strategy-Proof Mechanisms AAAI 2025 On the Power of Strategic Corpus Enrichment in Content Creation Games AAAI 2025 On the Price of Differential Privacy for Hierarchical Clustering ICLR 2025 On the Private Estimation of Smooth Transport Maps ICML 2025 On the query complexity of sampling from non-log-concave distributions (extended abstract) COLT 2025 On the Statistical Properties of Generative Adversarial Models for Low Intrinsic Data Dimension JMLR 2025 On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning RSS 2025 On the Tension between Byzantine Robustness and No-Attack Accuracy in Distributed Learning ICML 2025 On the Utility of Equal Batch Sizes for Inference in Stochastic Gradient Descent JMLR 2025 Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games COLT 2025 Operator Learning for Hyperbolic PDEs JMLR 2025 OPTAMI: Global Superlinear Convergence of High-order Methods ICLR 2025 OptiBench Meets ReSocratic: Measure and Improve LLMs for Optimization Modeling ICLR 2025 OPTICAL: Leveraging Optimal Transport for Contribution Allocation in Dataset Distillation CVPR 2025 Optimal Algorithm for Max-Min Fair Bandit ICML 2025 Optimal and Efficient Algorithms for Decentralized Online Convex Optimization JMLR 2025 Optimal and Efficient Binary Questioning for Accelerated Annotation AAAI 2025 Optimal and Practical Batched Linear Bandit Algorithm ICML 2025 Optimal Auction Design for Mixed Bidders AAAI 2025 Optimal Bounds for Dissatisfaction in Perpetual Voting AAAI 2025 Optimal Capacity Modification for Stable Matchings with Ties IJCAI 2025 Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound AAAI 2025 Optimal Complexity in Byzantine-Robust Distributed Stochastic Optimization with Data Heterogeneity JMLR 2025