Next
Livestream will start soon!
Livestream has already ended.
Presentation has not been recorded yet!
  • title: Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget
      0:00 / 0:00
      • Report Issue
      • Settings
      • Playlists
      • Bookmarks
      • Subtitles Off
      • Playback rate
      • Quality
      • Settings
      • Debug information
      • Server sl-yoda-v2-stream-005-alpha.b-cdn.net
      • Subtitles size Medium
      • Bookmarks
      • Server
      • sl-yoda-v2-stream-005-alpha.b-cdn.net
      • sl-yoda-v2-stream-005-beta.b-cdn.net
      • 1034628162.rsc.cdn77.org
      • 1409346856.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
            Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget
            • Settings
            • Sync diff
            • Quality
            • Settings
            • Server
            • Quality
            • Server

            Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget

            Nov 28, 2022

            Speakers

            JB

            Jasmin Brandt

            Speaker · 0 followers

            BH

            Björn Haddenhorst

            Speaker · 0 followers

            VB

            Viktor Bengs

            Speaker · 0 followers

            About

            We consider the combinatorial bandits problem with semi-bandit feedback under finite sampling budget constraints, in which the learner can carry out its action only for a limited number of times specified by an overall budget. The action is to choose a set of arms, whereupon feedback for each arm in the chosen set is received. Unlike existing works, we study this problem in a non-stochastic setting with subset-dependent feedback, i.e., the semi-bandit feedback received could be generated by an o…

            Organizer

            N2
            N2

            NeurIPS 2022

            Account · 962 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

            BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach
            04:32

            BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach

            Bo Liu, …

            N2
            N2
            NeurIPS 2022 2 years ago

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

            Formal Controller Synthesis for Stochastic Dynamical Models with Epistemic Uncertainty
            03:03

            Formal Controller Synthesis for Stochastic Dynamical Models with Epistemic Uncertainty

            Thom Badings, …

            N2
            N2
            NeurIPS 2022 2 years ago

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

            DevFly: Bio-Inspired Development of Binary Connections for Locality Preserving Sparse Codes
            05:23

            DevFly: Bio-Inspired Development of Binary Connections for Locality Preserving Sparse Codes

            Tianqi Wei, …

            N2
            N2
            NeurIPS 2022 2 years ago

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

            Deconfounded Representation Similarity for Comparison of Neural Networks
            04:55

            Deconfounded Representation Similarity for Comparison of Neural Networks

            Tianyu Cui, …

            N2
            N2
            NeurIPS 2022 2 years ago

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

            Efficient and Effective Augmentation Strategy for Adversarial Training
            01:04

            Efficient and Effective Augmentation Strategy for Adversarial Training

            Sravanti Addepalli, …

            N2
            N2
            NeurIPS 2022 2 years ago

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

            projUNN: efficient method for training deep networks with unitary matrices
            04:59

            projUNN: efficient method for training deep networks with unitary matrices

            Bobak T. Kiani, …

            N2
            N2
            NeurIPS 2022 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 NeurIPS 2022