Foundations of Polar Linear Algebra

• URL: http://arxiv.org/abs/2603.28939v1
• Date: Mon, 30 Mar 2026 19:17:40 GMT
• Title: Foundations of Polar Linear Algebra
• Abstract summary: This work revisits operator learning from a spectral perspective by introducing Polar Linear Algebra.<n>We define the associated operators and analyze their spectral properties.<n>Despite the simplicity of the task, the results demonstrate that polar and fully spectral operators can be trained reliably.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work revisits operator learning from a spectral perspective by introducing Polar Linear Algebra, a structured framework based on polar geometry that combines a linear radial component with a periodic angular component. Starting from this formulation, we define the associated operators and analyze their spectral properties. As a proof of feasibility, the framework is evaluated on a canonical benchmark (MNIST). Despite the simplicity of the task, the results demonstrate that polar and fully spectral operators can be trained reliably, and that imposing self-adjoint-inspired spectral constraints improves stability and convergence. Beyond accuracy, the proposed formulation leads to a reduction in parameter count and computational complexity, while providing a more interpretable representation in terms of decoupled spectral modes. By moving from a spatial to a spectral domain, the problem decomposes into orthogonal eigenmodes that can be treated as independent computational pipelines. This structure naturally exposes an additional dimension of model parallelization, complementing existing parallel strategies without relying on ad-hoc partitioning. Overall, the work offers a different conceptual lens for operator learning, particularly suited to problems where spectral structure and parallel execution are central.

Related papers

• Spectral graph clustering with inhomogeneous latent geometry [42.02177719060884]
  We develop a density-based spectral clustering algorithm that requires only approximate localization of the informative eigenvalue.<n>Our theoretical predictions for the location of the informative eigenvalue notably align with observations in real-world experiments.
  arXiv  Detail & Related papers  (2026-08-11T18:15:38Z)
• Curvature-Aware PCA with Geodesic Tangent Space Aggregation for Semi-Supervised Learning [52.452902154360565]
  GTSA-PCA is a geometric extension of Principal Component Analysis.<n>It integrates curvature awareness and geodesic consistency within a unified spectral framework.<n>Our results position GTSA-PCA as a principled bridge between statistical and geometric approaches to dimensionality reduction.
  arXiv  Detail & Related papers  (2026-04-20T20:36:36Z)
• Spectral Path Regression: Directional Chebyshev Harmonics for Interpretable Tabular Learning [0.0]
  We replace tensorised oscillations with directional harmonic modes of the form $cos(mathbfmtoparccos(mathbfx)$.<n>This representation yields a discrete spectral regression model in which complexity is controlled by selecting a small number of structured frequency vectors.
  arXiv  Detail & Related papers  (2026-04-05T12:13:59Z)
• On the Spectral Geometry of Cross-Modal Representations: A Functional Map Diagnostic for Multimodal Alignment [0.0]
  We study cross-modal alignment between independently pretrained vision (DINOv2) and language (all-MiniLM-L6-v2) encoders.<n>We find that the Laplacian eigenvalue spectra of the two encoders are quantitatively similar.<n>We term this decoupling the spectral complexity--orientation gap: models converge in how much structure they capture but not in how they organize it.
  arXiv  Detail & Related papers  (2026-03-28T04:20:54Z)
• Gauge-Equivariant Intrinsic Neural Operators for Geometry-Consistent Learning of Elliptic PDE Maps [0.0]
  We propose Gauge-Equivariant Intrinsic Neural Operators (GINO) for geometric partial differential equations (PDEs)<n>GINO parameterize elliptic solution maps through intrinsic spectral multipliers acting on geometry-dependent spectra, coupled with gauge-equivariant nonlinearities.<n>We show GINO achieves low operator-approximation error, near machine-precision gauge equivariance, equi robustness to structured metric perturbations, strong cross-resolution generalization with small commutation error under restriction/prolongation, and structure-preserving performance on a regularized exact/coexact decomposition task.
  arXiv  Detail & Related papers  (2026-03-16T02:10:06Z)
• RKHS Representation of Algebraic Convolutional Filters with Integral Operators [111.57971404925486]
  In this paper, we develop a theory showing that the range of integral operators naturally induces RKHS convolutional signal models.<n>We show that filtering with integral operators corresponds to iterated box products, giving rise to a unital kernel algebra.<n>Our results establish precise connections between eigendecompositions and RKHS representations in graphon signal processing, extend naturally to directed graphons, and enable novel spatial-spectral localization results.
  arXiv  Detail & Related papers  (2026-02-22T08:28:34Z)
• Spectral Superposition: A Theory of Feature Geometry [1.3837984867394175]
  We develop a theory for studying the geometric structre of features by analyzing the spectra of weight derived matrices.<n>In toy models of superposition, we use this theory to prove that capacity saturation forces spectral localization.
  arXiv  Detail & Related papers  (2026-02-02T15:28:38Z)
• Deep Eigenspace Network and Its Application to Parametric Non-selfadjoint Eigenvalue Problems [0.12744523252873352]
  We consider operator learning for efficiently solving parametric non-selfadjoint eigenvalue problems.<n>We introduce a hybrid framework that learns the stable invariant eigensubspace mapping rather than individual eigenfunctions.
  arXiv  Detail & Related papers  (2025-12-23T05:20:22Z)
• Learning Eigenstructures of Unstructured Data Manifolds [47.81117132002129]
  We introduce a novel framework that learns a spectral basis for shape and manifold analysis from unstructured data.<n>By replacing the traditional operator selection, construction, and eigendecomposition with a learning-based approach, our framework offers a principled, data-driven alternative to conventional pipelines.
  arXiv  Detail & Related papers  (2025-11-30T22:06:49Z)
• Avoiding spectral pollution for transfer operators using residuals [0.6116681488656472]
  We present algorithms for computing spectral properties of transfer operators without spectral pollution.<n>Case studies range from families of Blaschke maps with known spectrum to a molecular dynamics model of protein folding.<n>Our methods offer robust tools for spectral estimation across a broad range of applications.
  arXiv  Detail & Related papers  (2025-07-22T18:01:05Z)
• Loss-Complexity Landscape and Model Structure Functions [53.92822954974537]
  We develop a framework for dualizing the Kolmogorov structure function $h_x(alpha)$.<n>We establish a mathematical analogy between information-theoretic constructs and statistical mechanics.<n>We explicitly prove the Legendre-Fenchel duality between the structure function and free energy.
  arXiv  Detail & Related papers  (2025-07-17T21:31:45Z)
• Spectra-to-Structure and Structure-to-Spectra Inference Across the Periodic Table [49.65586812435899]
  XAStruct is a learning-based system capable of both predicting XAS spectra from crystal structures and inferring local structural descriptors from XAS input.<n>XAStruct is trained on a large-scale dataset spanning over 70 elements across the periodic table.
  arXiv  Detail & Related papers  (2025-06-13T15:58:05Z)
• Spectral Decomposition Representation for Reinforcement Learning [100.0424588013549]
  We propose an alternative spectral method, Spectral Decomposition Representation (SPEDER), that extracts a state-action abstraction from the dynamics without inducing spurious dependence on the data collection policy. A theoretical analysis establishes the sample efficiency of the proposed algorithm in both the online and offline settings. An experimental investigation demonstrates superior performance over current state-of-the-art algorithms across several benchmarks.
  arXiv  Detail & Related papers  (2022-08-19T19:01:30Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.