Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Songyang Yan

dblp:324/3724 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0003-0628-8642ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 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
Autonomous driving · 28% Motion planning and robot control · 24% Planning, search and constraint satisfaction · 24%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › learning for planning
imitation-based planning
0.912025
Causal Contrastive Learning with Data Augmentations for Imitation-Based Planning · ICRA 2025
Machine learning › Reinforcement learning
imitation learning
0.912025
Causal Contrastive Learning with Data Augmentations for Imitation-Based Planning · ICRA 2025
Robotics › Motion planning and robot control
motion planning
0.912025
Causal Contrastive Learning with Data Augmentations for Imitation-Based Planning · ICRA 2025
Logic in computer science › temporal logic
signal temporal logic
0.312026
ConFixer: Robustness Semantics Based Configuration Bug Fixing for Automated Driving Systems · FM (2) 2026
Logic in computer science
temporal logic
0.312026
ConFixer: Robustness Semantics Based Configuration Bug Fixing for Automated Driving Systems · FM (2) 2026

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

robustness semantics · 3.0gradient-based fine-tuning · 3.0shortcut eliminator · 0.9counterfactual data augmentation · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2026 ConFixer: Robustness Semantics Based Configuration Bug Fixing for Automated Driving Systems
abstract
Abstract Automated Driving Systems (ADSs) coordinate multiple modules (e.g., perception, prediction, planning, and control) and expose a large configuration surface that engineers must tune for different platforms and operational conditions. In industrial practice, misconfigured parameters are a common source of unsafe or law-violating behaviors, yet fixing such configuration bugs remains largely overlooked. Debugging is difficult because parameter effects propagate through long, nonlinear pipelines (often involving learning-based components), and manual trial-and-error provides little guidance in high-dimensional spaces while risking regressions in previously passing scenarios. We propose ConFixer , an automated approach for repairing ADS configuration bugs against formal correctness specifications, including traffic laws encoded in signal temporal logic (STL). ConFixer uses robustness semantics to derive gradient-like signals that localize bug-relevant parameters and guide fine-tuning toward compliance. To support adoption in scenario-based validation workflows, ConFixer evaluates candidate fixes on large scenario suites and prioritizes regression-safe solutions. Our evaluation on Baidu Apollo with the LGSVL simulator shows that ConFixer fixes 173 configuration bugs without introducing regressions.
Xiaodong Zhang 0014, Songyang Yan, Zijiang Yang 0004
FM (2)2
2025 Causal Contrastive Learning with Data Augmentations for Imitation-Based Planning
abstract
Motion planning is a difficult task, especially when generating feasible future trajectories in complex and interactive scenarios. While recent advancements in imitation-based planning have shown significant progress, this approach often encounters causal confusion in dynamic traffic environments. This confusion will cause the planner to incorrectly associate certain actions with outcomes, leading to suboptimal or unsafe plans. To address this, we introduce a novel framework called$\overline{C}^{2}L$, which improves the planner's latent Causal understanding by incorporating Contrastive Learning and counterfactual data augmentation. Additionally, we propose a shortcut eliminator to extract copycat-free features from history states, reducing the impact of temporal spurious correlations. We validate our method on the nuPlan and interPlan benchmarks, with extensive experiments demonstrating that$C^{2}L$delivers highly competitive performance compared to state-of-the-art methods.
Haojie Xin, Xiaodong Zhang 0036, Songyang Yan, Jun Sun 0001, Zijiang Yang 0006
ICRA3