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

Laura Yu Zheng

dblp:285/3002 · also Laura Y. Zheng · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1

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
Reinforcement learning · 35% Trustworthy machine learning · 31% Segmentation and scene understanding · 15%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
data augmentation
0.912025
Adaptive Sensitivity Analysis for Robust Augmentation against Natural Corruptions in Image Segmentation · ICML 2025
Computer vision › Segmentation and scene understanding
image segmentation
0.912025
Adaptive Sensitivity Analysis for Robust Augmentation against Natural Corruptions in Image Segmentation · ICML 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
Adaptive Sensitivity Analysis for Robust Augmentation against Natural Corruptions in Image Segmentation · ICML 2025
Machine learning › Trustworthy machine learning › robustness
robustness to corruption
0.912025
Adaptive Sensitivity Analysis for Robust Augmentation against Natural Corruptions in Image Segmentation · ICML 2025
Machine learning › Reinforcement learning › policy optimization
policy gradient
0.712023
Gradient Informed Proximal Policy Optimization · NeurIPS 2023
Machine learning › Reinforcement learning
policy optimization
0.712023
Gradient Informed Proximal Policy Optimization · NeurIPS 2023
Machine learning › Reinforcement learning › policy optimization
proximal policy optimization
0.712023
Gradient Informed Proximal Policy Optimization · NeurIPS 2023

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

sensitivity analysis · 0.9α-policy · 0.7proximal policy optimization · 0.7analytical gradient · 0.7
YearPublicationVenuePosition
2025 Adaptive Sensitivity Analysis for Robust Augmentation against Natural Corruptions in Image Segmentation
abstract
Achieving robustness in image segmentation models is challenging due to the fine-grained nature of pixel-level classification. These models, which are crucial for many real-time perception applications, particularly struggle when faced with natural corruptions in the wild for autonomous systems. While sensitivity analysis can help us understand how input variables influence model outputs, its application to natural and uncontrollable corruptions in training data is computationally expensive. In this work, we present an adaptive, sensitivity-guided augmentation method to enhance robustness against natural corruptions. Our sensitivity analysis on average runs 10 times faster and requires about 200 times less storage than previous sensitivity analysis, enabling practical, on-the-fly estimation during training for a model-free augmentation policy. With minimal fine-tuning, our sensitivity-guided augmentation method achieves improved robustness on both real-world and synthetic datasets compared to state-of-the-art data augmentation techniques in image segmentation.
Laura Yu Zheng, Wenjie Wei, Jacob Clements, Shreelekha Revankar, Andre Harrison, Ming C. Lin
ICML1
2023 Gradient Informed Proximal Policy Optimization
abstract
We introduce a novel policy learning method that integrates analytical gradients from differentiable environments with the Proximal Policy Optimization (PPO) algorithm. To incorporate analytical gradients into the PPO framework, we introduce the concept of an α-policy that stands as a locally superior policy. By adaptively modifying the α value, we can effectively manage the influence of analytical policy gradients during learning. To this end, we suggest metrics for assessing the variance and bias of analytical gradients, reducing dependence on these gradients when high variance or bias is detected. Our proposed approach outperforms baseline algorithms in various scenarios, such as function optimization, physics simulations, and traffic control environments. Our code can be found online: https://github.com/SonSang/gippo.
Sanghyun Son 0003, Laura Yu Zheng, Ryan Sullivan, Yi-Ling Qiao, Ming C. Lin
NeurIPS2
2020 Enhanced Transfer Learning for Autonomous Driving with Systematic Accident Simulation
abstract
Simulation data can be utilized to extend real-world driving data in order to cover edge cases, such as vehicle accidents. The importance of handling edge cases can be observed in the high societal costs in handling car accidents, as well as potential dangers to human drivers. In order to cover a wide and diverse range of all edge cases, we systemically parameterize and simulate the most common accident scenarios. By applying this data to autonomous driving models, we show that transfer learning on simulated data sets provide better generalization and collision avoidance, as compared to random initialization methods. Our results illustrate that information from a model trained on simulated data can be inferred to a model trained on real-world data, indicating the potential influence of simulation data in real world models and advancements in handling of anomalous driving scenarios.
Shivam Akhauri, Laura Yu Zheng, Ming C. Lin
IROS2