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)

On the Asymptotic Normality of an Estimate of a Regression Functional JMLR 2015 On the Complexity of Bandit Linear Optimization COLT 2015 On the Complexity of Learning with Kernels COLT 2015 On the consistency theory of high dimensional variable screening NeurIPS 2015 On the Convergence of Stochastic Gradient MCMC Algorithms with High-Order Integrators NeurIPS 2015 On the Equivalence of Moving Entrance Pupil and Radial Distortion for Camera Calibration ICCV 2015 On the Global Linear Convergence of Frank-Wolfe Optimization Variants NeurIPS 2015 On the High Dimensional Power of a Linear-Time Two Sample Test under Mean-shift Alternatives AISTATS 2015 On the Inductive Bias of Dropout JMLR 2015 On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank-One Perturbations of Gaussian Tensors NeurIPS 2015 On the Optimality of Classifier Chain for Multi-label Classification NeurIPS 2015 On the Optimality of Multi-Label Classification under Subset Zero-One Loss for Distributions Satisfying the Composition Property ICML 2015 On Theoretical Properties of Sum-Product Networks AISTATS 2015 On the Pseudo-Dimension of Nearly Optimal Auctions NeurIPS 2015 On the Rate of Convergence and Error Bounds for LSTD(λ) ICML 2015 On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NeurIPS 2015 On Variance Reduction in Stochastic Gradient Descent and its Asynchronous Variants NeurIPS 2015 Open Problem: Learning Quantum Circuits with Queries COLT 2015 Open Problem: Online Sabotaged Shortest Path COLT 2015 Open Problem: Recursive Teaching Dimension Versus VC Dimension COLT 2015 Open Problem: Restricted Eigenvalue Condition for Heavy Tailed Designs COLT 2015 Open Problem: The landscape of the loss surfaces of multilayer networks COLT 2015 Open Problem: The Oracle Complexity of Smooth Convex Optimization in Nonstandard Settings COLT 2015 Optimal and Adaptive Algorithms for Online Boosting ICML 2015 Optimal Bayesian Estimation in Random Covariate Design with a Rescaled Gaussian Process Prior JMLR 2015