Demo Data from EDBT 2026 / reviewers in the wild / expert
Jinxing Yan
dblp:400/5586
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 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 2021Computer networks · 1 · 1 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 · 77% Multi-agent systems · 23% | |
| Databases, data mining, and information retrieval
1 paper |
Spatial and temporal data management · 67% Machine learning and data management · 33% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › multi-agent reinforcement learning
credit assignment |
0.9 | 1 | 2025 | Gradient-Guided Credit Assignment and Joint Optimization for Dependency-Aware Spatial Crowdsourcing · AAAI 2025 |
Knowledge, reasoning and agents › Multi-agent systems
multi-agent coordination |
0.9 | 1 | 2025 | Gradient-Guided Credit Assignment and Joint Optimization for Dependency-Aware Spatial Crowdsourcing · AAAI 2025 |
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
0.9 | 1 | 2025 | Gradient-Guided Credit Assignment and Joint Optimization for Dependency-Aware Spatial Crowdsourcing · AAAI 2025 |
Machine learning › Reinforcement learning
spatial crowdsourcing task assignment |
0.9 | 1 | 2025 | Gradient-Guided Credit Assignment and Joint Optimization for Dependency-Aware Spatial Crowdsourcing · AAAI 2025 |
Spatial and temporal data management › spatial crowdsourcing
adaptive task assignment |
0.9 | 1 | 2025 | Adaptive Task Assignment in Spatial Crowdsourcing: A Human-in-The-Loop Approach · IEEE Trans. Mob. Comput. 2025 |
Machine learning and data management
human-in-the-loop |
0.9 | 1 | 2025 | Adaptive Task Assignment in Spatial Crowdsourcing: A Human-in-The-Loop Approach · IEEE Trans. Mob. Comput. 2025 |
Spatial and temporal data management
spatial crowdsourcing |
0.9 | 1 | 2025 | Adaptive Task Assignment in Spatial Crowdsourcing: A Human-in-The-Loop Approach · IEEE Trans. Mob. Comput. 2025 |
Methods — techniques the papers use, named apart from their topics
human-in-the-loop · 1.7dual attention network · 1.7deep q-network · 1.7utility function · 0.9multi-agent reinforcement learning · 0.9meta-gradient · 0.9gradient synchronization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Gradient-Guided Credit Assignment and Joint Optimization for Dependency-Aware Spatial CrowdsourcingabstractDependency-aware spatial crowdsourcing (DASC) addresses the unique challenges posed by subtask dependencies in spatial task assignment. This paper investigates the task assignment problem in DASC and proposes a two-stage Recommend and Match Optimization (RMO) framework, leveraging multi-agent reinforcement learning for subtask recommendation and a multi-dimensional utility function for subtask matching. The RMO framework primarily addresses two key challenges: credit assignment for subtasks with interdependencies and maintaining overall coherence between subtask recommendation and matching. Specifically, we employ meta-gradients to construct auxiliary policies and establish a gradient connection between two stages, which can effectively address credit assignment and joint optimization of subtask recommendation and matching, while concurrently accelerating network training. We further establish a unified gradient descent process through gradient synchronization across recommendation networks, auxiliary policies, and the matching utility evaluation function. Experiments on two real-world datasets validate the effectiveness and feasibility of our proposed approach. Wei Chen 0001, Jinxing Yan, Mingliang Xu 0001 |
AAAI | 3 |
| 2025 | Adaptive Task Assignment in Spatial Crowdsourcing: A Human-in-The-Loop ApproachabstractIn recent years, adaptive task assignment has been explored in spatial crowdsourcing. The challenge lies in how to adaptively partition the task stream to achieve the best utility for task assignment. A number of existing works have attempted to solve this challenge and achieve better performance by utilizing learning-based methods. Specifically, they mainly employ reinforcement learning to divide the task stream into a series of suitable batches and then perform task assignment in a batch fashion. Drawing inspiration from the effectiveness of human-machine collaborative decision-making, we aim to investigate human-in-the-loop methods to further enhance the performance of adaptive task assignment. In this paper, we propose a novel framework called Human-in-the-Loop Adaptive Partition (HLAP), which consists of two primary modules: Reinforcement Learning Partition Decision (RL-PD) and Human Supervision and Guidance (HSG). In the RL-PD module, we develop an RL agent, referred to as the decision-maker, by integrating the dual attention network into the Deep Q-Network (DQN) algorithm to capture cross-dimensional contextual information and long-range dependencies for a better understanding of the environment. In the HSG module, we design a human-in-the-loop mechanism to optimize the performance of the decision-maker, focusing on addressing two key issues: when and how humans interact with the decision-maker. Furthermore, to alleviate the heavy workload on humans, we construct a supervisor based on RL to oversee the decision-maker's partition process and adaptively determine when human intervention is necessary. We conduct extensive experiments on two real-world datasets, and the results demonstrate the efficiency and effectiveness of the HLAP framework. Qingshun Wu, Jinxing Yan, Jianliang Xu, Mingliang Xu 0001 |
IEEE Trans. Mob. Comput. | 3 |