Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yuan Xiao 0003
dblp:152/3962-3
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0009-3166-8007ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 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 |
Trustworthy machine learning · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Software testing · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › robustness
neural network verification |
1.6 | 2 | 2025 | Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation Zone · CVPR 2025 Towards General Robustness Verification of MaxPool-Based Convolutional Neural Networks via Tightening Linear Approximation · CVPR 2024 |
Machine learning › Trustworthy machine learning › verification
robustness verification |
1.6 | 2 | 2025 | Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation Zone · CVPR 2025 Towards General Robustness Verification of MaxPool-Based Convolutional Neural Networks via Tightening Linear Approximation · CVPR 2024 |
Machine learning › Trustworthy machine learning › robustness
certified robustness |
0.9 | 1 | 2025 | Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation Zone · CVPR 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.9 | 1 | 2025 | Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation Zone · CVPR 2025 |
Machine learning › Trustworthy machine learning
certified lower bound |
0.8 | 1 | 2024 | Towards General Robustness Verification of MaxPool-Based Convolutional Neural Networks via Tightening Linear Approximation · CVPR 2024 |
Software testing › system testing › cyber-physical system testing
autonomous driving system testing |
0.8 | 1 | 2024 | CooTest: An Automated Testing Approach for V2X Communication Systems · ISSTA 2024 |
Software testing
metamorphic testing |
0.8 | 1 | 2024 | CooTest: An Automated Testing Approach for V2X Communication Systems · ISSTA 2024 |
Methods — techniques the papers use, named apart from their topics
linear approximation · 1.6abstract interpretation · 0.9metamorphic relations · 0.8guidance strategy · 0.8formal verification · 0.8communication transformation operators · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation ZoneabstractThe robustness of neural network classifiers is important in the safety-critical domain and can be quantified by robustness verification. At present, efficient and scalable verification techniques are always sound but incomplete, and thus, the improvement of verified robustness results is the key criterion to evaluate the performance of incomplete verification approaches. The multi-variate function MaxPool is widely adopted yet challenging to verify. In this paper, we present Ti-Lin, a robustness verifier for MaxPool-based CNNs with Tight Linear Approximation. Following the sequel of minimizing the over-approximation zone of the nonlinear function of CNNs, we are the first to propose the provably neuron-wise tightest linear bounds for the MaxPool function. By our proposed linear bounds, we can certify larger robustness results for CNNs. We evaluate the effectiveness of Ti-Lin on different verification frameworks with open-sourced benchmarks, including LeNet, PointNet, and networks trained on the MNIST, CIFAR-10, Tiny ImageNet and ModelNet40 datasets. Experimental results show that Ti-Lin significantly outperforms the state-of-the-art methods across all networks with up to 78.6% improvement in terms of the certified accuracy with almost the same time consumption as the fastest tool. Our code is available at https://github.com/xiaoyuanpigo/Ti-Lin-Hybrid-Lin. Yuan Xiao 0003, Shiqing Ma, Chunrong Fang, Tongtong Bai, Mingzheng Gu, Yuxin Cheng, Zhenyu Chen 0001 |
CVPR | 1 |
| 2024 | Towards General Robustness Verification of MaxPool-Based Convolutional Neural Networks via Tightening Linear ApproximationabstractThe robustness of convolutional neural networks (CNNs) is vital to modern AI-driven systems. It can be quanti-fied by formal verification by providing a certified lower bound, within which any perturbation does not alter the original input's classification result. It is challenging due to nonlinear components, such as MaxPool. At present, many verification methods are sound but risk losing some precision to enhance efficiency and scalability, and thus, a certified lower bound is a crucial criterion for evaluating the performance of verification tools. In this paper, we present MaxLin, a robustness verifier for MaxPool-based CNNs with tight Linear approximation. By tight-ening the linear approximation of the MaxPool function, we can certify larger certified lower bounds of CNNs. We evaluate MaxLin with open-sourced benchmarks, including LeNet and networks trained on the MNIST, CIFAR-10, and Tiny ImageNet datasets. The results show that MaxLin outperforms state-of-the-art tools with up to 110.60% improvement regarding the certified lower bound and 5.13 × speedup for the same neural networks. Our code is available at https://github.com/xiaoyuanpigo/maxlin. Yuan Xiao 0003, Shiqing Ma, Juan Zhai, Chunrong Fang, Jinyuan Jia 0001, Zhenyu Chen 0001 |
CVPR | 1 |
| 2024 | CooTest: An Automated Testing Approach for V2X Communication SystemsabstractPerceiving the complex driving environment precisely is crucial to the safe operation of autonomous vehicles. With the tremendous advancement of deep learning and communication technology, Vehicle-to-Everything (V2X) collaboration has the potential to address limitations in sensing distant objects and occlusion for a single-agent perception system. However, despite spectacular progress, several communication challenges can undermine the effectiveness of multi-vehicle cooperative perception. The low interpretability of Deep Neural Networks (DNNs) and the high complexity of communication mechanisms make conventional testing techniques inapplicable for the cooperative perception of autonomous driving systems (ADS). Besides, the existing testing techniques, depending on manual data collection and labeling, become time-consuming and prohibitively expensive. In this paper, we design and implement CooTest, the first automated testing tool of the V2X-oriented cooperative perception module. CooTest devises the V2X-specific metamorphic relation and equips communication and weather transformation operators that can reflect the impact of the various cooperative driving factors to produce transformed scenes. Furthermore, we adopt a V2X-oriented guidance strategy for the transformed scene generation process and improve testing efficiency. We experiment CooTest with multiple cooperative perception models with different fusion schemes to evaluate its performance on different tasks. The experiment results show that CooTest can effectively detect erroneous behaviors under various V2X-oriented driving conditions. Also, the results confirm that CooTest can improve detection average precision and decrease misleading cooperation errors by retraining with the generated scenes. An Guo 0002, Zhenyu Chen 0001, Yuan Xiao 0003, Jiakai Liu, Xiuting Ge, Weisong Sun, Chunrong Fang |
ISSTA | 4 |