aiqbench analysis
Twincher addresses the challenge of inverting continuous forward maps used in physical systems by learning a bijective representation that eliminates spurious stationary points in optimization. This approach allows Newton-type iterations to converge to machine precision using only qualitative model correctness, offering a significant improvement over standard learned inverses or iterative solvers that stall on noisy data. The method introduces a novel architecture based on localized, area-preserving rotations and provides an open-source implementation for researchers working on state estimation and action planning.
Twincher: Bijective Representation Learning for Robust Inversion of Continuous Systems
arXiv:2605.13470v2 Announce Type: replace Abstract: Perception, state estimation, and action planning in physical systems often reduce to inverting a continuous forward map $p \mapsto y = f(p)$ (a renderer, a physics simulator, or a learned surrogate) that can be queried but not inverted in closed form. Learned direct inverses are limited by an approximation error that decreases only gradually with the amount of data, whereas iterative solvers that minimize the misfit in observation space can stall at spurious stationary points. We study an intermediate route: learning a representation $r(y)$ in which the composite map $p \mapsto r(f(p))$ is a well-conditioned bijection and which is insensitive to perturbations of $y$ normal to the data manifold. In such coordinates, the inverse problem becomes a square nonlinear system whose least-squares formulation has no spurious interior stationary points, so that Newton-type iterations using the exact forward model can refine the solution to the accuracy permitted by the observations; the learned model must be qualitatively correct rather than accurate. We introduce Twincher, an architecture composed of localized, area-preserving pairwise rotations ("twinches"), and explore training possibilities with Jacobian-level objectives, a domain-growing curriculum, and memory-efficient routines for propagating derivative tensors. On a family of synthetic forward maps with controllable nonconvexity, once the query budget suffices to form a bijective representation, the worst-case residual over $10^3$ test targets reaches machine precision within five refinement steps, whereas a parameter-matched baseline that combines an MLP inverse with Gauss-Newton refinement improves only gradually with the budget. A pose-estimation example from noisy depth maps illustrates inference errors that scale linearly with, and vanish together with, the observation noise. We release an open-source CPU/GPU Python implementation.
Abstract:Perception, state estimation, and action planning in physical systems often reduce to inverting a continuous forward map $p \mapsto y = f(p)$ (a renderer, a physics simulator, or a learned surrogate) that can be queried but not inverted in closed form. Learned direct inverses are limited by an approximation error that decreases only gradually with the amount of data, whereas iterative solvers that minimize the misfit in observation space can stall at spurious stationary points. We study an intermediate route: learning a representation $r(y)$ in which the composite map $p \mapsto r(f(p))$ is a well-conditioned bijection and which is insensitive to perturbations of $y$ normal to the data manifold. In such coordinates, the inverse problem becomes a square nonlinear system whose least-squares formulation has no spurious interior stationary points, so that Newton-type iterations using the exact forward model can refine the solution to the accuracy permitted by the observations; the learned model must be qualitatively correct rather than accurate. We introduce Twincher, an architecture composed of localized, area-preserving pairwise rotations ("twinches"), and explore training possibilities with Jacobian-level objectives, a domain-growing curriculum, and memory-efficient routines for propagating derivative tensors. On a family of synthetic forward maps with controllable nonconvexity, once the query budget suffices to form a bijective representation, the worst-case residual over $10^3$ test targets reaches machine precision within five refinement steps, whereas a parameter-matched baseline that combines an MLP inverse with Gauss-Newton refinement improves only gradually with the budget. A pose-estimation example from noisy depth maps illustrates inference errors that scale linearly with, and vanish together with, the observation noise. We release an open-source CPU/GPU Python implementation.
Machine Learning (cs.LG)
arXiv:2605.13470 [cs.LG]
(or arXiv:2605.13470v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2605.13470 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 360 words
Related coverage
Latent reasoning architectures would likely undermine CoT, our strongest oversight tool
AI Alignment Forum · Sep 23, 2026
Kairos: Numerically Robust News Recommendation under Item Cold-Start via Cholesky-based LinUCB
arXiv · Jul 30, 2026

Exploding variance of means of exponentials: least-squares to the rescue – Machine Learning Research Blog
francisbach.com · Sep 27, 2026

Deconfusing Corrigibility
AI Alignment Forum · Oct 17, 2026