Kaito Ariu

Orcid: 0000-0001-6286-9906

According to our database1, Kaito Ariu authored at least 23 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Nash Equilibrium and Learning Dynamics in Three-Player Matching m-Action Games.
CoRR, 2024

Return-Aligned Decision Transformer.
CoRR, 2024

Hyperparameter-Free Approach for Faster Minimum Bayes Risk Decoding.
CoRR, 2024

Memory Asymmetry Creates Heteroclinic Orbits to Nash Equilibrium in Learning in Zero-Sum Games.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Model-Based Minimum Bayes Risk Decoding.
CoRR, 2023

On Uniformly Optimal Algorithms for Best Arm Identification in Two-Armed Bandits with Fixed Budget.
CoRR, 2023

Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model.
CoRR, 2023

A Slingshot Approach to Learning in Monotone Games.
CoRR, 2023

Memory Asymmetry: A Key to Convergence in Zero-Sum Games.
CoRR, 2023

Exploration of Unranked Items in Safe Online Learning to Re-Rank.
Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2023

Learning in Multi-Memory Games Triggers Complex Dynamics Diverging from Nash Equilibrium.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Last-Iterate Convergence with Full- and Noisy-Information Feedback in Two-Player Zero-Sum Games.
CoRR, 2022

Optimal Fixed-Budget Best Arm Identification using the Augmented Inverse Probability Weighting Estimator in Two-Armed Gaussian Bandits with Unknown Variances.
CoRR, 2022

Thresholded Lasso Bandit.
Proceedings of the International Conference on Machine Learning, 2022

2021
Optimal Simple Regret in Bayesian Best Arm Identification.
CoRR, 2021

Policy Choice and Best Arm Identification: Comments on "Adaptive Treatment Assignment in Experiments for Policy Choice".
CoRR, 2021

The Role of Contextual Information in Best Arm Identification.
CoRR, 2021

2020
A Practical Guide of Off-Policy Evaluation for Bandit Problems.
CoRR, 2020

Regret in Online Recommendation Systems.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Optimal Algorithms for Multiplayer Multi-Armed Bandits.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Optimal Clustering from Noisy Binary Feedback.
CoRR, 2019

2017
Chance-Constrained Path Planning with Continuous Time Safety Guarantees.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017


  Loading...