EDBT 2026 Demo / reviewers in the wild / expert
Jindou Chen
dblp:351/8503
· DBLP profile ↗
6ranked-venue papers
2as first author
6since 2021 · last 2025
0000-0002-3294-8272ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
2 papers |
Language models and text generation · 76% Information extraction and text analysis · 24% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 50% Computational science and engineering · 50% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › systems biology
kinetic modeling |
0.9 | 1 | 2025 | KinFormer: Generalizable Dynamical Symbolic Regression for Catalytic Organic Reaction Kinetics · ICLR 2025 |
Natural language and speech › Language models and text generation
large language model |
0.8 | 1 | 2024 | Can Large Language Models Serve as Rational Players in Game Theory? A Systematic Analysis · AAAI 2024 |
Algorithmic game theory and mechanism design
rationality |
0.8 | 1 | 2024 | Can Large Language Models Serve as Rational Players in Game Theory? A Systematic Analysis · AAAI 2024 |
Natural language and speech › Language models and text generation › prompting
chain-of-thought prompting |
0.7 | 1 | 2023 | Task-Level Thinking Steps Help Large Language Models for Challenging Classification Task · EMNLP 2023 |
Natural language and speech › Language models and text generation
in-context learning |
0.7 | 1 | 2023 | Task-Level Thinking Steps Help Large Language Models for Challenging Classification Task · EMNLP 2023 |
Natural language and speech › Information extraction and text analysis
text classification |
0.7 | 1 | 2023 | Task-Level Thinking Steps Help Large Language Models for Challenging Classification Task · EMNLP 2023 |
Methods — techniques the papers use, named apart from their topics
monte carlo tree search · 0.9conditional transformer · 0.9progressive revision · 0.7chain-of-thought · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | KinFormer: Generalizable Dynamical Symbolic Regression for Catalytic Organic Reaction KineticsabstractModeling kinetic equations is essential for understanding the mechanisms of chemical reactions, yet a complex and time-consuming task. Kinetic equation prediction is formulated as a problem of dynamical symbolic regression (DSR) subject to physical chemistry constraints. Deep learning (DL) holds the potential to capture reaction patterns and predict kinetic equations from data of chemical species, effectively avoiding empirical bias and improving efficiency compared with traditional analytical methods. Despite numerous studies focusing on DSR and the introduction of Transformers to predict ordinary differential equations, the corresponding models lack generalization abilities across diverse categories of reactions. In this study, we propose KinFormer, a generalizable kinetic equation prediction model. KinFormer utilizes a conditional Transformer to model DSR under physical constraints and employs Monte Carlo Tree Search to apply the model to new types of reactions. Experimental results on 20 types of organic reactions demonstrate that KinFormer not only outperforms classical baselines, but also exceeds Transformer baselines in out-of-domain evaluations, thereby proving its generalization ability. Jindou Chen, Jidong Tian, ChenXinWei, Xiaokang Yang 0001, Yaohui Jin, Yanyan Xu 0002 |
ICLR | 1 |
| 2024 | Can Large Language Models Serve as Rational Players in Game Theory? A Systematic AnalysisabstractGame theory, as an analytical tool, is frequently utilized to analyze human behavior in social science research. With the high alignment between the behavior of Large Language Models (LLMs) and humans, a promising research direction is to employ LLMs as substitutes for humans in game experiments, enabling social science research. However, despite numerous empirical researches on the combination of LLMs and game theory, the capability boundaries of LLMs in game theory remain unclear. In this research, we endeavor to systematically analyze LLMs in the context of game theory. Specifically, rationality, as the fundamental principle of game theory, serves as the metric for evaluating players' behavior --- building a clear desire, refining belief about uncertainty, and taking optimal actions. Accordingly, we select three classical games (dictator game, Rock-Paper-Scissors, and ring-network game) to analyze to what extent LLMs can achieve rationality in these three aspects. The experimental results indicate that even the current state-of-the-art LLM (GPT-4) exhibits substantial disparities compared to humans in game theory. For instance, LLMs struggle to build desires based on uncommon preferences, fail to refine belief from many simple patterns, and may overlook or modify refined belief when taking actions. Therefore, we consider that introducing LLMs into game experiments in the field of social science should be approached with greater caution. Caoyun Fan, Jindou Chen, Yaohui Jin, Hao He 0007 |
AAAI | 2 |
| 2024 | Self-Hint Prompting Improves Zero-shot Reasoning in Large Language Models via Reflective Cycle
Jindou Chen, Jidong Tian, Yaohui Jin |
CogSci | 1 |
| 2024 | CRT-based group rekeying with efficient dynamically aggregate signature for IoMT
Aiqing Zhang, Huining Luo, Jindou Chen |
Ad Hoc Networks | 4 |
| 2023 | Task-Level Thinking Steps Help Large Language Models for Challenging Classification TaskabstractLarge language models (LLMs) have shown incredible performance on many tasks such as dialogue generation, commonsense reasoning and question answering.In-context learning (ICL) is an important paradigm for adapting LLMs to the downstream tasks by prompting few demonstrations.However, the distribution of demonstrations can severely affect the performance, especially for challenging classification tasks.In this paper, we propose the concept of task-level thinking steps that can eliminate bias introduced by demonstrations.Further, to help LLMs distinguish confusing classes, we design a progressive revision framework, which can improve the thinking steps by correcting hard demonstrations.Experimental results prove the superiority of our proposed method, achieving best performance on three kinds of challenging classification tasks in the zero-shot and few-shot settings.Besides, with task-level thinking steps, automatically generated chain-of-thoughts (CoTs) bring more competitive performance. Jidong Tian, Haoran Liao, Jindou Chen, Hao He 0007, Yaohui Jin |
EMNLP | 4 |
| 2022 | Blockchain-based multi-hop permission delegation scheme with controllable delegation depth for electronic health record sharingabstractPermission delegation has become a new way for data sharing by delegating the authorized permission to other users. A flexible authorization model with strict access control policies is promising for electronic health record (EHR) sharing with security. In this paper, a blockchain-based multi-hop permission delegation scheme with controllable delegation depth for EHR sharing has been presented. We use the interplanetary file system (IPFS) for storing the original EHRs. Smart contracts and proxy re-encryption technology are implemented for permission delegation. In order to ensure data security, we use attribute-based encryption to provide fine-grained access control. Additionally, blockchain is used to achieve traceability and immutability. We deploy smart contracts so that the delegation depth can be set by delegators. Security analysis of the proposed protocol shows that our solution meets the designed goals. Finally, we evaluate the proposed algorithm and implement the scheme on the Ethereum test chain. Our scheme outperforms the competition in terms of performance, according to the results of our experiments. Aiqing Zhang, Jindou Chen |
High Confid. Comput. | 4 |