Escaping Spectral Bias without Backpropagation: Fast Implicit Neural Representations with Extreme Learning Machines

• URL: http://arxiv.org/abs/2602.07603v1
• Date: Sat, 07 Feb 2026 16:12:39 GMT
• Title: Escaping Spectral Bias without Backpropagation: Fast Implicit Neural Representations with Extreme Learning Machines
• Abstract summary: Training implicit neural representations (INRs) to capture fine-scale details typically relies on iterative backpropagation.<n>We propose ELM-INR, a backpropagation-free INR that decomposes the domain into iterative and fits each local problem using an Extreme Learning Machine (ELM) in closed form.<n>This design yields fast and numerically robust reconstruction by combining local predictors through a partition of unity.
• Score: 4.6894180050630005
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Training implicit neural representations (INRs) to capture fine-scale details typically relies on iterative backpropagation and is often hindered by spectral bias when the target exhibits highly non-uniform frequency content. We propose ELM-INR, a backpropagation-free INR that decomposes the domain into overlapping subdomains and fits each local problem using an Extreme Learning Machine (ELM) in closed form, replacing iterative optimization with stable linear least-squares solutions. This design yields fast and numerically robust reconstruction by combining local predictors through a partition of unity. To understand where approximation becomes difficult under fixed local capacity, we analyze the method from a spectral Barron norm perspective, which reveals that global reconstruction error is dominated by regions with high spectral complexity. Building on this insight, we introduce BEAM, an adaptive mesh refinement strategy that balances spectral complexity across subdomains to improve reconstruction quality in capacity-constrained regimes.

Related papers

• CG-GLORE: A Conjugate Gradient-Based Global-Local Regularization Network for Sparse-View CT Reconstruction [3.7567584936415166]
  Sparse-view computed tomography (CT) reduces radiation dose by acquiring fewer projection views, but the resulting inverse problem is highly ill-posed.<n>Existing deep reconstruction methods have achieved promising performance, yet many rely on first-order updates or large regularization networks.<n>We propose textbfCG-GLORE, a compact deep unrolling framework inspired by second-order optimization for sparse-view CT reconstruction.
  arXiv  Detail & Related papers  (2026-08-15T14:08:44Z)
• CLEAR: Conflict-aware Learning via Evidence-guided Adaptive Routing for Unified Sparse-View 3D Gaussian Super-Resolution [80.43237927269575]
  We propose CLEAR as the first unified single-stage framework for Sparse-view 3D Gaussian Splatting Super-resolution.<n> CLEAR performs joint the optimization of authentic LR observations and external HR priors within a unified Gaussian representation.<n>Experiments on both synthetic and real-world $4times$ super-resolution benchmarks demonstrate that CLEAR consistently achieves state-of-the-art rendering quality.
  arXiv  Detail & Related papers  (2026-08-03T13:31:53Z)
• MG-SpaIR: Multi-grade Sparse-guided Implicit Representation for Training-Data-Free Image Restoration [15.897294007874898]
  MG-SpaIR is a training-data-free framework for restoring a clean image from a single observation.<n>We introduce a multi-grade coarse-to-fine residual hierarchy that progressively refines the reconstruction across resolution grades.<n> Experiments on mixed-degradation benchmarks demonstrate that MG-SpaIR consistently outperforms strong training-data-free baselines.
  arXiv  Detail & Related papers  (2026-06-30T20:17:37Z)
• Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals [83.0127582612634]
  Near-boundary Rescue (NSR) is a minimal, plug-and-play modification that retains out-of-bound tokens to recover lost signals.<n>NSR substantially improves training stability and delivers consistent gains over strong baselines such as DAPO and GSPO.
  arXiv  Detail & Related papers  (2026-05-21T16:45:31Z)
• Next-Acceleration-Scale Prediction for Autoregressive MRI Reconstruction [52.32112533846212]
  MRI reconstruction is an inherently ill-posed inverse problem, since incomplete measurements admit many plausible solutions.<n>We address this limitation by moving reconstruction to discrete multi-scale latent space and posing it as autoregressive next-acceleration-scale prediction.<n>We show that our approach delivers improved reconstruction performance across diverse sampling patterns under extreme undersampling.
  arXiv  Detail & Related papers  (2026-05-19T04:40:50Z)
• DegBins: Degradation-Driven Binning for Depth Super-Resolution [57.61783461543096]
  DegBins is a novel DSR framework that leverages degradation-driven binning to adaptively enhance residual modeling.<n>DegBins consistently outperforms existing state-of-the-art methods in terms of accuracy, robustness, and generalization.
  arXiv  Detail & Related papers  (2026-05-10T16:17:11Z)
• PILIR: Physics-Informed Local Implicit Representation [10.009790673923789]
  We introduce the Physics-Informed Local Implicit Representation (PILIR)<n>Our approach separates the global physical domain into a discrete latent feature space and a continuous generative decoder.<n>A generative neural operator then synthesizes these local latent features into continuous physical fields, allowing accurate reconstruction of fine-scale structures.
  arXiv  Detail & Related papers  (2026-05-01T04:07:39Z)
• Spectral Regularization for Diffusion Models [14.919876123456747]
  We propose a loss-level spectral regularization framework that augments standard diffusion training with differentiable Fourier- and wavelet-domain losses.<n>Our approach is compatible with DDPM, DDIM, and EDM formulations and introduces negligible computational overhead.
  arXiv  Detail & Related papers  (2026-03-02T22:39:02Z)
• FUTON: Fourier Tensor Network for Implicit Neural Representations [56.48739018255443]
  Implicit neural representations (INRs) have emerged as powerful tools for encoding signals, yet dominant-based designs often suffer from slow convergence, overfitting to noise, and poor extrapolation.<n>We introduce FUTON, which models signals as generalized Fourier series whose coefficients are parameterized by a low-rank tensor decomposition.
  arXiv  Detail & Related papers  (2026-02-13T19:31:44Z)
• Self-Reinforced Deep Priors for Reparameterized Full Waveform Inversion [3.930876721046067]
  We propose a self-reinforced DIP-FWI framework, in which a steering algorithm alternately updates both the network parameters and the input at each iteration.<n>SRDIP-FWI achieves superior resolution, improved accuracy and greater depth penetration compared to multiscale FWI.
  arXiv  Detail & Related papers  (2025-12-09T06:30:39Z)
• Mixture of Ranks with Degradation-Aware Routing for One-Step Real-World Image Super-Resolution [76.66229730098759]
  In real-world image super-resolution (Real-ISR), existing approaches mainly rely on fine-tuning pre-trained diffusion models.<n>We propose a Mixture-of-Ranks (MoR) architecture for single-step image super-resolution.<n>We introduce a fine-grained expert partitioning strategy that treats each rank in LoRA as an independent expert.
  arXiv  Detail & Related papers  (2025-11-20T04:11:44Z)
• Low-Rank Tensor Recovery via Variational Schatten-p Quasi-Norm and Jacobian Regularization [49.85875869048434]
  We propose a CP-based low-rank tensor function parameterized by neural networks for implicit neural representation.<n>To achieve sparser CP decomposition, we introduce a variational Schatten-p quasi-norm to prune redundant rank-1 components.<n>For smoothness, we propose a regularization term based on the spectral norm of the Jacobian and Hutchinson's trace estimator.
  arXiv  Detail & Related papers  (2025-06-27T11:23:10Z)
• Generalization of Scaled Deep ResNets in the Mean-Field Regime [55.77054255101667]
  We investigate emphscaled ResNet in the limit of infinitely deep and wide neural networks. Our results offer new insights into the generalization ability of deep ResNet beyond the lazy training regime.
  arXiv  Detail & Related papers  (2024-03-14T21:48:00Z)
• Convergence of mean-field Langevin dynamics: Time and space discretization, stochastic gradient, and variance reduction [49.66486092259376]
  The mean-field Langevin dynamics (MFLD) is a nonlinear generalization of the Langevin dynamics that incorporates a distribution-dependent drift. Recent works have shown that MFLD globally minimizes an entropy-regularized convex functional in the space of measures. We provide a framework to prove a uniform-in-time propagation of chaos for MFLD that takes into account the errors due to finite-particle approximation, time-discretization, and gradient approximation.
  arXiv  Detail & Related papers  (2023-06-12T16:28:11Z)
• Hyperspectral Image Denoising Using Non-convex Local Low-rank and Sparse Separation with Spatial-Spectral Total Variation Regularization [49.55649406434796]
  We propose a novel non particular approach to robust principal component analysis for HSI denoising. We develop accurate approximations to both rank and sparse components. Experiments on both simulated and real HSIs demonstrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2022-01-08T11:48:46Z)
• Multi-Head ReLU Implicit Neural Representation Networks [3.04585143845864]
  A novel multi-head multi-layer perceptron (MLP) structure is presented for implicit neural representation (INR) We show that the proposed model does not suffer from the special bias of conventional ReLU networks and has superior capabilities.
  arXiv  Detail & Related papers  (2021-10-07T13:27:35Z)
• Probabilistic partition of unity networks: clustering based deep approximation [0.0]
  Partition of unity networks (POU-Nets) have been shown capable of realizing algebraic convergence rates for regression and solution of PDEs. We enrich POU-Nets with a Gaussian noise model to obtain a probabilistic generalization amenable to gradient-based generalizations of a maximum likelihood loss. We provide benchmarks quantifying performance in high/low-dimensions, demonstrating that convergence rates depend only on the latent dimension of data within high-dimensional space.
  arXiv  Detail & Related papers  (2021-07-07T08:02:00Z)
• Learned convex regularizers for inverse problems [3.294199808987679]
  We propose to learn a data-adaptive input- neural network (ICNN) as a regularizer for inverse problems. We prove the existence of a sub-gradient-based algorithm that leads to a monotonically decreasing error in the parameter space with iterations. We show that the proposed convex regularizer is at least competitive with and sometimes superior to state-of-the-art data-driven techniques for inverse problems.
  arXiv  Detail & Related papers  (2020-08-06T18:58:35Z)
• Stochastic spectral embedding [0.0]
  We propose a novel sequential adaptive surrogate modeling method based on "stochastic spectral embedding" (SSE) We show how the method compares favorably against state-of-the-art sparse chaos expansions on a set of models with different complexity and input dimension.
  arXiv  Detail & Related papers  (2020-04-09T11:00:07Z)
• Modal Regression based Structured Low-rank Matrix Recovery for Multi-view Learning [70.57193072829288]
  Low-rank Multi-view Subspace Learning has shown great potential in cross-view classification in recent years. Existing LMvSL based methods are incapable of well handling view discrepancy and discriminancy simultaneously. We propose Structured Low-rank Matrix Recovery (SLMR), a unique method of effectively removing view discrepancy and improving discriminancy.
  arXiv  Detail & Related papers  (2020-03-22T03:57: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.