CORTEXA
← Browse
arxivcs.LG2026-07-01

Efficient Compression of Structured and Unstructured Volumes via Learned 3D Gaussian Representation

Landon Dyken, Sharmistha Chakrabarti, Nathan Debardeleben, Steve Petruzza, Qi Wu, Will Usher, Sidharth Kumar

Recent work has shown that implicit neural representations (INRs) can be trained to effectively compress structured and unstructured volume data, allowing for direct data querying with a reduced memory footprint. However, as existing INRs for unstructured volumes do not encode geometry, they require partial mesh storage for later sampling, limiting achievable compression. At the same time, novel view synthesis methods have shown that explicit collections of 3D Gaussians can be used to accurately visualize volume data. In this work, we introduce an explicit model for volume data compression based on 3D Gaussian primitives. We reinterpret collections of 3D Gaussians as an explicit representation of a scalar field and use a sampling strategy that reconstructs scalar values at spatial locations through weighted aggregation of intersecting Gaussians. We develop optimized CUDA-accelerated pipelines for structured and unstructured model sampling, loss functions that encourage accurate domain encoding by our models, and a novel sampling-error based densification strategy. Our explicit formulation naturally encodes domain geometry, eliminating the need for mesh storage in unstructured volumes and introducing significantly higher compression opportunities. Compared to existing INRs, we demonstrate that our explicit model achieves competitive reconstruction quality with significant training speedups on structured volumes, while markedly outperforming in all metrics on unstructured volumes.

View free PDFSource page

Related papers

arxivcs.LG2026-07-31

Sample Efficient Hierarchical Reinforcement Learning via Best Policy Identification

Anders Jonsson, Emilie Kaufmann, Gianmarco Tedeschi, Lorenzo Steccanella

We present HBPI-UCRL, a model-based algorithm for hierarchical reinforcement learning (HRL) that learns high-level and low-level policies in parallel. HBPI-UCRL exploits the fact that a high-level transition corresponds to a multi-step transition at the low level. We introduce tw…

View free PDFSource page
arxivcs.LGcs.AIstat.ML2026-07-23

Hilbert Operator for Progressive Encoding (HOPE): A Mathematical Framework for Deconstructing Learned Representations in Deep Networks

Hossein Mobahi, Peter L. Bartlett

Deep neural networks encode complex representations, but deconstructing this internal knowledge remains a challenge. Given the link between learning and compression, network compression offers a promising lens to analyze this knowledge. However, standard compression heuristics of…

View free PDFSource page
arxivphysics.flu-dyncs.LGquant-ph2026-07-23

Explainable quantum-compressed machine learning for complex fluid flows

Xiao Xue, Maida Wang, Mingyang Gao, Minh Chung, Peter V. Coveney

Machine-learning surrogates of physical systems face a paradox: explainable models facing the challenge of expressivity to capture complex nonlinear flows, whereas expressive deep surrogates match high-fidelity simulations only through massive parameterisations that turn the lear…

View free PDFSource page
arxivcs.LG2026-07-23

Parameter-free Adaptive Sparse Attention via Compression-Based Content Selection

Debarshi Kundu, Swaroop Ghosh, Vasant Honavar

Data-adaptive sparse attention masks substantially outperform fixed patterns (e.g., BigBird and Longformer) and can even exceed dense attention on long sequences. Existing adaptive approaches---including SBM-Transformer, Dynamic Mask Attention, and NSA---typically require additio…

View free PDFSource page
arxivcs.LG2026-07-24

Efficient Recommendations via Graph Coarsening and Label Propagation

Alessandro Sbandi, Federico Siciliano, Fabrizio Silvestri

Graph-based recommendations are widely adopted in real-world industrial applications. However, graphs in these systems often reach a massive scale, posing notable scalability and efficiency challenges. This requires techniques that can effectively balance predictive quality with…

View free PDFSource page
arxivcs.LG2026-07-24

Integrated Order Dispatching and Routing for Last-Mile Pickup via Deep Reinforcement Learning

Yida Xu, Zhaofang Mao, Yuheng Miao, Jiaxin Zhang, Yiting Sun

In recent years, the growing complexity of last-mile pickup operations has increased the need for fast and accurate decision-making on logistics platforms. This challenge is fundamentally driven by two key and tightly coupled decision-making processes: order dispatching and routi…

View free PDFSource page