Skip to main content
Search

# Bijective Representation Learning

1 related articles

Subscribe to updates
  1. arXiv

    Twincher learns a bijective representation that drives inversion of continuous forward maps to machine precision within five steps

    The work introduces Twincher, an architecture of localized area-preserving pairwise rotations ("twinches") that learns a representation r(y) making the composite map p↦r(f(p)) a well-conditioned bijection; 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 103 test targets reaches machine precision within five refinement steps, whereas a parameter-matched MLP-inverse-plus-Gauss-Newton baseline improves only gradually with the budget; a pose-estimation example from noisy depth maps shows inference errors that scale linearly with, and vanish together with, the observation noise.

You’re all caught up