Papers › End to End Learning for Self-Driving Cars
End to End Learning for Self-Driving Cars
Mariusz Bojarski, Davide Del Testa, Daniel Dworakowski, Bernhard Firner, Beat Flepp, Prasoon Goyal, Lawrence D. Jackel, Mathew Monfort, Urs Muller, Jiakai Zhang, Xin Zhang, Jake Zhao, Karol Zieba
We trained a convolutional neural network (CNN) to map raw pixels from a single front-facing camera directly to steering commands. This end-to-end approach proved surprisingly powerful. With minimum training data from humans the system learns to drive in traffic on local roads with or without lane markings and on highways. It also operates in areas with unclear visual guidance such as in parking lots and on unpaved roads. The system automatically learns internal representations of the necessary processing steps such as detecting useful road features with only the human steering angle as the training signal. We never explicitly trained it to detect, for example, the outline of roads. Compared to explicit decomposition of the problem, such as lane marking detection, path planning, and control, our end-to-end system optimizes all processing steps simultaneously. We argue that this will eventually lead to better performance and smaller systems. Better performance will result because the internal components self-optimize to maximize overall system performance, instead of optimizing human-selected intermediate criteria, e.g., lane detection. Such criteria understandably are selected for ease of human interpretation which doesn't automatically guarantee maximum system performance. Smaller networks are possible because the system learns to solve the problem with the minimal number of processing steps. We used an NVIDIA DevBox and Torch 7 for training and an NVIDIA DRIVE(TM) PX self-driving car computer also running Torch 7 for determining where to drive. The system operates at 30 frames per second (FPS).
In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1604.07316")
Code
Syntology Ran 9 of 41 code samples harvested from 21 repositories linked to this paper; 32 have no recorded run. Of those that ran: 2 ran · violated contract; 4 ran · our draft was wrong; 3 ran · fixture could not drive it.
By repository: community (archive-listed): 41 samples from 21 repositories, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
113 repositories listed; official and paper-mentioned ones first.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
41 samples harvested; 9 ran; 0 honoured the contract we drafted; 32 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.
Licence: 9 of the 41 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 21 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
beaf0e6f77128166 · report
2e6fe67a4824a13c · report
5d78e1f7a1afb766 · report
40b4d4844a4401d7 · report
7e827bbc77666d2d · report
8773998315a878a0 · report
dac6e010a84be37a · report
be16515895537798 · report
3cc11af621bf4fdf · report
fb2c05a4b230783a · report
50fb64330c7cfa97 · report
be1a41ace6daae2d · report
fd1e225bec959bc0 · report
55499fe64c859590 · report
051b7206bccec72e · report
993d22ff0d2b0b3d · report
f865b97a27ceaca6 · report
8ee4683fd264a4f5 · report
2e55a9f2aa760ba5 · report
bbbef8afaefb2b00 · report
132dbb6a991d344c · report
3c2e04da72d7ad81 · report
616cce9a3b983e6e · report
51f056d5c91d6ff0 · report
8decfcfe2fe9b77e · report
846e601c438d4e0e · report
9d511f7658db9f74 · report
b982f37276160f7e · report
56fb80160fd14de8 · report
b1e217ac94ad316e · report
acb5ef62667663ff · report
2d9b24ef0b26085c · report
9f03184dfeb34b29 · report
c56bc195493f19cd · report
7d435baa52bf195d · report
732028197e9c0404 · report
8421101e2bfcb508 · report
e1e0d9441a6d3abe · report
cb07eb141f5648be · report
ac237542eee6cf2f · report
d5ef859d6dcd9a83 · report
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections