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

Luan Yang

dblp:251/1477 · DBLP profile ↗
← Back
3ranked-venue papers
1as 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 · 2 · 1 first-author · 2 since 2021Computer networks · 1

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
1 paper
Motion planning and robot control · 50% Reinforcement learning · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › control systems
event-triggered control
0.912025
Neural Event-Triggered Control with Optimal Scheduling · ICML 2025
Robotics › Motion planning and robot control › robot control
neural network controller
0.812024
FESSNC: Fast Exponentially Stable and Safe Neural Controller · ICML 2024
Machine learning › Reinforcement learning
stochastic control
0.812024
FESSNC: Fast Exponentially Stable and Safe Neural Controller · ICML 2024

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

projection operation · 0.9path integral algorithm · 0.9monte carlo algorithm · 0.9projection operator · 0.8neural network · 0.8hutchinson's trace estimator · 0.8
YearPublicationVenuePosition
2025 Neural Event-Triggered Control with Optimal Scheduling
abstract
Learning-enabled controllers with stability certificate functions have demonstrated impressive empirical performance in addressing control problems in recent years. Nevertheless, directly deploying the neural controllers onto actual digital platforms requires impractically excessive communication resources due to a continuously updating demand from the closed-loop feedback controller. We introduce a framework aimed at learning the event-triggered controller (ETC) with optimal scheduling, i.e., minimal triggering times, to address this challenge in resource-constrained scenarios. Our proposed framework, denoted by Neural ETC, includes two practical algorithms: the path integral algorithm based on directly simulating the event-triggered dynamics, and the Monte Carlo algorithm derived from new theoretical results regarding lower bound of inter-event time. Furthermore, we propose a projection operation with an analytical expression that ensures theoretical stability and schedule optimality for Neural ETC. Compared to the conventional neural controllers, our empirical results show that the Neural ETC significantly reduces the required communication resources while enhancing the control performance in constrained communication resources scenarios.
Luan Yang, Qunxi Zhu
ICML1
2024 FESSNC: Fast Exponentially Stable and Safe Neural Controller
abstract
In order to stabilize nonlinear systems modeled by stochastic differential equations, we design a Fast Exponentially Stable and Safe Neural Controller (FESSNC) for fast learning controllers. Our framework is parameterized by neural networks, and realizing both rigorous exponential stability and safety guarantees. Concretely, we design heuristic methods to learn the exponentially stable and the safe controllers, respectively, in light of the classical theory of stochastic exponential stability and our established theorem on guaranteeing the almost-sure safety for stochastic dynamics. More significantly, to rigorously ensure the stability and the safety guarantees for the learned controllers, we develop a projection operator, projecting to the space of exponentially-stable and safe controllers. To reduce the highly computational cost for solving the projection operation, approximate projection operators are delicately proposed with closed forms that map the learned controllers to the target controller space. Furthermore, we employ Hutchinson's trace estimator for a scalable unbiased estimate of the Hessian matrix that is used in the projection operator, which thus allows for reducing computational cost and, therefore, can accelerate the training and testing processes. More importantly, our approximate projection operations are applicable to the nonparametric control methods, improving their stability and safety performance. We empirically demonstrate the superiority of the FESSNC over the existing methods.
Luan Yang, Qunxi Zhu
ICML2
2019 Considering Decoy Effect and Fairness Preference: An Incentive Mechanism for Crowdsensing
abstract
Crowdsensing is a system which collects sensing data through recruiting a large number of participants to perform the sensing tasks. It consists of two parts: 1) the platform side and 2) the user side. The incentive mechanism is necessary to recruit a sufficient number of participants for the utility of the platform, and to guarantee the utility of the participants for the users. Current mechanisms for crowdsensing are based on traditional economics with two basic hypotheses. The first is that the preference of people is constant, which implies that their preference for an item does not change under different circumstances; the second is that the utility of people is equal to the payment they obtain. However, decoy effect from behavioral economics shows that people's preferences change as the alternative set changes. And resulting from fairness preference theory, people's utility depends not only on the actual income they receive but also on the fairness of the income of all people. Thus, current incentive mechanisms will lead to users' wrong selection making. To solve these problems, we design the framework for publishing tasks based on decoy effect (FPDE) mechanism on the platform side. And we design the payoff allocation based on fairness preference (PAFP) mechanism for the user side. We compare our mechanisms with a new and advanced mechanism called incentive mechanism for crowdsensing-centric (IMCC) model. The simulations show that FPDE can increase the utility of the platform by approximately 20.8%, and the utility of the users will increases by 14.8% under PAFP.
Deng Li 0001, Luan Yang, Jiaqi Liu 0001, Hui Liu 0008
IEEE Internet Things J.2