Stochastic Bandits: Optimism In The Face of Uncertainty
The previous two algorithms had regret bounds in the order of $\mathcal{O}(n^{\frac{2}{3}} (k\log{n})^{\frac{1}{3}})$. But with...
2022, May 04 — 2 minute readThe previous two algorithms had regret bounds in the order of $\mathcal{O}(n^{\frac{2}{3}} (k\log{n})^{\frac{1}{3}})$. But with...
2022, May 04 — 2 minute readThe Multi-Class Classification Problem: Let’s say, we have a domain $\mathcal{X}$ where each element $x...
2022, Apr 06 — 6 minute readPreviously, we saw that in the ETC algorithm, we first explore all of the arms...
2022, Feb 22 — 3 minute readFam locavore snackwave bushwick $x^{2} + 1$ sartorial. Selfies portland knausgaard synth. Pop-up art party...
2022, Feb 11 — 4 minute readBroadly, I am interested in almost everything that ends with “learning”, for example, Machine Learning,...
2020, Dec 03 — 1 minute readI am a lecturer in the Department of Computer Science and Engineering at BRAC University,...
2019, Oct 09 — 2 minute readঅনেক সময় আমরা বাইপার্টাইট ম্যাচিং এর যে কোন এই সাইডের সব ভারটেক্স কে সম্পৃক্ত করতে...
2019, Oct 08 — 9 minute read