Demo Data from EDBT 2026 / reviewers in the wild / expert
Chungang Lin
dblp:174/3936
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2026
0009-0005-5094-3140ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 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 |
Efficient and distributed learning · 52% Trustworthy machine learning · 19% Language models and text generation · 14% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
federated learning |
1.0 | 1 | 2026 | Heterogeneity-Oblivious Robust Federated Learning · INFOCOM 2026 |
Natural language and speech › Language models and text generation › machine-generated text detection
LLM-generated text detection |
1.0 | 1 | 2026 | SpecDetect: Simple, Fast, and Training-Free Detection of LLM-Generated Text via Spectral Analysis · AAAI 2026 |
Machine learning › Efficient and distributed learning › federated learning › heterogeneous federated learning
model heterogeneity |
1.0 | 1 | 2026 | Heterogeneity-Oblivious Robust Federated Learning · INFOCOM 2026 |
Machine learning › Trustworthy machine learning › robustness
poisoning attack defense |
1.0 | 1 | 2026 | Heterogeneity-Oblivious Robust Federated Learning · INFOCOM 2026 |
Machine learning › Efficient and distributed learning › federated learning
robust federated learning |
1.0 | 1 | 2026 | Heterogeneity-Oblivious Robust Federated Learning · INFOCOM 2026 |
Machine learning › Learning theory
spectral analysis |
1.0 | 1 | 2026 | SpecDetect: Simple, Fast, and Training-Free Detection of LLM-Generated Text via Spectral Analysis · AAAI 2026 |
Machine learning › Trustworthy machine learning
interpretability |
0.3 | 1 | 2026 | SpecDetect: Simple, Fast, and Training-Free Detection of LLM-Generated Text via Spectral Analysis · AAAI 2026 |
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
low-rank adaptation |
0.3 | 1 | 2026 | Heterogeneity-Oblivious Robust Federated Learning · INFOCOM 2026 |
Machine learning › Efficient and distributed learning › federated learning
model aggregation |
0.3 | 1 | 2026 | Heterogeneity-Oblivious Robust Federated Learning · INFOCOM 2026 |
Methods — techniques the papers use, named apart from their topics
spectral energy · 1.0short-time fourier transform · 1.0projection-aware aggregation · 1.0poisoning score · 1.0low-rank adaptation · 1.0discrete fourier transform · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | SpecDetect: Simple, Fast, and Training-Free Detection of LLM-Generated Text via Spectral AnalysisabstractThe proliferation of high-quality text from Large Language Models (LLMs) demands reliable and efficient detection methods. While existing training-free approaches show promise, they often rely on surface-level statistics and overlook fundamental signal properties of the text generation process. In this work, we reframe detection as a signal processing problem, introducing a novel paradigm that analyzes the sequence of token log-probabilities in the frequency domain. By systematically analyzing the signal's spectral properties using the global Discrete Fourier Transform (DFT) and the local Short-Time Fourier Transform (STFT), we find that human-written text consistently exhibits significantly higher spectral energy. This higher energy reflects the larger-amplitude fluctuations inherent in human writing compared to the suppressed dynamics of LLM-generated text. Based on this key insight, we construct SpecDetect, a detector built on a single, robust feature from the global DFT: DFT total energy. We also propose an enhanced version, SpecDetect++, which incorporates a sampling discrepancy mechanism to further boost robustness. Extensive experiments show that our approach outperforms the state-of-the-art model while running in nearly half the time. Our work introduces a new, efficient, and interpretable pathway for LLM-generated text detection, showing that classical signal processing techniques offer a surprisingly powerful solution to this modern challenge. Haitong Luo, Weiyao Zhang, Suhang Wang, Wenji Zou, Chungang Lin, Xuying Meng, Yujun Zhang 0001 |
AAAI | 5 |
| 2026 | Heterogeneity-Oblivious Robust Federated LearningabstractFederated Learning (FL) remains highly vulnerable to poisoning attacks, especially under real-world hyper-heterogeneity, where clients differ significantly in data distributions, communication capabilities, and model architectures. Such heterogeneity not only undermines the effectiveness of aggregation strategies but also makes attacks more difficult to detect. Furthermore, high-dimensional models expand the attack surface. To address these challenges, we propose Horus, a heterogeneity-oblivious robust FL framework centered on low-rank adaptations (LoRAs). Rather than aggregating full model parameters, Horus inserts LoRAs into empirically stable layers and aggregates only LoRAs to reduce the attack uncover a key empirical observation that the input projection (LoRA-A) is markedly more stable than the output projection (LoRA-B) under heterogeneity and poisoning. Leveraging this, we design a Heterogeneity-Oblivious Poisoning Score using the features from LoRA-A to filter poisoned clients. For the remaining benign clients, we propose projection-aware aggregation mechanism to preserve collaborative signals while suppressing drifts, which reweights client updates by consistency with the global directions. Extensive experiments across diverse datasets, model architectures, and attacks demonstrate that Horus consistently outperforms state-of-the-art baselines in both robustness and accuracy. Weiyao Zhang, Chungang Lin, Haitong Luo, Xuying Meng |
INFOCOM | 5 |
| 2025 | TraGe: A Generic Packet Representation for Traffic Classification Based on Header-Payload DifferencesabstractTraffic classification has a significant impact on maintaining the Quality of Service (QoS) of the network. Since traditional methods heavily rely on feature extraction and largescale labeled data, some recent pre-trained models manage to reduce the dependency by utilizing different pre-training tasks to train generic representations for network packets. However, existing pre-trained models typically adopt pre-training tasks developed for image or text data, which are not tailored to traffic data. As a result, the obtained traffic representations fail to fully reflect the information contained in the traffic, and may even disrupt the protocol information. To address this, we propose TraGe, a novel generic packet representation model for traffic classification. Based on the differences between the header and payload-the two fundamental components of a network packetwe perform differentiated pre-training according to the byte sequence variations (continuous in the header vs. discontinuous in the payload). A dynamic masking strategy is further introduced to prevent overfitting to fixed byte positions. Once the generic packet representation is obtained, TraGe can be finetuned for diverse traffic classification tasks using limited labeled data. Experimental results demonstrate that TraGe significantly outperforms state-of-the-art methods on two traffic classification tasks, with up to a 6.97% performance improvement. Moreover, TraGe exhibits superior robustness under parameter fluctuations and variations in sampling configurations. Chungang Lin, Yilong Jiang, Weiyao Zhang, Xuying Meng, Tianyu Zuo, Yujun Zhang 0001 |
IWQoS | 1 |
| 2025 | Accelerating traffic engineering optimization for segment routing: A recommendation perspective
Linghao Wang, Miao Wang 0007, Chungang Lin, Yujun Zhang 0001 |
Comput. Networks | 3 |