Leian Chen

dblp:193/7400 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · unresolved

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 first-author

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Network and information security
1 paper
Network security · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed algorithms
asynchronous distributed algorithm
0.812024
Triadic-OCD: Asynchronous Online Change Detection with Provable Robustness, Optimality, and Convergence · ICML 2024
Distributed systems
distributed coordination and fault tolerance
0.812024
Triadic-OCD: Asynchronous Online Change Detection with Provable Robustness, Optimality, and Convergence · ICML 2024
Mathematical optimization
distributed optimization
0.812024
Triadic-OCD: Asynchronous Online Change Detection with Provable Robustness, Optimality, and Convergence · ICML 2024
Network security › intrusion detection and prevention
intrusion detection
0.212024
Triadic-OCD: Asynchronous Online Change Detection with Provable Robustness, Optimality, and Convergence · ICML 2024

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

primal-dual optimization · 2.3non-asymptotic convergence analysis · 2.3
YearPublicationVenuePosition
2024 Triadic-OCD: Asynchronous Online Change Detection with Provable Robustness, Optimality, and Convergence
abstract
The primary goal of online change detection (OCD) is to promptly identify changes in the data stream. OCD problem find a wide variety of applications in diverse areas, e.g., security detection in smart grids and intrusion detection in communication networks. Prior research usually assumes precise knowledge of the system parameters. Nevertheless, this presumption often proves unattainable in practical scenarios due to factors such as estimation errors, system updates, etc. This paper aims to take the first attempt to develop a triadic-OCD framework with certifiable robustness, provable optimality, and guaranteed convergence. In addition, the proposed triadic-OCD algorithm can be realized in a fully asynchronous distributed manner, easing the necessity of transmitting the data to a single server. This asynchronous mechanism could also mitigate the straggler issue that faced by traditional synchronous algorithm. Moreover, the non-asymptotic convergence property of Triadic-OCD is theoretically analyzed, and its iteration complexity to achieve an $\epsilon$-optimal point is derived. Extensive experiments have been conducted to elucidate the effectiveness of the proposed method.
Yancheng Huang, Kai Yang 0001, Zelin Zhu, Leian Chen
ICML4
2016 Robust Cooperative Wi-Fi Fingerprint-Based Indoor Localization
abstract
Wi-Fi fingerprint-based localization has attracted significant research interest recently. Previous works in this area mainly focus on locating an individual user, whereas the additional assistance from peer-to-peer interactions has not been fully exploited. In this paper, we propose a cooperative localization method which not only utilizes the initial results by the fingerprint-based algorithm but also takes into account the physical constraint of pairwise distances to refine the localization estimates for multiple users simultaneously. The experimental results demonstrate that our algorithm is robust against the ranging error and the outdated fingerprint database. With the proposed peer selection scheme, it considerably improves localization accuracy. We further extend our framework to single-user motion tracking and localization based only on access-point-connectivity data.
Leian Chen, Kai Yang 0001, Xiaodong Wang 0001
IEEE Internet Things J.1