I’m a PhD student in the Paul G. Allen School of Computer Science & Engineering at the University of Washington, where I am fortunate to be advised by Kevin Jamieson. I work broadly on the theory of machine learning and algorithms for decision-making under uncertainty. reviously, I completed my undergraduate degree in Computer Science with a minor in Mathematics from Sharif University of Technology, where my thesis was supervised by Salman Beigi.
Preprints
Optimal Pricing for Bundles: Using Submodularity in Offline and Online Settings — Online Learning and Economics Workshop at EC 2025, 2025. Authors: Artin Tajdini, Lalit Jain, Kevin Jamieson.
Publications
Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards — To appear at NeurIPS 2025, 2025. Authors: Artin Tajdini, Jonathan Scarlett, Kevin Jamieson. arXiv | short talk
Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals — ICML 2025, 2025. Authors: Junyan Liu, Arnab Maiti, Artin Tajdini, Kevin Jamieson, Lillian J. Ratliff. arXiv
Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification — NeurIPS 2024, 2024. Authors: Haolin Liu, Artin Tajdini, Andrew Wagenmaker, Chen-Yu Wei. arXiv
Nearly Minimax Optimal Submodular Maximization with Bandit Feedback — NeurIPS 2024, 2024. Authors: Artin Tajdini, Lalit Jain, Kevin Jamieson. arXiv
Time and Query-Optimal Quantum Algorithms Based on Decision Trees — ACM Transactions on Quantum Computing (TQC), 2022. Authors: Salman Beigi, Leila Taghavi, Artin Tajdini. arXiv
On a question of Haemers regarding vectors in the nullspace of Seidel matrices — Linear Algebra and its Applications (LAA), 2021. Authors: Saieed Akbari, Sebastian M. Cioabă, Samira Goudarzi, Aidin Niaparast, Artin Tajdini. arXiv