Pruning AMR: Efficient Visualization of Implicit Neural Representations via Weight Matrix Analysis

• URL: http://arxiv.org/abs/2512.02967v1
• Date: Tue, 02 Dec 2025 17:49:01 GMT
• Title: Pruning AMR: Efficient Visualization of Implicit Neural Representations via Weight Matrix Analysis
• Authors: Jennifer Zvonek, Andrew Gillette,
• Abstract summary: An implicit neural representation (INR) is a neural network that approximates a function.<n>We present PruningAMR, an algorithm that builds a mesh with a resolution adapted to geometric features by the INR.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: An implicit neural representation (INR) is a neural network that approximates a spatiotemporal function. Many memory-intensive visualization tasks, including modern 4D CT scanning methods, represent data natively as INRs. While INRs are prized for being more memory-efficient than traditional data stored on a lattice, many visualization tasks still require discretization to a regular grid. We present PruningAMR, an algorithm that builds a mesh with resolution adapted to geometric features encoded by the INR. To identify these geometric features, we use an interpolative decomposition pruning method on the weight matrices of the INR. The resulting pruned network is used to guide adaptive mesh refinement, enabling automatic mesh generation tailored to the underlying resolution of the function. Starting from a pre-trained INR--without access to its training data--we produce a variable resolution visualization with substantial memory savings.

Related papers

• Sampling Theory for Super-Resolution with Implicit Neural Representations [0.3222802562733786]
  Implicit neural representations (INRs) have emerged as a powerful tool for solving inverse problems in computer and computational imaging.<n>We show how to fit a hidden-layer INR with ReLU and a hidden Fourier layer using a form of weight decay regularization.<n>We empirically assess the probability of achieving exact recovery of images realized by low-width single-layer INRs.
  arXiv  Detail & Related papers  (2025-06-11T17:18:20Z)
• Meta-INR: Efficient Encoding of Volumetric Data via Meta-Learning Implicit Neural Representation [4.782024723712711]
  Implicit neural representation (INR) has emerged as a promising solution for encoding volumetric data.<n>We propose Meta-INR, a pretraining strategy adapted from meta-learning algorithms to learn initial INR parameters from partial observation of a dataset.<n>We demonstrate that Meta-INR can effectively extract high-quality generalizable features that help encode unseen similar volume data across diverse datasets.
  arXiv  Detail & Related papers  (2025-02-12T21:54:22Z)
• Towards a Sampling Theory for Implicit Neural Representations [0.3222802562733786]
  Implicit neural representations (INRs) have emerged as a powerful tool for solving inverse problems in computer and computational imaging.<n>We show how to recover images from a hidden-layer INR using a generalized form of weight decay regularization.<n>We empirically assess the probability of achieving exact recovery images realized by low-width single-layer INRs, and illustrate the performance of INR on super-resolution recovery of more realistic continuous domain phantom images.
  arXiv  Detail & Related papers  (2024-05-28T17:53:47Z)
• Heterogenous Memory Augmented Neural Networks [84.29338268789684]
  We introduce a novel heterogeneous memory augmentation approach for neural networks. By introducing learnable memory tokens with attention mechanism, we can effectively boost performance without huge computational overhead. We show our approach on various image and graph-based tasks under both in-distribution (ID) and out-of-distribution (OOD) conditions.
  arXiv  Detail & Related papers  (2023-10-17T01:05:28Z)
• Deep Multi-Threshold Spiking-UNet for Image Processing [51.88730892920031]
  This paper introduces the novel concept of Spiking-UNet for image processing, which combines the power of Spiking Neural Networks (SNNs) with the U-Net architecture. To achieve an efficient Spiking-UNet, we face two primary challenges: ensuring high-fidelity information propagation through the network via spikes and formulating an effective training strategy. Experimental results show that, on image segmentation and denoising, our Spiking-UNet achieves comparable performance to its non-spiking counterpart.
  arXiv  Detail & Related papers  (2023-07-20T16:00:19Z)
• Signal Processing for Implicit Neural Representations [80.38097216996164]
  Implicit Neural Representations (INRs) encode continuous multi-media data via multi-layer perceptrons. Existing works manipulate such continuous representations via processing on their discretized instance. We propose an implicit neural signal processing network, dubbed INSP-Net, via differential operators on INR.
  arXiv  Detail & Related papers  (2022-10-17T06:29:07Z)
• Transformers as Meta-Learners for Implicit Neural Representations [10.673855995948736]
  Implicit Neural Representations (INRs) have emerged and shown their benefits over discrete representations in recent years. We propose a formulation that uses Transformers as hypernetworks for INRs, where it can directly build the whole set of INR weights. We demonstrate the effectiveness of our method for building INRs in different tasks and domains, including 2D image regression and view synthesis for 3D objects.
  arXiv  Detail & Related papers  (2022-08-04T17:54:38Z)
• Robust lEarned Shrinkage-Thresholding (REST): Robust unrolling for sparse recover [87.28082715343896]
  We consider deep neural networks for solving inverse problems that are robust to forward model mis-specifications. We design a new robust deep neural network architecture by applying algorithm unfolding techniques to a robust version of the underlying recovery problem. The proposed REST network is shown to outperform state-of-the-art model-based and data-driven algorithms in both compressive sensing and radar imaging problems.
  arXiv  Detail & Related papers  (2021-10-20T06:15:45Z)
• A novel Deep Neural Network architecture for non-linear system identification [78.69776924618505]
  We present a novel Deep Neural Network (DNN) architecture for non-linear system identification. Inspired by fading memory systems, we introduce inductive bias (on the architecture) and regularization (on the loss function) This architecture allows for automatic complexity selection based solely on available data.
  arXiv  Detail & Related papers  (2021-06-06T10:06:07Z)
• Deep Neural Networks Based Weight Approximation and Computation Reuse for 2-D Image Classification [0.9507070656654631]
  Deep Neural Networks (DNNs) are computationally and memory intensive. This paper introduces a new method to improve DNNs performance by fusing approximate computing with data reuse techniques. It is suitable for IoT edge devices as it reduces the memory size requirement as well as the number of needed memory accesses.
  arXiv  Detail & Related papers  (2021-04-28T10:16:53Z)
• Modeling from Features: a Mean-field Framework for Over-parameterized Deep Neural Networks [54.27962244835622]
  This paper proposes a new mean-field framework for over- parameterized deep neural networks (DNNs) In this framework, a DNN is represented by probability measures and functions over its features in the continuous limit. We illustrate the framework via the standard DNN and the Residual Network (Res-Net) architectures.
  arXiv  Detail & Related papers  (2020-07-03T01:37: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.