Next
Livestream will start soon!
Livestream has already ended.
Presentation has not been recorded yet!
  • title: Combinatorial Pure Exploration for Dueling Bandit
      0:00 / 0:00
      • Report Issue
      • Settings
      • Playlists
      • Bookmarks
      • Subtitles Off
      • Playback rate
      • Quality
      • Settings
      • Debug information
      • Server sl-yoda-v3-stream-014-alpha.b-cdn.net
      • Subtitles size Medium
      • Bookmarks
      • Server
      • sl-yoda-v3-stream-014-alpha.b-cdn.net
      • sl-yoda-v3-stream-014-beta.b-cdn.net
      • 1978117156.rsc.cdn77.org
      • 1243944885.rsc.cdn77.org
      • Subtitles
      • Off
      • en
      • Playback rate
      • Quality
      • Subtitles size
      • Large
      • Medium
      • Small
      • Mode
      • Video Slideshow
      • Audio Slideshow
      • Slideshow
      • Video
      My playlists
        Bookmarks
          00:00:00
            Combinatorial Pure Exploration for Dueling Bandit
            • Settings
            • Sync diff
            • Quality
            • Settings
            • Server
            • Quality
            • Server

            Combinatorial Pure Exploration for Dueling Bandit

            Jul 12, 2020

            Speakers

            YD

            Yihan Du

            Speaker · 0 followers

            WC

            Wei Chen

            Speaker · 1 follower

            LH

            Longbo Huang

            Speaker · 0 followers

            About

            In this paper, we study combinatorial pure exploration for dueling bandit (CPE-DB): we have multiple candidates for multiple positions as modeled by a bipartite graph, and in each round we sample a duel of two candidates on one position and observe who wins in the duel, with the goal of finding the best candidate-position matching with high probability after multiple rounds of samples. CPE-DB is an extension of the original combinatorial pure exploration for multi-armed bandit (CPE-MAB) problem…

            Organizer

            I2
            I2

            ICML 2020

            Account · 2.6k followers

            Categories

            Mathematics

            Category · 2.4k presentations

            AI & Data Science

            Category · 10.8k presentations

            About ICML 2020

            The International Conference on Machine Learning (ICML) is the premier gathering of professionals dedicated to the advancement of the branch of artificial intelligence known as machine learning. ICML is globally renowned for presenting and publishing cutting-edge research on all aspects of machine learning used in closely related areas like artificial intelligence, statistics and data science, as well as important application areas such as machine vision, computational biology, speech recognition, and robotics. ICML is one of the fastest growing artificial intelligence conferences in the world. Participants at ICML span a wide range of backgrounds, from academic and industrial researchers, to entrepreneurs and engineers, to graduate students and postdocs.

            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

            Density Deconvolution with Normalizing Flows
            04:05

            Density Deconvolution with Normalizing Flows

            Tim Dockhorn, …

            I2
            I2
            ICML 2020 5 years ago

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

            DeepMatch: Balancing Deep Covariate Representations for Causal Inference Using Adversarial Training
            15:38

            DeepMatch: Balancing Deep Covariate Representations for Causal Inference Using Adversarial Training

            Nathan Kallus

            I2
            I2
            ICML 2020 5 years ago

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

            Continuous-time Lower Bounds for Gradient-based Algorithms
            15:46

            Continuous-time Lower Bounds for Gradient-based Algorithms

            Michael Muehlebach, …

            I2
            I2
            ICML 2020 5 years ago

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

            On the Relation between Quality-Diversity Evaluation and Distribution-Fitting Goal in Text Generation
            13:50

            On the Relation between Quality-Diversity Evaluation and Distribution-Fitting Goal in Text Generation

            Jianing Li, …

            I2
            I2
            ICML 2020 5 years ago

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

            On the Sample Complexity of Adversarial Multi-Source PAC Learning
            15:04

            On the Sample Complexity of Adversarial Multi-Source PAC Learning

            Nikola Konstantinov, …

            I2
            I2
            ICML 2020 5 years ago

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

            The k-tied Normal Distribution: A Compact Parameterization of Gaussian Mean Field Posteriors in Bayesian Neural Networks
            13:13

            The k-tied Normal Distribution: A Compact Parameterization of Gaussian Mean Field Posteriors in Bayesian Neural Networks

            Jakub Swiatkowski, …

            I2
            I2
            ICML 2020 5 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 2020