Math: Functional analysis

Machine-learning ideas tagged Functional analysis in the Math taxonomy of the Math2NN corpus.

✗ Mechanism failed 2026

Pseudo-Hyperbolic Recurrent Dynamics

Replace an unconstrained recurrent transition with two coupled channels: one contracts under forward iteration and the other contracts under inverse iteration. Enforcing this structure should prevent long-horizon amplification of state, numerical, and teacher-forcing perturbations while retaining nontrivial memory through the backward-stable channel.

Useful8/10
Difficulty6/10
Novelty7/10
Paper: On Generalized Hyperbolicity, Stability, and Shadowing for Linear Operators arXiv:2608.17021
✓✓ Beats tuned baseline 2026

Equivariant Variational Field Network

Represent a scalar energy or free-energy functional of a three-dimensional neural field using translation- and rotation-equivariant convolutions, and produce the field prediction by minimizing the total functional rather than by a direct decoder. The same functional can then generate equilibrium states, forces, and response observables under new external fields, resolutions, and system sizes.

Useful8/10
Difficulty7/10
Novelty6/10
Paper: Equivariant learning of a transferable three-dimensional classical density functional arXiv:2608.13506
△ Mechanism confirmed, baseline not beaten 2026

Koopman Skew-Dilation RNN

Replace an unconstrained recurrent generator with a skew-adjoint block lift whose projected first channel implements a non-skew effective generator. The hidden state evolves unitarily in the enlarged space, preventing exponential norm blow-up, while the projection can express transient amplification, damping, and non-normal dynamics unavailable to a purely orthogonal recurrent matrix.

Useful8/10
Difficulty6/10
Novelty6/10
Paper: Measure-free Koopman-von Neumann Dynamics and Noncommutative Geometry arXiv:2608.11591
△ Mechanism confirmed, baseline not beaten 2026

Zubov Invariant Head for Stable Latent Dynamics

Attach a scalar Zubov head to a neural ODE, state-space model, or recurrent world model and train it to be invariant under a discounted Koopman action. The head should be near one for trajectories attracted to the target equilibrium and near zero for states with large accumulated deviation, providing a long-horizon stability signal and an off-distribution failure detector.

Useful8/10
Difficulty6/10
Novelty7/10
Paper: Data-Driven Domain of Attraction Estimation via Convergent Koopman-Zubov Approximation arXiv:2608.01018
✗ Failed on benchmark 2026

Weak Koopman Latent Dynamics

Replace noisy pointwise derivative matching in a neural state-space model with a weak-form Koopman-generator residual. An encoder maps observations to latent observables, while a learned matrix generator propagates those observables. Integration by parts removes the need to differentiate noisy trajectories and provides a controllable noise-averaging mechanism.

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Weak-form Extended Dynamic Mode Decomposition arXiv:2607.25950
✗ Failed on benchmark 2026

Average-contracting invariant fibre

Replace pointwise spectral-norm contraction in a recurrent or state-space model with an average logarithmic contraction certificate for an input-conditioned fibre update. Let a base state carry expressive, possibly noncontractive dynamics, while an auxiliary latent fibre contracts on average. This should preserve useful variability in the base while preventing long-horizon fibre explosion and making the fibre converge to an input-dependent invariant section.

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Decay of Correlations for Partially Hyperbolic Skew-Products arXiv:2607.21516
✗ Failed on benchmark 2026

Localized Petrov–Galerkin Neural Residuals

Replace the pointwise strong-form PINN loss with a vector of localized weak residuals generated by fixed compactly supported polynomial test functions. Use a neural network or KAN as the trial function, integrate by parts once, and evaluate each test residual with Gauss–Legendre quadrature; this lowers the required derivative order and prevents a few high-curvature collocation points from dominating training.

Useful8/10
Difficulty5/10
Novelty5/10
Paper: PG-KINN: A Physics-Informed Petrov-Galerkin Kolmogorov-Arnold Network for Solving Forward and Inverse PDEs arXiv:2607.20378
△ Mechanism confirmed, baseline not beaten 2026

Derivative-Free Very-Weak Neural PDE Solver

Train a neural trial function for an elliptic PDE using a very-weak residual in which all derivatives act on fixed smooth test functions rather than on the neural network. This eliminates second-order reverse-mode or forward-mode automatic differentiation and allows low-regularity activations while retaining a least-squares objective over many test functions.

Useful8/10
Difficulty4/10
Novelty6/10
Paper: Neural Very Weak Formulations enabling Hardware-Oriented deep PDE solvers arXiv:2607.14498
△ Mechanism confirmed, baseline not beaten 2026

Input-Subspace Perturbation Learning

Replace full-dimensional node or weight perturbation with perturbations in an input-conditioned d-dimensional tangent subspace, where d is the input or feature dimension and is much smaller than the reservoir width or parameter count. Estimate the update using only scalar self-supervised losses from positive and negative perturbations, then map the low-dimensional update back to the trainable parameters.

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Scalable Perturbation Learning for Online Self-Supervised Learning in Echo State Networks arXiv:2607.06079
✗ Mechanism failed 2026

Inverse-Laplacian Residual Loss

Replace the standard squared pointwise PDE residual in an elliptic PINN by its discrete $H^{-1}$ norm. The residual is passed through an inverse Dirichlet Laplacian, reducing the dominance of rapidly varying residual modes and acting as a mathematically specified preconditioner for the PINN training gradients.

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Mitigating Numerical Stiffness in Least-Squares Formulations of Elliptic PDEs for Physics-Informed Neural Networks arXiv:2607.02726
✗ Failed on benchmark 2026

Lyapunov Fading-Memory Optimizer

Add a fading-memory consensus force to parameter dynamics, pulling the current parameter toward a distributed average of its past while preserving the ordinary gradient step. Implement the infinite memory through one or several recursive exponential states, and tune the memory decay so that quadratic-mode dynamics remain exponentially stable. This should suppress oscillations and catastrophic steps without relying on conventional momentum alone.

Useful7/10
Difficulty4/10
Novelty6/10
Paper: Exponential Consensus and Flocking in Multi-Agent Systems with Infinite Fading Memory arXiv:2609.02454
△ Mechanism confirmed, baseline not beaten 2026

Piola-Conditioned Fixed-Reference Neural Operator

Build a geometry-conditioned neural operator on a single reference mesh instead of remeshing or changing the network discretization for every domain shape. Transport vector-valued surface features with a contravariant surface Piola map, and feed the network geometry-dependent pulled-back quantities. This should make the architecture stable across shape changes and allow batching many geometries with identical tensor shapes.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: Shape Holomorphy and Sparse Approximation of the Maxwell Electric Field Integral Operator arXiv:2609.00466
✗ Failed on benchmark 2026

Fractional Memory State-Space Layer

Replace a standard recurrent state update or finite-order SSM filter with a causal relative-history operator using a weakly singular kernel k(s)=s^{p-1}m(s), where 0<p<1. The resulting layer retains information over a power-law range of timescales and introduces tunable frequency-dependent phase and attenuation, while remaining implementable through a small bank of exponentially decaying states.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: High frequency wave propagation for the viscoelastic wave equation with singular memory arXiv:2608.30138
△ Mechanism confirmed, baseline not beaten 2026

State-Dependent Temperature Langevin

Replace isotropic Langevin noise in latent or energy-based neural sampling with a smooth position-dependent temperature \(\sigma(x)\geq 1\). Use the divergence correction associated with the diffusion matrix so that increasing exploration in the tails does not change the desired target distribution. This should reduce metastability and improve effective samples per gradient evaluation on heavy-tailed latent posteriors.

Useful7/10
Difficulty4/10
Novelty6/10
Paper: Hypocoercivity of Tempered Bouncy Particle Samplers for Heavy-Tailed Targets arXiv:2608.29657
△ Mechanism confirmed, baseline not beaten 2026

Task-Tangent Capture Pruning

Prune parameter directions according to how much task-relevant Jacobian energy they carry, rather than by weight magnitude or individual gradient magnitude. Keep a mask whose discarded tangent component is at most an empirical fraction epsilon of the full tangent vector for calibration task directions, thereby preserving the local output dynamics seen by the task.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: The role of parameter Jacobians in the stability of network outputs arXiv:2608.27748
✓✓ Beats tuned baseline 2026

Phase-Aware Bias-Energy Trust Region

Use the envelope's phase transition to choose whether clipping should primarily control update energy or preserve the raw gradient and reduce clipping bias. In the energy-dominated regime, regulate the retained update energy; in the bias-dominated regime, regulate the removed-gradient residual and monitor rare outliers explicitly.

Useful7/10
Difficulty5/10
Novelty5/10
Paper: A Sharp Joint Bias-Energy Envelope for Radial Clipping arXiv:2608.18999
△ Mechanism confirmed, baseline not beaten 2026

Energy-Riesz checkpoint selector

Replace raw neural PDE training-loss checkpoint selection with a residual monitor measured in the variational energy geometry. For every archived network, solve an auxiliary conforming Riesz problem and select the checkpoint with the smallest reconstructed residual norm; nested auxiliary spaces make this score converge monotonically to the inaccessible energy error.

Useful7/10
Difficulty4/10
Novelty7/10
Paper: Reference-free logged energy-oracle recovery for neural approximations of symmetric coercive variational problems: conforming Riesz reconstruction and archive-level selection arXiv:2608.16473
△ Mechanism confirmed, baseline not beaten 2026

Multiplicity-balanced symmetric interaction layer

Replace a dense degree-m tensor interaction layer by a symmetric orbit-parameterized layer with one parameter per exponent vector and explicit multinomial scaling. This preserves the contribution of all ordered tensor entries represented by one orbit, while reducing parameter count and avoiding the amplitude distortion of unweighted monomial compression.

Useful7/10
Difficulty4/10
Novelty7/10
Paper: Orbit compression and asymptotic contractivity for symmetric Bohnenblust--Hille inequalities arXiv:2608.13753
✗ Failed on benchmark 2026

Response-from-Hessian Regularizer

Use the learned variational functional's second functional derivative as a consistency mechanism: equilibrium susceptibility, forces, and phase stability must all be computed from the same Hessian rather than from independently trained predictors. Penalize negative or excessively ill-conditioned Hessian modes during training, while retaining soft negative modes as a detectable phase-transition signal.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: Equivariant learning of a transferable three-dimensional classical density functional arXiv:2608.13506
△ Mechanism confirmed, baseline not beaten 2026

Adjoint-Weak Fractional Residuals

Replace pointwise fractional derivatives of noisy trajectories in a neural PDE or neural dynamics loss with weak projections in which the fractional operator acts on smooth test functions. The network is trained to match integral residuals over local space-time windows, making the residual insensitive to high-frequency measurement noise while retaining sensitivity to the underlying fractional dynamics.

Useful7/10
Difficulty4/10
Novelty5/10
Paper: Robust data-driven discovery of fractional differential equations via weak formulations and Pareto-based subset selection arXiv:2608.12879
△ Mechanism confirmed, baseline not beaten 2026

Gram-Whitened Directional Pooling

Represent local feature channels as a smooth directional signal and aggregate them with a partition-of-unity family of learnable spherical atoms instead of hard angular bins. Use the atom Gram matrix to whiten the descriptor and add a projected-energy loss, so the network is rewarded for retaining information in the directional subspace rather than merely producing large correlated channel responses.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: Point Feature Descriptor via Directional Partition of Unity on Maps arXiv:2608.12794
△ Mechanism confirmed, baseline not beaten 2026

Measurement-Space Neural Operator with Mesh Transfer

Build a neural operator around explicit input and output measurement spaces rather than forcing the network to consume and emit a fixed grid. The same learned latent surrogate can be reused on alternative sensor layouts or query meshes through reconstruction and re-encoding maps, with a consistency loss enforcing agreement between measurement pipelines.

Useful7/10
Difficulty6/10
Novelty5/10
Paper: Kernel Methods for Learning Operators with Multiple Inputs and Outputs arXiv:2608.11831
△ Mechanism confirmed, baseline not beaten 2026

Koopman-generator HJB critic

Replace an unconstrained learned dynamics model in model-based reinforcement learning or neural optimal control with a Koopman-style observable lift and an explicitly estimated infinitesimal generator. Train a value network against an HJB residual formed from this generator, so the critic is constrained by the observed vector field and control directions rather than relying only on temporal-difference targets.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: Data-Driven optimal control via Koopman operators and Hamilton-Jacobi-Bellman equations arXiv:2608.11808
✗ Failed on benchmark 2026

Entropy-stable split quadratic layer

Replace the naive pseudospectral evaluation of a quadratic neural-operator nonlinearity with a two-point split-form product. Use the entropy-stable (alpha, beta) = (1/3, 2/3) split as the default, or learn alpha under the consistency constraint alpha + beta = 1 while monitoring energy growth. The goal is to suppress weakly underresolved aliasing and prevent long-horizon rollout blow-up without full 2/3-rule zero-padding.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: On the Role of Split Formulations on Aliasing Errors and Entropy Stability of Discontinuous Galerkin Schemes arXiv:2608.07355