cs.LGOct 24, 2026

Greedy Orthogonal Polynomial Manifolds with Lipschitz Control for Dimensionality Reduction and Reduced Modeling

Authors: Tomoki Koike, Benjamin Peherstorfer, Elizabeth Qian

Organizations: School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA, USA · Institute of Mathematics, EPFL, Lausanne, Switzerland · School of Aerospace Engineering and School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, GA, USA

Abstract

Polynomial manifolds provide nonlinear low-dimensional representations through polynomial decoders. We propose to represent the polynomial terms of the decoder using features that are orthonormal on the training data. This empirical orthogonality enables a greedy algorithm, Greedy-OPM, which jointly selects encoder modes and polynomial features while minimizing the reconstruction error under a prescribed bound on the decoder's Lipschitz constant. Numerical experiments show that this Lipschitz constraint improves generalization away from the training data while retaining high reconstruction accuracy.

Figures & tables

Appendix figures & tables3 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. (MPO)2^2: Multivariate Polynomial Optimization based on Matrix Product Operators

    Jul 17, 2026Niccolò Ciolli, Anders Vestergaard Nørskov, Michael Kastoryano +2Tensor NetworksTensor Decomposition

  2. Gradient Descent with Projection Finds Over-Parameterized Neural Networks for Learning Low-Degree Polynomials with Nearly Minimax Optimal Rate

    Mar 22, 2026Yingzhen Yang, Ping LiLow-Degree Polynomial MethodNeural Network Generalization

  3. Generalization in Nonlinear Least Squares via Learned Feature Geometry

    Jun 7, 2026Ayub Kharel, Ilja Kuzborskij, Patrick Rebeschini +1Neural Representation GeometryAlgorithmic Stability