基于组合多项式网络的非线性流形逼近
Nonlinear manifold approximation using compositional polynomial networks
AI总结:
针对希尔伯特空间子集M的低维流形逼近问题,提出组合多项式网络方法,通过光滑非线性解码器(树结构多项式映射)和线性编码器,结合自适应子空间构造,实现受控误差与稳定性,并经数值实验验证性能。
摘要:
我们考虑利用希尔伯特空间X的子集M的样本,用低维流形Mₙ逼近M的问题。我们提出一种非线性逼近方法:Mₙ定义为光滑非线性解码器D的取值范围,D定义在ℝⁿ上,取值于可能高维的线性空间X_N;线性编码器E将M中的元素映射到其在n维子空间Xₙ⊂X_N基上的系数E(u),X_N是基于所选误差度量的最优或近优线性空间。编码器的线性特性便于获取M中给定元素u的参数E(u)。所提解码器是从ℝⁿ到X_N的多项式映射,由多项式映射的树结构组合构成,通过M的样本逐次估计。我们提供了严格的误差与稳定性分析,以及构造子空间Xₙ的自适应策略,该解码器可保证以受控均方误差或最坏情况误差逼近集合M,并保证编码器-解码器对的受控稳定性(利普希茨连续性)。我们通过数值实验验证了方法的性能。
英文摘要:
We consider the problem of approximating a subset $M$ of a Hilbert space $X$ by a low-dimensional manifold $M_n$, using samples from $M$. We propose a nonlinear approximation method where $M_n $ is defined as the range of a smooth nonlinear decoder $D$ defined on $\mathbb{R}^n$ with values in a possibly high-dimensional linear space $X_N$, and a linear encoder $E$ which associates to an element from $ M$ its coefficients $E(u)$ on a basis of a $n$-dimensional subspace $X_n \subset X_N$, where $X_N$ is an optimal or near to optimal linear space, depending on the selected error measure The linearity of the encoder allows to easily obtain the parameters $E(u)$ associated with a given element $u$ in $M$. The proposed decoder is a polynomial map from $\mathbb{R}^n$ to $X_N$ which is obtained by a tree-structured composition of polynomial maps, estimated sequentially from samples in $M$. Rigorous error and stability analyses are provided, as well as an adaptive strategy for constructing the subspace $X_n$, and a decoder that guarantees an approximation of the set $M$ with controlled mean-squared or wort-case errors, and a controlled stability (Lipschitz continuity) of the encoder and decoder pair. We demonstrate the performance of our method through numerical experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。