IP Library › Granted Patent US 12,267,089
Granted Patent B2
US 12,267,089 · App. 18/008,045 · Granted Apr 1, 2025

Systems and methods for improved machine-learned compression

Inventors: Eirikur Thor Agustsson (Zürich, CH); Lucas Marvin Theis (Berlin, DE)
Assignee: GOOGLE LLC
H03M7/3059G06N3/0455G06N3/084
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,267,089
App. No.
18/008,045
Granted
Apr 1, 2025
Kind
B2
Abstract

A computer-implemented method for compressing computer-readable data having improved efficiency can include obtaining, by a computing system including one or more computing devices, input data associated with the computing system; and encoding, by the computing system, the input data and added noise from a noisy channel to produce encoded data based at least in part on an encoder model, wherein encoding the input data and added noise includes additively combining the added noise and the input data to obtain noisy input data and rounding the noisy input data by a soft rounding function, the soft rounding function having a sharpness, to produce the encoded data, wherein the machine-learned encoder model is trained on training data, wherein the training data is encoded with the added noise from the noisy channel.

Claims (99)

1. A computer-implemented method for compressing computer-readable data having improved efficiency, the method comprising:

obtaining, by a computing system comprising one or more computing devices, input data associated with the computing system; and

encoding, by the computing system, the input data and added noise from a noisy channel to produce encoded data based at least in part on a machine-learned encoder model, wherein encoding the input data and added noise comprises additively combining the added noise and the input data to obtain noisy input data and rounding the noisy input data by a soft rounding function, the soft rounding function having a sharpness, to produce the encoded data;

wherein the machine-learned encoder model is trained on training data, wherein the training data is encoded with the added noise from the noisy channel.

2. The computer-implemented method of claim 1 , wherein the sharpness is progressively increased during training of the machine-learned encoder model.

3. The computer-implemented method of claim 1 , wherein the soft rounding function comprises, in response to an input, a sum of a rounded input and a ratio of a hyperbolic tangent of the sharpness multiplied by a quantizing factor to a hyperbolic tangent of half of the sharpness.

4. The computer-implemented method of claim 1 , wherein the encoder model comprises one or more neural networks.

5. The computer-implemented method of claim 1 , wherein the input data comprises image data.

6. The computer-implemented method of claim 1 , wherein the added noise comprises uniform noise.

7. The computer-implemented method of claim 1 , wherein the noisy channel is differentiable.

8. The computer-implemented method of claim 1 , wherein the noisy input data is quantized by adding uniform noise during training of the machine-learned encoder model and during inference by the machine-learned encoder model by universal quantization.

9. The computer-implemented method of claim 1 , wherein the added noise comprises Gaussian noise.

10. The computer-implemented method of claim 1 , wherein the noisy channel comprises a lattice quantizer and the added noise comprises lattice quantization noise.

11. The computer-implemented method of claim 1 , wherein the machine-learned encoder model is trained by:

during a forward pass, computing a loss by (h(y+u)) for a sampled instance u; and

during a backward pass, replacing the derivative

∂

∂

y

i

h

⁡

(

y

i

+

u

i

)

with its expected value, f(y i +0.5)−f(y i −0.5).

12. The computer-implemented method of claim 1 , wherein the encoder model is trained using a training loss, wherein the training loss comprises a sum over all values of an expected value of a logarithm of a probability of the sum of the input data and a corresponding uniform random variable and the expected value of a decoder model.

13. A computer-implemented method of decoding encoded data, the method comprising:

obtaining, by a computing system comprising one or more computing devices, encoded data, the encoded data encoded based at least in part on input data and added noise from a noisy channel, wherein the encoded data is encoded by additively combining the added noise and the input data to obtain noisy input data and rounding the noisy input data by a soft rounding function, the soft rounding function having a sharpness, to produce the encoded data; and

applying, by the computing system, a reconstruction defined by an expected value given a smooth universal quantization approximation to reconstruct approximated input data.

14. The computer-implemented method of claim 13 , wherein a gradient of the approximated input data is computed without any loss by a distortion term including an expected value of a derivative of a loss function.

15. The computer-implemented method of claim 13 , the encoded data encoded by a machine-learned encoder model trained on training data, wherein the training data is encoded with the added noise from the noisy channel.

16. A computer-implemented method of encoding input data with improved computational and statistical efficiency, the method comprising:

obtaining, by a computing system comprising one or more computing devices, input data associated with the computing system;

obtaining, by the computing system, data indicative of a target distribution based at least in part on the input data;

determining, by the computing system, a uniform distribution based at least in part on the target distribution;

obtaining, by the computing system, a plurality of samples from the uniform distribution;

identifying, by the computing system, an index corresponding to a selected sample of the plurality of samples from the uniform distribution such that the selected sample is distributed according to the target distribution; and

communicating, by the computing system, encoded sample representation data, the encoded sample representation data comprising the index corresponding to the selected sample and a decoding factor comprising a subtractive combination of the selected sample and a uniform random variable corresponding to the selected sample.

17. The computer-implemented method of claim 16 , wherein the input data comprises parameters of a machine-learned model, and wherein the target distribution comprises a distribution of the parameters of the machine-learned model.

18. The computer-implemented method of claim 16 , wherein a support of the uniform distribution is at least equal to a support of the target distribution.

19. The computer-implemented method of claim 16 , wherein identifying, by the computing system, the index corresponding to the selected sample of the plurality of samples comprises:

iteratively scoring, for at least one sample of the plurality of samples, the sample based at least in part on the target distribution; and

selecting the sample as the selected sample if a score of the sample is less than or equal to a target score, the target score comprising an exponential sum of the indices of the plurality of samples divided by a maximum value of the target distribution.

20. The computer-implemented method of claim 16 , wherein the selected sample is transformed to a multiplication of the index and a cumulative density function of a marginal distribution of the selected sample and a width of the target distribution.

21. A computing system, comprising:

one or more processors; and

one or more non-transitory computer-readable media storing instructions that, when executed by the one or more processors, cause the computing system to perform operations, the operations comprising:

obtaining input data associated with the computing system; and

encoding the input data and added noise from a noisy channel to produce encoded data based at least in part on a machine-learned encoder model, wherein encoding the input data and added noise comprises additively combining the added noise and the input data to obtain noisy input data and rounding the noisy input data by a soft rounding function, the soft rounding function having a sharpness, to produce the encoded data;

wherein the machine-learned encoder model is trained on training data, wherein the training data is encoded with the added noise from the noisy channel.

22. The computing system of claim 21 , wherein the sharpness is progressively increased during training of the machine-learned encoder model.

23. The computing system of claim 21 , wherein the soft rounding function comprises, in response to an input, a sum of a rounded input and a ratio of a hyperbolic tangent of the sharpness multiplied by a quantizing factor to a hyperbolic tangent of half of the sharpness.

24. The computing system of claim 21 , wherein the input data comprises image data.

25. The computing system of claim 21 , wherein the noisy channel is differentiable.

26. The computing system of claim 21 , wherein the noisy input data is quantized by adding uniform noise during training of the machine-learned encoder model and during inference by the machine-learned encoder model by universal quantization.

27. One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause a computing system to perform operations, the operations comprising:

obtaining input data associated with the computing system; and

encoding the input data and added noise from a noisy channel to produce encoded data based at least in part on a machine-learned encoder model, wherein encoding the input data and added noise comprises additively combining the added noise and the input data to obtain noisy input data and rounding the noisy input data by a soft rounding function, the soft rounding function having a sharpness, to produce the encoded data;

wherein the machine-learned encoder model is trained on training data, wherein the training data is encoded with the added noise from the noisy channel.

28. The one or more non-transitory computer-readable media of claim 27 , wherein the sharpness is progressively increased during training of the machine-learned encoder model.

29. The one or more non-transitory computer-readable media of claim 28 , wherein the soft rounding function comprises, in response to an input, a sum of a rounded input and a ratio of a hyperbolic tangent of the sharpness multiplied by a quantizing factor to a hyperbolic tangent of half of the sharpness.

30. The one or more non-transitory computer-readable media of claim 28 , wherein the input data comprises image data.

31. The one or more non-transitory computer-readable media of claim 28 , wherein the noisy channel is differentiable.

32. The one or more non-transitory computer-readable media of claim 28 , wherein the noisy input data is quantized by adding uniform noise during training of the machine-learned encoder model and during inference by the machine-learned encoder model by universal quantization.

33. A computing system, comprising:

one or more processors; and

one or more non-transitory computer-readable media storing instructions that, when executed by the one or more processors, cause the computing system to perform operations, the operations comprising:

obtaining encoded data, the encoded data encoded based at least in part on input data and added noise from a noisy channel, wherein the encoded data is encoded by additively combining the added noise and the input data to obtain noisy input data and rounding the noisy input data by a soft rounding function, the soft rounding function having a sharpness, to produce the encoded data; and

applying a reconstruction defined by an expected value given a smooth universal quantization approximation to reconstruct approximated input data.

34. The computing system of claim 33 , wherein a gradient of the approximated input data is computed without any loss by a distortion term including an expected value of a derivative of a loss function.

35. The computing system of claim 33 , the encoded data encoded by a machine-learned encoder model trained on training data, wherein the training data is encoded with the added noise from the noisy channel.

36. One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause a computing system to perform operations, the operations comprising:

obtaining encoded data, the encoded data encoded based at least in part on input data and added noise from a noisy channel, wherein the encoded data is encoded by additively combining the added noise and the input data to obtain noisy input data and rounding the noisy input data by a soft rounding function, the soft rounding function having a sharpness, to produce the encoded data; and

applying a reconstruction defined by an expected value given a smooth universal quantization approximation to reconstruct approximated input data.

37. The one or more non-transitory computer-readable media of claim 36 , wherein a gradient of the approximated input data is computed without any loss by a distortion term including an expected value of a derivative of a loss function.

38. The one or more non-transitory computer-readable media of claim 36 , the encoded data encoded by a machine-learned encoder model trained on training data, wherein the training data is encoded with the added noise from the noisy channel.

39. A computing system, comprising:

one or more processors; and

one or more non-transitory computer-readable media storing instructions that, when executed by the one or more processors, cause the computing system to perform operations, the operations comprising:

obtaining input data associated with the computing system;

obtaining data indicative of a target distribution based at least in part on the input data;

determining a uniform distribution based at least in part on the target distribution;

obtaining a plurality of samples from the uniform distribution;

identifying an index corresponding to a selected sample of the plurality of samples from the uniform distribution such that the selected sample is distributed according to the target distribution; and

communicating encoded sample representation data, the encoded sample representation data comprising the index corresponding to the selected sample and a decoding factor comprising a subtractive combination of the selected sample and a uniform random variable corresponding to the selected sample.

40. The computing system of claim 39 , wherein the input data comprises parameters of a machine-learned model, and wherein the target distribution comprises a distribution of the parameters of the machine-learned model.

41. One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause a computing system to perform operations, the operations comprising:

obtaining input data associated with the computing system;

obtaining data indicative of a target distribution based at least in part on the input data;

determining a uniform distribution based at least in part on the target distribution;

obtaining a plurality of samples from the uniform distribution;

identifying an index corresponding to a selected sample of the plurality of samples from the uniform distribution such that the selected sample is distributed according to the target distribution; and

communicating encoded sample representation data, the encoded sample representation data comprising the index corresponding to the selected sample and a decoding factor comprising a subtractive combination of the selected sample and a uniform random variable corresponding to the selected sample.

42. The one or more non-transitory computer-readable media of claim 41 , wherein the input data comprises parameters of a machine-learned model, and wherein the target distribution comprises a distribution of the parameters of the machine-learned model.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 17, 2023
From: AGUSTSSON, EIRIKUR THOR; THEIS, LUCAS MARVIN
To: GOOGLE LLC
Reel/Frame 062394/0507 →
Continuity (2)
Provisional Application 63034172 · Jun 3, 2020
Related Publication 20230299788A1 · Sep 21, 2023
References Cited (57)
US 11544606B2 · Mandt · 2023 [cited by examiner]
US 20180032871A1 · Holt · 2018 [cited by examiner]
US 20180357753A1 · Lehtinen · 2018 [cited by examiner]
US 20190392302A1 · Mandt · 2019 [cited by examiner]
US 20200090069A1 · Mandt · 2020 [cited by examiner]
US 20200364603A1 · Oktay · 2020 [cited by examiner]
US 20200372305A1 · Streeter · 2020 [cited by examiner]
US 20210357789A1 · Pagh · 2021 [cited by examiner]
US 20220174328A1 · Toderici · 2022 [cited by examiner]
US 20230050134A1 · Biswas · 2023 [cited by examiner]
US 20230099526A1 · Chinen · 2023 [cited by examiner]
US 20230186166A1 · Oktay · 2023 [cited by examiner]
US 20240176988A1 · Martinez Gil · 2024 [cited by examiner]
Agustsson et al., “Generative Adversarial Networks for Extreme Learned Image Compression.”, arXiv:1804.02958v3, Aug. 18, 2019, 26 pages. [cited by applicant]
Agustsson et al., “Soft-to-Hard Vector Quantization for End-to-End Learning Compressible Representations.”, arXiv:1704.00648v2, Jun. 8, 2017, 16 pages. [cited by applicant]
Akamai, “State of the Internet Report.”, retrieved on Apr. 19, 2023, https://www.akamai.com/newsroom/press- release/akamai-releases-first-quarter-2017-state-of-the-internet-connectivity-report, May 30, 2017, 4 pages. [cited by applicant]
Balle et al., “End-to-End Optimization of Nonlinear Transform Codes for Perceptual Quality.”, arXiv:1607.05006v2, Oct. 17, 2016, 5 pages. [cited by applicant]
Balle et al., “End-to-End Optimized Image Compression.”, arXiv:1611.01704v3, Mar. 3, 2017, 27 pages. [cited by applicant]
Balle et al., “Variational Image Compression with a Scale Hyperprior.”, arXiv:1802.01436v2, May 1, 2016, 23 pages. [cited by applicant]
Barnett Jr., “Cisco Visual Networking Index.”, retrieved on Jan. 17, 2023, https://blogs.cisco.com/sp/2018-complete-vni-forecast-update, Nov. 27, 2018, 6 pages. [cited by applicant]
Bengio et al., “Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation.”, arXiv:1308.3432v1, Aug. 15, 2013, 12 pages. [cited by applicant]
Bennett et al., “Entanglement-Assisted Capacity of a Quantum Channel and the Reverse Shannon Theorem.”, arXiv:quant-ph/0106052v2, May 14, 2002, 42 pages. [cited by applicant]
Choi et al., “Variable Rate Deep Image Compression with a Conditional Autoencoder.” arXiv:1909.04802v1, Sep. 11, 2019, 14 pages. [cited by applicant]
Cover et al., “Capacity of Coordinated Actions.”, International Symposium on Information Theory, Nice, France, Jun. 24-30, 2007, pp. 2701-2705. [cited by applicant]
Cuff, “Communication Requirements for Generating Correlated Random Variables.”, International Symposium on Information Theory, Toronto, Ontario, Canada, Jul. 7-12, 2008, pp. 1393-1397. [cited by applicant]
Cuff et al., “The Likelihood Encoder for Source Coding.”, Information Theory Workshop (ITW), Seville, Spain, 2013, pp. 1-2. [cited by applicant]
Flamich et al., “Compressing Images by Encoding Their Latent Representations with Relative Entropy Coding.”, 24 pages. [cited by applicant]
Harsha et al., “The Communication Complexity of Correlation.”, Institute of Electrical and Electronics Engineers Transactions on Information Theory, vol. 56, No. 1, Jan. 2010, pp. 438-449. [cited by applicant]
Havasi et al., “Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters.”, arXiv:1810.00440v1, Sep. 30, 2018, 11 pages. [cited by applicant]
International Telecommunication Union, “Information Technology—Digital Compression and Coding of Continuous-Tone Still Images—Requirements and Guidelines.”, retrieved on Apr. 19, 2023, chrome-extension://efaidnbmnnnibpc… [cited by applicant]
Kingma et al., “Adam: A Method for Stochastic Optimization.”, arXiv:1412.6980v9, Jan. 30, 2017, 15 pages. [cited by applicant]
Kingma et al., “Auto-Encoding Variational Bayes.”, arXiv:1312.6114v10, May 1, 2014, 14 pages. [cited by applicant]
Kodak, “Kodak Lossless True Color Image Suite—PhotoCD PCD0992.”, retrieved on Jan. 18, 2023, http://r0k.us/graphics/kodak/, Jan. 27, 2013, 3 pages. [cited by applicant]
Li et al., “Strong Functional Representation Lemma and Applications to Coding Theorems.”, rXiv:1701.02827v4, Jan. 19, 2018, 15 pages. [cited by applicant]
Long et al., “Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate.”, Twenty-seventh International Conference on Machine Learning, Haifa, Israel, Jun. 21-24, 2010, 8 pages. [cited by applicant]
Minnen et al., “Joint Autoregressive and Hierarchical Priors for Learned Image Compression.”, arXiv:1809,02736v1, Sep. 8, 2018, 22 pages. [cited by applicant]
Qin et al., “Scale Mixture Models with Applications to Bayesian Inference.”, American Institute of Physics Conference Proceedings, Los Alamos, New Mexico, United States, vol. 690, No. 1, Jun. 9-11, 2003, pp. 394-395. [cited by applicant]
Rezende et al., “Stochastic Backpropagation and Approximate Inference in Deep Generative Models.”, arXiv:1401.4082v3, May 30, 2014, 14 pages. [cited by applicant]
Rippel et al., “Real-Time Adaptive Image Compression.”, arXiv:1705.05823v1, May 16, 2017, 16 pages. [cited by applicant]
Roberts, “Picture Coding Using Pseudo-Random Noise.”, IRE Transactions on Information Theory, vol. 8, No. 2, pp. 145-154, Feb. 1962, 10 pages. [cited by applicant]
Saxe et al., “Exact Solutions to the Nonlinear Dynamics of Learning in Deep Linear Neural Networks.”, arXiv:1312.6120v3, Feb. 19, 2014, 22 pages. [cited by applicant]
Schuchman, “Dither Signals and Their Effect on Quantization Noise.”, Communication Technology, vol. 12, No. 4, Dec. 1964, pp. 162-165. [cited by applicant]
Smolensky, “Information Processing in Dynamical Systems: Foundations of Harmony Theory.”, Parallel Distributed Processing, vol. 1, MIT Press, Cambridge, pp. 194-281. [cited by applicant]
Theis et al., “Lossy Image Compression with Compressive Autoencoders.”, arXiv:1703.00395v1, Mar. 1, 2017, 19 pages. [cited by applicant]
Toderici et al., “Variable Rate Image Compression with Recurrent Neural Networks.”, arXiv:1511.06085v5, Mar. 1, 2016, 12 pages. [cited by applicant]
Werbos et al, “Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences.”, Harvard University, Cambridge, Massachusetts, United States, 1974, 454 pages. [cited by applicant]
Zamir et al., “Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation and Multiuser Information Theory.”, Cambridge University Press, Aug. 2014, 8 pages. [cited by applicant]
Zamir et al., “On Universal Quantization by Randomized Uniform/Lattice Quantizers.”, Transactions on Information Theory, vol. 38, No. 2. Mar. 1992, pp. 428-436. [cited by applicant]
Zhou et al., “Variational Autoencoder for Low Bit-rate Image Compression.”, Computer Vision and Pattern Recognition Workshops, Salt Lake City, Utah, United States, Jun. 18-22, 2018, pp. 2617-2620. [cited by applicant]
Ziv, “On Universal Quantization.” Institute of Electrical and Electronics Engineers Transactions on Information Theory, vol. 31, No. 3, May 1985, pp. 344-347. [cited by applicant]
International Preliminary Report on Patentability for Application No. PCT/US2021/035672, mailed Dec. 15, 2022, 13 pages. [cited by applicant]
Baskin, et al. “Uniq: Uniform Noise Injection for Non-uniform Quantization of Neural Networks.” arXiv:1804.10969v3, Oct. 2, 2018. 10 pages. [cited by applicant]
Choi, et al. “Universal Deep Neural Network Compression.” IEEE, vol. 14, No. 4. Feb. 21, 2019. pp. 715-726. [cited by applicant]
Fan, et al. “Training with Quantization Noise for Extreme Model Compression.” Apr. 17, 2020. https://arxiv.org/pdf/2004.07320v2.pdf. 18 pages. [cited by applicant]
Gong, et al. “Differentiable Soft Quantization: Bridging Full-Precision and Low-Bit Neural Networks.” Oct. 27, 2019. 2019 IEEE/CVF ICCV, pp. 4851-4860. [cited by applicant]
International Search Report, PCT/US2021/035672 mailed on Nov. 30, 2021, 5 pages. [cited by applicant]
Louizos, et al. “Relaxed Quantization for Discretized Neural Networks.” arXiv:1810.01875v1. Oct. 3, 2018. 14 pages. [cited by applicant]