paper-with-me

홈 › Papers

Beyond the Kolmogorov Barrier: A Learnable Weighted Hybrid Autoencoder for Model Order Reduction

2024-10-23 · Nithin Somasekharan, Shaowu Pan

Representation learning for high-dimensional, complex physical systems aims to identify a low-dimensional intrinsic latent space, which is crucial for reduced-order modeling and modal analysis. To overcome the well-known Kolmogorov barrier, deep autoencoders (AEs) have been introduced in recent years, but they often suffer from poor convergence behavior as the rank of the latent space increases. To address this issue, we propose the learnable weighted hybrid autoencoder, a hybrid approach that combines the strengths of singular value decomposition (SVD) with deep autoencoders through a learnable weighted framework. We find that the introduction of learnable weighting parameters is essential -- without them, the resulting model would either collapse into a standard POD or fail to exhibit the desired convergence behavior. Interestingly, we empirically find that our trained model has a sharpness thousands of times smaller compared to other models. Our experiments on classical chaotic PDE systems, including the 1D Kuramoto-Sivashinsky and forced isotropic turbulence datasets, demonstrate that our approach significantly improves generalization performance compared to several competing methods. Additionally, when combining with time series modeling techniques (e.g., Koopman operator, LSTM), the proposed technique offers significant improvements for surrogate modeling of high-dimensional multi-scale PDE systems.

📄 PDF Abstract BibTeX arXiv:2410.18148

Code (0)

등록된 구현이 없습니다.

Tasks

Representation Learning

Similar Papers 제목 키워드 기반

Beyond Weighted Summation: Learnable Nonlinear Aggregation Functions for Robust Artificial Neurons

2026-03-19 · Berke Deniz Bozyigit arxiv

Weighted summation has remained the default input aggregation mechanism in artificial neurons since the earliest neural network models. While computationally efficient, this design implicitly behaves like a mean-based es…

SigKAN: Signature-Weighted Kolmogorov-Arnold Networks for Time Series

2024-06-25 · Hugo Inzirillo, Remi Genet

We propose a novel approach that enhances multivariate function approximation using learnable path signatures and Kolmogorov-Arnold networks (KANs). We enhance the learning capabilities of these networks by weighting the…

Kolmogorov-Arnold NetworksTime SeriesTime Series AnalysisTime Series Forecasting

Sinusoidal Approximation Theorem for Kolmogorov-Arnold Networks

2025-08-01 · Sergei Gleyzer, Hanh Nguyen, Dinesh P. Ramakrishnan, Eric A. F. Reinhardt arxiv

The Kolmogorov-Arnold representation theorem states that any continuous multivariable function can be exactly represented as a finite superposition of continuous single variable functions. Subsequent simplifications of t…

Kolmogorov-Arnold Fourier Networks

2025-02-09 · Jusheng Zhang, Yijia Fan, Kaitong Cai, Keze Wang

Although Kolmogorov-Arnold based interpretable networks (KAN) have strong theoretical expressiveness, they face significant parameter explosion and high-frequency feature capture challenges in high-dimensional tasks. To …

Computational Efficiency

FI-KAN: Fractal Interpolation Kolmogorov-Arnold Networks

2026-03-30 · Gnankan Landry Regis N'guessan arxiv

Kolmogorov-Arnold Networks (KAN) employ B-spline bases on a fixed grid, providing no intrinsic multi-scale decomposition for non-smooth function approximation. We introduce Fractal Interpolation KAN (FI-KAN), which incor…