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

122 views
Download
  • Share
#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. 

Read more about the IEEE Sarnoff Symposium https://ewh.ieee.org/conf/sarnoff/2019

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. 

Advertisment

Advertisment