IP Library Granted Patent US 12,531,575
Granted Patent B1
US 12,531,575 · App. 18/407,006 · Granted Jan 20, 2026

Systems and methods for compressing structured data via latent variable estimation

Inventors: Andrea Montanari (Stanford, CA); Joseph Gardi (Mountain View, CA); Eric Mclaughlin Weiner (Los Angeles, CA)
Assignee: Granica Computing, Inc.
H03M7/3064H03M7/6011
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,531,575
App. No.
18/407,006
Filed
Jan 8, 2024
Granted
Jan 20, 2026
Kind
B1
Examiner
MAI, LAM T
Art Unit
2845
USPC
341/50
Abstract

A computer-implemented method for compressing structured data or semi-structured data is provided. The method comprises: (a) estimating one or more latent variables associated with rows or columns of the structured data or semi-structured data; (b) partitioning the structured data or semi-structured data in one or more blocks according to the one or more one or more latent variables; (c) applying a sequential encoding algorithm to each of the blocks; and (d) appending a compressed encoding of the one or more latent variables.

Claims (32)

1 . A computer-implemented method for compressing structured data or semi-structured data, comprising:

(a) estimating latent variables associated with rows or columns of the structured data or semi-structured data;

(b) partitioning the structured data or the semi-structured data into one or more blocks according to the latent variables;

(c) applying a sequential encoding algorithm to each of the one or more blocks; and

(d) appending a compressed encoding of the latent variables to the compressed encoding of each of the one or more blocks.

2 . The computer-implemented method of claim 1 , wherein the latent variables comprise row latent variables associated with the rows and column latent variables associated with the columns.

3 . The computer-implemented method of claim 1 , wherein the latent variables are estimated utilizing a spectral clustering algorithm.

4 . The computer-implemented method of claim 1 , wherein the latent variables are estimated using side information.

5 . The computer-implemented method of claim 4 , wherein the side information comprises a column datatype, a column name, or a row name.

6 . The computer-implemented method of claim 1 , further comprising, prior to (b), reordering the rows and columns of the structured data or semi-structured data based at least in part on the latent variables.

7 . The computer-implemented method of claim 1 , further comprising, prior to (c), generating a serialized block vector for each of the one or more blocks.

8 . Computer-implemented method of claim 7 , wherein the sequential encoding algorithm is applied to each serialized block vector.

9 . The computer-implemented method of claim 8 , wherein applying the sequential encoding algorithm comprises applying a first base compressor to each serialized block vector and a second base compressor to a latent variables of each serialized block vector.

10 . The computer-implemented method of claim 9 , wherein the first base compressor and the second base compressor are different.

11 . The computer-implemented method of claim 1 , wherein the structured data or semi-structured data is associated with hyperspectral imaging, image processing, quantum chemistry, or large language models.

12 . The computer-implemented method of claim 1 , wherein the structured data or semi-structured data is associated with tabular data.

13 . The computer-implemented method of claim 1 , wherein the method achieves an optimal compression rate.

14 . The computer-implemented method of claim 1 , wherein the method reduces a compression rate by at least about 5% compared to frequency-based entropy encoders (ANS), Lempel-Ziv encoders, or finite-state encoders.

15 . A non-transitory computer readable medium comprising machine executable code that, upon execution by one or more computer processors, implements a lossless compression algorithm, comprising:

(a) estimating latent variables associated with rows or columns of a structured data or semi-structured data;

(b) partitioning the structured data or semi-structured data into one or more blocks according to the latent variables;

(c) applying a sequential encoding algorithm to each of the one or more blocks; and

(d) appending a compressed encoding of the latent variables to the compressed encoding of each of the one or more blocks.

16 . The non-transitory computer readable medium of claim 15 , wherein the latent variables comprise row latent variables associated with the rows and column latent variables associated with the columns.

17 . The non-transitory computer readable medium of claim 15 , wherein the latent variables are estimated utilizing a spectral clustering algorithm.

18 . The non-transitory computer readable medium of claim 15 , wherein the latent variables are estimated using side information.

19 . The non-transitory computer readable medium of claim 18 , wherein the side information comprises a column datatype, a column name, or a row name.

20 . A computer program product for compressing structured data or semi-structured data, the computer program product comprising at least one non-transitory computer-readable medium having computer-readable program code portions embodied therein, the computer-readable program code portions comprising:

an executable portion configured to estimate variables associated with rows or columns of the structured data or semi-structured data;

an executable portion configured to partition the structured data or the semi-structured data into one or more blocks according to the latent variables;

an executable portion configured to apply a sequential encoding algorithm to each of the one or more blocks; and

an executable portion configured to append a compressed encoding of the latent variables to the compressed encoding of each of the one or more blocks.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 25, 2024
From: MONTANARI, ANDREA; GARDI, JOSEPH; WEINER, ERIC MCLAUGHLIN
To: GRANICA COMPUTING, INC.
Reel/Frame 068077/0795 →
Continuity (1)
Provisional Application 63479636 · Jan 12, 2023
References Cited (48)
US 7243341B2 · Murray · 2007 [cited by examiner]
US 8706749B1 · Klaren · 2014 [cited by examiner]
US 8751687B2 · Nagy · 2014 [cited by examiner]
US 8954400B2 · Brown · 2015 [cited by examiner]
US 9477927B2 · Snow · 2016 [cited by examiner]
US 9881254B2 · Kyle · 2018 [cited by examiner]
US 10866940B2 · Alsubaiee · 2020 [cited by examiner]
US 11068468B2 · Pasini · 2021 [cited by examiner]
US 11080336B2 · Van Dusen · 2021 [cited by examiner]
US 11157705B2 · Wu · 2021 [cited by examiner]
US 11328000B1 · Whybark · 2022 [cited by examiner]
US 11416526B2 · Chen · 2022 [cited by examiner]
US 11860675B2 · Jin · 2024 [cited by examiner]
US 12106413B1 · Mason · 2024 [cited by examiner]
US 20040167907A1 · Wakefield · 2004 [cited by examiner]
US 20090300581A1 · Triplett · 2009 [cited by examiner]
US 20110153531A1 · Ishizaki · 2011 [cited by examiner]
US 20130332478A1 · Bornea · 2013 [cited by examiner]
US 20150294588A1 · Kullok · 2015 [cited by examiner]
US 20150294589A1 · Kullok · 2015 [cited by examiner]
US 20150294590A1 · Kullok · 2015 [cited by examiner]
US 20150294591A1 · Kullok · 2015 [cited by examiner]
US 20180349461A1 · Bhoovaraghavan · 2018 [cited by examiner]
US 20210133204A1 · Motamedi · 2021 [cited by examiner]
US 20210133205A1 · Motamedi · 2021 [cited by examiner]
US 20220044121A1 · Pituwalakankanamge · 2022 [cited by examiner]
US 20220342900A1 · Basu · 2022 [cited by examiner]
US 20230125621A1 · Yu · 2023 [cited by examiner]
US 20250159258A1 · Esenlik · 2025 [cited by examiner]
US 20250171017A1 · Chen · 2025 [cited by examiner]
US 20250254308A1 · Wang · 2025 [cited by examiner]
Altman, Erik R. Synthesizing Credit Card Transactions. Cornell University, arXiv Labs Oct. 4, 2019; [retrieved on Jun. 24, 2024]. Available at URL:https://arxiv.org/abs/1910.03033 pp. 1-7. [cited by applicant]
Business price indexes: Mar. 2022 quarter. Stats NZ, May 19, 2022 [retrieved on Jun. 24, 2024]. Available at URL:https://www.stats.govt.nz/information-releases/business-price-indexes-march-2022-quarter pp. 1-5. [cited by applicant]
Chen, et al. Data-aware low-rank compression for large NLP models. 35th Conference on Neural Information Processing Systems:1-14 (2021). [cited by applicant]
Cheng, et al. On the Compression of Low Rank Matrices, SIAM Journal on Scientific Computing 26(4):1389-1404 (2005). [cited by applicant]
Cover, et al. Elements of Information Theory. Wiley-Interscience (2006). [cited by applicant]
Frey, et al. Free Energy Coding, Proceedings of Data Compression Conference. IEEE: 73-81 (1996). [cited by applicant]
Goldberg, et al. Eigentaste: A Constant Time Collaborative Filtering Algorithm. Information Retrieval 4(2):133-151 (2001). [cited by applicant]
Hinton, et al. Autoencoders, Minimum Description Length and Helmholtz Free Energy. Proceedings of the 6th International Conference on Neural Information Processing Systems:3-10 (1993). [cited by applicant]
Hou, et al. Sparse Low-rank Matrix Approximation for Data Compression. IEEE Transactions on Circuits and Systems for Video Technology 27(5):1043-1054 (2015). [cited by applicant]
Li, et al. Tensor Completion for on-board Compression of Hyperspectral Images. IEEE International Conference on Image Processing: 517-520 (2010). [cited by applicant]
Phan, et al. Stable Low-Rank Tensor Decomposition for Compression of Convolutional Neural Network. European Conference on Computer Vision:522-539 (2020). [cited by applicant]
Salomon, David. Data Compression: the Complete Reference. Springer Science and Business Media: 1-902 (2004). [cited by applicant]
Taylor, Peter R. Lossless Compression of Wave Function Information Using Matrix Factorization: a “Gzip” for Quantum Chemistry. The Journal of Chemical Physics 139:074113, 1-14 (2013). [cited by applicant]
TLC Trip Record Data: NYC Taxi and Limousine Commission (2022). Available at URL:https://www.nyc.gov/site/tlc/about/tlc-trip-record-data.page. [cited by applicant]
Townsend, et al. Hilloc: Lossless Image Compression with Hierarchical Latent Variable Models. International Conference on Learning Representations, ICLR: 1-14 (2020). [cited by applicant]
Townsend, et al. Practical lossless compression with latent variables using bits back coding. 7th International Conference on Learning Representations:1-13 (2019). [cited by applicant]
Yuan, et al. Projective Nonnegative Matrix Factorization for Image Compression and Feature Extraction. 14th Scandinavian Conference Lecture Notes in Computer Science:333-342 (2005). [cited by applicant]