paper-with-me

Papers

Bayesian Few-Shot Classification with One-vs-Each Pólya-Gamma Augmented Gaussian Processes

2020-07-20 · ICLR 2021 1 · Jake Snell, Richard Zemel

Few-shot classification (FSC), the task of adapting a classifier to unseen classes given a small labeled dataset, is an important step on the path toward human-like machine learning. Bayesian methods are well-suited to tackling the fundamental issue of overfitting in the few-shot scenario because they allow practitioners to specify prior beliefs and update those beliefs in light of observed data. Contemporary approaches to Bayesian few-shot classification maintain a posterior distribution over model parameters, which is slow and requires storage that scales with model size. Instead, we propose a Gaussian process classifier based on a novel combination of P\'olya-Gamma augmentation and the one-vs-each softmax approximation that allows us to efficiently marginalize over functions rather than model parameters. We demonstrate improved accuracy and uncertainty quantification on both standard few-shot classification benchmarks and few-shot domain transfer tasks.

📄 PDF Abstract BibTeX arXiv:2007.10417

Code (2)

jakesnell/ove-polya-gamma-gp 공식 구현 pytorch
zoj613/polya-gamma

Tasks

ClassificationGaussian ProcessesGeneral ClassificationUncertainty Quantification

Methods 이 논문이 사용한 방법론

Polya-Gamma Augmentation This method applies Polya-Gamma latent variables as a way to obtain closed form expressions for full-conditionals of posterior distributions in sampling algorithms like MCMC.
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Similar Papers 제목 키워드 기반

Pólygamma Data Augmentation to address Non-conjugacy in the Bayesian Estimation of Mixed Multinomial Logit Models

2019-04-13 · Prateek Bansal, Rico Krueger, Michel Bierlaire, Ricardo A. Daziano 외

The standard Gibbs sampler of Mixed Multinomial Logit (MMNL) models involves sampling from conditional densities of utility parameters using Metropolis-Hastings (MH) algorithm due to unavailability of conjugate prior for…

Data Augmentation

Unsupervised Classification for Polarimetric SAR Data Using Variational Bayesian Wishart Mixture Model with Inverse Gamma-Gamma Prior

2021-04-04 · Shijie Ren, Feng Zhou, Changlong Wang

Although various clustering methods have been successfully applied to polarimetric synthetic aperture radar (PolSAR) image clustering tasks, most of the available approaches fail to realize automatic determination of clu…

ClusteringImage Clustering

PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits

2018-05-18 · NeurIPS 2018 12 · Bianca Dumitrascu, Karen Feng, Barbara E. Engelhardt

We address the problem of regret minimization in logistic contextual bandits, where a learner decides among sequential actions or arms given their respective contexts to maximize binary rewards. Using a fast inference pr…

Multi-Armed BanditsThompson Sampling

Asymptotic properties of Bayesian inference in linear regression with a structural break

2022-01-18 · Kenichi Shimizu

This paper studies large sample properties of a Bayesian approach to inference about slope parameters $\gamma$ in linear regression models with a structural break. In contrast to the conventional approach to inference ab…

Bayesian Inferenceregression

For Manifold Learning, Deep Neural Networks can be Locality Sensitive Hash Functions

2021-03-11 · Nishanth Dikkala, Gal Kaplun, Rina Panigrahy

It is well established that training deep neural networks gives useful representations that capture essential features of the inputs. However, these representations are poorly understood in theory and practice. In the co…

One-Shot Learning