arXiv:2603.14474cs.LG2026-03

用生成模型解决流数据压缩中的信息丢失问题,恢复更准更快。

On the (Generative) Linear Sketching Problem

  • 引入生成先验填补线性压缩中的信息缺失
  • 无需真实数据即可训练,错误率降低1000倍
  • 适合实时流数据处理,计算开销极低

近年来,压缩技术在数据流场景中得到广泛应用,其优势在于能快速、紧凑地更新摘要。然而,从这些摘要中准确、快速且实时地恢复原始状态仍具挑战性。本文聚焦于形如 $\boldsymbolΦf \rightarrow f$ 的线性压缩问题,分三阶段展开:首先剖析现有方法,揭示问题根源为正交信息损失;其次探讨如何利用生成先验弥补信息鸿沟;最后提出 FLORE——一种新型生成式压缩框架,融合前述分析,实现高精度恢复与轻量计算的统一。尤为重要的是,FLORE 可在无真实数据的情况下训练。全面实验表明,该方法在恢复质量上显著优于以往方案,误差降低最高达1000倍,处理速度提升100倍,同时保持极低计算开销。

原文摘要 · Abstract (English)

Sketch techniques have been extensively studied in recent years and are especially well-suited to data streaming scenarios, where the sketch summary is updated quickly and compactly. However, it is challenging to recover the current state from these summaries in a way that is accurate, fast, and real. In this paper, we seek a solution that reconciles this tension, aiming for near-perfect recovery with lightweight computational procedures. Focusing on linear sketching problems of the form $\boldsymbolΦf \rightarrow f$, our study proceeds in three stages. First, we dissect existing techniques and show the root cause of the sketching dilemma: an orthogonal information loss. Second, we examine how generative priors can be leveraged to bridge the information gap. Third, we propose FLORE, a novel generative sketching framework that embraces these analyses to achieve the best of all worlds. More importantly, FLORE can be trained without access to ground-truth data. Comprehensive evaluations demonstrate FLORE's ability to provide high-quality recovery, and support summary with low computing overhead, outperforming previous methods by up to 1000 times in error reduction and 100 times in processing speed compared to learning-based solutions.

数据压缩生成模型流处理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。