Abstract
We consider the problem of approximating a subset M of a Hilbert space X by a low-dimensional manifold Mn . A large class of nonlinear methods can be described by a decoder D : IRn → X whose range is the nonlinear manifold Mn , and an encoder E : E → IRn which extracts n pieces of information E(u) from an element u in M .
Here, we introduce a nonlinear method where E is linear and D is a stable decoder obtained via a tree-structured composition of polynomial maps, estimated sequentially from samples in M . Rigorous error and stability analyses are provided, along with an adaptive strategy for constructing a decoder that guarantees an approximation of the set M with controlled mean-squared or worst-case errors, and controlled stability (Lipschitz continuity) of the encoder-decoder pair.
We also discuss the definition of optimal encoders and provide concrete strategies for their estimation.
Joint work with A. Bensalah, J. Soffo, A. Somacal.