Tomáš Kocák
9 papers · 2014–2024 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
🌉 Interdisciplinary Bridge 🗺️ Taxonomy Completionist (10) 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🌍 Conference Polyglot (5)
🏃
Academic Marathon
(10)
🐝
Cross-Pollinator
(15)
📈
Trend Setter
🔥
Unstoppable
(5)
Conferences
AISTATS (2)
ICML (2)
IJCAI (2)
NIPS (2)
JMLR (1)
Top co-authors
Keywords
multi-armed bandit
(7)
online learning
(6)
regret bound
(5)
spectral method
(3)
sample complexity
(2)
cumulative regret
(2)
bandit algorithm
(2)
exploration strategy
(2)
best arm identification
(2)
graph structure
(2)
partial observability
(1)
regret minimization
(1)
online algorithm
(1)
spectral algorithm
(1)
minimax regret
(1)
implicit exploration
(1)
bandit problem
(1)
graph smoothness
(1)
pac learning
(1)
combinatorial optimization
(1)
Papers
On Weak Regret Analysis for Dueling Bandits
NIPS 2024
Online Learning with Feedback Graphs: The True Shape of Regret
ICML 2023
A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits
AISTATS 2022
Epsilon Best Arm Identification in Spectral Bandits
IJCAI 2021
Spectral bandits
JMLR 2020
Best Arm Identification in Spectral Bandits
IJCAI 2020
Online Learning with Noisy Side Observations
AISTATS 2016
Spectral Bandits for Smooth Graph Functions
ICML 2014
Efficient learning by implicit exploration in bandit problems with side observations
NIPS 2014