Kenshi Abe

Orcid: 0000-0002-9267-9510

According to our database1, Kenshi Abe authored at least 22 papers between 2019 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
Scalable and Provably Fair Exposure Control for Large-Scale Recommender Systems.
CoRR, 2024

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

Return-Aligned Decision Transformer.
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
Learning Fair Division from Bandit Feedback.
CoRR, 2023

Model-Based Minimum Bayes Risk Decoding.
CoRR, 2023

Why Guided Dialog Policy Learning performs well? Understanding the role of adversarial learning and its alternative.
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
Fair Matrix Factorisation for Large-Scale Recommender Systems.
CoRR, 2022

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

Policy Gradient Algorithms with Monte-Carlo Tree Search for Non-Markov Decision Processes.
CoRR, 2022

Mutation-driven follow the regularized leader for last-iterate convergence in zero-sum games.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Anytime Capacity Expansion in Medical Residency Match by Monte Carlo Tree Search.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

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

2021
Off-Policy Exploitability-Evaluation in Two-Player Zero-Sum Markov Games.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

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

Off-Policy Exploitability-Evaluation and Equilibrium-Learning in Two-Player Zero-Sum Markov Games.
CoRR, 2020

2019
A Simple Heuristic for Bayesian Optimization with A Low Budget.
CoRR, 2019


  Loading...