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)

Exploiting Spatial Relation for Reducing Distortion in Style Transfer WACV 2021 Exploration and Estimation for Model Compression ICCV 2021 Exploration and Exploitation: Two Ways to Improve Chinese Spelling Correction Models ACL 2021 Exploration-Exploitation in Multi-Agent Learning: Catastrophe Theory Meets Game Theory AAAI 2021 Exploring Discourse Structures for Argument Impact Classification ACL 2021 Exploring Distantly-Labeled Rationales in Neural Network Models ACL 2021 Exploring the loss landscape in neural architecture search UAI 2021 Exploring the Uncertainty Properties of Neural Networks’ Implicit Priors in the Infinite-Width Limit ICLR 2021 Exploring the Vulnerability of Deep Neural Networks: A Study of Parameter Corruption AAAI 2021 Exploring Transitivity in Neural NLI Models through Veridicality EACL 2021 Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning NeurIPS 2021 Exponential Convergence Rates of Classification Errors on Learning with SGD and Random Features AISTATS 2021 Exponential Graph is Provably Efficient for Decentralized Deep Training NeurIPS 2021 Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL ICML 2021 Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions ALT 2021 Exponentially Many Local Minima in Quantum Neural Networks ICML 2021 Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics ICML 2021 Exponential savings in agnostic active learning through abstention COLT 2021 Exponential Separation between Two Learning Models and Adversarial Robustness NeurIPS 2021 Exponential Weights Algorithms for Selective Learning COLT 2021 Exposing Cyber-Physical System Weaknesses by Implicitly Learning their Underlying Models ACML 2021 Expressive 1-Lipschitz Neural Networks for Robust Multiple Graph Learning against Adversarial Attacks ICML 2021 Expressive Power of Invariant and Equivariant Graph Neural Networks ICLR 2021 Extending the Fullband E-Model Towards Background Noise, Bursty Packet Loss, and Conversational Degradations Interspeech 2021 Extracting Strong Policies for Robotics Tasks from Zero-Order Trajectory Optimizers ICLR 2021