VLDB 2026 Research / reviewers in the wild / expert
Chengbo Zang
dblp:376/9750
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0008-7413-7217ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
1 paper |
Reinforcement learning · 70% Trustworthy machine learning · 23% Image recognition and object detection · 7% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
adaptive data collection |
0.9 | 1 | 2025 | Adaptive Data Collection for Robust Learning Across Multiple Distributions · ICML 2025 |
Machine learning › Reinforcement learning › bandit
bandit learning |
0.9 | 1 | 2025 | Adaptive Data Collection for Robust Learning Across Multiple Distributions · ICML 2025 |
Machine learning › Reinforcement learning
multi-armed bandit |
0.9 | 1 | 2025 | Adaptive Data Collection for Robust Learning Across Multiple Distributions · ICML 2025 |
Machine learning › Trustworthy machine learning › robustness
robust learning |
0.9 | 1 | 2025 | Adaptive Data Collection for Robust Learning Across Multiple Distributions · ICML 2025 |
Computer vision › Image recognition and object detection
object detection |
0.3 | 1 | 2025 | Adaptive Data Collection for Robust Learning Across Multiple Distributions · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
upper-confidence-bound sampling · 0.9online gradient descent · 0.9minimax regret analysis · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | AI-Powered CPS-Enabled Vulnerable-User-Aware Urban Transportation Digital Twin: Methods and ApplicationsabstractWe present methods and applications for the development of digital twins (DT) for urban traffic management. While the majority of studies on the DT focus on its “eyes,” which is the emerging sensing and perception like object detection and tracking, what really distinguishes the DT from a traditional simulator lies in its “brain,” the prediction and decision making capabilities of extracting patterns and making informed decisions from what has been seen and perceived. In order to add value to urban transportation management, DTs need to be powered by artificial intelligence and complement with low-latency high-bandwidth sensing and networking technologies, in other words, cyberphysical systems. This paper can be a pointer to help researchers and practitioners identify challenges and opportunities for the development of DTs; a bridge to initiate conversations across disciplines; and a road map to exploiting potentials of DTs for diverse urban transportation applications. Yongjie Fu, Mehmet Kerem Türkcan, Mahshid Ghasemi, Zhaobin Mo, Chengbo Zang, Abhishek Adhikari, Zoran Kostic, Gil Zussman, Xuan Di |
IEEE Trans. Intell. Transp. Syst. | 5 |
| 2025 | Adaptive Data Collection for Robust Learning Across Multiple DistributionsabstractWe propose a framework for adaptive data collection aimed at robust learning in multi-distribution scenarios under a fixed data collection budget. In each round, the algorithm selects a distribution source to sample from for data collection and updates the model parameters accordingly. The objective is to find the model parameters that minimize the expected loss across all the data sources. Our approach integrates upper-confidence-bound (UCB) sampling with online gradient descent (OGD) to dynamically collect and annotate data from multiple sources. By bridging online optimization and multi-armed bandits, we provide theoretical guarantees for our UCB-OGD approach, demonstrating that it achieves a minimax regret of $O(T^{\frac{1}{2}}(K\ln T)^{\frac{1}{2}})$ over $K$ data sources after $T$ rounds. We further provide a lower bound showing that the result is optimal up to a $\ln T$ factor. Extensive evaluations on standard datasets and a real-world testbed for object detection in smart-city intersections validate the consistent performance improvements of our method compared to baselines such as random sampling and various active learning methods. Chengbo Zang, Mehmet Kerem Türkcan, Gil Zussman, Zoran Kostic, Javad Ghaderi |
ICML | 1 |