Skip to main content
Search

# Diffeomorphic Learning

1 related articles

Subscribe to updates
  1. arXiv

    One kernel flow now handles both classification and density estimation: reduced Gauss–Newton converges in 17 iterations, and control points make particle cost linear

    Classification and likelihood-based density estimation are cast as a single optimal-control problem sharing one diffeomorphic flow whose velocity lives in a reproducing kernel Hilbert space (RKHS), differing only in the objective. Variable projection removes the terminal model, leaving a reduced gradient from an analytic discrete adjoint, and the kernel parameterization makes the flow's divergence exact at the cost of one kernel matrix–vector product, so objective and gradient are deterministic and reduced Gauss–Newton solvers apply to both tasks. In experiments from dimension 2 to 256, the reduced Gauss–Newton solvers use fewer iterations than any other optimizer tested, and a control-point reduction lowers per-solve particle cost from quadratic to linear at near-lossless accuracy.

You’re all caught up