Empirically studies how transformer-based native multimodal pre-training scales under fixed compute, deriving compute- and data-allocation power laws and an efficiency frontier for model size, token count, and data mixture; evaluates cross-modal transfer and multimodal in-context learning.
Drives long‑horizon desktop agents by reading and manipulating program state (files, DOM, backends) instead of relying on screenshots. The main agent uses code for actions and structural verification while a lightweight GUI subagent handles rare screenshot-click steps, improving success rates and lowering per-task cost versus screenshot-only approaches.
Reranks multilingual retrieval candidates to favour documents that are both semantically relevant and written in the same language as the query, using English-anchored relevance distillation and preference alignment; excels in language-coherence tests while remaining competitive on standard multilingual reranking benchmarks.
Transforms open-ended LLM optimization into self-verifiable reinforcement learning by turning tasks into proxy environments that produce deterministic, rule-based rewards. Proposes RLSVR and SpyRL — an information-asymmetric self-play scheme where agents vote to identify a preassigned spy, yielding verifiable rewards without human annotation. Demonstrated on summarization, creative writing and mathematical reasoning.
Lets canvas-native agents plan, generate, edit, and organize long-horizon multimodal creative projects by representing artifacts, versions, and actions as typed canvas nodes and links. Uses a three-layer design (canvas state, protocol bridge, agent runtime) so agents act within an inspectable, editable project state.
Turns document relevance into an execution prior for agentic corpus interaction: orders documents for sequential ripgrep traversal, seeds promising entry points with query-relevant paragraphs, and reranks grep matches to surface informative excerpts. Improves the accuracy–efficiency frontier on browse QA and reasoning-intensive retrieval.
Measures how agent memory systems miss implicitly associated facts by introducing InMind, a 125-task benchmark with paired controls that separate stored-vs-retrieval vs knowledge gaps. Quantifies a large retrieval-interface blind spot and points to routing as the core open problem.
Bridges the proprietary-to-open-source gap in agentic search by converting multi-step retrieval and reasoning traces into a structured, style-normalized JSON protocol and using it for joint distillation + RL. Produces denser supervision that improves student success rates while reducing style drift.
Generates polygonal meshes from images using flow matching for fast, native mesh synthesis. Decodes vertices, edge connectivity, and face winding in one parallel pass, preserves artist-authored topology without vertex quantization or welding, supports a user-set vertex budget for face-count control, and completes image-to-mesh in ~6s median.
Provides a portable, robot-free UMI capture pipeline and shows that policies post-trained only on this high-fidelity data deploy directly on real robots matching teleoperation baselines. Capture achieves ~3 mm end-effector accuracy, microsecond sync, ultra-wide FOV, and releases 2,000h HiFi-UMI-2K.
Co-evolves a solver skill and a rubric-generator skill for text-space LLM optimization under decoupled objectives to avoid rubric gaming without using gold rubrics. Solver updates use criterion-level feedback; generator updates use independent audits of requirement coverage and response discrimination.
Allocates token-level credit in rubric-conditioned GRPO by counterfactually replaying the same response under rubric and criteria-free prompts, using tokenwise log-likelihood contrasts to compute bounded, response-normalized weights that redistribute GRPO advantages without training an auxiliary scorer.