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

Yinuo Zhao

dblp:266/6179 · DBLP profile ↗
← Back
15ranked-venue papers
5as first author
13since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 8 · 3 first-author · 8 since 2021Computer networks · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 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
5 papers
Reinforcement learning · 58% Robot manipulation · 17% Autonomous driving · 12%
Computer networks
3 papers
Network optimization and economics · 44% Internet of things and sensor networks · 43% Vehicular, aerial and satellite networks · 8%
Human-computer interaction and pervasive computing
1 paper
Human-AI interaction · 77% Collaborative and social computing · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
deep reinforcement learning
1.022022
CADRE: A Cascade Deep Reinforcement Learning Framework for Vision-Based Autonomous Urban Driving · AAAI 2022
Curiosity-Driven Energy-Efficient Worker Scheduling in Vehicular Crowdsourcing: A Deep Reinforcement Learning Approach · ICDE 2020
Robotics › Robot manipulation
affordance learning
0.912025
RoboAfford: A Dataset and Benchmark for Enhancing Object and Spatial Affordance Learning in Robot Manipulation · ACM Multimedia 2025
Machine learning › Reinforcement learning › reward design
reward generation
0.912025
Training-Free Generation of Temporally Consistent Rewards from VLMs · ICCV 2025
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.812024
Energy-Efficient Ground-Air-Space Vehicular Crowdsensing by Hierarchical Multi-Agent Deep Reinforcement Learning With Diffusion Models · IEEE J. Sel. Areas Commun. 2024
Internet of things and sensor networks › mobile crowdsensing
vehicular crowdsensing
0.812024
Energy-Efficient Ground-Air-Space Vehicular Crowdsensing by Hierarchical Multi-Agent Deep Reinforcement Learning With Diffusion Models · IEEE J. Sel. Areas Commun. 2024
Robotics › Autonomous driving
vision-based autonomous driving
0.612022
CADRE: A Cascade Deep Reinforcement Learning Framework for Vision-Based Autonomous Urban Driving · AAAI 2022
Computer vision › Vision and language
vision-language model
0.522025
RoboAfford: A Dataset and Benchmark for Enhancing Object and Spatial Affordance Learning in Robot Manipulation · ACM Multimedia 2025
Training-Free Generation of Temporally Consistent Rewards from VLMs · ICCV 2025
Internet of things and sensor networks
mobile crowdsensing
0.512021
Distributed and Energy-Efficient Mobile Crowdsensing with Charging Stations by Deep Reinforcement Learning · IEEE Trans. Mob. Comput. 2021
Network optimization and economics › mechanism design › incentive mechanism
crowdsourcing incentive mechanism
0.412020
Free Market of Multi-Leader Multi-Follower Mobile Crowdsensing: An Incentive Mechanism Design by Deep Reinforcement Learning · IEEE Trans. Mob. Comput. 2020
Network optimization and economics › mechanism design
incentive mechanism
0.412020
Free Market of Multi-Leader Multi-Follower Mobile Crowdsensing: An Incentive Mechanism Design by Deep Reinforcement Learning · IEEE Trans. Mob. Comput. 2020
Network optimization and economics › game theory › dynamic game
stackelberg game
0.412020
Free Market of Multi-Leader Multi-Follower Mobile Crowdsensing: An Incentive Mechanism Design by Deep Reinforcement Learning · IEEE Trans. Mob. Comput. 2020
Distributed systems
crowdsourcing
0.412020
Curiosity-Driven Energy-Efficient Worker Scheduling in Vehicular Crowdsourcing: A Deep Reinforcement Learning Approach · ICDE 2020

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

hierarchical reinforcement learning · 1.5goal-conditioned policy · 1.5diffusion model · 1.5expert evaluation · 1.0comparative study · 1.0vision-language model fine-tuning · 0.9vision-language model · 0.9bayesian tracking · 0.9deep reinforcement learning · 0.9curiosity model · 0.9reward shaping · 0.6proximal policy optimization · 0.6co-attention · 0.6prioritized experience replay · 0.5multi-agent deep reinforcement learning · 0.5convolutional neural network · 0.5actor-critic · 0.5LSTM · 0.5
YearPublicationVenuePosition
2026 When AI Gives Advice: Evaluating AI and Human Responses to Online Advice-Seeking for Well-Being
abstract
Seeking advice is a core human behavior that the internet has reinvented twice: first through forums and Q&A communities that crowdsource public guidance, and now through large language models (LLMs). Yet the quality of this LLM advice for everyday well-being scenarios remains unclear. How does it compare, not only against human comments, but against the wisdom of the online crowd? We ran two studies (N=210) in which experts compared top-voted Reddit advice with LLM-generated advice. LLMs ranked significantly higher overall and on effectiveness, warmth, and willingness to seek advice again. GPT-4o beat GPT-5 on all metrics except sycophancy, suggesting that benchmark gains need not improve advice-giving. In Study-2, we examined how human and algorithmic advice could be combined, and found that human advice can be unobtrusively polished to compete with AI-generated comments. We conclude with design implications for advice-giving agents and ecosystems blending AI, crowd input, and expert oversight.
Jasmine Chahal, Yinuo Zhao, Zeling Zhang, Annika Z. Wei, Louis Tay, Ashton Anderson
CHI3
2026 LGR: Lyapunov gradient regularization for improving ensemble adversarial transferability against robust models
Guoyin Nie, Yubo Ma, Yiyun Gou, Yinuo Zhao
Neurocomputing6
2025 Training-Free Generation of Temporally Consistent Rewards from VLMs
abstract
Recent advances in vision-language models (VLMs) have significantly improved performance in embodied tasks such as goal decomposition and visual comprehension. However, providing accurate rewards for robotic manipulation without fine-tuning VLMs remains challenging due to the absence of domain-specific robotic knowledge in pre-trained datasets and high computational costs that hinder real-time applicability. To address this, we propose $\mathrm{T}^2$-VLM, a novel training-free, temporally consistent framework that generates accurate rewards through tracking the status changes in VLM-derived subgoals. Specifically, our method first queries the VLM to establish spatially aware subgoals and an initial completion estimate before each round of interaction. We then employ a Bayesian tracking algorithm to update the goal completion status dynamically, using subgoal hidden states to generate structured rewards for reinforcement learning (RL) agents. This approach enhances long-horizon decision-making and improves failure recovery capabilities with RL. Extensive experiments indicate that $\mathrm{T}^2$-VLM achieves state-of-the-art performance in two robot manipulation benchmarks, demonstrating superior reward accuracy with reduced computation consumption. We believe our approach not only advances reward generation techniques but also contributes to the broader field of embodied AI. Project website: https://t2-vlm.github.io/.
Yinuo Zhao, Jiale Yuan, Xiaoshuai Hao, Xinyi Zhang 0009, Kun Wu 0001, Zhengping Che, Chi Harold Liu, Jian Tang 0008
ICCV1
2025 Efficient Training of Generalizable Visuomotor Policies via Control-Aware Augmentation
Yinuo Zhao, Kun Wu 0001, Tianjiao Yi, Zhengping Che, Chi Harold Liu, Jian Tang 0008
AAMAS1
2025 HACTS: a Human-As-Copilot Teleoperation System for Robot Learning
abstract
Teleoperation is essential for autonomous robot learning, especially in manipulation tasks that require human demonstrations or corrections. However, most existing systems only offer unilateral robot control and lack the ability to synchronize the robot’s status with the teleoperation hardware, preventing real-time, flexible intervention. In this work, we introduce HACTS (Human-As-Copilot Teleoperation System), a novel system that establishes bilateral, real-time joint synchronization between a robot arm and teleoperation hardware. This simple yet effective feedback mechanism, akin to a steering wheel in autonomous vehicles, enables the human copilot to intervene seamlessly while collecting action-correction data for future learning. Implemented using 3D-printed components and low-cost, off-the-shelf motors, HACTS is both accessible and scalable. Our experiments show that HACTS significantly enhances performance in imitation learning (IL) and reinforcement learning (RL) tasks, boosting IL recovery capabilities and data efficiency, and facilitating human-in-the-loop RL. HACTS paves the way for more effective and interactive human-robot collaboration and data-collection, advancing the capabilities of robot manipulation.
Yinuo Zhao, Kun Wu 0001, Ning Liu 0007, Junjie Ji, Zhengping Che, Chi Harold Liu, Jian Tang 0008
IROS2
2025 RoboAfford: A Dataset and Benchmark for Enhancing Object and Spatial Affordance Learning in Robot Manipulation
abstract
Robot manipulation is a fundamental capability of embodied intelligence, enabling effective robot interactions with the physical world. In robotic manipulation tasks, predicting precise grasping positions and object placement is essential. Achieving this requires object recognition to localize target object, predicting object affordances for interaction and spatial affordances for optimal arrangement. While Vision-Language Models (VLMs) provide insights for high-level task planning and scene understanding, they often struggle to predict precise action positions, such as functional grasp points and spatial placements. This limitation stems from the lack of annotations for object and spatial affordance data in their training datasets. To address this gap, we introduce RoboAfford , a novel large-scale dataset designed to enhance object and spatial affordance learning in robot manipulation. Our dataset comprises 819,987 images paired with 1.9 million question answering (QA) annotations, covering three critical tasks: object affordance recognition to identify objects based on attributes and spatial relationships, object affordance prediction to pinpoint functional grasping parts, and spatial affordance localization to identify free space for placement. Complementing this dataset, we propose RoboAfford-Eval , a comprehensive benchmark for assessing affordance-aware prediction in real-world scenarios, featuring 338 meticulously annotated samples across the same three tasks. Extensive experimental results reveal the deficiencies of existing VLMs in affordance learning, while fine-tuning on the RoboAfford dataset significantly enhances their affordance prediction in robot manipulation, validating the dataset's effectiveness. The dataset, benchmark and evaluation code will be made publicly available to facilitate future research. Project website: https://roboafford-dataset.github.io/.
Yingbo Tang, Yinuo Zhao, Xiaoshuai Hao
ACM Multimedia4
2025 Y-Net-ECG: A Multi-Lead informed and interpretable architecture for ECG segmentation across diverse rhythms
Peng Zhang 0106, Xiaoli Feng, Kaibiao Huang, Yinuo Zhao, Zuoming Fu, Zhigang Ye, Tao Wang 0138, Xiaoyun Yang, Fan Lin, Qiang Li 0018
Expert Syst. Appl.8
2025 ACL-QL: Adaptive Conservative Level in Q-Learning for Offline Reinforcement Learning
abstract
Offline reinforcement learning (RL), which operates solely on static datasets without further interactions with the environment, provides an appealing alternative to learning a safe and promising control policy. The prevailing methods typically learn a conservative policy to mitigate the problem of Q-value overestimation, but it is prone to overdo it, leading to an overly conservative policy. Moreover, they optimize all samples equally with fixed constraints, lacking the nuanced ability to control conservative levels in a fine-grained manner. Consequently, this limitation results in a performance decline. To address the above two challenges in a united way, we propose a framework, adaptive conservative level in Q-learning (ACL-QL), which limits the Q-values in a mild range and enables adaptive control on the conservative level over each state-action pair, i.e., lifting the Q-values more for good transitions and less for bad transitions. We theoretically analyze the conditions under which the conservative level of the learned Q-function can be limited in a mild range and how to optimize each transition adaptively. Motivated by the theoretical analysis, we propose a novel algorithm, ACL-QL, which uses two learnable adaptive weight functions to control the conservative level over each transition. Subsequently, we design a monotonicity loss and surrogate losses to train the adaptive weight functions, Q-function, and policy network alternatively. We evaluate ACL-QL on the commonly used datasets for deep data-driven reinforcement learning (D4RL) benchmark and conduct extensive ablation studies to illustrate the effectiveness and state-of-the-art performance compared with existing offline DRL baselines.
Kun Wu 0001, Yinuo Zhao, Zhengping Che, Chengxiang Yin 0001, Chi Harold Liu, Feifei Feng, Jian Tang 0008
IEEE Trans. Neural Networks Learn. Syst.2
2024 Energy-Efficient Ground-Air-Space Vehicular Crowdsensing by Hierarchical Multi-Agent Deep Reinforcement Learning With Diffusion Models
abstract
The integrated ground-air-space (GAS) communications system can enhance post-disaster rescue and management efforts when traditional networks fail, by navigating unmanned ground vehicles (UGVs) and unmanned arieal vehicles (UAVs) to collaboratively collect sufficient data from point-of-interests (PoIs) in a timely manner. In this paper, we consider the GAS vehicular crowdsensing (VCS) campaign, where UGVs dispatch and callback UAVs periodically across multiple stops in the workzone, to maximize the total collected amount of data, geographic fairness while minimizing the energy consumption simultaneously. Specifically, we propose an energy-efficient, go-directed hierarchical multi-agent deep reinforcement learning (MADRL) method with discrete diffusion models called “gMADRL-VCS”, to optimize the high-level goal-conditioned navigation policies of UGVs, and the low-level long-term sensing strategies of UAVs. Extensive experimental results on two real-world datasets in Roma, Italy, and Hong Kong SAR, China show that gMADRL-VCS outperforms baselines in terms of energy efficiency, data collection ratio, energy consumption, and UAV-UGV cooperation factor.
Yinuo Zhao, Chi Harold Liu, Tianjiao Yi, Guozheng Li 0002, Dapeng Oliver Wu
IEEE J. Sel. Areas Commun.1
2023 LSTM-ReGAT: A network-centric approach for cryptocurrency price trend prediction
Chao Zhong, Qianhui Huang, Yinuo Zhao
Decis. Support Syst.5
2022 CADRE: A Cascade Deep Reinforcement Learning Framework for Vision-Based Autonomous Urban Driving
abstract
Vision-based autonomous urban driving in dense traffic is quite challenging due to the complicated urban environment and the dynamics of the driving behaviors. Widely-applied methods either heavily rely on hand-crafted rules or learn from limited human experience, which makes them hard to generalize to rare but critical scenarios. In this paper, we present a novel CAscade Deep REinforcement learning framework, CADRE, to achieve model-free vision-based autonomous urban driving. In CADRE, to derive representative latent features from raw observations, we first offline train a Co-attention Perception Module (CoPM) that leverages the co-attention mechanism to learn the inter-relationships between the visual and control information from a pre-collected driving dataset. Cascaded by the frozen CoPM, we then present an efficient distributed proximal policy optimization framework to online learn the driving policy under the guidance of particularly designed reward functions. We perform a comprehensive empirical study with the CARLA NoCrash benchmark as well as specific obstacle avoidance scenarios in autonomous urban driving tasks. The experimental results well justify the effectiveness of CADRE and its superiority over the state-of-the-art by a wide margin.
Yinuo Zhao, Kun Wu 0001, Zhengping Che, Jian Tang 0008, Chi Harold Liu
AAAI1
2021 Social-Aware Incentive Mechanism for Vehicular Crowdsensing by Deep Reinforcement Learning
abstract
Vehicular crowdsensing (VCS) takes the advantage of vehicles' mobility and exploits both the crowd wisdom and sensing abilities offered by vehicle drivers' carried smart mobile devices and on-board sensors to accomplish challenging sensing tasks. The daily roadway commutes of vehicle drivers may form “virtual” mobile communities, called Vehicular Social Networks (VSNs). It offers an opportunity to include social network effect into incentive mechanism design where a driver can benefit from others' sensing strategy in one VSN. In this paper, we consider a non-cooperative VCS campaign where multiple vehicles are incentivized by dynamically priced tasks and social network effect. In order to maximize the overall utility of vehicle drivers, we propose a social-aware incentive mechanism by deep reinforcement learning (called DRL-SIM), to derive the optimal long term sensing strategy for all vehicles. Finally, numerical results are supplemented to show both the convergence and the effectiveness of DRL-SIM when compared with other baselines.
Yinuo Zhao, Chi Harold Liu
IEEE Trans. Intell. Transp. Syst.1
2021 Distributed and Energy-Efficient Mobile Crowdsensing with Charging Stations by Deep Reinforcement Learning
abstract
Mobile crowdsensing (MCS) represents a new sensing paradigm that utilizes the smart mobile devices to collect and share data. Traditional MCS systems mainly leverages the people carried smartphones and other wearable devices which are constrained by the limited sensing capability and battery power. With the popularity of unmanned vehicles like unmanned aerial vehicles (UAVs) and driverless cars, they can provide much more reliable, accurate and cost-efficient sensing services due to to their equipped more powerful sensors. In this paper, we propose a distributed control framework for energy-efficient and DIstributed VEhicle navigation with chaRging sTations, called “e-Divert”. It is a distributed multi-agent deep reinforcement learning (DRL) solution, which uses a convolutional neural network (CNN) to extract useful spatial features as the input to the actor-critic network to produce a real-time action. Also, e-Divert incorporates a distributed prioritized experience replay for better exploration and exploitation, and a long short-term memory (LSTM) enabled N-step temporal sequence modeling module. The solution fully explores the spatiotemporal nature of the considered scenario for better vehicle cooperation and competition between themselves and charging stations, to maximize the energy efficiency, data collection ratio, geographic fairness, and minimize the energy consumption simultaneously. Through extensive simulations, we find an appropriate set of hyperparameters that achieve the best performance, i.e., 5 actors in Ape-X architecture, priority exponent 0.5, and LSTM sequence length 3. Finally, we compare with four baselines including one state-of-the-art approach MADDPG. Results show that our proposed e-Divert significantly improves the energy efficiency, as compared to MADDPG, by 3.62 and 2.36 times on average when varying different numbers of vehicles and charging stations, respectively.
Chi Harold Liu, Zipeng Dai, Yinuo Zhao, Jon Crowcroft, Dapeng Oliver Wu, Kin K. Leung
IEEE Trans. Mob. Comput.3
2020 Curiosity-Driven Energy-Efficient Worker Scheduling in Vehicular Crowdsourcing: A Deep Reinforcement Learning Approach
abstract
Spatial crowdsourcing (SC) utilizes the potential of a crowd to accomplish certain location based tasks. Although worker scheduling has been well studied recently, most existing works only focus on the static deployment of workers but ignore their temporal movement continuity. In this paper, we explicitly consider the use of unmanned vehicular workers, e.g., drones and driverless cars, which are more controllable and can be deployed in remote or dangerous areas to carry on long-term and hash tasks as a vehicular crowdsourcing (VC) campaign. We propose a novel deep reinforcement learning (DRL) approach for curiosity-driven energy-efficient worker scheduling, called "DRL-CEWS", to achieve an optimal trade-off between maximizing the collected amount of data and coverage fairness, and minimizing the overall energy consumption of workers. Specifically, we first utilize a chief-employee distributed computational architecture to stabilize and facilitate the training process. Then, we propose a spatial curiosity model with a sparse reward mechanism to help derive the optimal policy in large crowdsensing space with unevenly distributed data. Extensive simulation results show that DRL-CEWS outperforms the state-of-the-art methods and baselines, and we also visualize the benefits curiosity model brings and show the impact of two hyperparameters.
Chi Harold Liu, Yinuo Zhao, Zipeng Dai, Ye Yuan 0001, Guoren Wang, Dapeng Oliver Wu, Kin K. Leung
ICDE2
2020 Free Market of Multi-Leader Multi-Follower Mobile Crowdsensing: An Incentive Mechanism Design by Deep Reinforcement Learning
abstract
The explosive increase of mobile devices with built-in sensors such as GPS, accelerometer, gyroscope and camera has made the design of mobile crowdsensing (MCS) applications possible, which create a new interface between humans and their surroundings. Until now, various MCS applications have been designed, where the task initiators (TIs) recruit mobile users (MUs) to complete the required sensing tasks. In this paper, deep reinforcement learning (DRL) based techniques are investigated to address the problem of assigning satisfactory but profitable amount of incentives to multiple TIs and MUs as a MCS game. Specifically, we first formulate the problem as a multi-leader and multi-follower Stackelberg game, where TIs are the leaders and MUs are the followers. Then, the existence of the Stackelberg Equilibrium (SE) is proved. Considering the challenge to compute the SE, a DRL based Dynamic Incentive Mechanism (DDIM) is proposed. It enables the TIs to learn the optimal pricing strategies directly from game experiences without knowing the private information of MUs. Finally, numerical experiments are provided to illustrate the effectiveness of the proposed incentive mechanism compared with both state-of-the-art and baseline approaches.
Yufeng Zhan, Chi Harold Liu, Yinuo Zhao, Jiang Zhang 0003, Jian Tang 0008
IEEE Trans. Mob. Comput.3