AISTATS 2016

181 papers

Top Research Directions

Research directions most represented by AISTATS 2016 papers.

Scaling Gaussian Processes Beyond Cubic Complexity 11
Learning Densities with Intractable Normalizing Constants 7
Overcoming the Cubic Complexity of Kernel Methods 7
Tensor Decomposition for Latent Parameter Recovery 4
Marginal Dependency Decoupling via Copula Functions 4
Scaling Kernel Methods with Random Fourier Features 4
Inducing Point Approximations for Scalable Gaussian Processes 4
Overcoming the Convexity Constraint in Modern Optimization 4
High-Dimensional Bayesian Optimization 4
Kernel Mean Embeddings for Distribution Matching 3
Scaling Submodular Optimization to Massive Datasets 3
Correcting Shrinkage Bias in High Dimensional Estimation 3
Convergence of Message Passing on Loopy Graphs 3
Beyond Gaussian Approximations in Variational Inference 3
Noise Robust Sparse Recovery 3

Top Authors

AuthorPapers
Eric P. Xing5
Andreas Krause4
Andrew Gordon Wilson4
Adrian Weller3
Ameet Talwalkar3
Barnabas Poczos3
David Carlson3
Jeff Schneider3
Philipp Hennig3
Quanquan Gu3
Volkan Cevher3
Alex Smola2
Ambuj Tewari2
Anastasios Kyrillidis2
Boaz Nadler2
Chunyuan Li2
Dale Schuurmans2
Daniel Sheldon2
David Sontag2
François Laviolette2

Impactful Papers

Papers from AISTATS 2016 that shaped research clusters.

Foundational

Influential

Papers

Title
Non-stochastic Best Arm Identification and Hyperparameter Optimization.
No Regret Bound for Extreme Bandits
NuC-MKL: A Convex Approach to Non Linear Multiple Kernel Learning
NYTRO: When Subsampling Meets Early Stopping
On Convergence of Model Parallel Proximal Gradient Algorithm for Stale Synchronous Parallel System
One Scan 1-Bit Compressed Sensing
Online and Distributed Bayesian Moment Matching for Parameter Learning in Sum-Product Networks
Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees
Online Learning to Rank with Feedback at the Top
Online Learning to Rank with Feedback at the Top.
Online Learning with Noisy Side Observations
Online Relative Entropy Policy Search using Reproducing Kernel Hilbert Space Embeddings
On Lloyd's Algorithm: New Theoretical Insights for Clustering in Practice
On Searching for Generalized Instrumental Variables
On Sparse Variational Methods and the Kullback-Leibler Divergence between Stochastic Processes
On the Reducibility of Submodular Functions
On the Use of Non-Stationary Strategies for Solving Two-Player Zero-Sum Markov Games
Optimal Statistical and Computational Rates for One Bit Matrix Completion
Optimization as Estimation with Gaussian Processes in Bandit Settings
Ordered Weighted L1 Regularized Regression with Strongly Correlated Covariates: Theoretical Aspects
PAC-Bayesian Bounds based on the Rényi Divergence
Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization
Parallel Markov Chain Monte Carlo via Spectral Clustering
Pareto Front Identification from Stochastic Bandit Feedback
Precision Matrix Estimation in High Dimensional Gaussian Graphical Models with Faster Rates
Private Causal Inference
Probabilistic Approximate Least-Squares
Probabilistic Approximate Least-Squares.
Probability Inequalities for Kernel Embeddings in Sampling without Replacement
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, AISTATS 2016, Cadiz, Spain, May 9-11, 2016
Provable Bayesian Inference via Particle Mirror Descent
Provable Tensor Methods for Learning Mixtures of Generalized Linear Models
Pseudo-Marginal Slice Sampling
Quantization based Fast Inner Product Search
Random Forest for the Contextual Bandit Problem
Randomization and The Pernicious Effects of Limited Budgets on Auction Experiments
Relationship between PreTraining and Maximum Likelihood Estimation in Deep Boltzmann Machines
Revealing Graph Bandits for Maximizing Local Influence
Rivalry of Two Families of Algorithms for Memory-Restricted Streaming PCA
Robust Covariate Shift Regression
Robust Covariate Shift Regression.
Scalable and Sound Low-Rank Tensor Learning
Scalable Exemplar Clustering and Facility Location via Augmented Block Coordinate Descent with Column Generation.
Scalable Gaussian Process Classification via Expectation Propagation
Scalable Gaussian Processes for Characterizing Multidimensional Change Surfaces
Scalable Gaussian Processes for Characterizing Multidimensional Change Surfaces.
Scalable geometric density estimation
Scalable MCMC for Mixed Membership Stochastic Blockmodels
Scaling Submodular Maximization via Pruned Submodularity Graphs
Score Permutation Based Finite Sample Inference for Generalized AutoRegressive Conditional Heteroskedasticity (GARCH) Models

« prev Page 3/4 next »