Skip to content
conftrace_

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
52
352
828
3,646
5,854
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Federated Learning Based on Dynamic Regularization ICLR 2021 Federated Learning under Arbitrary Communication Patterns ICML 2021 Federated Learning with Fair Averaging IJCAI 2021 Federated Learning with Sparsification-Amplified Privacy and Adaptive Optimization IJCAI 2021 Federated Multi-Armed Bandits AAAI 2021 Federated stochastic gradient Langevin dynamics UAI 2021 Feedback Coding for Active Learning AISTATS 2021 Fenchel-Young Losses with Skewed Entropies for Class-posterior Probability Estimation AISTATS 2021 Few-Shot Bayesian Optimization with Deep Kernel Surrogates ICLR 2021 Few-Shot Learning via Feature Hallucination With Variational Inference WACV 2021 Few-Shot Learning via Learning the Representation, Provably ICLR 2021 Few-Shot Neural Architecture Search ICML 2021 FILTRA: Rethinking Steerable CNN by Filter Transform ICML 2021 Finding Concept-specific Biases in Form–Meaning Associations NAACL 2021 Finding Diverse Trees, Paths, and More AAAI 2021 Finding k in Latent $k-$ polytope ICML 2021 Finding Relevant Information via a Discrete Fourier Expansion ICML 2021 Finding the Hardest Formulas for Resolution (Extended Abstract) IJCAI 2021 Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case ICML 2021 Fine-Grained Gap-Dependent Bounds for Tabular MDPs via Adaptive Multi-Step Bootstrap COLT 2021 Fine-grained Generalization Analysis of Inductive Matrix Completion NeurIPS 2021 Fine-grained Generalization Analysis of Structured Output Prediction IJCAI 2021 Fine-grained Generalization Analysis of Vector-Valued Learning AAAI 2021 Finite Sample Analysis of Average-Reward TD Learning and Q-Learning NeurIPS 2021 Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regime JMLR 2021