Demo Data from EDBT 2026 / reviewers in the wild / expert
Youtong Shi
dblp:415/4797
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 |
Trustworthy machine learning · 67% 3D vision · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › robustness › adversarial robustness › 3d adversarial examples
adversarial point cloud |
0.9 | 1 | 2025 | RDPA: Real-Time Distributed-Concentrated Penetration Attack for Point Cloud Learning · IJCAI 2025 |
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.9 | 1 | 2025 | RDPA: Real-Time Distributed-Concentrated Penetration Attack for Point Cloud Learning · IJCAI 2025 |
Computer vision › 3D vision › point cloud analysis
point cloud learning |
0.9 | 1 | 2025 | RDPA: Real-Time Distributed-Concentrated Penetration Attack for Point Cloud Learning · IJCAI 2025 |
Methods — techniques the papers use, named apart from their topics
multi-scale penetration loss · 0.9distributed-concentrated point selection · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | RDPA: Real-Time Distributed-Concentrated Penetration Attack for Point Cloud LearningabstractPartial point attack approaches focus on leveraging the fewest points to achieve the best attack efficiency for easy implementation in the physical domain. For the first time, this paper proposes that the partial point attack strategy should pay attention to not only the selection and disturbance of points, but also the penetration of current defense methods. By re-examining characteristics of previous partial point attack approaches leading to performance improvement, we discover two fundamental principles: first, the selection of attacked points should consider not only the favourable visual salience but also the proper position concentration, thus to acquire effective structural destruction on the basis of remaining imperceptible; second, the perturbation of target points should form meaningful structures rather than outliers. To achieve this, we first propose a novel distributed-concentrated point selection (DPS) strategy, which is easier to concentrate salient points containing rich local information in a few tiny regions. Additionally, to enhance the penetration efficacy and real-time performance of attack point clouds against defenses, we further design a perturbation network based on the multi-scale penetration loss (L_msp), which can generate adversarial samples with as few outliers as possible only through a single forward propagation. Experimental results demonstrate that the real-time distributed-concentrated penetration attack (RDPA) framework can achieve state-of-the-art (SOTA) success rates by perturbing only 3.5% of points, and have the best penetration for mainstream defense methods such as SRS and SOR. Youtong Shi, Lixin Chen, Chenhui Yang, Cheng Wang 0003 |
IJCAI | 1 |