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)

Receptive Field Size Optimization With Continuous Time Pooling WACV 2021 ReconfigISP: Reconfigurable Camera Image Processing Pipeline ICCV 2021 Reconsidering the Past: Optimizing Hidden States in Language Models EMNLP 2021 Reconstructing weighted voting schemes from partial information about their power indices COLT 2021 Recovering AES Keys with a Deep Cold Boot Attack ICML 2021 Recovering Trajectories of Unmarked Joints in 3D Human Actions Using Latent Space Optimization WACV 2021 Recovery Analysis for Plug-and-Play Priors using the Restricted Eigenvalue Condition NeurIPS 2021 Recovery Guarantees for Kernel-based Clustering under Non-parametric Mixture Models AISTATS 2021 Rectification-Based Knowledge Retention for Continual Learning CVPR 2021 ReCU: Reviving the Dead Weights in Binary Neural Networks ICCV 2021 Recursive Bayesian Networks: Generalising and Unifying Probabilistic Context-Free Grammars and Dynamic Bayesian Networks NeurIPS 2021 Recursive prosody is not finite-state ACL 2021 Redesigning the Transformer Architecture with Insights from Multi-particle Dynamical Systems NeurIPS 2021 Reducing Exposure Bias in Training Recurrent Neural Network Transducers Interspeech 2021 Reducing Neural Network Parameter Initialization Into an SMT Problem (Student Abstract) AAAI 2021 Reducing SAT to Max2SAT IJCAI 2021 Reducing Streaming ASR Model Delay with Self Alignment Interspeech 2021 Refined approachability algorithms and application to regret minimization with global costs JMLR 2021 Refined Learning Bounds for Kernel and Approximate k-Means NeurIPS 2021 Refining Deep Generative Models via Discriminator Gradient Flow ICLR 2021 Regression Discontinuity Design under Self-selection AISTATS 2021 Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints ICML 2021 Regret Bounds for Adaptive Nonlinear Control L4DC 2021 Regret Bounds for Batched Bandits AAAI 2021 Regret Bounds for Gaussian-Process Optimization in Large Domains NeurIPS 2021