102
this post was submitted on 29 Sep 2023
102 points (100.0% liked)
Technology
37748 readers
187 users here now
A nice place to discuss rumors, happenings, innovations, and challenges in the technology sphere. We also welcome discussions on the intersections of technology and society. If it’s technological news or discussion of technology, it probably belongs here.
Remember the overriding ethos on Beehaw: Be(e) Nice. Each user you encounter here is a person, and should be treated with kindness (even if they’re wrong, or use a Linux distro you don’t like). Personal attacks will not be tolerated.
Subcommunities on Beehaw:
This community's icon was made by Aaron Schneider, under the CC-BY-NC-SA 4.0 license.
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
I think this is a legitimate use case. It shouldn't have any security vulnerabilities beyond regular compression-related vulnerabilities.
The core to compression is prediction. Most compression algorithms work sort of like this:
If your guess is good it doesn't take much data to encode the difference. So the data stream is smaller.
AI image generation can be used to guess the data quite effectively, and it can use context that is hard to encode in classic algorithms (such as what a car looks like). This is basically the next step of shared dictionary compression (like what makes Brotli quite effective) where instead of building a dictionary as a simple Huffman table you compress the dictionary into the model weights. Since the model can do a pretty good job at creating "Image of a girl with brown hair looking right" you "just" need to encode the difference.
IIUC neither PNG or FLAC use pre-shared data, so sending a massive set of neural weights can be an advantage (and presumably you only need to send these weights occasionally).
An example of a compression algorithm that does support tuning parameters before hand is zstd.
Even if something isn't in a pre-shared dataset, I wonder if a sufficiently advanced LLM might be able to do well at compressing predictable but non-repeating data, such as "abc, bcd, cde, [...]".