← Back to feed

TTPO: Test-Time Policy Optimization

L5 · ResearcherResearcharXiv· 8/27/2026

Introduces a cutting-edge unsupervised training technique that advances reasoning capabilities beyond label-dependent methods.

AI Summary

Researchers propose TTPO, a novel test-time policy optimization method that enhances large language models' mathematical reasoning without ground-truth labels.

Excerpt

Recent prominent post-training methods, such as Reinforcement Learning (RL) and On-Policy Self-Distillation (OPSD), have driven rapid progress in mathematical reasoning for large language models, yet their reliance on ground-truth labels precludes test-time training (TTT). Replacing ground truth with majority-vote pseudo-labels is a natural alternative, yet it is fragile: an incorrect vote corrupts the teacher and misleads every token. We observe that this failure mode is asymmetric: rollouts th

Read Original
0 upvotes · 0 downvotes · 1 min read

Related Articles

L4 · DeveloperResearcharXiv
Persona-Execution Separation: An Architecture Pattern for Evolving LLM Agents under Execution Audit

Presents Persona-Execution Separation, an architecture pattern for enterprise LLM agents that keeps execution auditable while allowing persona instructions to evolve freely.

L5 · ResearcherResearcharXiv
LLMs Can Design Near-Optimal OR Algorithms

GPT-5.6 can design near-optimal algorithms for operations research problems like inventory control and queueing networks, matching or beating specialized methods with minimal human input.

L5 · ResearcherResearcharXiv
From Static to Dynamic: Benchmarking Real-World Code Review with MCR-Bench

Researchers introduce MCR-Bench, the first defect state-aware benchmark for multi-round code review, evaluating LLMs' limitations in iterative defect detection and tracking.

L5 · ResearcherResearcharXiv
Mechanistic Reaction Prediction via Discrete Flow Matching on Graph-Structured Electron Occupation

Researchers introduce MAELLE, a novel AI approach that models chemical reactions as discrete flow matching over electron occupation vectors rather than molecular topology.

L5 · ResearcherResearcharXiv
Scaling Graph Neural Networks for Friend Recommendation: Multi-Hash User Embeddings and Temporal Neighbor Sampling

Researchers present a scalable GNN system for friend recommendation that reduces embedding table size by 98% and improves temporal sampling efficiency, achieving 16% more friend additions in production tests.