Mohammad Hajiesmaili
23 papers · 2020–2026 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🌍 Conference Polyglot (7) 🏃 Academic Marathon (5) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐝 Cross-Pollinator (12)
🌈
Renaissance Researcher
(6)
🐝
Cross-Pollinator
(12)
🏆
Grand Slam
👑
Triple Crown
❓
The Questioner
💎
Century Club
(22)
⚡
Prolific Year
(7)
Conferences
ICML (8)
NIPS (5)
AAAI (3)
ICLR (3)
AISTATS (1)
ALT (1)
L4DC (1)
UAI (1)
Top co-authors
Keywords
multi-armed bandit
(6)
regret bound
(6)
online algorithm
(4)
cooperative learning
(3)
learning-augmented algorithm
(2)
asynchronous agent
(2)
competitive ratio
(2)
multi-agent system
(2)
online optimization
(2)
query complexity
(1)
contextual bandit
(1)
machine learning
(1)
communication complexity
(1)
quantum algorithm
(1)
competitive analysis
(1)
no-regret algorithm
(1)
adversarial attack
(1)
combinatorial bandit
(1)
stochastic bandit
(1)
best arm identification
(1)
Papers
Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms
ALT 2026
Stochastic Bandits Robust to Adversarial Attacks
ICLR 2025
Heterogeneous Multi-Agent Bandits with Parsimonious Hints
AAAI 2025
Quantum Best Arm Identification with Quantum Oracles
AAAI 2025
Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
ICML 2025
Fusing Reward and Dueling Feedback in Stochastic Bandits
ICML 2025
Multi-agent Stochastic Bandits Robust to Adversarial Corruptions
L4DC 2025
Time Fairness in Online Knapsack Problems
ICLR 2024
Robust Learning-Augmented Dictionaries
ICML 2024
Chasing Convex Functions with Long-term Constraints
ICML 2024
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
ICML 2024
Online Algorithms with Uncertainty-Quantified Predictions
ICML 2024
Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits?
UAI 2023
On-Demand Communication for Asynchronous Multi-Agent Bandits
AISTATS 2023
Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits
ICLR 2023
Contextual Combinatorial Bandits with Probabilistically Triggered Arms
ICML 2023
Applied Online Algorithms with Heterogeneous Predictors
ICML 2023
Adversarial Attacks on Online Learning to Rank with Click Feedback
NIPS 2023
No-regret Algorithms for Fair Resource Allocation
NIPS 2023
Data-driven Competitive Algorithms for Online Knapsack and Set Cover
AAAI 2021
Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback
NIPS 2021
Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems
NIPS 2021
Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm
NIPS 2020