Combinatorial Sleeping Bandits with Fairness Constraints - Bo Ji - IEEE Sarnoff Symposium, 2019

  • 18 views


  • Download
  • Share
    Conference Highlights
  • #IEEE
  • #ComSoc
  • #Sarnoff
  • #2019
  • #6G
  • #5G
  • #IoT
  • #Cloud
  • #Analytics
  • #Networks
  • #Artificial Intelligence
  • #Machine Learning
  • #Data Science
  • #Orchestration
  • #Open Source
  • #learning problems
  • #framework
  • #algorithm
  • #multiarmed bandit
  • #CSMABF
  • #LFG
  • #fairness issues

Assistant Professor Bo Ji, Temple University, discusses online learning problems and specifically explains what the term Combinatorial Sleeping Bandits means when it comes to factoring unknown variables. Ji considers application examples, a CSMAB-F framework and the Learning with Fairness Guarantee algorithm. 

More

  • Published on
  • October 29, 2019

Avatar

Biography

Videos with