Profiles2020-2026
Mohammad H Hajiesmaili
University of Massachusetts
Also published as Mohammad Hajiesmaili
19Papers
6Last author
42Unique co-authors
0First author
0Solo
First and last author come from byline position, which some venues assign alphabetically.
Recent papers19
- Online Learning to Rank under Corruption: A Robust Cascading Bandits ApproachAuthor 5 of 5KDD 2026 · 1 citation
- Low-Bitrate Video Compression through Semantic-Conditioned DiffusionAuthor 5 of 10CVPR Findings 2026
- Learning Best Paths in Quantum NetworksAuthor 5 of 7INFOCOM 2025 · 5 citations
- Quantum Best Arm Identification with Quantum OraclesAuthor 5 of 7AAAI 2025 · 4 citations
- Heterogeneous Multi-Agent Bandits with Parsimonious HintsAuthor 5 of 5AAAI 2025 · 3 citations
- Combinatorial Ski Rental Problem: Robust and Learning-Augmented AlgorithmsAuthor 4 of 7NeurIPS 2025 · 1 citation
- Stochastic Bandits Robust to Adversarial AttacksAuthor 5 of 5ICLR 2025
- Online Algorithms with Uncertainty-Quantified PredictionsAuthor 4 of 6ICML 2024 · 12 citations
- Time Fairness in Online Knapsack ProblemsAuthor 5 of 5ICLR 2024 · 8 citations
- Robust Learning-Augmented DictionariesAuthor 3 of 3ICML 2024 · 6 citations
- No-regret Algorithms for Fair Resource AllocationAuthor 5 of 5NeurIPS 2023 · 14 citations
- Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent BanditsAuthor 5 of 7ICLR 2023
- Distributed Bandits with Heterogeneous AgentsAuthor 3 of 5INFOCOM 2022 · 12 citations
- Data-driven Competitive Algorithms for Online Knapsack and Set CoverAuthor 3 of 4AAAI 2021 · 41 citations
- Pareto-Optimal Learning-Augmented Algorithms for Online Conversion ProblemsAuthor 3 of 5NeurIPS 2021 · 39 citations
- Cooperative Stochastic Bandits with Asynchronous Agents and Constrained FeedbackAuthor 4 of 6NeurIPS 2021 · 36 citations
- FOCAS: Practical Video Super Resolution using Foveated RenderingAuthor 2 of 3ACM MM 2021 · 21 citations
- Ride Substitution Using Electric Bike Sharing: Feasibility, Cost, and Carbon AnalysisAuthor 3 of 4UbiComp 2021 · 17 citations
- Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret AlgorithmAuthor 2 of 5NeurIPS 2020 · 39 citations
