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)

A Dynamic Relational Infinite Feature Model for Longitudinal Social Networks AISTATS 2011
Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees AISTATS 2011
Evolving Cluster Mixed-Membership Blockmodel for Time-Evolving Networks AISTATS 2011
Optimal Distributed Market-Based Planning for Multi-Agent Systems with Shared Resources AISTATS 2011
Fast $b$-matching via Sufficient Selection Belief Propagation AISTATS 2011
Improved Loss Bounds For Multiple Kernel Learning AISTATS 2011
On Learning Discrete Graphical Models using Group-Sparse Regularization AISTATS 2011
Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011
Convex envelopes of complexity controlling penalties: the case against premature envelopment AISTATS 2011
On Time Varying Undirected Graphs AISTATS 2011
Approximate inference for the loss-calibrated Bayesian AISTATS 2011
Robust Bayesian Matrix Factorisation AISTATS 2011
Bayesian Hierarchical Cross-Clustering AISTATS 2011
A Fast Algorithm for Recovery of Jointly Sparse Vectors based on the Alternating Direction Methods AISTATS 2011
Learning mixtures of Gaussians with maximum-a-posteriori oracle AISTATS 2011
Estimating beta-mixing coefficients AISTATS 2011
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization AISTATS 2011
Maximum Volume Clustering AISTATS 2011
Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011
Faithfulness in Chain Graphs: The Gaussian Case AISTATS 2011
Directional Statistics on Permutations AISTATS 2011
On the Estimation of $\alpha$-Divergences AISTATS 2011
On NDCG Consistency of Listwise Ranking Methods AISTATS 2011
A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning AISTATS 2011
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback AISTATS 2011