paper-with-me

Papers

Predictive Complexity Priors

2020-06-18 · Eric Nalisnick, Jonathan Gordon, José Miguel Hernández-Lobato

Specifying a Bayesian prior is notoriously difficult for complex models such as neural networks. Reasoning about parameters is made challenging by the high-dimensionality and over-parameterization of the space. Priors that seem benign and uninformative can have unintuitive and detrimental effects on a model's predictions. For this reason, we propose predictive complexity priors: a functional prior that is defined by comparing the model's predictions to those of a reference model. Although originally defined on the model outputs, we transfer the prior to the model parameters via a change of variables. The traditional Bayesian workflow can then proceed as usual. We apply our predictive complexity prior to high-dimensional regression, reasoning over neural network depth, and sharing of statistical strength for few-shot learning.

📄 PDF Abstract BibTeX arXiv:2006.10801

Code (0)

등록된 구현이 없습니다.

Tasks

Few-Shot Learning

Similar Papers 제목 키워드 기반

AutoElicit: Using Large Language Models for Expert Prior Elicitation in Predictive Modelling

2024-11-26 · Alexander Capstick, Rahul G. Krishnan, Payam Barnaghi

Large language models (LLMs) acquire a breadth of information across various domains. However, their computational complexity, cost, and lack of transparency often hinder their direct application for predictive tasks whe…

Bayesian InferenceIn-Context LearningModel Selection

Loss Bounds and Time Complexity for Speed Priors

2016-04-12 · Daniel Filan, Marcus Hutter, Jan Leike

This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that a…

Expectation Propagation for Neural Networks with Sparsity-promoting Priors

2013-03-27 · Pasi Jylänki, Aapo Nummenmaa, Aki Vehtari

We propose a novel approach for nonlinear regression using a two-layer neural network (NN) model structure with sparsity-favoring hierarchical priors on the network weights. We present an expectation propagation (EP) app…

Adaptive Low-Complexity Sequential Inference for Dirichlet Process Mixture Models

2014-09-29 · NeurIPS 2015 12 · Theodoros Tsiligkaridis, Keith W. Forsythe

We develop a sequential low-complexity inference procedure for Dirichlet process mixtures of Gaussians for online clustering and parameter estimation when the number of clusters are unknown a-priori. We present an easily…

ClusteringOnline Clusteringparameter estimation

Compressive Phase Retrieval: Optimal Sample Complexity with Deep Generative Priors

2020-08-24 · Paul Hand, Oscar Leong, Vladislav Voroninski

Advances in compressive sensing provided reconstruction algorithms of sparse signals from linear measurements with optimal sample complexity, but natural extensions of this methodology to nonlinear inverse problems have …

Compressive SensingRetrieval