Skip to content

Multivariate Scientific Data Compression with Learned Cross-Variable Latent Decorrelation and Autoregressive Entropy Modeling

Aug 2026 · 0 citations · 26 references
Computer Science

TL;DR

CAESAR-LDAR is presented, an error-controlled multivariate learned compressor that augments a shared CAESAR-V backbone with two complementary mechanisms: a trainable orthogonal transform that reorganizes dependence across aligned latent channels, and a causal autoregressive hierarchical prior that captures local spatial structure left after transformation.

Abstract

Scientific simulations generate collections of physical fields with heterogeneous statistics and dependencies, yet learned compressors often encode those fields independently or rely on a shared encoder without explicitly modeling the structure that remains in latent space. We present CAESAR-LDAR, an error-controlled multivariate learned compressor that augments a shared CAESAR-V backbone with two complementary mechanisms: a trainable orthogonal transform that reorganizes dependence across aligned latent channels, and a causal autoregressive hierarchical prior that captures local spatial structure left after transformation. Orthogonality is maintained through a matrix-exponential parameterization, making the transform exactly invertible without an additional penalty. A common residual-correction stage is applied uniformly to all variants to enforce the requested reconstruction tolerance. Experiments across combustion, climate, and turbulence data show that the two mechanisms are useful in different regimes. Latent decorrelation helps most when substantial linear cross-channel dependence survives the nonlinear encoder, whereas autoregressive modeling remains effective when the remaining structure is primarily local or spatial. Their combination provides the strongest or near-strongest rate-distortion performance across the evaluated datasets. The global transform adds little computational overhead, while autoregressive coding introduces a larger throughput tradeoff. More broadly, the results suggest a practical design principle for multivariate scientific compression: exploit global cross-channel dependence when it is measurably present in latent space, and use local probabilistic context as a complementary mechanism across a wider range of data regimes.

View source

Similar papers

#machine learning Preprint Sep 2026

Neural Residual Modeling for Scientific Data Compression under Guaranteed Error Bounds

This work proposes a post-processing pipeline that augments an RVQ-based compressor with a U-Net trained to predict and correct pixel-space residuals between the original volume and its RVQ reconstruction, and is the first pipeline to combine latent-space RVQ, explicit pixel-space residual correction via a deep spatial...

Surya Majumder, Liang-Ji Zhu, Sanjay Ranka et al. · 0 citations
Preprint Aug 2026

Conditional-Independence-Regularized Distributional Autoencoders for Mixed-Type Data

This work introduces Conditional-Independence-Regularized Distributional Autoencoders, a framework for learning low-dimensional representations of mixed-type data through conditional distribution matching and structural regularization that achieves strong performance on both synthetic and real-world datasets.

Si-Yuan Tang, Gong-Jun Xu, Ji Zhu · 0 citations
#artificial intelligence Preprint Sep 2026

Superposed Latent Autoencoder

The Superposed Latent Autoencoder (SLAE) is introduced, which preserves high-capacity latent representations while sharing storage through learned superposition, and suggests a new principle for representation compression: instead of making every latent smaller, keep representations wide and let them share memory.

Quan-Ling Zhao, Jia-Ying Yang, Tian-Qi Zhang et al. · 0 citations
Book Open access Sep 2026

SSQT: A Hardware-Friendly Fusion Compression Framework of Structured Sparsification and Sensitivity-Driven Quantization for Large-Scale Language Models

The results show that compression and execution layout must be co-designed to convert model-size reduction into practical parallel inference acceleration, and that compression and execution layout must be co-designed to convert model-size reduction into practical parallel inference acceleration.

Qian-Sheng Song, Guo-Lin Tang · 0 citations
#machine learning Preprint Sep 2026

Learning Functional Subspaces for Neural Network Compression

Modern transformers pair impressive capabilities with substantial memory and compute demands. Low-rank weight factorization reduces both while keeping the matrices dense, and thus efficient on standard hardware. Existing methods, however, choose the subspace to remove from each weight matrix with local closed-form crit...

Massimo Bini, Anders Christensen, S. Alaniz et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Residual Sparsification via Output Importance for Compressing Mixture-of-Experts LLMs

PARSER is a new residual sparsification method that shifts the compression objective from minimizing isolated matrix errors to preserving the expert output error, and achieves this by introducing output importance, which measures the actual contribution to the expert output error.

Seung-Woo Jung, Dohyeok Kwon, Seung-Min Cha et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.