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)

Efficient and robust algorithms for adversarial linear contextual bandits COLT 2020 Efficient and Robust High-Dimensional Linear Contextual Bandits IJCAI 2020 Efficient and Scalable Bayesian Neural Nets with Rank-1 Factors ICML 2020 Efficient Automatic CASH via Rising Bandits AAAI 2020 Efficient Clustering for Stretched Mixtures: Landscape and Optimality NeurIPS 2020 Efficient Derivative Computation for Cumulative B-Splines on Lie Groups CVPR 2020 Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning NeurIPS 2020 Efficient Distributed Hessian Free Algorithm for Large-scale Empirical Risk Minimization via Accumulating Sample Strategy AISTATS 2020 Efficient Estimation of Influence of a Training Instance EMNLP 2020 Efficient Exact Verification of Binarized Neural Networks NeurIPS 2020 Efficient Exploration of Reward Functions in Inverse Reinforcement Learning via Bayesian Optimization NeurIPS 2020 Efficient Heuristic Search for M-Modes Inference PGM 2020 Efficient improper learning for online logistic regression COLT 2020 Efficient Inference for Nonparametric Hawkes Processes Using Auxiliary Latent Variables JMLR 2020 Efficient Inference of Optimal Decision Trees AAAI 2020 Efficient Intervention Design for Causal Discovery with Latents ICML 2020 Efficient Learning of Discrete Graphical Models NeurIPS 2020 Efficient Learning of Generative Models via Finite-Difference Score Matching NeurIPS 2020 Efficiently Learning Adversarially Robust Halfspaces with Noise ICML 2020 Efficiently Solving MDPs with Stochastic Mirror Descent ICML 2020 Efficient Marginalization of Discrete and Structured Latent Variables via Sparsity NeurIPS 2020 Efficient MDI Adaptation for n-Gram Language Models Interspeech 2020 Efficient Minimum Word Error Rate Training of RNN-Transducer for End-to-End Speech Recognition Interspeech 2020 Efficient Neural Architecture Search via Proximal Iterations AAAI 2020 Efficient, Noise-Tolerant, and Private Learning via Boosting COLT 2020