mlsanityData to 13 Oct 2026

Scientific Data Compression and Super-Resolution Sampling

arXiv 2511.13675 ↗First posted 17 Nov 2025cs.LG physics.data-an stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Modern scientific simulations, observations, and large-scale experiments generate data at volumes that often exceed the limits of storage, processing, and analysis. This challenge drives the development of data reduction methods that efficiently manage massive datasets while preserving essential physical features and quantities of interest. In many scientific workflows, it is also crucial to enable data recovery from compressed representations - a task known as super-resolution - with guarantees on the preservation of key physical characteristics. A notable example is checkpointing and restarting, which is essential for long-running simulations to recover from failures, resume after interruptions, or examine intermediate results. In this work, we introduce a novel framework for scientific data compression and super-resolution, grounded in recent advances in learning exponential families. Our method preserves and quantifies uncertainty in physical quantities of interest and supports flexible trade-offs between compression ratio and reconstruction fidelity.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 17 of its 50 references that are in the map. First posted on arXiv 17 Nov 2025.

Builds on

17 of 50 references.

References · 17

  1. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,028
  2. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,077
  3. 2016A Theory of Generative ConvNetcited by 174
  4. 2019Learning Non-Convergent Non-Persistent Short-Run MCMC Toward Energy-Based Modelcited by 147
  5. 2019On the Anatomy of MCMC-Based Maximum Likelihood Learning of Energy-Based Modelscited by 105
  6. 2016Medical image denoising using convolutional denoising autoencoderscited by 76
  7. 2022Statistical Efficiency of Score Matching: The View from Isoperimetrycited by 64
  8. 2014Efficiently learning Ising models on arbitrary graphscited by 50
  9. 2016Interaction Screening: Efficient and Sample-Optimal Learning of Ising Modelscited by 43
  10. 2019Efficient Learning of Discrete Graphical Modelscited by 21
  11. 2023Provable benefits of score matchingcited by 18
  12. 2023Sampling Multimodal Distributions with the Vanilla Score: Benefits of Data-Based Initializationcited by 10
5 more
  1. 2024Efficiently learning and sampling multimodal distributions with data-based initializationcited by 6
  2. 2020Target-Embedding Autoencoders for Supervised Representation Learningcited by 5
  3. 2020Programmable Quantum Annealers as Noisy Gibbs Samplerscited by 4
  4. 2020BUDD: Multi-modal Bayesian Updating Deforestation Detectionscited by 1
  5. 2022Semi-supervised classification using a supervised autoencoder for biomedical applicationscited by 1

Built on by

Not cited yet.