Artin Tajdini

According to our database, Artin Tajdini authored at least 7 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards.

Artin Tajdini, Jonathan Scarlett, Kevin G. Jamieson

CoRR, June, 2025

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals.

Junyan Liu, Arnab Maiti, Artin Tajdini, Kevin G. Jamieson, Lillian J. Ratliff

CoRR, May, 2025

2024

Nearly Minimax Optimal Submodular Maximization with Bandit Feedback.

Artin Tajdini, Lalit Jain, Kevin G. Jamieson

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification.

Haolin Liu, Artin Tajdini, Andrew Wagenmaker, Chen-Yu Wei

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

2023

Minimax Optimal Submodular Optimization with Bandit Feedback.

Artin Tajdini, Lalit Jain, Kevin Jamieson

CoRR, 2023

2021

Time and Query Optimal Quantum Algorithms Based on Decision Trees.

Salman Beigi, Leila Taghavi, Artin Tajdini

CoRR, 2021

2020

On a question of Haemers regarding vectors in the nullspace of Seidel matrices.

Saieed Akbari, Sebastian M. Cioaba, Samira Goudarzi, Aidin Niaparast, Artin Tajdini

CoRR, 2020