The Contextual Bandits Problem: A New, Fast, and Simple Algorithm

แชร์
ฝัง
  • เผยแพร่เมื่อ 11 ธ.ค. 2024

ความคิดเห็น • 11

  • @halflearned2190
    @halflearned2190 7 ปีที่แล้ว +25

    Please focus only on the slides. The general viewership of this kind of talk is not interested in the presenter's body language.

  • @rusergeev
    @rusergeev 2 ปีที่แล้ว

    Super nice to learn about the contextual bandits!

  • @pankajsinghrawat1056
    @pankajsinghrawat1056 ปีที่แล้ว

    ahen there are multiple ads, how to de choose 'k' ads as actions, since actions are just classes right

  • @Amapramaadhy
    @Amapramaadhy 7 ปีที่แล้ว

    Very enlightening. This is bleeding-edge research in the field

  • @fuhualin
    @fuhualin 6 ปีที่แล้ว +1

    hope to see the slides

  • @geoffreyanderson4719
    @geoffreyanderson4719 6 ปีที่แล้ว +1

    tldr; is there a 15 minute version of this?

  • @omarrayyann
    @omarrayyann 4 หลายเดือนก่อน

    Cool

  • @Redactification
    @Redactification 6 ปีที่แล้ว

    So the innovation here is that the speaker has created a faster simpler algorithm to solve a problem based on the number of times that the algorithm references information that by definition one will never has access to? In the heterogenous treatment effects framework this in effect assumes that one has access to all potential outcomes for each observational unit. i.e. you give a cancer patient one of 20 treatments, observe the outcome from that treatment then some how know the outcome from every other treatment given to THAT patient? So what practical use is it?

  • @castonnyabadza6521
    @castonnyabadza6521 3 ปีที่แล้ว +1

    The camera person sucks, next time please spend more time on the presentation while the presenter is talking us through

  • @lenkapenka6976
    @lenkapenka6976 3 ปีที่แล้ว +1

    FFS show us the slides!!!!!!!!!!!!!!!!