CORTEXA
← Browse
arxivmath.NAstat.ML2026-07-01

Convolutional Symmetric AutoEncoders: enhancing latent stability via differential geometry

G. Li Causi, N. Tonicello, L. Magri, G. Rozza

Autoencoders (AEs) have emerged as powerful tools for non-linear dimensionality reduction, often surpassing traditional linear methods such as Proper Orthogonal Decomposition (POD) in scenarios characterized by slowly decaying Kolmogorov $n$-widths. In the realm of Reduced-Order Modelling (ROM), these models are increasingly utilized to learn low-dimensional representations of solution manifolds associated with parametric Partial Differential Equations (PDEs). However, the high expressivity of AEs presents a challenge: although trained networks typically minimize reconstruction error, they often struggle to capture the essential properties necessary for building accurate and robust ROMs. Recent works by arXiv:2307.15288v2 and arXiv:2506.11641v1 have tackled this challenge in fully connected AEs by proposing representation-consistent architectures, which preserve some of the properties belonging to POD. This study builds upon that concept by extending representation consistency for convolutional layers. We introduce a novel class of symmetric Convolutional AutoEncoders (CAEs) designed to embody the primary properties of manifold parametrization mappings. When integrated into a ROM framework, this architecture demonstrates significantly improved predictive capabilities. Specifically, we compared the performance of the ROMs based on classical and symmetric CAEs on three one dimensional academic test cases, namely the Linear Advection, the Viscous Burger and the Kuramoto Sivashinsky equation. Numerical results demonstrate that our proposed symmetric approach consistently yields more accurate latent trajectories, lower reconstruction errors, and enhanced model robustness.

View free PDFSource page

Related papers

arxivstat.MLcs.ITcs.LGmath.NA2026-07-12

Approximation of Analytic Functions by ReLU Neural Networks with Adjustable Depth and Width

Yanming Lai, Defeng Sun, Yang Wang

In contrast to most studies on neural network approximation theory that characterize results through a single parameter, such as the total number of network parameters, \cite{shen2020deep} pioneered the characterization of approximation rates as a joint function of the width para…

View free PDFSource page
arxivstat.MLeess.SPmath.NAmath.OC2026-07-10

Characterization of the basin of convexity for multi-snapshot spike deconvolution via variable projection

Meghna Kalra, Maxime Ferreira Da Costa, Kiryung Lee

We study the problem of multi-snapshot spike deconvolution, where the goal is to recover the locations of sparse impulses from their noisy convolution with a known point spread function (PSF) across multiple snapshots. We adopt a variable-projection formulation that eliminates th…

View free PDFSource page
arxivcs.CRcs.DSmath.NAstat.APstat.ML2026-06-29

A Sieve-Accelerated Quadrature Method for Exact Privacy Accounting in the 2020 U.S. Decennial Census

Buxin Su, Weijie Su, Chendi Wang

In 2020, the U.S. Census Bureau adopted differential privacy for the Decennial Census by injecting integer-valued Gaussian noise into published census tabulations. Exactly evaluating the privacy guarantees of these data releases would enable the Bureau to determine the absolute m…

View free PDFSource page
arxivstat.MLcs.LGmath.NAstat.ME2026-07-17

Cluster-Aware Matching via Laplacian Optimal Transport

Gabriel Samberg, YoonHaeng Hur, Yuehaw Khoo, Nir Sharon

In many applications of matching, the point clouds to be matched are not merely unstructured sets of points but rather samples from distributions with an intrinsic cluster structure. In such cases, as individual points are often interchangeable within a coherent region, finding a…

View free PDFSource page