Big AI models often write very long step-by-step solutions, but usual checkers either only check the final answer or get lost in the long steps.
This paper builds a math problem–solving agent, Intern-S1-MO, that thinks in multiple rounds and remembers proven mini-results called lemmas so it can solve very long, Olympiad-level problems.
LEO-RobotAgent is a simple but powerful framework that lets a language model think, plan, and operate many kinds of robots using natural language.
Long texts make standard attention in large language models very slow because it checks every word against every other word.
This paper builds TAD, a brand-new test that checks if AI can understand what happens over time in real driving videos.
ReVSeg teaches an AI to segment objects in videos by thinking step-by-step instead of guessing everything at once.