kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Note on Generalization Bounds for Losses with Finite Moments
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-0862-1333
UCL.
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0001-9307-484X
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-7926-5081
2024 (English)In: 2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings, Institute of Electrical and Electronics Engineers (IEEE) , 2024, p. 2676-2681Conference paper, Published paper (Refereed)
Abstract [en]

This paper studies the truncation method from Alquier [1] to derive high-probability PAC-Bayes bounds for unbounded losses with heavy tails. Assuming that the p-th moment is bounded, the resulting bounds interpolate between a slow rate 1/√n when p=2, and a fast rate 1/n when p→∞ and the loss is essentially bounded. Moreover, the paper derives a high-probability PAC-Bayes bound for losses with a bounded variance. This bound has an exponentially better dependence on the confidence parameter and the dependency measure than previous bounds in the literature. Finally, the paper extends all results to guarantees in expectation and single-draw PAC-Bayes. In order to so, it obtains analogues of the PAC-Bayes fast rate bound for bounded losses from [2] in these settings. The full version of the paper can be found in https://arxiv.org/abs/2403.16681.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2024. p. 2676-2681
National Category
Probability Theory and Statistics Mathematical Analysis
Identifiers
URN: urn:nbn:se:kth:diva-353510DOI: 10.1109/ISIT57864.2024.10619194ISI: 001304426902133Scopus ID: 2-s2.0-85202842028OAI: oai:DiVA.org:kth-353510DiVA, id: diva2:1899185
Conference
2024 IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, Jul 7 2024 - Jul 12 2024
Note

Part of ISBN 9798350382846

QC 20240919

Available from: 2024-09-19 Created: 2024-09-19 Last updated: 2025-12-05Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Rodríguez Gálvez, BorjaThobaben, RagnarSkoglund, Mikael

Search in DiVA

By author/editor
Rodríguez Gálvez, BorjaThobaben, RagnarSkoglund, Mikael
By organisation
Information Science and Engineering
Probability Theory and StatisticsMathematical Analysis

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 123 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf