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

Jierui Lin

dblp:255/9244 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 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
3 papers
Reinforcement learning · 53% Trustworthy machine learning · 22% Efficient and distributed learning · 11%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › imitation learning › offline imitation learning
behavior cloning
0.922021
Keyframe-Focused Visual Imitation Learning · ICML 2021
Fighting Copycat Agents in Behavioral Cloning from Observation Histories · NeurIPS 2020
Machine learning › Reinforcement learning
imitation learning
0.922021
Keyframe-Focused Visual Imitation Learning · ICML 2021
Fighting Copycat Agents in Behavioral Cloning from Observation Histories · NeurIPS 2020
Machine learning › Efficient and distributed learning
data selection
0.612022
Fighting Fire with Fire: Avoiding DNN Shortcuts through Priming · ICML 2022
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
feature selection
0.612022
Fighting Fire with Fire: Avoiding DNN Shortcuts through Priming · ICML 2022
Machine learning › Trustworthy machine learning
robustness
0.612022
Fighting Fire with Fire: Avoiding DNN Shortcuts through Priming · ICML 2022
Machine learning › Trustworthy machine learning › robustness
shortcut learning
0.612022
Fighting Fire with Fire: Avoiding DNN Shortcuts through Priming · ICML 2022
Machine learning › Reinforcement learning › imitation learning › learning from observation
visual imitation learning
0.512021
Keyframe-Focused Visual Imitation Learning · ICML 2021
Machine learning › Reinforcement learning › imitation learning
causal confusion
0.412020
Fighting Copycat Agents in Behavioral Cloning from Observation Histories · NeurIPS 2020
Machine learning › Deep learning architectures and training
data augmentation
0.212022
Fighting Fire with Fire: Avoiding DNN Shortcuts through Priming · ICML 2022

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

priming · 0.6approximate domain knowledge · 0.6observation history · 0.5keyframe upweighting · 0.5adversarial representation learning · 0.4
YearPublicationVenuePosition
2022 Fighting Fire with Fire: Avoiding DNN Shortcuts through Priming
abstract
Across applications spanning supervised classification and sequential control, deep learning has been reported to find “shortcut” solutions that fail catastrophically under minor changes in the data distribution. In this paper, we show empirically that DNNs can be coaxed to avoid poor shortcuts by providing an additional “priming” feature computed from key input features, usually a coarse output estimate. Priming relies on approximate domain knowledge of these task-relevant key input features, which is often easy to obtain in practical settings. For example, one might prioritize recent frames over past frames in a video input for visual imitation learning, or salient foreground over background pixels for image classification. On NICO image classification, MuJoCo continuous control, and CARLA autonomous driving, our priming strategy works significantly better than several popular state-of-the-art approaches for feature selection and data augmentation. We connect these empirical findings to recent theoretical results on DNN optimization, and argue theoretically that priming distracts the optimizer away from poor shortcuts by creating better, simpler shortcuts.
Chuan Wen, Jianing Qian, Jierui Lin, Jiaye Teng, Dinesh Jayaraman, Yang Gao 0029
ICML3
2021 Keyframe-Focused Visual Imitation Learning
abstract
Imitation learning trains control policies by mimicking pre-recorded expert demonstrations. In partially observable settings, imitation policies must rely on observation histories, but many seemingly paradoxical results show better performance for policies that only access the most recent observation. Recent solutions ranging from causal graph learning to deep information bottlenecks have shown promising results, but failed to scale to realistic settings such as visual imitation. We propose a solution that outperforms these prior approaches by upweighting demonstration keyframes corresponding to expert action changepoints. This simple approach easily scales to complex visual imitation settings. Our experimental results demonstrate consistent performance improvements over all baselines on image-based Gym MuJoCo continuous control tasks. Finally, on the CARLA photorealistic vision-based urban driving simulator, we resolve a long-standing issue in behavioral cloning for driving by demonstrating effective imitation from observation histories. Supplementary materials and code at: \url{https://tinyurl.com/imitation-keyframes}.
Chuan Wen, Jierui Lin, Jianing Qian, Yang Gao 0029, Dinesh Jayaraman
ICML2
2020 Fighting Copycat Agents in Behavioral Cloning from Observation Histories
abstract
Imitation learning trains policies to map from input observations to the actions that an expert would choose. In this setting, distribution shift frequently exacerbates the effect of misattributing expert actions to nuisance correlates among the observed variables. We observe that a common instance of this causal confusion occurs in partially observed settings when expert actions are strongly correlated over time: the imitator learns to cheat by predicting the expert's previous action, rather than the next action. To combat this "copycat problem", we propose an adversarial approach to learn a feature representation that removes excess information about the previous expert action nuisance correlate, while retaining the information necessary to predict the next action. In our experiments, our approach improves performance significantly across a variety of partially observed imitation learning tasks.
Chuan Wen, Jierui Lin, Trevor Darrell, Dinesh Jayaraman, Yang Gao 0029
NeurIPS2