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)

Tight and fast generalization error bound of graph embedding in metric space ICML 2023 Tight Bounds for Volumetric Spanners and Applications NeurIPS 2023 Tight Bounds on the Hardness of Learning Simple Nonparametric Mixtures COLT 2023 Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations ICML 2023 Tight Data Access Bounds for Private Top-k Selection ICML 2023 Tighter Analysis for ProxSkip ICML 2023 Tighter Bounds on the Expressivity of Transformer Encoders ICML 2023 Tighter Information-Theoretic Generalization Bounds from Supersamples ICML 2023 Tighter Lower Bounds for Shuffling SGD: Random Permutations and Beyond ICML 2023 Tighter PAC-Bayes Bounds Through Coin-Betting COLT 2023 Tighter PAC-Bayes Generalisation Bounds by Leveraging Example Difficulty AISTATS 2023 Tighter Robust Upper Bounds for Options via No-Regret Learning AAAI 2023 Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient COLT 2023 Tight Performance Guarantees of Imitator Policies with Continuous Actions AAAI 2023 Tight Regret and Complexity Bounds for Thompson Sampling via Langevin Monte Carlo AISTATS 2023 Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits ICML 2023 Tight Risk Bounds for Gradient Descent on Separable Data NeurIPS 2023 TIJO: Trigger Inversion with Joint Optimization for Defending Multimodal Backdoored Models ICCV 2023 Tilted Sparse Additive Models ICML 2023 Time Dependent Inverse Optimal Control using Trigonometric Basis Functions L4DC 2023 Time-Independent Information-Theoretic Generalization Bounds for SGLD NeurIPS 2023 Time Optimal Ergodic Search RSS 2023 Time-Reversed Dissipation Induces Duality Between Minimizing Gradient Norm and Function Value NeurIPS 2023 Time-uniform confidence bands for the CDF under nonstationarity NeurIPS 2023 TIPI: Test Time Adaptation With Transformation Invariance CVPR 2023