{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/wayformer-motion-forecasting-via-simple","title":"Wayformer: Motion Forecasting via Simple & Efficient Attention Networks","arxiv_id":"2207.05844","date":"2022-07-12","proceeding":null,"authors":["Nigamaa Nayakanti","Rami Al-Rfou","Aurick Zhou","Kratarth Goel","Khaled S. Refaat","Benjamin Sapp"],"abstract":"Motion forecasting for autonomous driving is a challenging task because complex driving scenarios result in a heterogeneous mix of static and dynamic inputs. It is an open problem how best to represent and fuse information about road geometry, lane connectivity, time-varying traffic light state, and history of a dynamic set of agents and their interactions into an effective encoding. To model this diverse set of input features, many approaches proposed to design an equally complex system with a diverse set of modality specific modules. This results in systems that are difficult to scale, extend, or tune in rigorous ways to trade off quality and efficiency. In this paper, we present Wayformer, a family of attention based architectures for motion forecasting that are simple and homogeneous. Wayformer offers a compact model description consisting of an attention based scene encoder and a decoder. In the scene encoder we study the choice of early, late and hierarchical fusion of the input modalities. For each fusion type we explore strategies to tradeoff efficiency and quality via factorized attention or latent query attention. We show that early fusion, despite its simplicity of construction, is not only modality agnostic but also achieves state-of-the-art results on both Waymo Open MotionDataset (WOMD) and Argoverse leaderboards, demonstrating the effectiveness of our design philosophy","url_abs":"https://arxiv.org/abs/2207.05844v1","url_pdf":"https://arxiv.org/pdf/2207.05844v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"wayformer-motion-forecasting-via-simple","repo_url":"https://github.com/kit-mrt/future-motion","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"wayformer-motion-forecasting-via-simple","repo_url":"https://github.com/nvlabs/catk","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"wayformer-motion-forecasting-via-simple","repo_url":"https://github.com/zhejz/hptr","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"wayformer-motion-forecasting-via-simple","repo_url":"https://github.com/vita-epfl/unitraj","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"autonomous-driving","task_name":"Autonomous Driving"},{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"motion-forecasting","task_name":"Motion Forecasting"},{"task_slug":"philosophy","task_name":"Philosophy"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/motion-forecasting-on-argoverse-cvpr-2020","task":"Motion Forecasting","dataset":"Argoverse CVPR 2020","model":"Wayformer","rank_in_archive_order":6,"of":299,"metrics":{"DAC (K=6)":"0.9893","MR (K=1)":"0.5716","MR (K=6)":"0.1186","brier-minFDE (K=6)":"1.7408","minADE (K=1)":"1.636","minADE (K=6)":"0.7676","minFDE (K=1)":"3.6559","minFDE (K=6)":"1.1616"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2207.05844","atlas_url":"https://app.syntology.ai/?focus=2207.05844","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2207.05844"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2207.05844\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2207.05844"},"call":"get_concepts_for_paper(arxiv_id=\"2207.05844\")"}],"by_repo":[{"repo":"kit-mrt/future-motion","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2406.11624"],"harvested_for_calls":[{"arxiv_id":"2406.11624","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.11624"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.11624\")"}]},{"repo":"nvlabs/catk","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2412.05334","2606.19370"],"harvested_for_calls":[{"arxiv_id":"2412.05334","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2412.05334"},"call":"get_harvested_code_for_paper(arxiv_id=\"2412.05334\")"},{"arxiv_id":"2606.19370","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2606.19370"},"call":"get_harvested_code_for_paper(arxiv_id=\"2606.19370\")"}]},{"repo":"zhejz/hptr","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2310.12970"],"harvested_for_calls":[{"arxiv_id":"2310.12970","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.12970"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.12970\")"}]},{"repo":"vita-epfl/unitraj","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2403.15098"],"harvested_for_calls":[{"arxiv_id":"2403.15098","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2403.15098"},"call":"get_harvested_code_for_paper(arxiv_id=\"2403.15098\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7b9ff16f01cb119a0ce8b576ac0c5350b4efd36b911b31fb898d5108f45037b2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}