arXiv:2608. 14112v1 Announce Type: cross Abstract: Scientific simulations often produce scalar volumes faster than they can be stored, transferred, and loaded, while in situ reduction must use only a limited share of simulation resources.
arXiv:2607. 18187v1 Announce Type: cross Abstract: Large-scale scientific simulations generate volumetric data at rates that far outpace advances in storage and network bandwidth, making effective lossy compression increasingly critical.
arXiv:2607. 01164v1 Announce Type: new Abstract: 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.
arXiv:2606. 01790v1 Announce Type: cross Abstract: Vision-language-model-based graphical user interface (GUI) agents have shown broad automation capabilities, yet deployment is bottlenecked by a key-value (KV) cache that grows linearly with interaction steps.
Feed-forward 3D Gaussian Splatting enables efficient novel-view synthesis without per-scene optimization, but most existing methods assume a fixed set of context views and process them jointly. This limits their applicability to online scenarios where calibrated views arrive sequentially and the scene must be updated causally.
KISS-GS is a modular compression pipeline for 3D Gaussian Splatting (3DGS) scenes that separates compression from training. It first compacts a vanilla 3DGS scene by 15.7× using state‑of‑the‑art pruning, then encodes the result into the SOG‑XT image‑based format, achieving an additional 6.6× reduction. Optional encoding‑aware fine‑tuning can further cut the size by 2.2×, yielding total reductions of 85× to 319× on standard benchmarks while enabling web‑native decoding.
arXiv:2608. 04515v1 Announce Type: cross Abstract: Slice-based MLLMs leverage mature 2D encoders by representing 3D volumes as sequences of 2D slices.
arXiv:2606. 00144v1 Announce Type: cross Abstract: Speculative decoding speeds up autoregressive decoding by using a drafter to propose multiple tokens that a verifier validates in parallel.
CC-4DGS introduces a storage‑efficient framework for dynamic 4D Gaussian splatting by replacing large multi‑resolution hash tables with a deterministic dense hash encoding and compact neural decoders, reducing deformation storage to 1–3 MB per scene. It also compresses canonical point‑cloud attributes through conditional autoencoding, selective quantization, and residual codebooks, achieving 3–5× reduction in point‑cloud size with negligible quality loss. The combined approach maintains real‑time rendering performance while lowering total storage to 20–30 MB, matching state‑of‑the‑art reconstruction accuracy on N3DV and Technicolor Light Field datasets.
Gauss What You Need: Compact Gaussian Splatting Across Scene Scales introduces TangoGS, a method that automatically selects the number of Gaussian primitives for 3D Gaussian Splatting by combining capture-derived model sizing with training-based adaptation. The approach first estimates a learning allowance based on the capture’s total pixels, then adjusts the number of Gaussians during training according to reconstruction quality. On standard benchmarks, TangoGS matches the best baseline’s PSNR while using 48% fewer Gaussians, and on larger captures it scales automatically to achieve the highest mean PSNR with 2.3× more Gaussians.
The paper introduces a unified sample‑based Gaussian encoding method that represents structured grids, unstructured meshes, and particle data under a single fixed‑budget formulation. By initializing and refining Gaussian primitives directly from input samples while maintaining a prescribed primitive count, the method achieves higher reconstruction accuracy with fewer primitives—up to 4.8 dB higher PSNR and roughly a 44× reduction in primitive count compared to prior approaches. For time‑varying data, warm‑starting from the previous timestep further reduces optimization effort while preserving reconstruction quality.
F4Splat introduces a feed‑forward predictive densification strategy for 3D Gaussian splatting that allocates Gaussians based on a densification‑score guided by spatial complexity and multi‑view overlap. The method predicts per‑region scores to estimate required Gaussian density, enabling explicit control over the total Gaussian budget without retraining. This adaptive allocation reduces redundancy in simple regions and minimizes duplicate Gaussians across overlapping views, yielding compact yet high‑quality 3D representations and superior novel‑view synthesis performance with fewer Gaussians.
arXiv:2606. 05389v1 Announce Type: new Abstract: Lossy compression is essential for massive spatiotemporal data from scientific simulations.