Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yiming Qi

dblp:32/275 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 87% Generative modeling · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
imitation learning
0.712023
Ess-InfoGAIL: Semi-supervised Imitation Learning from Imbalanced Demonstrations · NeurIPS 2023
Machine learning › Reinforcement learning › imitation learning › sample-efficient imitation learning
semi-supervised imitation learning
0.712023
Ess-InfoGAIL: Semi-supervised Imitation Learning from Imbalanced Demonstrations · NeurIPS 2023
Machine learning › Generative modeling
generative adversarial network
0.212023
Ess-InfoGAIL: Semi-supervised Imitation Learning from Imbalanced Demonstrations · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

information maximization · 0.7disentangled representation learning · 0.7
YearPublicationVenuePosition
2025 Imitation Learning with Process Adversarial Diffusion
abstract
Generative Adversarial Imitation Learning (GAIL) replicates expert behaviors by employing adversarial training involving the discriminator and the generator. In theory, GAIL can balance discriminator and generator through considerable online interactions to learn well. But real-world adversarial training is tricky and unstable. Early mistakes by the discriminator can lead to bad learning outcomes, or the generator might just copy average expert actions (mode collapse) instead of diverse strategies. To address these, we propose Process Adversarial Diffusion Imitation Learning (PADIL). Employing a conditional diffusion model as the generator facilitates the generation of a multi-modal strategy, thereby reducing the likelihood of mode collapse and enhancing imitation learning performance with fewer online interactions. At the same time, it lessens the generator’s vulnerability to the fluctuating signals or errors conveyed by the discriminator throughout the training process. Furthermore, we have revised the sample extraction approach of the diffusion policy to tackle the concern of iterative instability under rapidly fluctuating reward signals. Experimental results demonstrate that our method achieves better performance compared to baseline methods.
Yiming Qi, Huiqiao Fu, Kaiqiang Tang, Chunlin Chen 0001
SMC1
2025 Macro-Action-Based DRL for Asynchronous Multi-User Dynamic Spectrum Access in Half-Duplex CRNs
abstract
This paper addresses the asynchronous multi-user dynamic spectrum access (DSA) problem in half-duplex cognitive radio networks (HD-CRNs). The core challenge lies in resolving the decision asynchrony caused by variable action duration under HD constraints, which traditional deep reinforcement learning (DRL) methods fail to address. The problem is formulated as a Macro-Action Decentralized Partially Observable Markov Decision Process (MacDec-POMDP), with a decentralized macro-action-based multi-agent Dueling Double Deep Q-Network (D3QN) framework being proposed. An extra reward mechanism is specifically designed to encourage sustained conflict-free access. Simulation results demonstrate that our approach outperforms synchronous fixed-duration methods by dynamically adjusting access duration. The reward function design significantly improves adaptability, reducing collisions to both primary and secondary users while optimizing the spectrum utilization under HD constraints, validating its effectiveness in asynchronous multi-user DSA.
Yiming Qi, Jianzhao Zhang
VTC2025-Spring1
2023 Ess-InfoGAIL: Semi-supervised Imitation Learning from Imbalanced Demonstrations
abstract
Imitation learning aims to reproduce expert behaviors without relying on an explicit reward signal. However, real-world demonstrations often present challenges, such as multi-modal, data imbalance, and expensive labeling processes. In this work, we propose a novel semi-supervised imitation learning architecture that learns disentangled behavior representations from imbalanced demonstrations using limited labeled data. Specifically, our method consists of three key components. First, we adapt the concept of semi-supervised generative adversarial networks to the imitation learning context. Second, we employ a learnable latent distribution to align the generated and expert data distributions. Finally, we utilize a regularized information maximization approach in conjunction with an approximate label prior to further improve the semi-supervised learning performance. Experimental results demonstrate the efficiency of our method in learning multi-modal behaviors from imbalanced demonstrations compared to baseline methods.
Huiqiao Fu, Kaiqiang Tang, Yuanyang Lu, Yiming Qi, Guizhou Deng, Flood Sung, Chunlin Chen 0001
NeurIPS4