paper-with-me

Papers

Nonparametric learning from Bayesian models with randomized objective functions

2018-12-01 · NeurIPS 2018 12 · Simon Lyddon, Stephen Walker, Chris C. Holmes

Bayesian learning is built on an assumption that the model space contains a true reflection of the data generating mechanism. This assumption is problematic, particularly in complex data environments. Here we present a Bayesian nonparametric approach to learning that makes use of statistical models, but does not assume that the model is true. Our approach has provably better properties than using a parametric model and admits a Monte Carlo sampling scheme that can afford massive scalability on modern computer architectures. The model-based aspect of learning is particularly attractive for regularizing nonparametric inference when the sample size is small, and also for correcting approximate approaches such as variational Bayes (VB). We demonstrate the approach on a number of examples including VB classifiers and Bayesian random forests.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Nonparametric learning from Bayesian models with randomized objective functions

2018-06-29 · NeurIPS 2018 · S. P. Lyddon, S. G. Walker, C. C. Holmes

Bayesian learning is built on an assumption that the model space contains a true reflection of the data generating mechanism. This assumption is problematic, particularly in complex data environments. Here we present a B…

Scalable Nonparametric Sampling from Multimodal Posteriors with the Posterior Bootstrap

2019-02-08 · Edwin Fong, Simon Lyddon, Chris Holmes

Increasingly complex datasets pose a number of challenges for Bayesian inference. Conventional posterior sampling based on Markov chain Monte Carlo can be too computationally intensive, is serial in nature and mixes poor…

Bayesian Inferenceregression

Gradient-free stochastic optimization for additive models

2025-03-03 · Arya Akhavan, Alexandre B. Tsybakov

We address the problem of zero-order optimization from noisy observations for an objective function satisfying the Polyak-{\L}ojasiewicz or the strong convexity condition. Additionally, we assume that the objective funct…

Additive modelsStochastic Optimization

Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization

2018-04-13 · Jarno Hartog, Harry van Zanten

This article describes an implementation of a nonparametric Bayesian approach to solving binary classification problems on graphs. We consider a hierarchical Bayesian approach with a prior that is constructed by truncati…

Binary ClassificationGeneral Classification

Nonparametric Bayesian Inverse Reinforcement Learning for Multiple Reward Functions

2012-12-01 · NeurIPS 2012 12 · Jaedeug Choi, Kee-Eung Kim

We present a nonparametric Bayesian approach to inverse reinforcement learning (IRL) for multiple reward functions. Most previous IRL algorithms assume that the behaviour data is obtained from an agent who is optimizing …

reinforcement-learningReinforcement LearningReinforcement Learning (RL)