conftrace_
← Machine Learning
Machine Learning ›

Optimization & Theory

36,874 papers (3 classified directly here)

Subtopics

Optimization (14,983) Bayesian Inference (5,566) Learning Theory (5,334) Theory (4,955) Statistical Learning (4,117) Neural Network Optimization (3,649) Stochastic Processes (2,667) Loss Functions (1,162) Distributed Learning (1,135) Stochastic Methods (1,118) Online Algorithms (806) Statistics (684) Information Theory (318) Generalization (220) Sparse Optimization (158) Sample Complexity (99) Game Theory (30) Robust Optimization (17) Optimal Transport (14) Approximation Algorithms (10) Distributed Optimization (8) Convex Optimization (8)

Papers per year

1
52
337
806
3400
3289
'00
'05
'10
'15
'20
'25

Papers (including subtopics)

Collaborative Clustering: Sample Complexity and Efficient Algorithms ALT 2017
Parameter identification in Markov chain choice models ALT 2017
The Complexity of Explaining Neural Networks Through (group) Invariants ALT 2017
An efficient query learning algorithm for zero-suppressed binary decision diagrams ALT 2017
Soft-Bayes: Prod for Mixtures of Experts with Log-Loss ALT 2017
Hypotheses testing on infinite random graphs ALT 2017
Learning MSO-definable hypotheses on strings ALT 2017
The Power of Random Counterexamples ALT 2017
A Strongly Quasiconvex PAC-Bayesian Bound ALT 2017
Efficient tracking of a growing number of experts ALT 2017
Tight Bounds on $\ell_1$ Approximation and Learning of Self-Bounding Functions ALT 2017
Structured Best Arm Identification with Fixed Confidence ALT 2017
Dealing with Range Anxiety in Mean Estimation via Statistical Queries ALT 2017
Learning from Networked Examples ALT 2017
PAC Learning Depth-3 $\textrm{AC}^0$ Circuits of Bounded Top Fanin ALT 2017
A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds ALT 2017
Open Problem: First-Order Regret Bounds for Contextual Bandits COLT 2017
Open Problem: Meeting Times for Learning Random Automata COLT 2017
Corralling a Band of Bandit Algorithms COLT 2017
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons COLT 2017
Homotopy Analysis for Tensor PCA COLT 2017
Efficient PAC Learning from the Crowd COLT 2017
Computationally Efficient Robust Sparse Estimation in High Dimensions COLT 2017
Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems COLT 2017
The Sample Complexity of Optimizing a Convex Function COLT 2017