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)

Householder Sketch for Accurate and Accelerated Least-Mean-Squares Solvers ICML 2021 How Data Augmentation affects Optimization for Linear Regression NeurIPS 2021 Hybrid-order Stochastic Block Model AAAI 2021 Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits NeurIPS 2021 Hybrid Rotation Averaging: A Fast and Robust Rotation Averaging Approach CVPR 2021 Hyperparameter Optimization via Sequential Uniform Designs JMLR 2021 IA-GM: A Deep Bidirectional Learning Method for Graph Matching AAAI 2021 Identification of Matrix Joint Block Diagonalization AISTATS 2021 Identification of the Generalized Condorcet Winner in Multi-dueling Bandits NeurIPS 2021 Identifying Norms from Observation Using MCMC Sampling IJCAI 2021 If You Like Shapley Then You’ll Love the Core AAAI 2021 IGSSTRCF: Importance Guided Sparse Spatio-Temporal Regularized Correlation Filters for Tracking WACV 2021 Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path NeurIPS 2021 Implicit Langevin Algorithms for Sampling From Log-concave Densities JMLR 2021 Implicit Regularization in Matrix Sensing via Mirror Descent NeurIPS 2021 Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications COLT 2021 Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming IJCAI 2021 Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach IJCAI 2021 Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions L4DC 2021 Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions COLT 2021 Improved Complexity Bounds in Wasserstein Barycenter Problem AISTATS 2021 Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces NeurIPS 2021 Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP IJCAI 2021 Improved Guarantees and a Multiple-descent Curve for Column Subset Selection and the Nystrom Method (Extended Abstract) IJCAI 2021 Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes NeurIPS 2021