activity
20202026
most citedPanBench: Towards High-Resolution and High-Performance Pansharpening

2 citations · 2 across the 9 of their papers we have counts for

collaborators

9 papers

cs.LG2026

AutoPref: Automatic Discovery of Task-Specific Preference Objectives for Neural Combinatorial Optimization

Shengda Gu, Kai Li, Xinyi Ke +3

Combinatorial optimization problems (COPs) underpin many real-world decisions, but their exponentially large search spaces make high-quality solutions costly to obtain. Neural comb…

cs.AI2026

Benchmarking the Limits of In-Context Reinforcement Learning for Ad-Hoc Teamwork

Yuheng Jing, Kai Li, Ziwen Zhang +8

In-Context Reinforcement Learning (ICRL) has enabled foundation agents to adapt instantaneously to novel tasks, yet its efficacy in Ad-Hoc Teamwork (AHT)-where coordination with un…

cs.LG2025

Deep (Predictive) Discounted Counterfactual Regret Minimization

Hang Xu, Kai Li, Haobo Fu +3

Counterfactual regret minimization (CFR) is a family of algorithms for effectively solving imperfect-information games. To enhance CFR's applicability in large games, researchers u…

cs.LG2025

Goal-Oriented Skill Abstraction for Offline Multi-Task Reinforcement Learning

Jinmin He, Kai Li, Yifan Zang +4

Offline multi-task reinforcement learning aims to learn a unified policy capable of solving multiple tasks using only pre-collected task-mixed datasets, without requiring any onlin…

cs.LG2025

Efficient Multi-Task Reinforcement Learning with Cross-Task Policy Guidance

Jinmin He, Kai Li, Yifan Zang +4

Multi-task reinforcement learning endeavors to efficiently leverage shared information across various tasks, facilitating the simultaneous learning of multiple tasks. Existing appr…

cs.LG2024

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent

Hang Xu, Kai Li, Bingyun Liu +4

Counterfactual regret minimization (CFR) is a family of algorithms for effectively solving imperfect-information games. It decomposes the total regret into counterfactual regrets,…

cs.AI2024

Not All Tasks Are Equally Difficult: Multi-Task Deep Reinforcement Learning with Dynamic Depth Routing

Jinmin He, Kai Li, Yifan Zang +4

Multi-task reinforcement learning endeavors to accomplish a set of different tasks with a single policy. To enhance data efficiency by sharing parameters across multiple tasks, a c…

cs.CV2023★ 2 cited

PanBench: Towards High-Resolution and High-Performance Pansharpening

Shiying Wang, Xuechao Zou, Kai Li +2

Pansharpening, a pivotal task in remote sensing, involves integrating low-resolution multispectral images with high-resolution panchromatic images to synthesize an image that is bo…

cs.LG2020

OpenHoldem: A Benchmark for Large-Scale Imperfect-Information Game Research

Kai Li, Hang Xu, Enmin Zhao +2

Owning to the unremitting efforts by a few institutes, significant progress has recently been made in designing superhuman AIs in No-limit Texas Hold'em (NLTH), the primary testbed…