Search Results for author: Shuxin Li

Found 10 papers, 4 papers with code

Grasper: A Generalist Pursuer for Pursuit-Evasion Problems

1 code implementation19 Apr 2024 Pengdeng Li, Shuxin Li, Xinrun Wang, Jakub Cerny, Youzhi Zhang, Stephen Mcaleer, Hau Chan, Bo An

Pursuit-evasion games (PEGs) model interactions between a team of pursuers and an evader in graph-based environments such as urban street networks.

Self-adaptive PSRO: Towards an Automatic Population-based Game Solver

no code implementations17 Apr 2024 Pengdeng Li, Shuxin Li, Chang Yang, Xinrun Wang, Xiao Huang, Hau Chan, Bo An

(2) We propose the self-adaptive PSRO (SPSRO) by casting the hyperparameter value selection of the parametric PSRO as a hyperparameter optimization (HPO) problem where our objective is to learn an HPO policy that can self-adaptively determine the optimal hyperparameter values during the running of the parametric PSRO.

Hyperparameter Optimization

Population-size-Aware Policy Optimization for Mean-Field Games

no code implementations7 Feb 2023 Pengdeng Li, Xinrun Wang, Shuxin Li, Hau Chan, Bo An

In this work, we attempt to bridge the two fields of finite-agent and infinite-agent games, by studying how the optimal policies of agents evolve with the number of agents (population size) in mean-field games, an agent-centric perspective in contrast to the existing works focusing typically on the convergence of the empirical distribution of the population.

Offline Equilibrium Finding

1 code implementation12 Jul 2022 Shuxin Li, Xinrun Wang, Youzhi Zhang, Jakub Cerny, Pengdeng Li, Hau Chan, Bo An

Extensive experimental results demonstrate the superiority of our approach over offline RL algorithms and the importance of using model-based methods for OEF problems.

Offline RL

CFR-MIX: Solving Imperfect Information Extensive-Form Games with Combinatorial Action Space

no code implementations18 May 2021 Shuxin Li, Youzhi Zhang, Xinrun Wang, Wanqi Xue, Bo An

The challenge of solving this type of game is that the team's joint action space grows exponentially with the number of agents, which results in the inefficiency of the existing algorithms, e. g., Counterfactual Regret Minimization (CFR).

counterfactual

Relaxing Relationship Queries on Graph Data

1 code implementation24 Feb 2020 Shuxin Li, Gong Cheng, Chengkai Li

We prove that verifying the success of a sub-query turns into finding an entity (called a certificate) that satisfies a distance-based condition about the query entities.

A Framework for Evaluating Snippet Generation for Dataset Search

no code implementations2 Jul 2019 Xiaxia Wang, Jinchi Chen, Shuxin Li, Gong Cheng, Jeff Z. Pan, Evgeny Kharlamov, Yuzhong Qu

Reusing existing datasets is of considerable significance to researchers and developers.

Cannot find the paper you are looking for? You can Submit a new open access paper.