Mohammad Hajiesmaili
25 papers · 2020–2026 · 9 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (33) π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π
Triple Crown
π
Keyword Champion
(4)
π
Grand Slam
π¬
Deep Specialist
(12)
π
Renaissance Researcher
(5)
β
The Questioner
β‘
Prolific Year Β· Productive
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(106)
Top co-authors
Research topics
Machine Learning
(18)
Mathematics & Optimization
(16)
Optimization
(16)
Optimization & Theory
(16)
Artificial Intelligence
(9)
Learning Types
(9)
Computer Science
(8)
Core AI
(7)
Foundations
(4)
Systems
(4)
Learning Paradigms
(3)
Interdisciplinary
(1)
Reinforcement Learning
(1)
Application Areas
(1)
Applications
(1)
Keywords
regret bound
(9)
multi-armed bandit
(8)
online algorithm
(5)
cooperative learning
(4)
multi-agent system
(3)
learning-augmented algorithm
(3)
online optimization
(2)
competitive ratio
(2)
adversarial attack
(2)
prediction
(2)
online knapsack
(2)
asynchronous agent
(2)
stochastic bandit
(2)
online learning
(2)
approximation algorithm
(1)
multi-agent learning
(1)
communication complexity
(1)
quantum algorithm
(1)
best arm identification
(1)
regret minimization
(1)
Papers
Online Caching in Tree Networks: Algorithms, Regret, and Complexity
L4DC 2026
Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms
ALT 2026
SPADE: Signal-Aware DAG Scheduling and Dynamic Provisioning for Data Processing Clusters
OSDI 2026
Fusing Reward and Dueling Feedback in Stochastic Bandits
ICML 2025
Heterogeneous Multi-Agent Bandits with Parsimonious Hints
AAAI 2025
Multi-agent Stochastic Bandits Robust to Adversarial Corruptions
L4DC 2025
Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
ICML 2025
Quantum Best Arm Identification with Quantum Oracles
AAAI 2025
Stochastic Bandits Robust to Adversarial Attacks
ICLR 2025
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
Robust Learning-Augmented Dictionaries
ICML 2024
Time Fairness in Online Knapsack Problems
ICLR 2024
Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits
ICLR 2023
Adversarial Attacks on Online Learning to Rank with Click Feedback
NeurIPS 2023
Applied Online Algorithms with Heterogeneous Predictors
ICML 2023
Contextual Combinatorial Bandits with Probabilistically Triggered Arms
ICML 2023
Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits?
UAI 2023
No-regret Algorithms for Fair Resource Allocation
NeurIPS 2023
On-Demand Communication for Asynchronous Multi-Agent Bandits
AISTATS 2023
Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback
NeurIPS 2021
Data-driven Competitive Algorithms for Online Knapsack and Set Cover
AAAI 2021
Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems
NeurIPS 2021
Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm
NeurIPS 2020