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.

Brian Yang

dblp:91/9437 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1Graphics, 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
2 papers
Motion planning and robot control · 46% Autonomous driving · 25% Generative modeling · 13%
Human-computer interaction and pervasive computing
1 paper
Games and playful interaction · 100%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

Topics — the 9 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › motion planning
closed-loop planning
0.812024
Tractable Joint Prediction and Planning over Discrete Behavior Modes for Urban Driving · ICRA 2024
Robotics › Motion planning and robot control › motion planning › learning-based motion planning
diffusion-based trajectory planning
0.812024
Diffusion-ES: Gradient-Free Planning with Diffusion for Autonomous and Instruction-Guided Driving · CVPR 2024
Machine learning › Generative modeling
diffusion model
0.812024
Diffusion-ES: Gradient-Free Planning with Diffusion for Autonomous and Instruction-Guided Driving · CVPR 2024
Machine learning › Optimization for machine learning › evolutionary computation
genetic algorithms
0.812024
Diffusion-ES: Gradient-Free Planning with Diffusion for Autonomous and Instruction-Guided Driving · CVPR 2024
Robotics › Autonomous driving
planning for self-driving vehicles
0.812024
Diffusion-ES: Gradient-Free Planning with Diffusion for Autonomous and Instruction-Guided Driving · CVPR 2024
Robotics › Motion planning and robot control
trajectory optimization
0.812024
Diffusion-ES: Gradient-Free Planning with Diffusion for Autonomous and Instruction-Guided Driving · CVPR 2024
Robotics › Autonomous driving
trajectory prediction
0.812024
Tractable Joint Prediction and Planning over Discrete Behavior Modes for Urban Driving · ICRA 2024
Robotics › Motion planning and robot control › robot control
model-based control
0.212024
Tractable Joint Prediction and Planning over Discrete Behavior Modes for Urban Driving · ICRA 2024
Robotics › Motion planning and robot control
motion planning
0.212024
Tractable Joint Prediction and Planning over Discrete Behavior Modes for Urban Driving · ICRA 2024

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

thematic analysis · 2.0large language model parsing · 2.0multimodal trajectory forecasting · 0.8gradient-free optimization · 0.8evolutionary search · 0.8diffusion model · 0.8autoregressive closed-loop models · 0.8anchor embedding · 0.8LLM prompting · 0.8
YearPublicationVenuePosition
2026 Deconstructing Open-World Game Mission Design Formula: A Thematic Analysis Using an Action-Block Framework
abstract
Open-world missions often rely on repeated formulas, yet designers lack systematic ways to examine pacing, variation, and experiential balance across large portfolios. We introduce the Mission Action Quality Vector (MAQV), a six-dimensional framework—covering combat, exploration, narrative, emotion, problem-solving, and uniqueness—paired with an action block grammar representing missions as gameplay sequences. Using about 2200 missions from 20 AAA titles, we apply LLM-assisted parsing to convert community walkthroughs into structured action sequences and score them with MAQV. An interactive dashboard enables designers to reveal underlying mission formulas. In a mixed-methods study with experienced players and designers, we validate the pipeline’s fidelity and the tool’s usability, and use thematic analysis to identify recurring design trade-offs, pacing grammars, and systematic differences by quest type and franchise evolution. Our work offers a reproducible analytical workflow, a data-driven visualization tool, and reflective insights to support more balanced, varied mission design at scale.
Kaijie Xu 0002, Brian Yang, Clark Verbrugge
CHI3
2024 Diffusion-ES: Gradient-Free Planning with Diffusion for Autonomous and Instruction-Guided Driving
abstract
Diffusion models excel at modeling complex and multi-modal trajectory distributions for decision-making and control. Reward-gradient guided denoising has been recently proposed to generate trajectories that maximize both a differentiable reward function and the likelihood under the data distribution captured by a diffusion model. Reward-gradient guided denoising requires a differentiable reward function fitted to both clean and noised samples, limiting its applicability as a general trajectory optimizer. In this paper, we propose Diffusion-ES, a method that combines gradient-free optimization with trajectory denoising to optimize black-box non-differentiable objectives while staying in the data manifold. Diffusion-ES samples trajectories during evolutionary search from a diffusion model and scores them using a black-box reward function. It mutates high-scoring trajecto-ries using a truncated diffusion process that applies a small number of noising and denoising steps, allowing for much more efficient exploration of the solution space. We show that Diffusion-Ex achieves state-of-the-art performance on nuPlan, an established closed-loop planning benchmark for autonomous driving. Diffusion-ES outperforms existing sampling-based planners, reactive deterministic or diffusion-based policies, and reward-gradient guidance. Additionally, we show that unlike prior guidance methods, our method can optimize non-differentiable language-shaped reward functions generated by few-shot LLM prompting. When guided by a human teacher that issues instructions to follow, our method can generate novel, highly complex behaviors, such as aggressive lane weaving, which are not present in the training data. This allows us to solve the hardest nuPlan scenarios which are beyond the capabilities of existing tra-jectory optimization methods and driving policies.11Project page: diffusion-es.github.io
Brian Yang, Huangyuan Su, Nikolaos Gkanatsios, Tsung-Wei Ke, Jeff G. Schneider, Katerina Fragkiadaki
CVPR1
2024 Increasing Adversarial Robustness Around Uncertain Boundary Regions with Amodal Segmentation
abstract
Adversarial perturbations in object recognition and image classification tasks impact a learning model's ability to perform accurately and increase the safety risks of deployed machine learning models. During the adversarial example generation process, adversaries approach areas most prone to model uncertainty. Identifying partially occluded items, especially without understanding general object shapes, contributes to significant model uncertainty since object boundaries are not inherently at the forefront of the feature generalization process in deep learning models. Thus, this work aims to reduce model uncertainty surrounding partially occluded boundaries and increase adversarial robustness by augmenting the training dataset with amodal segmentation boundary masks. By observing performance degradation, robust sensitivity, and loss sensitivity, we show how including these masks during training impacts an adversary's ability to generate effective adversarial examples on the versatile MS COCO dataset. Lastly, we observe how including these masks during training influences the performance of adversarial training.
Sheila Alemany, Niki Pissinou, Brian Yang
ICMLA3
2024 Tractable Joint Prediction and Planning over Discrete Behavior Modes for Urban Driving
abstract
Significant progress has been made in training multimodal trajectory forecasting models for autonomous driving. However, effectively integrating these models with downstream planners and model-based control approaches is still an open problem. Although these models have conventionally been evaluated for open-loop prediction, we show that they can be used to parameterize autoregressive closed-loop models without retraining. We consider recent trajectory prediction approaches which leverage learned anchor embeddings to predict multiple trajectories, finding that these anchor embeddings can parameterize discrete and distinct modes representing high-level driving behaviors. We propose to perform fully reactive closed-loop planning over these discrete latent modes, allowing us to tractably model the causal interactions between agents at each step. We validate our approach on a suite of more dynamic merging scenarios, finding that our approach avoids the frozen robot problem which is pervasive in conventional planners. Our approach also outperforms the previous state-of-the-art in CARLA on challenging dense traffic scenarios when evaluated at realistic speeds.
Adam Villaflor, Brian Yang, Huangyuan Su, Katerina Fragkiadaki, John M. Dolan, Jeff G. Schneider
ICRA2
2020 Mechanisms of Behavioral Contagion: An Approximate Bayesian Approach
abstract
Researchers have proposed that contagion processes govern how information and behavior itself spreads through social networks. Empirical evidence for such contagion often makes unjustified, but implicit assumptions about the mechanisms underlying contagion. Here, we present an approximate Bayesian method that uses empirical data to draw inferences about the underlying mechanisms. We provide initial validation of our approach in three simulation experiments, each investigating how a real-world factor (e.g., noise) impacts inferential accuracy.
Christian C. Luhmann, Brian Yang
ASONAM2