Distributed-bandits-codes

Our codes for the rebuttal of Neurips 2019 paper: Distributed Bandits Learning: Near-optimal Regret with Efficient Communication.

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
DELB(5000,10,10000,500).png		DELB(5000,10,10000,500).png
DELB-(8000,15,5000,100).png		DELB-(8000,15,5000,100).png
DELB.ipynb		DELB.ipynb
DELB.png		DELB.png
DELB.txt		DELB.txt
DisLinUCB.ipynb		DisLinUCB.ipynb
DisLinUCB.png		DisLinUCB.png
LinUCB-(8000,15,5000,100).png		LinUCB-(8000,15,5000,100).png
LinUCB-(8000,15,5000,100).txt		LinUCB-(8000,15,5000,100).txt
LinUCB-lastit.png		LinUCB-lastit.png
LinUCB.ipynb		LinUCB.ipynb
LinUCB.png		LinUCB.png
LinUCB.txt		LinUCB.txt
LinUCB_finish.txt		LinUCB_finish.txt
LinUCB_naive-lastit.png		LinUCB_naive-lastit.png
LinUCB_naive.ipynb		LinUCB_naive.ipynb
LinUCB_naive.png		LinUCB_naive.png
LinUCB_naive.txt		LinUCB_naive.txt
README.md		README.md
aggregate-1.png		aggregate-1.png
aggregate.png		aggregate.png
combine.ipynb		combine.ipynb

Provide feedback