AISTATS

5,608 papers4,963 directions

Papers by Year

2026 538
2025 626
2024 567
2023 481
2022 487
2021 453
2020 421
2019 375
2018 224
2017 179
2016 181
2015 131
2014 123
2013 73
2012 161
2011 112
2010 130
2009 87
2007 87
2005 58
2003 45
2001 47
1999 45
1997 59
1996 1
1995 42

Top Research Directions

Research directions most represented by papers from this venue.

Scaling Gaussian Processes Beyond Cubic Complexity 137
Kernel Hyperparameter Sensitivity in Distributional Metrics 72
Learning Densities with Intractable Normalizing Constants 64
Overcoming the Cubic Complexity of Kernel Methods 60
Mitigating the Curse of Dimensionality in Density Estimation 55
Non-linear Causal Discovery via Functional Constraints 51
Basins of Attraction in Nonconvex Optimization 50
Inducing Point Approximations for Scalable Gaussian Processes 46
The Non-Linear Function Approximation Gap in Reinforcement Learning 44
Multi-Agent Learning Under Bandit Feedback 42
Scaling Kernel Methods with Random Fourier Features 41
Overcoming Local Mode Entrapment in Multimodal Sampling 40
Scaling Bayesian Sampling via Stochastic Gradient MCMC 40
Causal Inference with Unobserved Confounding 39
Breaking Observational Equivalence in Causal Discovery 35

Top Authors

AuthorPapers
Michael Jordan43
Andreas Krause34
Mihaela van der Schaar31
Francis Bach29
Csaba Szepesvari27
Masashi Sugiyama25
Yoshua Bengio24
Bernhard Schölkopf23
Eric P. Xing23
Samuel Kaski23
Ambuj Tewari22
Quanquan Gu22
Aarti Singh21
Barnabas Poczos21
David Blei21
Padhraic Smyth20
Arthur Gretton19
Jennifer Dy19
Max Welling19
Philipp Hennig19

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Error Analysis of Laplacian Eigenmaps for Semi-supervised Learning2011
Estimating beta-mixing coefficients2011
Estimating Probabilities in Recommendation Systems2011
Evolving Cluster Mixed-Membership Blockmodel for Time-Evolving Networks2011
Faithfulness in Chain Graphs: The Gaussian Case2011
Fast b-matching via Sufficient Selection Belief Propagation2011
Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference2011
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization2011
Generalization Bound for Infinitely Divisible Empirical Process2011
Generative Kernels for Exponential Families2011
Generative Modeling for Maximizing Precision and Recall in Information Visualization2011
Group Orthogonal Matching Pursuit for Logistic Regression2011
Hidden-Unit Conditional Random Fields2011
Hierarchical Probabilistic Models for Group Anomaly Detection2011
Improved Loss Bounds For Multiple Kernel Learning2011
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback2011
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback.2011
Information Theoretical Clustering via Semidefinite Programming2011
Kernel Belief Propagation2011
Learning Class-relevant Features and Class-irrelevant Features via a Hybrid third-order RBM2011
Learning equivalence classes of acyclic models with latent and selection variables from multiple datasets with overlapping variables2011
Learning from positive and unlabeled examples by enforcing statistical significance2011
Learning mixtures of Gaussians with maximum-a-posteriori oracle2011
Learning Scale Free Networks by Reweighted $\ell_1$ regularization2011
Learning Scale Free Networks by Reweighted L1 regularization.2011
Lightweight Implementations of Probabilistic Programming Languages Via Transformational Compilation2011
Linear-Time Estimators for Propensity Scores2011
Machine Learning Markets2011
Maximum Volume Clustering2011
Mixed Cumulative Distribution Networks2011
Multicore Gibbs Sampling in Dense, Unstructured Graphs2011
Multi-Label Output Codes using Canonical Correlation Analysis2011
Multiscale Community Blockmodel for Network Exploration2011
On Learning Discrete Graphical Models using Group-Sparse Regularization2011
Online Inference for the Infinite Topic-Cluster Model: Storylines from Streaming Text2011
Online Learning of Multiple Tasks and Their Relationships2011
Online Variational Inference for the Hierarchical Dirichlet Process2011
On NDCG Consistency of Listwise Ranking Methods2011
On the Estimation of alpha-Divergences2011
On Time Varying Undirected Graphs2011
Optimal and Robust Price Experimentation: Learning by Lottery2011
Optimal Distributed Market-Based Planning for Multi-Agent Systems with Shared Resources2011
Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees2011
Polytope samplers for inference in ill-posed inverse problems2011
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2011, Fort Lauderdale, USA, April 11-13, 20112011
Relational Learning with One Network: An Asymptotic Analysis2011
Relative Entropy Inverse Reinforcement Learning2011
Revisiting MAP Estimation, Message Passing and Perfect Graphs2011
Revisiting MAP Estimation, Message Passing and Perfect Graphs.2011
Robust Bayesian Matrix Factorisation2011

« prev Page 100/113 next »