Demo Data from EDBT 2026 / reviewers in the wild / expert
Quanwei Wang
dblp:203/1625
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Computer networks · 1 · 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
2 papers |
Reinforcement learning · 60% Optimization for machine learning · 20% Language models and text generation · 20% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › value-based reinforcement learning
distributional reinforcement learning |
0.9 | 1 | 2025 | DAIL: Beyond Task Ambiguity for Language-Conditioned Reinforcement Learning · NeurIPS 2025 |
Machine learning › Reinforcement learning › goal-conditioned reinforcement learning
language-conditioned reinforcement learning |
0.9 | 1 | 2025 | DAIL: Beyond Task Ambiguity for Language-Conditioned Reinforcement Learning · NeurIPS 2025 |
Machine learning › Reinforcement learning
offline reinforcement learning |
0.9 | 1 | 2025 | Fewer May Be Better: Enhancing Offline Reinforcement Learning with Reduced Dataset · ICLR 2025 |
Machine learning › Optimization for machine learning › combinatorial optimization
submodular optimization |
0.9 | 1 | 2025 | Fewer May Be Better: Enhancing Offline Reinforcement Learning with Reduced Dataset · ICLR 2025 |
Natural language and speech › Language models and text generation
task ambiguity |
0.9 | 1 | 2025 | DAIL: Beyond Task Ambiguity for Language-Conditioned Reinforcement Learning · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
semantic alignment · 0.9orthogonal matching pursuit · 0.9gradient approximation · 0.9distributional policy · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Blockchain-based privacy-preserving authentication protocol for UAV cross-domainabstractAs unmanned aerial vehicles (UAVs) become increasingly integral in domains such as agriculture, logistics, and military operations, secure cross-domain authentication mechanisms are essential. Existing centralized protocols are prone to single points of failure, privacy vulnerabilities, and physical capture risks. This paper presents a novel blockchain-based, privacy-preserving authentication protocol for UAVs operating across multiple domains. By combining zero-Knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) and physical unclonable functions (PUFs), the proposed protocol ensures secure identity verification without disclosing sensitive information. The blockchain platform offers a decentralized, tamper-resistant environment for UAV authentication, addressing the challenges of scalability, privacy, and security in cross-domain operations. We demonstrate the security and effectiveness of the protocol through formal and informal security proofs and performance evaluations. The results indicate that the proposed protocol outperforms traditional methods, achieving significant reductions in both computational and communication costs while maintaining high security standards. Liefeng Cao, Haoran Ji, Quanwei Wang, Guozi Sun |
Peer Peer Netw. Appl. | 3 |
| 2025 | Fewer May Be Better: Enhancing Offline Reinforcement Learning with Reduced DatasetabstractResearch in offline reinforcement learning (RL) marks a paradigm shift in RL. However, a critical yet under-investigated aspect of offline RL is determining the subset of the offline dataset, which is used to improve algorithm performance while accelerating algorithm training. Moreover, the size of reduced datasets can uncover the requisite offline data volume essential for addressing analogous challenges. Based on the above considerations, we propose identifying Reduced Datasets for Offline RL (ReDOR) by formulating it as a gradient approximation optimization problem. We prove that the common actor-critic framework in reinforcement learning can be transformed into a submodular objective. This insight enables us to construct a subset by adopting the orthogonal matching pursuit (OMP). Specifically, we have made several critical modifications to OMP to enable successful adaptation with Offline RL algorithms. The experimental results indicate that the data subsets constructed by the ReDOR can significantly improve algorithm performance with low computational complexity. Yiqin Yang, Quanwei Wang, Chenghao Li 0002, Hao Hu 0006, Chengjie Wu, Yuhua Jiang, Dianyu Zhong, Ziyou Zhang, Qianchuan Zhao, Chongjie Zhang, Bo Xu 0002 |
ICLR | 2 |
| 2025 | DAIL: Beyond Task Ambiguity for Language-Conditioned Reinforcement LearningabstractComprehending natural language and following human instructions are critical capabilities for intelligent agents.
However, the flexibility of linguistic instructions induces substantial ambiguity across language-conditioned tasks, severely degrading algorithmic performance.
To address these limitations, we present a novel method named DAIL (Distributional Aligned Learning), featuring two key components: distributional policy and semantic alignment.
Specifically, we provide theoretical results that the value distribution estimation mechanism enhances task differentiability.
Meanwhile, the semantic alignment module captures the correspondence between trajectories and linguistic instructions.
Extensive experimental results on both structured and visual observation benchmarks demonstrate that DAIL effectively resolves instruction ambiguities, achieving superior performance to baseline methods. Our implementation is available at https://github.com/RunpengXie/Distributional-Aligned-Learning. Runpeng Xie, Quanwei Wang, Hao Hu 0006, Zherui Zhou, Ni Mu, Xiyun Li, Yiqin Yang, Qianchuan Zhao, Bo Xu 0002 |
NeurIPS | 2 |
| 2023 | A Stackelberg Game-Theoretic Exploration Rendering Robustness and Optimality for Performance Improvement of Fuzzy Mechanical SystemsabstractWe consider mechanical systems with uncertainty. The uncertainty may be time varying. The bound of the uncertainty is described by its fuzzy characteristics. To design a feasible control, we start with a robust phase, which renders a control scheme that guarantees the system performance regardless of the actual value of the uncertainty. This robust phase is then followed by an optimal phase. There are design parameters in the control, which can be fine-tuned. We proposed multiple performance objectives. The goal of the choice of the control design parameters is to minimize the performance objectives. However, since these objectives are nonconciliating (meaning one's minimum is not the other one's minimum), we invoke the Stackelberg strategy for the optimal parameters. The game strategy mimics two players: one is the leader and one is the follower. Through the interplay between the two players, we show how to select the design parameters. The design procedure in both robust and optimal phases is demonstrated by a coupled inverted pendulum system. Rongrong Yu, Ye-Hwa Chen, Quanwei Wang |
IEEE Trans. Cybern. | 3 |