Physics-Preserving Latent Compression for Zero-Shot Resolution Transfer in 3D Turbulence

• URL: http://arxiv.org/abs/2606.21781v1
• Date: Fri, 19 Jun 2026 22:02:42 GMT
• Title: Physics-Preserving Latent Compression for Zero-Shot Resolution Transfer in 3D Turbulence
• Abstract summary: High-resolution turbulence modeling is essential for scientific computing.<n>Existing scientific compressors reduce storage but typically operate on per-frame representations.<n>We propose Physics-Preserving Latent Compression (PPLC), a patch-local latent compressor for three-dimensional turbulence.
• Score: 23.18933468902136
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-resolution turbulence modeling is essential for scientific computing, but remains constrained by the cost of direct numerical simulation and the scarcity of full-resolution data. Existing scientific compressors reduce storage but typically operate on per-frame representations, whereas learned compressors yield compact latents that are often resolution-dependent and weakly aligned with the physics of turbulence. This raises the need for a compression framework that reduces data size, preserves physical diagnostics, and transfers from low-resolution training fields to high-resolution test fields without retraining. In this paper, we propose Physics-Preserving Latent Compression (PPLC), a patch-local latent compressor for three-dimensional turbulence. Motivated by inertial-range scale similarity, PPLC treats fixed-size patches as transferable units and applies a shared variational autoencoder independently of the global grid size. It combines exact mean preservation, zero-mean fluctuation encoding, an invertible Haar wavelet front-end, shift-consistency regularization, and overlap-aware reconstruction. Instantiated on forced isotropic turbulence, PPLC is trained only on stride-downsampled 256^3 fields and transfers zero-shot to 1024^3 fields. Experiments show that PPLC improves the balance between reconstruction accuracy and physical fidelity over classical and learned baselines, keeping diagnostics such as dissipation, enstrophy, energy spectra, and incompressibility closer to the ground truth. Beyond turbulence compression, PPLC offers a general strategy for physics-preserving latent representations that support data-efficient scientific surrogate modeling.

Related papers

• EVOLVE: Efficient Learned Volume Compression with Variable-Rate Encoding on a Cross-Domain Database [6.618761947019336]
  We present EVOLVE, an autoencoder (AE)-based volume-compression framework that targets high compression ratios for offline compression.<n>First, we construct a large-scale cross-domain database of 6,376 volumes from 21 scientific simulations, curated via perceptual hashing to ensure diversity.<n>Second, we reexamine the design space of AE-based compressors and incorporate several macro- and micro-designs into a vanilla AE to develop EVOLVE, which substantially improves the expressive power and compression capability.<n>Third, we develop a learnable gain mechanism with a three-stage training strategy to enable variable-rate encoding
  arXiv  Detail & Related papers  (2026-07-20T17:26:21Z)
• Efficient Learned Image Compression without Entropy Coding [62.01837001379442]
  We present Entropy-Coding Free Learned Image Compression (EF-LIC)<n>EF-LIC is a multi-rate framework that generates compact representation by removing statistical and correlation redundancy with low coding latency.<n>Experiments show EF-LIC achieves up to 67.86% reduction over MS-ILLM on Kodak with LPIPS.
  arXiv  Detail & Related papers  (2026-05-22T07:37:30Z)
• SAFE-SVD: Sensitivity-Aware Fidelity-Enforcing SVD for Physics Foundation Models [8.53361303062229]
  We propose a new method for compressing physics foundation models (PFMs) which is a new trend in AI Science.<n>Experiments show substantial gains over existing methods across multiple models and datasets, achieving significantly higher compression ratios while maintaining accuracy, in some cases by orders of magnitude.
  arXiv  Detail & Related papers  (2026-05-18T07:40:46Z)
• Arbitrary Ratio Feature Compression via Next Token Prediction [52.10426317889982]
  Arbitrary Ratio Feature Compression (ARFC) framework supports any compression ratio with a single model.<n>ARC is an auto-regressive model that performs compression via next-gressive prediction.<n>MoS module refines the compressed tokens by utilizing multiple compression results.<n>ERGC is integrated into the training process to preserve semantic and structural relationships during compression.
  arXiv  Detail & Related papers  (2026-02-12T02:38:57Z)
• An Efficient Gradient-Aware Error-Bounded Lossy Compressor for Federated Learning [7.649286962189554]
  Federated learning (FL) enables collaborative model training without exposing clients' private data.<n>EBLC is particularly appealing for its fine-grained utility-compression tradeoff.<n>We propose an EBLC framework tailored for FL gradient data to achieve high compression ratios while preserving model accuracy.
  arXiv  Detail & Related papers  (2025-11-07T23:59:09Z)
• LLMComp: A Language Modeling Paradigm for Error-Bounded Scientific Data Compression (Technical Report) [4.2414540423650795]
  LLMCOMP is a lossy compression paradigm that leverages decoder-only large language models to model scientific data.<n>It consistently outperforms state-of-the-art compressors, achieving up to 30% higher compression ratios under strict error bounds.
  arXiv  Detail & Related papers  (2025-10-24T05:41:04Z)
• Breaking the Compression Ceiling: Data-Free Pipeline for Ultra-Efficient Delta Compression [57.71917274869577]
  UltraDelta is a data-free delta compression pipeline that achieves both ultra-high compression and strong performance.<n>UltraDelta is designed to minimize redundancy, maximize information, and stabilize performance across inter-layer, intra-layer, and global dimensions.
  arXiv  Detail & Related papers  (2025-05-19T10:37:22Z)
• E-3SFC: Communication-Efficient Federated Learning with Double-way Features Synthesizing [23.586844019776024]
  The exponential growth in model sizes has significantly increased the communication burden in Learning (FL)<n>Existing methods to alleviate this burden by transmitting compressed gradients face high compression errors, which slow down the model's performance.<n>We propose a systematical algorithm termed Extended Single-Step Synthetic Features.<n>E-3SFC consists of three sub-components, i.e. the Single-Step Synthetic Features (3SFC), a double-way compression algorithm, and a communication budget scheduler.
  arXiv  Detail & Related papers  (2025-02-05T11:31:21Z)
• Foundation Model for Lossy Compression of Spatiotemporal Scientific Data [11.494915987840876]
  We present a foundation model (FM) for lossy scientific data compression.<n>We combine a variational autoencoder (E) with a hyper-prior structure and a super-resolution (SR) module.
  arXiv  Detail & Related papers  (2024-12-22T22:57:08Z)
• MoDeGPT: Modular Decomposition for Large Language Model Compression [59.361006801465344]
  This paper introduces textbfModular bfDecomposition (MoDeGPT), a novel structured compression framework.<n>MoDeGPT partitions the Transformer block into modules comprised of matrix pairs and reduces the hidden dimensions.<n>Our experiments show MoDeGPT, without backward propagation, matches or surpasses previous structured compression methods.
  arXiv  Detail & Related papers  (2024-08-19T01:30:14Z)
• Fed-CVLC: Compressing Federated Learning Communications with Variable-Length Codes [54.18186259484828]
  In Federated Learning (FL) paradigm, a parameter server (PS) concurrently communicates with distributed participating clients for model collection, update aggregation, and model distribution over multiple rounds. We show strong evidences that variable-length is beneficial for compression in FL. We present Fed-CVLC (Federated Learning Compression with Variable-Length Codes), which fine-tunes the code length in response to the dynamics of model updates.
  arXiv  Detail & Related papers  (2024-02-06T07:25:21Z)
• Degradation-Aware Unfolding Half-Shuffle Transformer for Spectral Compressive Imaging [142.11622043078867]
  We propose a principled Degradation-Aware Unfolding Framework (DAUF) that estimates parameters from the compressed image and physical mask, and then uses these parameters to control each iteration. By plugging HST into DAUF, we establish the first Transformer-based deep unfolding method, Degradation-Aware Unfolding Half-Shuffle Transformer (DAUHST) for HSI reconstruction.
  arXiv  Detail & Related papers  (2022-05-20T11:37:44Z)

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.