๊ฐ€์ž… ํ›„ ์ดˆ๋Œ€ ๋งํฌ๋ฅผ ๊ณต์œ ํ•˜๋ฉด ๋™์˜์ƒ ์žฌ์ƒ ๋ฐ ์ดˆ๋Œ€ ๋ณด์ƒ์„ ๋ฐ›์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

cv usk
@cv_usk
AI / Software Research Notes AI Agent, LLMOps, MLOps, Software Architecture ๆŠ•็จฟใฏๅ€‹ไบบใฎๆ„่ฆ‹ใงใ™ใ€‚
๊ฐ€์ž… May 2026
286 ํŒ”๋กœ์ž‰ ์ค‘    469 ํŒฌ
TL;DR Treating spatial reasoning as a classification problem over finite candidates, instead of generating text, speeds up a VLM by up to 5.6x while also improving accuracy. Title: MJev-Spatial: System One Spatial Intelligence via Native Attention Matching URL: Here are the key points. ใƒป๐ŸŽฏ Choices, numeric values, and point coordinates are all unified as classification over a finite candidate set ใƒป๐Ÿง  No new prediction head is added - it reuses the model's existing query-key attention projections for scoring ใƒป๐Ÿ“ Point prediction uses a 3x3 grid refined through 3 rounds of re-cropping and re-encoding ใƒป๐Ÿš€ 160.6ms average latency on a B200 GPU, 2.5x faster than the best autoregressive baseline and 5.6x faster than the base model ใƒป๐Ÿ“Š 65.64% average across 12 benchmarks, beating Qwen3-VL-8B and others, ranking #1# on 7 of them ใƒป๐Ÿ”ข Surprisingly, coarser distance bins actually beat finer ones in accuracy ใƒป๐ŸŒฒ A probability-tree decoding scheme extends the single-point predictor to multi-point prediction with no extra training What's interesting is how this shift away from text generation toward a more "intuitive" classification approach delivers both speed and accuracy at once. #VLM# #SpatialReasoning#
๋” ๋ณด๊ธฐ