FirsthandTech
arXiv: cs.AI preprintsInternational20 November 2026

Test-Time Symmetrization: Scaling Laws for Model-Agnostic Learning under Structure

This is an official announcement record

Firsthand records what arXiv: cs.AI preprints announced and links to the original. The wording below is theirs, not ours.

arXiv:2611.24032v1 Announce Type: new Abstract: Test-time compute has emerged as a powerful way to improve the accuracy of language models at inference time, with scaling laws quantifying how accuracy improves with additional forward passes. Existing scaling laws, however, focus on repeated sampling from a fixed prompt, even though many tasks admit multiple equivalent representations of the same underlying problem. A graph does not depend on how its nodes are numbered, and a program does not depend on the names of its variables, yet language models can change their answers under such rewriting
Source: arXiv: cs.AI preprints

More from arXiv: cs.AI preprints

This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.