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)

Robust Model Reasoning and Fitting via Dual Sparsity Pursuit NeurIPS 2023 Robust Quickest Change Detection for Unnormalized Models UAI 2023 Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing NeurIPS 2023 Robust Sequence Networked Submodular Maximization AAAI 2023 Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows AAAI 2023 Rule Induction in Knowledge Graphs Using Linear Programming AAAI 2023 Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise IJCAI 2023 Runtime Analysis for the NSGA-II: Provable Speed-Ups from Crossover AAAI 2023 Saddle-to-Saddle Dynamics in Diagonal Linear Networks NeurIPS 2023 Safeguarded Learned Convex Optimization AAAI 2023 Safe Interval Path Planning with Kinodynamic Constraints AAAI 2023 Safety Verification of Nonlinear Systems with Bayesian Neural Network Controllers AAAI 2023 Sample Complexity Bound for Evaluating the Robust Observer’s Performance under Coprime Factors Uncertainty L4DC 2023 Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms NeurIPS 2023 Sampling-based Nyström Approximation and Kernel Quadrature ICML 2023 Sampling Ex-Post Group-Fair Rankings IJCAI 2023 Sampling From a Schrödinger Bridge AISTATS 2023 Sampling random graph homomorphisms and applications to network data analysis JMLR 2023 SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract) IJCAI 2023 SCADE: NeRFs from Space Carving With Ambiguity-Aware Depth Estimates CVPR 2023 Scalable and Globally Optimal Generalized L₁ K-center Clustering via Constraint Generation in Mixed Integer Linear Programming AAAI 2023 Scalable and robust tensor ring decomposition for large-scale data UAI 2023 Scalable Bayesian Optimization Using Vecchia Approximations of Gaussian Processes AISTATS 2023 Scalable Bicriteria Algorithms for Non-Monotone Submodular Cover AISTATS 2023 Scalable Decision-Focused Learning in Restless Multi-Armed Bandits with Application to Maternal and Child Health AAAI 2023