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)

Fixed-Parameter and Approximation Algorithms for PCA with Outliers ICML 2021 Flow-based Attribution in Graphical Models: A Recursive Shapley Approach ICML 2021 Follow-the-Regularized-Leader Routes to Chaos in Routing Games ICML 2021 Fork or Fail: Cycle-Consistent Training with Many-to-One Mappings AISTATS 2021 Forming Better Stable Solutions in Group Formation Games Inspired by Internet Exchange Points (IXPs) AAAI 2021 Fractional Matchings under Preferences: Stability and Optimality IJCAI 2021 Frank-Wolfe with a Nearest Extreme Point Oracle COLT 2021 From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021 From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits NeurIPS 2021 From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization ICML 2021 Fully-Connected Tensor Network Decomposition and Its Application to Higher-Order Tensor Completion AAAI 2021 Fully Gap-Dependent Bounds for Multinomial Logit Bandit AISTATS 2021 Game of Gradients: Mitigating Irrelevant Clients in Federated Learning AAAI 2021 Game-theoretic Analysis of Effort Allocation of Contributors to Public Projects IJCAI 2021 Gaming Helps! Learning from Strategic Interactions in Natural Dynamics AISTATS 2021 GBHT: Gradient Boosting Histogram Transform for Density Estimation ICML 2021 Generalization Bounds for Stochastic Saddle Point Problems AISTATS 2021 Generalization of Quasi-Newton Methods: Application to Robust Symmetric Multisecant Updates AISTATS 2021 Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances AAAI 2021 Generalized Comprehensive Motion Theory for High-Order Differential Dynamics RSS 2021 Generalized Kings and Single-Elimination Winners in Random Tournaments IJCAI 2021 Generalized Linear Bandits with Local Differential Privacy NeurIPS 2021 Generalized parametric path problems UAI 2021 Generalized Shuffled Linear Regression ICCV 2021 Generalized Spectral Clustering via Gromov-Wasserstein Learning AISTATS 2021