paper-with-me

홈 › Papers

Learning to Drive by Observing the Best and Synthesizing the Worst

2019-05-01 · ICLR 2019 5 · Mayank Bansal, Alex Krizhevsky, Abhijit Ogale

Our goal is to train a policy for autonomous driving via imitation learning that is robust enough to drive a real vehicle. We find that standard behavior cloning is insufficient for handling complex driving scenarios, even when we leverage a perception system for preprocessing the input and a controller for executing the output on the car: 30 million examples are still not enough. We propose exposing the learner to synthesized data in the form of perturbations to the expert's driving, which creates interesting situations such as collisions and/or going off the road. Rather than purely imitating all data, we augment the imitation loss with additional losses that penalize undesirable events and encourage progress -- the perturbations then provide an important signal for these losses and lead to robustness of the learned model. We show that the model can handle complex situations in simulation, and present ablation experiments that emphasize the importance of each of our proposed changes and show that the model is responding to the appropriate causal factors. Finally, we demonstrate the model driving a car in the real world ( https://sites.google.com/view/learn-to-drive ).

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Autonomous DrivingImitation Learning

Similar Papers 제목 키워드 기반

ChauffeurNet: Learning to Drive by Imitating the Best and Synthesizing the Worst

2018-12-07 · Mayank Bansal, Alex Krizhevsky, Abhijit Ogale

Our goal is to train a policy for autonomous driving via imitation learning that is robust enough to drive a real vehicle. We find that standard behavior cloning is insufficient for handling complex driving scenarios, ev…

Autonomous DrivingImitation Learning

A data-driven approach to beating SAA out-of-sample

2021-05-26 · Jun-Ya Gotoh, Michael Jong Kim, Andrew E. B. Lim

While solutions of Distributionally Robust Optimization (DRO) problems can sometimes have a higher out-of-sample expected reward than the Sample Average Approximation (SAA), there is no guarantee. In this paper, we intro…

The Value of Reward Lookahead in Reinforcement Learning

2024-03-18 · Nadav Merlis, Dorian Baudry, Vianney Perchet

In reinforcement learning (RL), agents sequentially interact with changing environments while aiming to maximize the obtained rewards. Usually, rewards are observed only after acting, and so the goal is to maximize the e…

Offline RLreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Path Integral Methods for Synthesizing and Preventing Stealthy Attacks in Nonlinear Cyber-Physical Systems

2025-04-23 · Apurva Patil, Kyle Morgenstein, Luis Sentis, Takashi Tanaka

This paper studies the synthesis and mitigation of stealthy attacks in nonlinear cyber-physical systems (CPS). To quantify stealthiness, we employ the Kullback-Leibler (KL) divergence, a measure rooted in hypothesis test…

Simple data balancing achieves competitive worst-group-accuracy

2021-10-27 · Badr Youbi Idrissi, Martin Arjovsky, Mohammad Pezeshki, David Lopez-Paz

We study the problem of learning classifiers that perform well across (known or unknown) groups of data. After observing that common worst-group-accuracy datasets suffer from substantial imbalances, we set out to compare…

Model SelectionOut-of-Distribution Generalization