PAC-Bayes with Minimax for Confidence-Rated Transduction

01/15/2015
by   Akshay Balsubramani, et al.
0

We consider using an ensemble of binary classifiers for transductive prediction, when unlabeled test data are known in advance. We derive minimax optimal rules for confidence-rated prediction in this setting. By using PAC-Bayes analysis on these rules, we obtain data-dependent performance guarantees without distributional assumptions on the data. Our analysis techniques are readily extended to a setting in which the predictor is allowed to abstain.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2020

PAC-Bayes Analysis Beyond the Usual Bounds

We focus on a stochastic learning model where the learner observes a fin...
research
06/21/2014

PAC-Bayes Analysis of Multi-view Learning

This paper presents eight PAC-Bayes bounds to analyze the generalization...
research
05/19/2019

Teaching decision theory proof strategies using a crowdsourcing problem

Teaching how to derive minimax decision rules can be challenging because...
research
06/22/2022

Cold Posteriors through PAC-Bayes

We investigate the cold posterior effect through the lens of PAC-Bayes g...
research
09/21/2021

Learning PAC-Bayes Priors for Probabilistic Neural Networks

Recent works have investigated deep learning models trained by optimisin...
research
12/07/2020

A PAC-Bayesian Perspective on Structured Prediction with Implicit Loss Embeddings

Many practical machine learning tasks can be framed as Structured predic...
research
07/13/2020

Relaxing the I.I.D. Assumption: Adaptive Minimax Optimal Sequential Prediction with Expert Advice

We consider sequential prediction with expert advice when the data are g...

Please sign up or login with your details

Forgot password? Click here to reset