Exact ReLU realization of affine one-dimensional refinement iterates via residual memory and offset frames

• URL: http://arxiv.org/abs/2607.20586v1
• Date: Wed, 22 Jul 2026 13:51:38 GMT
• Title: Exact ReLU realization of affine one-dimensional refinement iterates via residual memory and offset frames
• Abstract summary: We study vector-valued affine refinement operators of the form [ (W)(t)=sum_jinmathbbZ A_j(Mt-j)+B(t), ] with finitely supported matrix mask.<n>For (Mge 3), every finite affine iterate admits an exact fixed-width ReLU realization whose depth is (O(n)).<n>We also prove a stage-dependent extension for forcing terms in a fixed finite-dimensional continuous piecewise linear span.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study vector-valued affine refinement operators of the form [ (Wγ)(t)=\sum_{j\in\mathbb{Z}} A_jγ(Mt-j)+B(t), ] with finitely supported matrix mask and compactly supported continuous piecewise linear input and forcing data. Building on the homogeneous realization theorem for (B\equiv 0), we prove that, for (M\ge 3), every finite affine iterate (W^nγ) admits an exact fixed-width ReLU realization whose depth is (O(n)). The main new ingredient is a residual memory controller. It replaces the noninvertible residual dynamics by an injective skew-product and permits exact backward replay of the residual states required by a Horner-type evaluation of the affine forcing sum. Offset frames align the forcing atoms away from residual seams, allowing complementary loop readouts to recover their values exactly. The remaining branch-selection ambiguity occurs only where the accumulated affine state has already vanished. For (M\ge 3), the result applies to arbitrary compactly supported continuous piecewise linear forcing terms. For (M=2), the same construction applies to ordinary-frame seam-separated forcing. We also prove a stage-dependent extension for forcing terms in a fixed finite-dimensional continuous piecewise linear span and record the resulting linear-depth upgrade for open-curve, finite-state, and Hilbert- and Morton-type recursive constructions.

Related papers

• CoCurve: Cross-Module Co-Pruning Curvature for Training-Free Structured LLM Pruning [47.406985340436925]
  CoCurve is a calibration-only, fine-tuning-free method that prunes attention and FFN units jointly.<n>It reduces to one budgeted quadratic program, solved in a single shot under a shared attention--FFN budget, with no labels, fine-tuning, or recovery.
  arXiv  Detail & Related papers  (2026-07-20T05:27:57Z)
• Maximal Classicalization of Finite-Group Quantum Reference-Frame Noise [0.0]
  A finite quantum reference token with group-valued misalignment induces a random-unitary channel.<n>We prove that the following conditions are equivalent for a unitary representation U of a finite group G.
  arXiv  Detail & Related papers  (2026-07-14T17:07:57Z)
• Optimization Geometrodynamics: Variational Reduction and Interaction Curvature [0.0]
  We develop geometrodynamics as a variational theory of this hidden determinant pushforward.<n>For affine pre-reductions, the induced interaction curvature is the negative-semidefinite operator $-G*H-1G$.<n>We prove a global analytic bundle with closed totally geodesic fibers and a unique analytic nearest-controller section.
  arXiv  Detail & Related papers  (2026-07-07T18:42:00Z)
• Exact ReLU realization of tensor-product refinement iterates [0.0]
  We prove that for every compactly supported continuous piecewise linear seed g:R2->R, the iterates Vn g admit exact ReLU realizations of fixed width and depth O(n)<n>This gives a first genuinely two-dimensional extension of the exact realization theory for refinement cascades.
  arXiv  Detail & Related papers  (2026-05-05T16:12:32Z)
• Exact Loop Controllers for ReLU Realization of Homogeneous Curve Refinements [0.0]
  We study homogeneous refinement operators ((V)(t)=sum_jinmathbb ZA_j(Mt-j)), acting on compactly supported continuous piecewise linear curves (:mathbb Rtomathbb Rp), where (Mge2) and only finitely many matrices (A_jinmathbb Rptimes p) are nonzero.<n>We prove that the iterates (Vn) admit exact Re
  arXiv  Detail & Related papers  (2026-05-03T00:44:46Z)
• Deep Sequence Modeling with Quantum Dynamics: Language as a Wave Function [0.0]
  We introduce a sequence modeling framework in which the latent state is a complex-valued wave function evolving on a finite-dimensional Hilbert space under a learned, time-dependent Hamiltonian.<n> Token probabilities are extracted using the Born rule, a quadratic measurement operator that couples magnitudes and relative phases.<n>We derive a continuity equation for the latent probability mass, yielding conserved pairwise currents that serve as a built-in diagnostic.
  arXiv  Detail & Related papers  (2026-02-24T23:42:18Z)
• Graph-based Clustering Revisited: A Relaxation of Kernel $k$-Means Perspective [73.18641268511318]
  We propose a graph-based clustering algorithm that only relaxes the orthonormal constraint to derive clustering results.<n>To ensure a doubly constraint into a gradient, we transform the non-negative constraint into a class probability parameter.
  arXiv  Detail & Related papers  (2025-09-23T09:14:39Z)
• Orthogonal Matrix Retrieval with Spatial Consensus for 3D Unknown-View Tomography [58.60249163402822]
  Unknown-view tomography (UVT) reconstructs a 3D density map from its 2D projections at unknown, random orientations. The proposed OMR is more robust and performs significantly better than the previous state-of-the-art OMR approach.
  arXiv  Detail & Related papers  (2022-07-06T21:40:59Z)
• Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
  We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-21T01:47:17Z)
• Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection [136.4014229319618]
  We study the role of the representation of state-action value functions in regret minimization in finite-horizon Markov Decision Processes (MDPs) with linear structure. We first derive a necessary condition on the representation, called universally spanning optimal features (UNISOFT), to achieve constant regret in any MDP with linear reward function.
  arXiv  Detail & Related papers  (2021-10-27T22:07:08Z)
• Multi-Objective Matrix Normalization for Fine-grained Visual Recognition [153.49014114484424]
  Bilinear pooling achieves great success in fine-grained visual recognition (FGVC) Recent methods have shown that the matrix power normalization can stabilize the second-order information in bilinear features. We propose an efficient Multi-Objective Matrix Normalization (MOMN) method that can simultaneously normalize a bilinear representation.
  arXiv  Detail & Related papers  (2020-03-30T08:40:35Z)
• Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion [101.83262280224729]
  We develop a relative error bound for nuclear norm regularized matrix completion. We derive a relative upper bound for recovering the best low-rank approximation of the unknown matrix.
  arXiv  Detail & Related papers  (2015-04-26T13:12:16Z)

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.