Optimization & Theory
43,292 papers (3 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Optimization (17,731)
Learning Theory (6,809)
Bayesian Inference (6,267)
Theory (5,579)
Statistical Learning (4,564)
Neural Network Optimization (4,155)
Stochastic Processes (2,948)
Stochastic Methods (1,283)
Loss Functions (1,220)
Distributed Learning (1,202)
Online Algorithms (1,013)
Statistics (822)
Generalization (376)
Information Theory (370)
Sample Complexity (282)
Sparse Optimization (241)
Game Theory (151)
Convex Optimization (132)
Optimal Transport (104)
Robust Optimization (84)
Distributed Optimization (73)
Approximation Algorithms (33)
Papers per year
1
14
29
44
31
52
189
195
212
235
352
382
457
787
816
828
1,066
1,391
1,913
3,012
3,646
4,303
4,450
5,357
6,155
5,854
1,521
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming
ICML 2023
Efficient Learning of Minimax Risk Classifiers in High Dimensions
UAI 2023
Efficient List-Decodable Regression using Batches
ICML 2023
Efficient Loss Function by Minimizing the Detrimental Effect of Floating-Point Errors on Gradient-Based Attacks
CVPR 2023
Efficient Low-rank Backpropagation for Vision Transformer Adaptation
NeurIPS 2023
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games
ICLR 2023
Efficiently Controlling Multiple Risks with Pareto Testing
ICLR 2023
Efficiently learning the graph for semi-supervised learning
UAI 2023
Efficient median of means estimator
COLT 2023
Efficient Model Updates for Approximate Unlearning of Graph-Structured Data
ICLR 2023
Efficient Non-parametric Neural Density Estimation and Its Application to Outlier and Anomaly Detection
AAAI 2023
Efficient On-Device Training via Gradient Filtering
CVPR 2023
Efficient Online Clustering with Moving Costs
NeurIPS 2023
Efficient Potential-based Exploration in Reinforcement Learning using Inverse Dynamic Bisimulation Metric
NeurIPS 2023
Efficient preconditioned stochastic gradient descent for estimation in latent variable models
ICML 2023
Efficient Privacy-Preserving Stochastic Nonconvex Optimization
UAI 2023
Efficient Quantum Algorithms for Quantum Optimal Control
ICML 2023
Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation
ICML 2023
Efficient RL with Impaired Observability: Learning to Act with Delayed and Missing State Observations
NeurIPS 2023
Efficient Robust Bayesian Optimization for Arbitrary Uncertain inputs
NeurIPS 2023
Efficient Structure-preserving Support Tensor Train Machine
JMLR 2023
Efficient Testable Learning of Halfspaces with Adversarial Label Noise
NeurIPS 2023
Efficient Top-K Feature Selection Using Coordinate Descent Method
AAAI 2023
EfficientTrain: Exploring Generalized Curriculum Learning for Training Visual Backbones
ICCV 2023
Efficient Training of Energy-Based Models Using Jarzynski Equality
NeurIPS 2023