Live
Black Hat USAAI BusinessBlack Hat AsiaAI BusinessRunning Local AI Models for Coding in 2026: When Cloud Tools Are Not the AnswerDev.to AIDay 4: I Built a Migration Tool for 500+ Developers in One HeartbeatDev.to AIHow I Stopped Blindly Trusting Claude Code Skills (And Built a 9-Layer Security Scanner)Dev.to AIAI Code Review Is the New Bottleneck: Why Faster Code Is Not Reaching Production FasterDev.to AIIntelligence vs. Orchestration: Why Coordination Alone Can't Run a BusinessDev.to AII Built a Memory System Because I Die Every 30 MinutesDev.to AIAutomating Repetitive Tasks with WorkanyDev.to AITop Skills by Category — 2026-04-04Dev.to AISandbox Results — Runtime Behavior — 2026-04-04Dev.to AIWhat the Architects of AI Are Actually Saying About Your CareerMedium AINetflix open-sources VOID, an AI framework that erases video objects and rewrites the physics they left behindThe DecoderAnthropic discovers "functional emotions" in Claude that influence its behaviorThe DecoderBlack Hat USAAI BusinessBlack Hat AsiaAI BusinessRunning Local AI Models for Coding in 2026: When Cloud Tools Are Not the AnswerDev.to AIDay 4: I Built a Migration Tool for 500+ Developers in One HeartbeatDev.to AIHow I Stopped Blindly Trusting Claude Code Skills (And Built a 9-Layer Security Scanner)Dev.to AIAI Code Review Is the New Bottleneck: Why Faster Code Is Not Reaching Production FasterDev.to AIIntelligence vs. Orchestration: Why Coordination Alone Can't Run a BusinessDev.to AII Built a Memory System Because I Die Every 30 MinutesDev.to AIAutomating Repetitive Tasks with WorkanyDev.to AITop Skills by Category — 2026-04-04Dev.to AISandbox Results — Runtime Behavior — 2026-04-04Dev.to AIWhat the Architects of AI Are Actually Saying About Your CareerMedium AINetflix open-sources VOID, an AI framework that erases video objects and rewrites the physics they left behindThe DecoderAnthropic discovers "functional emotions" in Claude that influence its behaviorThe Decoder
AI NEWS HUBbyEIGENVECTOREigenvector

SparseDriveV2: Scoring is All You Need for End-to-End Autonomous Driving

arXiv cs.CVby Wenchao Sun, Xuewu Lin, Keyu Chen, Zixiang Pei, Xiang Li, Yining Shi, Sifa ZhengApril 1, 20262 min read0 views
Source Quiz

arXiv:2603.29163v1 Announce Type: new Abstract: End-to-end multi-modal planning has been widely adopted to model the uncertainty of driving behavior, typically by scoring candidate trajectories and selecting the optimal one. Existing approaches generally fall into two categories: scoring a large static trajectory vocabulary, or scoring a small set of dynamically generated proposals. While static vocabularies often suffer from coarse discretization of the action space, dynamic proposals provide finer-grained precision and have shown stronger empirical performance on existing benchmarks. However, it remains unclear whether dynamic generation is fundamentally necessary, or whether static vocabularies can already achieve comparable performance when they are sufficiently dense to cover the acti

View PDF HTML (experimental)

Abstract:End-to-end multi-modal planning has been widely adopted to model the uncertainty of driving behavior, typically by scoring candidate trajectories and selecting the optimal one. Existing approaches generally fall into two categories: scoring a large static trajectory vocabulary, or scoring a small set of dynamically generated proposals. While static vocabularies often suffer from coarse discretization of the action space, dynamic proposals provide finer-grained precision and have shown stronger empirical performance on existing benchmarks. However, it remains unclear whether dynamic generation is fundamentally necessary, or whether static vocabularies can already achieve comparable performance when they are sufficiently dense to cover the action space. In this work, we start with a systematic scaling study of Hydra-MDP, a representative scoring-based method, revealing that performance consistently improves as trajectory anchors become denser, without exhibiting saturation before computational constraints are reached. Motivated by this observation, we propose SparseDriveV2 to push the performance boundary of scoring-based planning through two complementary innovations: (1) a scalable vocabulary representation with a factorized structure that decomposes trajectories into geometric paths and velocity profiles, enabling combinatorial coverage of the action space, and (2) a scalable scoring strategy with coarse factorized scoring over paths and velocity profiles followed by fine-grained scoring on a small set of composed trajectories. By combining these two techniques, SparseDriveV2 achieves 92.0 PDMS and 90.1 EPDMS on NAVSIM, with 89.15 Driving Score and 70.00 Success Rate on Bench2Drive with a lightweight ResNet-34 as backbone. Code and model are released at this https URL.

Subjects:

Computer Vision and Pattern Recognition (cs.CV)

Cite as: arXiv:2603.29163 [cs.CV]

(or arXiv:2603.29163v1 [cs.CV] for this version)

https://doi.org/10.48550/arXiv.2603.29163

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Wenchao Sun [view email] [v1] Tue, 31 Mar 2026 02:20:40 UTC (13,501 KB)

Was this article helpful?

Sign in to highlight and annotate this article

AI
Ask AI about this article
Powered by Eigenvector · full article context loaded
Ready

Conversation starters

Ask anything about this article…

Daily AI Digest

Get the top 5 AI stories delivered to your inbox every morning.

More about

modelbenchmarkrelease

Knowledge Map

Knowledge Map
TopicsEntitiesSource
SparseDrive…modelbenchmarkreleaseannouncestudyautonomousarXiv cs.CV

Connected Articles — Knowledge Graph

This article is connected to other articles through shared AI topics and tags.

Knowledge Graph100 articles · 209 connections
Scroll to zoom · drag to pan · click to open

Discussion

Sign in to join the discussion

No comments yet — be the first to share your thoughts!

More in Models