Demo Data from EDBT 2026 / reviewers in the wild / expert
Zikang Tian
dblp:235/0672
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2024
0009-0000-9307-7629ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 · 64% Language models and text generation · 18% Planning, search and constraint satisfaction · 18% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › hierarchical reinforcement learning
skill learning |
0.8 | 1 | 2024 | Hypothesis, Verification, and Induction: Grounding Large Language Models with Self-Driven Skill Learning · AAAI 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › hierarchical planning
subgoal planning |
0.8 | 1 | 2024 | Hypothesis, Verification, and Induction: Grounding Large Language Models with Self-Driven Skill Learning · AAAI 2024 |
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
0.7 | 1 | 2023 | Decompose a Task into Generalizable Subtasks in Multi-Agent Reinforcement Learning · NeurIPS 2023 |
Machine learning › Reinforcement learning › hierarchical reinforcement learning
sub-task decomposition |
0.7 | 1 | 2023 | Decompose a Task into Generalizable Subtasks in Multi-Agent Reinforcement Learning · NeurIPS 2023 |
Machine learning › Reinforcement learning › generalization in reinforcement learning
task generalization |
0.7 | 1 | 2023 | Decompose a Task into Generalizable Subtasks in Multi-Agent Reinforcement Learning · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
self-driven skill learning · 0.8large language model · 0.8hypothesis verification · 0.8zero-shot transfer · 0.7subtask encoder · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Hypothesis, Verification, and Induction: Grounding Large Language Models with Self-Driven Skill LearningabstractLarge language models (LLMs) show their powerful automatic reasoning and planning capability with a wealth of semantic knowledge about the human world. However, the grounding problem still hinders the applications of LLMs in the real-world environment. Existing studies try to fine-tune the LLM or utilize pre-defined behavior APIs to bridge the LLMs and the environment, which not only costs huge human efforts to customize for every single task but also weakens the generality strengths of LLMs. To autonomously ground the LLM onto the environment, we proposed the Hypothesis, Verification, and Induction (HYVIN) framework to automatically and progressively ground the LLM with self-driven skill learning. HYVIN first employs the LLM to propose the hypothesis of sub-goals to achieve tasks and then verify the feasibility of the hypothesis via interacting with the underlying environment. Once verified, HYVIN can then learn generalized skills with the guidance of these successfully grounded subgoals. These skills can be further utilized to accomplish more complex tasks that fail to pass the verification phase. Verified in the famous instruction following task set, BabyAI, HYVIN achieves comparable performance in the most challenging tasks compared with imitation learning methods that cost millions of demonstrations, proving the effectiveness of learned skills and showing the feasibility and efficiency of our framework. Shaohui Peng, Xing Hu 0001, Qi Yi, Rui Zhang 0040, Jiaming Guo, Zikang Tian, Ruizhi Chen, Zidong Du, Qi Guo 0001, Yunji Chen, Ling Li 0001 |
AAAI | 7 |
| 2023 | Decompose a Task into Generalizable Subtasks in Multi-Agent Reinforcement LearningabstractIn recent years, Multi-Agent Reinforcement Learning (MARL) techniques have made significant strides in achieving high asymptotic performance in single task. However, there has been limited exploration of model transferability across tasks. Training a model from scratch for each task can be time-consuming and expensive, especially for large-scale Multi-Agent Systems. Therefore, it is crucial to develop methods for generalizing the model across tasks. Considering that there exist task-independent subtasks across MARL tasks, a model that can decompose such subtasks from the source task could generalize to target tasks. However, ensuring true task-independence of subtasks poses a challenge. In this paper, we propose to \textbf{d}ecompose a \textbf{t}ask in\textbf{to} a series of \textbf{g}eneralizable \textbf{s}ubtasks (DT2GS), a novel framework that addresses this challenge by utilizing a scalable subtask encoder and an adaptive subtask semantic module. We show that these components endow subtasks with two properties critical for task-independence: avoiding overfitting to the source task and maintaining consistent yet scalable semantics across tasks. Empirical results demonstrate that DT2GS possesses sound zero-shot generalization capability across tasks, exhibits sufficient transferability, and outperforms existing methods in both multi-task and single-task problems. Zikang Tian, Ruizhi Chen, Xing Hu 0001, Ling Li 0001, Rui Zhang 0040, Shaohui Peng, Jiaming Guo, Zidong Du, Qi Guo 0001, Yunji Chen |
NeurIPS | 1 |
| 2020 | Joint empirical mode decomposition, exponential function estimation and L 1 norm approach for estimating mean value of photoplethysmogram and blood glucose levelabstractContinuous monitoring of the blood glucose levels is essential and critical for controlling diabetes and its complications. With the improvement of the measurement accuracy of the acquisition devices developed in recent decades, developing the optical‐based methods for performing the non‐invasive blood glucose estimation for the consumer applications becomes very important. The authors’ previous work is based on the heart rate variability of the electrocardiogram and the existing method is based on applying the random forest to the features extracted from the photoplethysmogram. However, the accuracies of these two methods are not very high. In this study, a joint empirical mode decomposition and exponential function estimation approach is proposed for estimating the mean value of a photoplethysmogram acquired from a wearable non‐invasive blood glucose device. Also, the exponential function fitting approach is employed for estimating the blood glucose levels via an L 1 norm formulation. The computer numerical simulation results show that the estimation accuracy based on their proposed method is higher than that based on the state‐of‐the‐art methods. Therefore, their proposed method can be employed for performing blood glucose estimation effectively. Xueling Zhou, Bingo Wing-Kuen Ling, Zikang Tian, Yiu-Wai Ho, Kok Lay Teo |
IET Signal Process. | 3 |