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)

ROOT-SGD: Sharp Nonasymptotics and Asymptotic Efficiency in a Single Algorithm COLT 2022 RORL: Robust Offline Reinforcement Learning via Conservative Smoothing NeurIPS 2022 ROSE: Robust Selective Fine-tuning for Pre-trained Language Models EMNLP 2022 R&R: Metric-guided Adversarial Sentence Generation AACL 2022 R-TeaFor: Regularized Teacher-Forcing for Abstractive Summarization EMNLP 2022 Safe Active Learning for Multi-Output Gaussian Processes AISTATS 2022 Safe Control Under Input Limits with Neural Control Barrier Functions CoRL 2022 Safe Control with Minimal Regret L4DC 2022 Safe Control with Neural Network Dynamic Models L4DC 2022 Safe Exploration for Efficient Policy Evaluation and Comparison ICML 2022 Safe Online Convex Optimization with Unknown Linear Safety Constraints AAAI 2022 Safe Optimal Design with Applications in Off-Policy Learning AISTATS 2022 Safe Robot Learning in Assistive Devices through Neural Network Repair CoRL 2022 Safe Subgame Resolving for Extensive Form Correlated Equilibrium AAAI 2022 Safety aware changepoint detection for piecewise i.i.d. bandits UAI 2022 Safety Guarantees for Neural Network Dynamic Systems via Stochastic Barrier Functions NeurIPS 2022 SAGDA: Achieving O(ε^-2) Communication Complexity in Federated Min-Max Learning NeurIPS 2022 Sample and Communication-Efficient Decentralized Actor-Critic Algorithms with Finite-Time Analysis ICML 2022 Sample Average Approximation for Stochastic Optimization with Dependent Data: Performance Guarantees and Tractability AAAI 2022 Sample Complexity Bounds for Robustly Learning Decision Lists against Evasion Attacks IJCAI 2022 Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search NeurIPS 2022 Sample Complexity of Policy-Based Methods under Off-Policy Sampling and Linear Function Approximation AISTATS 2022 Sample Complexity of Robust Reinforcement Learning with a Generative Model AISTATS 2022 Sample Complexity of the Robust LQG Regulator with Coprime Factors Uncertainty L4DC 2022 Sample Efficiency Matters: A Benchmark for Practical Molecular Optimization NeurIPS 2022