Haozhe Lei

Haozhe Lei

Auto-generated profile, based on publicly available information

Haozhe Lei

Department of Electrical and Computer Engineering, New York University, Brooklyn, NY, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 August 2024 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
TLTao Li
Tao Li
ZBZilin Bian
Zilin Bian
HLHaozhe Lei
Haozhe Lei
FZFan Zuo
Fan Zuo
YYYa-Ting Yang
Ya-Ting Yang
KOKaan Ozbay
Kaan Ozbay

29 September 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
YYYa-Ting Yang
Ya-Ting Yang
HLHaozhe Lei
Haozhe Lei
Quanyan  ZhuQuanyan Zhu
Quanyan Zhu
Leveraging recent advances in wireless communication, IoT, and AI, intelligent transportation systems (ITS) played an important role in reducing traffic congestion and enhancing user experience. Within ITS, navigational recommendation systems (NRS) are essential for helping users simplify route choices in urban environments. However, NRS are vulnerable to information-based attacks that can manipulate both the NRS and users to achieve the objectives of the malicious entities. This study aims to assess the risks of misinformed demand attacks, where attackers use techniques like Sybil-based attacks to manipulate the demands of certain origins and destinations considered by the NRS. We propose a game-theoretic framework for proactive risk assessment of demand attacks (PRADA) and treat the interaction between attackers and the NRS as a Stackelberg game. Specifically, we consider the case of local-targeted attacks, in which the attacker aims to make the NRS recommend the authentic users towards a specific road that favors certain groups. Our analysis unveils the equivalence between users’ incentive compatibility and Wardrop equilibrium recommendations and shows that the NRS and its users are at high risk when encountering intelligent attackers who can significantly alter user routes by strategically fabricating non-existent demands. To mitigate these risks, we introduce a trust mechanism that leverages users’ confidence in the integrity of the NRS, and show that it can effectively reduce the impact of misinformed demand attacks. Numerical experiments are used to corroborate the results and support our discussion of the Resilience Paradox, where locally targeted attacks can sometimes benefit the overall traffic conditions. Our framework not only assists risk assessment in automating the evaluation process and estimating potential impacts but also aligns with standards like ISO/IEC 27005, offering a proactive approach to managing risks in ITS.

25 May 2026 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
ZPZhaoye Pan
Zhaoye Pan
HLHaozhe Lei
Haozhe Lei
FZFan Zuo
Fan Zuo
ZBZilin Bian
Zilin Bian
TLTao Li
Tao Li
This paper studies distributed online convex optimization with time-varying coupled constraints, motivated by distributed online control in network systems. Most prior work assumes a separability condition: the global objective and coupled constraint functions are sums of local costs and individual constraints. In contrast, we study a group of agents, networked via a communication graph, that collectively select actions to minimize a sequence of nonseparable global cost functions and satisfy nonseparable long-term constraints, using full-information feedback and intra-agent communication. We propose a distributed online primal-dual belief consensus (DOPBC) algorithm, where each agent maintains and updates beliefs about the joint decisions and joint Lagrangian multipliers, which are repeatedly exchanged with neighboring agents. Under this belief-sharing protocol, DOPBC yields sublinear regret and cumulative constraint violation (CCV) bounds, both in O(Tmax{1–c, c}), where T denotes the time horizon, and c is a hyperparameter controlling step sizes. Such a result matches the lower bound of online constrained convex optimization when setting c = 1/2, indicating the online learning efficiency under nonseparability at the cost of communication overhead.