IP Library › Granted Patent US 12,456,231
Granted Patent B2
US 12,456,231 · App. 18/141,130 · Granted Oct 28, 2025

Lossless compression with probabilistic circuits

Inventors: Stephan Mandt (Irvine, CA); Anji Liu (Los Angeles, CA); Guy Van den Broeck (Los Angeles, CA)
Assignee: The Regents of the University of California
G06T9/002G06T9/005H04N19/13H04N19/134H04N19/182H04N19/192H04N19/42
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,456,231
App. No.
18/141,130
Granted
Oct 28, 2025
Kind
B2
Abstract

Devices, methods, and systems for lossless compression utilizing probabilistic circuits (PCs) are provided. In one embodiments, a method for lossless compression using PCs is provided, the method comprising: receiving image data comprising a plurality of pixels, wherein each of the plurality of pixels is represented by a variable; sequentially compressing the variables one-by-one using conditional probabilities, wherein the conditional probabilities are computed by: calculating at least one marginal; initially setting to 1 a probability p(n) for every PC unit n; defining an eval i for a set of PC units n that need to be evaluated in an i th iteration; and for i=1 to a dataset D, evaluating PC units n in eval i using a bottom-up process and computing a target probability; and generating a bitstream using a streaming code for the compressed variables using the conditional probabilities.

Claims (38)

1 . A method for lossless compression using probabilistic circuits (PCs), the method comprising:

receiving image data comprising a plurality of pixels, wherein each of the plurality of pixels is represented by a variable;

sequentially compressing the variables one-by-one using conditional probabilities, wherein the conditional probabilities are computed by:

calculating at least one marginal;

initially setting to 1 a probability p(n) for every PC unit n;

defining an eval i for a set of PC units n that need to be evaluated in an i th iteration; and

for i=1 to a dataset D, evaluating PC units n in eval i using a bottom-up process and computing a target probability; and

generating a bitstream using a streaming code for the compressed variables using the conditional probabilities.

2 . The method of claim 1 , wherein sequentially compressing the variable one-by-one using the conditional probabilities comprises encoding a next variable by defining a left and right side cumulative probabilities of the next variable given one or more already encoded variables.

3 . The method of claim 2 , wherein the left and right side cumulative probabilities are defined using a 2D conditional probability that is a quotient of two marginals.

4 . The method of claim 1 , wherein calculating the at least one marginal comprises:

inputting a PC p having a variable instantiation x;

outputting a marginal F(x)={p(x 1 , . . . , x 1 )} i=1 D , wherein D is the dataset.

5 . The method of claim 4 , wherein each of D terms in F(x) is computed one-by-one.

6 . The method of claim 5 , wherein each iteration on average re-evaluates only log(D)/D of the PC p.

7 . The method of claim 1 , wherein the evaluating the PC units in eval i is performed in a feedforward process to compute the target probability.

8 . The method of claim 1 , wherein at iteration i, a set of PC units eval i is selected that guarantees correctness of a target marginal, and contains a minimum number of PC units.

9 . The method of claim 8 , wherein the guarantee of correctness of the target marginal, and containing the minimum number of PC units is achieved by recognizing types of PC units that can be eliminated for evaluation.

10 . The method of claim 9 , wherein a root node's probability is equivalently computed using a weighted mixture of probabilities of PC units in eval i .

11 . A non-transitory computer readable storage medium storing a program comprising instructions that, when executed by at least one processor of a computing device, cause the at least one processor to perform operations including:

receiving image data comprising a plurality of pixels, wherein each of the plurality of pixels is represented by a variable;

sequentially compressing the variables one-by-one using conditional probabilities, wherein the conditional probabilities are computed by:

calculating at least one marginal;

initially setting to 1 a probability p(n) for every PC unit n;

defining an eval i for a set of PC units n that need to be evaluated in an i th iteration; and

for i=1 to a dataset D, evaluating PC units n in eval i using a bottom-up process and computing a target probability; and

generating a bitstream using a streaming code for the compressed variables using the conditional probabilities.

12 . The non-transitory computer readable storage medium of claim 11 , wherein sequentially compressing the variable one-by-one using the conditional probabilities comprises encoding a next variable by defining a left and right side cumulative probabilities of the next variable given one or more already encoded variables.

13 . The non-transitory computer readable storage medium of claim 12 , wherein the left and right side cumulative probabilities are defined using a 2D conditional probability that is a quotient of two marginals.

14 . The non-transitory computer readable storage medium of claim 11 , wherein calculating the at least one marginal comprises:

inputting a PC p having a variable instantiation x; and

outputting a marginal F(x)={p(x 1 , . . . , x i )} i=1 D , wherein D is the dataset.

15 . The non-transitory computer readable storage medium of claim 14 , wherein each of D terms in F(x) is computed one-by-one.

16 . The non-transitory computer readable storage medium of claim 15 , wherein each iteration on average re-evaluates only log(D)/D of the PC p.

17 . The non-transitory computer readable storage medium of claim 11 , wherein the evaluating the PC units in eval i is performed in a feedforward process to compute the target probability.

18 . The non-transitory computer readable storage medium of claim 11 , wherein at iteration i, a set of PC units eval i is selected that guarantees correctness of a target marginal, and contains a minimum number of PC units.

19 . The non-transitory computer readable storage medium of claim 18 , wherein the guarantee of correctness of the target marginal, and containing the minimum number of PC units is achieved by recognizing types of PC units that can be eliminated for evaluation.

20 . The non-transitory computer readable storage medium of claim 19 , wherein a root node's probability is equivalently computed using a weighted mixture of probabilities of PC units in eval i .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 22, 2025
From: MANDT, STEPHAN; LIU, ANJI; BROECK, GUY VAN DEN
To: THE REGENTS OF THE UNIVERSITY OF CALIFORNIA
Reel/Frame 072101/0177 →
Continuity (2)
Provisional Application 63336544 · Apr 29, 2022
Related Publication 20230353765A1 · Nov 2, 2023
References Cited (7)
US 10411728B2 · Flinsenberg · 2019 [cited by examiner]
US 10645389B2 · He · 2020 [cited by examiner]
US 11375194B2 · Liu · 2022 [cited by examiner]
US 11405618B2 · He · 2022 [cited by examiner]
US 12219143B2 · Han · 2025 [cited by examiner]
Han, Jun, et al. “Deep generative video compression.” Proceedings of the 33rd International Conference on Neural Information Processing Systems. (Year: 2019). [cited by examiner]
Liu, Anji, Stephan Mandt, and Guy Van den Broeck. “Lossless compression with probabilistic circuits.” arXiv preprint arXiv: 2111.11632 (Year: 2021). [cited by examiner]