23.6k citations
- Carnegie Mellon UniversityUS49 papers
- Google (United States)US37 papers
- California Institute of TechnologyUS33 papers
- Amazon (Germany)DE32 papers
- University of Illinois Urbana-ChampaignUS22 papers
- Microsoft (United States)US20 papers
- Stanford UniversityUS20 papers
- The University of Texas at AustinUS20 papers
- University of California, Los AngelesUS20 papers
- University of California, Santa BarbaraUS19 papers
- University of WashingtonUS19 papers
- Georgia Institute of TechnologyUS17 papers
7 papers · 2 filters
Hierarchical Indian Buffet Neural Networks for Bayesian Continual Learning
Samuel Kessler, Vu Nguyen, Stefan Zohren +1
We place an Indian Buffet process (IBP) prior over the structure of a Bayesian Neural Network (BNN), thus allowing the complexity of the BNN to increase and decrease automatically.…
Learning search spaces for Bayesian optimization: Another view of hyperparameter transfer learning
Valerio Perrone, Huibin Shen, Matthias Seeger +2
Bayesian optimization (BO) is a successful methodology to optimize black-box functions that are expensive to evaluate. While traditional methods optimize each black-box function in…
A Quantile-based Approach for Hyperparameter Transfer Learning
David Salinas, Huibin Shen, Valerio Perrone
Bayesian optimization (BO) is a popular methodology to tune the hyperparameters of expensive black-box functions. Traditionally, BO focuses on a single task at a time and is not de…
Deep Generative Quantile-Copula Models for Probabilistic Forecasting
Ruofeng Wen, Kari Torkkola
We introduce a new category of multivariate conditional generative models and demonstrate its performance and versatility in probabilistic time series forecasting and simulation. S…
Mix and Match: An Optimistic Tree-Search Approach for Learning Models from Mixture Distributions
Matthew Faw, Rajat Sen, Karthikeyan Shanmugam +2
We consider a covariate shift problem where one has access to several different training datasets for the same learning problem and a small validation set which possibly differs fr…
Learning Fair and Transferable Representations
Luca Oneto, Michele Donini, Andreas Maurer +1
Developing learning methods which do not discriminate subgroups in the population is a central goal of algorithmic fairness. One way to reach this goal is by modifying the data rep…