Assaf Zeevi
13 papers · 2014–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🌍 Conference Polyglot (5) 🏃 Academic Marathon (11) 🐝 Cross-Pollinator (13)
🌍
Conference Polyglot
(5)
🏃
Academic Marathon
(11)
🐝
Cross-Pollinator
(13)
💎
Century Club
(13)
📈
Trend Setter
🗃️
Keyword Collector
(52)
Conferences
ICML (6)
COLT (3)
AISTATS (2)
ALT (1)
NIPS (1)
Top co-authors
Keywords
regret bound
(6)
multi-armed bandit
(5)
online learning
(4)
regret minimization
(3)
stochastic optimization
(2)
contextual bandit
(2)
policy learning
(1)
dynamic programming
(1)
function approximation
(1)
sparse regression
(1)
upper confidence bound
(1)
exploration exploitation
(1)
sequential learning
(1)
bandit feedback
(1)
feature selection
(1)
bayesian posterior
(1)
markov decision process
(1)
multinomial logit
(1)
thompson sampling
(1)
time series prediction
(1)
Papers
Linear Bandits with Partially Observable Features
ICML 2025
Learning the Pareto Front Using Bootstrapped Observation Samples
AISTATS 2025
A Doubly Robust Approach to Sparse Reinforcement Learning
AISTATS 2024
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback
ICML 2023
Complexity Analysis of a Countable-armed Bandit Problem
ALT 2023
Last Switch Dependent Bandits with Monotone Payoff Functions
ICML 2023
Bayesian Design Principles for Frequentist Sequential Learning
ICML 2023
Learning to Stop with Surprisingly Few Samples
COLT 2021
Sparsity-Agnostic Lasso Bandit
ICML 2021
A General Approach to Multi-Armed Bandits Under Risk Criteria
COLT 2018
Thompson Sampling for the MNL-Bandit
COLT 2017
Online Time Series Prediction with Missing Data
ICML 2015
Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards
NIPS 2014