Next
Livestream will start soon!
Livestream has already ended.
Presentation has not been recorded yet!
  • title: PAC-Bayes bounds’ parameter optimization via events’ space discretization: new bounds for losses with general tail behaviors
      0:00 / 0:00
      • Report Issue
      • Settings
      • Playlists
      • Bookmarks
      • Subtitles Off
      • Playback rate
      • Quality
      • Settings
      • Debug information
      • Server sl-yoda-v2-stream-004-alpha.b-cdn.net
      • Subtitles size Medium
      • Bookmarks
      • Server
      • sl-yoda-v2-stream-004-alpha.b-cdn.net
      • sl-yoda-v2-stream-004-beta.b-cdn.net
      • 1685195716.rsc.cdn77.org
      • 1239898752.rsc.cdn77.org
      • Subtitles
      • Off
      • English
      • Playback rate
      • Quality
      • Subtitles size
      • Large
      • Medium
      • Small
      • Mode
      • Video Slideshow
      • Audio Slideshow
      • Slideshow
      • Video
      My playlists
        Bookmarks
          00:00:00
            PAC-Bayes bounds’ parameter optimization via events’ space discretization: new bounds for losses with general tail behaviors
            • Settings
            • Sync diff
            • Quality
            • Settings
            • Server
            • Quality
            • Server

            PAC-Bayes bounds’ parameter optimization via events’ space discretization: new bounds for losses with general tail behaviors

            Jul 28, 2023

            Speakers

            BRG

            Borja Rodríguez Gálvez

            Speaker · 0 followers

            RT

            Ragnar Thobaben

            Speaker · 0 followers

            MS

            Mikael Skoglund

            Speaker · 0 followers

            About

            In this paper, we present new parameter-free high-probability PAC-Bayes bounds for losses with different tail behaviors: a PAC-Bayes Chernoff analogue when the loss’ cumulative generating function is bounded, and a bound when the loss’ second moment is bounded. These two bounds are obtained using a new technique based on a discretization of the space of possible events for the “in probability” parameter optimization problem. Finally, we extend all previous results to anytime-valid bounds using a…

            Organizer

            I2
            I2

            ICML 2023

            Account · 631 followers

            Like the format? Trust SlidesLive to capture your next event!

            Professional recording and live streaming, delivered globally.

            Sharing

            Recommended Videos

            Presentations on similar topic, category or speaker

            Long-Tailed Recognition by Mutual Information Maximization between Latent Features and Ground-Truth Labels
            04:36

            Long-Tailed Recognition by Mutual Information Maximization between Latent Features and Ground-Truth Labels

            Min-Kook Suh, …

            I2
            I2
            ICML 2023 2 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Approximation Algorithms for Fair Range Clustering
            05:16

            Approximation Algorithms for Fair Range Clustering

            Sedjro Salomon Hotegni, …

            I2
            I2
            ICML 2023 2 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Multi-Symmetry Ensembles: Improving Diversity and Generalization via Opposing Symmetries
            05:25

            Multi-Symmetry Ensembles: Improving Diversity and Generalization via Opposing Symmetries

            Charlotte Loh, …

            I2
            I2
            ICML 2023 2 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Inferring Relational Potentials in Interacting Systems
            05:06

            Inferring Relational Potentials in Interacting Systems

            Armand Comas, …

            I2
            I2
            ICML 2023 2 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Slicing Mutual Information Generalization Bounds for Neural Networks
            18:20

            Slicing Mutual Information Generalization Bounds for Neural Networks

            Kimia Nadjahi

            I2
            I2
            ICML 2023 2 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Learning in POMDPs is Sample-Efficient with Hindsight Observability
            05:46

            Learning in POMDPs is Sample-Efficient with Hindsight Observability

            Jonathan N. Lee, …

            I2
            I2
            ICML 2023 2 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Interested in talks like this? Follow ICML 2023