On the (Generative) Linear Sketching Problem
Xinyu Yuan, Yan Qiao, Zonghui Wang, Wenzhi Chen

TL;DR
This paper introduces FLORE, a generative sketching framework that significantly improves data recovery accuracy and speed in linear sketching problems by leveraging generative priors and avoiding ground-truth data dependence.
Contribution
FLORE is a novel generative sketching method that addresses information loss and achieves high-quality, fast recovery without requiring ground-truth data for training.
Findings
FLORE reduces error by up to 1000 times compared to previous methods.
FLORE achieves 100 times faster processing speed.
FLORE provides high-quality recovery with low computational overhead.
Abstract
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 , 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Mobile Crowdsensing and Crowdsourcing · Web Data Mining and Analysis
