.png){kind=icon}
返回
Simpler PAC-Bayesian bounds for hostile data
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-017-5690-0.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
PAC-Bayesian learning bounds are of the utmost interest to the learning community. Their role is to connect the generalization ability of an aggregation distribution to its empirical risk and to its Kullback-Leibler divergence with respect to some prior distribution . Unfortunately, most of the available bounds typically rely on heavy assumptions such as boundedness and independence of the observations. This paper aims at relaxing these constraints and provides PAC-Bayesian learning bounds that hold for dependent, heavy-tailed observations (hereafter referred to as hostile data). In these bounds the Kullack-Leibler divergence is replaced with a general version of Csiszar's f-divergence. We prove a general PAC-Bayesian bound, and show how to use it in various hostile settings.
Keyword:
PAC-Bayesian theory
Dependent and unbounded data
Oracle inequalities
f-divergence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
分享收藏Mode of action of the gramicidin S analogs lacking hydrophilic amino acid residues on biomembranes.OAAI
OAAI分享收藏Optimization of Texture-Modified Yellowfin Sole (Pleuronectes aspera) by Enzymatic Treatment and Superheated Steam Treating to Improve Quality Characteristics.png)
ProcessesOAAI
ProcessesIF0
OAAI分享收藏Equilibria in solutions of amines and fatty acids with relevance to the corrosion inhibition of iron
PREAI
分享收藏Adaptive demodulation synchro-extracting transform for bearing time-varying fault feature extraction
PREAI
分享收藏
查看更多内容