English
Related papers

Related papers: A General Framework for Augmenting Lossy Compresso…

200 papers

Lossy compression has become an important technique to reduce data size in many domains. This type of compression is especially valuable for large-scale scientific data, whose size ranges up to several petabytes. Although Autoencoder-based…

Machine Learning · Computer Science 2024-07-03 Hieu Le , Jian Tao

Data compression plays a key role in reducing storage and I/O costs. Traditional lossy methods primarily target data on rectilinear grids and cannot leverage the spatial coherence in unstructured mesh data, leading to suboptimal compression…

Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…

Information Theory · Computer Science 2023-09-19 Amirmohammad Farzaneh , Mihai-Alin Badiu , Justin P. Coon

Many real-world datasets are represented as tensors, i.e., multi-dimensional arrays of numerical values. Storing them without compression often requires substantial space, which grows exponentially with the order. While many tensor…

Machine Learning · Computer Science 2023-09-21 Taehyung Kwon , Jihoon Ko , Jinhong Jung , Kijung Shin

Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale…

Computational Geometry · Computer Science 2024-10-01 Mingzhe Li , Hamish Carr , Oliver Rübel , Bei Wang , Gunther H. Weber

Tensor decompositions have been successfully applied to compress neural networks. The compression algorithms using tensor decompositions commonly minimize the approximation error on the weights. Recent work assumes the approximation error…

Machine Learning · Computer Science 2023-08-07 Jetze T. Schuurmans , Kim Batselier , Julian F. P. Kooij

With ever-increasing volumes of scientific floating-point data being produced by high-performance computing applications, significantly reducing scientific floating-point data size is critical, and error-controlled lossy compressors have…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-01-20 Robert Underwood , Sheng Di , Jon C. Calhoun , Franck Cappello

Neural networks embedded in safety-sensitive applications such as self-driving cars and wearable health monitors rely on two important techniques: input attribution for hindsight analysis and network compression to reduce its size for…

Machine Learning · Computer Science 2020-10-29 Geondo Park , June Yong Yang , Sung Ju Hwang , Eunho Yang

Lossy compressors are increasingly adopted in scientific research, tackling volumes of data from experiments or parallel numerical simulations and facilitating data storage and movement. In contrast with the notion of entropy in lossless…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-16 Robert Underwood , Julie Bessac , David Krasowska , Jon C. Calhoun , Sheng Di , Franck Cappello

Ensemble methods are among the state-of-the-art predictive modeling approaches. Applied to modern big data, these methods often require a large number of sub-learners, where the complexity of each learner typically grows with the size of…

Machine Learning · Computer Science 2018-10-29 Amichai Painsky , Saharon Rosset

Error-bounded lossy compression is one of the most efficient solutions to reduce the volume of scientific data. For lossy compression, progressive decompression and random-access decompression are critical features that enable on-demand…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-03 Daoce Wang , Pascal Grosset , Jesus Pulido , Jiannan Tian , Tushar M. Athawale , Jinda Jia , Baixi Sun , Boyuan Zhang , Sian Jin , Kai Zhao , James Ahrens , Fengguang Song

Graph compression is a data analysis technique that consists in the replacement of parts of a graph by more general structural patterns in order to reduce its description length. It notably provides interesting exploration tools for the…

Data Structures and Algorithms · Computer Science 2018-07-19 Robin Lamarche-Perrin

Compressed sensing techniques enable efficient acquisition and recovery of sparse, high-dimensional data signals via low-dimensional projections. In this work, we propose Uncertainty Autoencoders, a learning framework for unsupervised…

Machine Learning · Statistics 2019-04-15 Aditya Grover , Stefano Ermon

We propose a novel approach for preserving topological structures of the input space in latent representations of autoencoders. Using persistent homology, a technique from topological data analysis, we calculate topological signatures of…

Machine Learning · Computer Science 2021-06-01 Michael Moor , Max Horn , Bastian Rieck , Karsten Borgwardt

Ensemble data assimilation techniques form an indispensable part of numerical weather prediction. As the ensemble size grows and model resolution increases, the amount of required storage becomes a major issue. Data compression schemes may…

Topological Data Analysis (TDA) provides tools to describe the shape of data, but integrating topological features into deep learning pipelines remains challenging, especially when preserving local geometric structure rather than…

Machine Learning · Computer Science 2026-04-21 Elena Xinyi Wang , Arnur Nigmetov , Dmitriy Morozov

Because of the vast volume of data being produced by today's scientific simulations, lossy compression allowing user-controlled information loss can significantly reduce the data size and the I/O burden. However, for large-scale cosmology…

Information Theory · Computer Science 2017-08-08 Dingewn Tao , Sheng Di , Zizhong Chen , Franck Cappello

Error-bounded lossy compression is a critical technique for significantly reducing scientific data volumes. With ever-emerging heterogeneous high-performance computing (HPC) architecture, GPU-accelerated error-bounded compressors (such as…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-09-07 Jiannan Tian , Sheng Di , Xiaodong Yu , Cody Rivera , Kai Zhao , Sian Jin , Yunhe Feng , Xin Liang , Dingwen Tao , Franck Cappello

Deep Click-Through Rate (CTR) prediction models play an important role in modern industrial recommendation scenarios. However, high memory overhead and computational costs limit their deployment in resource-constrained environments.…

Information Retrieval · Computer Science 2024-06-12 Hao Yu , Minghao Fu , Jiandong Ding , Yusheng Zhou , Jianxin Wu

Error-bounded lossy compression has been a critical technique to significantly reduce the sheer amounts of simulation datasets for high-performance computing (HPC) scientific applications while effectively controlling the data distortion…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-23 Tripti Agarwal , Sheng Di , Jiajun Huang , Yafan Huang , Ganesh Gopalakrishnan , Robert Underwood , Kai Zhao , Xin Liang , Guanpeng Li , Franck Cappello