8 ms·
It seems like "lossless" isn't quite right; some of the information (as opposed to just the algo) seems to be in the NN? Is a soft-link a lossless compression?
by pbhjpbhj 7y ago
It seems like "lossless" isn't quite right; some of the information (as opposed to just the algo) seems to be in the NN?
Is a soft-link a lossless compression?
It's like the old joke about a pub where they optimise by numbering all the jokes, .. just the joke number isn't enough, it can be used to losslessly recover the joke, but it's using the community storage to hold the data.
- chickenpotpie 7y agoAs long as you get back the exact same image you put in, it's lossless.
- yters 7y agoIn that sense, I can losslessly compress everything down to zero bits, and recover the original artifact perfectly with the right algorithm.
- chickenpotpie 7y agoYes you can. However, it doesn't mean it's good lossless compression.
- ebg13 7y agoYou're ignoring two things: 1) that the aggregate savings from compressing the images needs to outweigh the initial cost of distributing the decompressor. 2) to be lossless, decompression must be deterministic an unambiguous, so you can't compress _everything_ down to zero bits; you can compress only _one_ thing down to zero bits, because otherwise you wouldn't be able to unambiguously determine which thing is represented by your zero bits.
- yters 7y agoIn each case I pick out an algorithm beforehand that will inflate my zero bits to whatever artifact I desire.
- ebg13 7y ago"I will custom write a new program to (somehow) generate each image and then distribute that instead of my image" is not a compression algorithm. But I think you'd do well over at the halfbakery.
- yters 7y agoIt works well if it's the only image!
- ebg13 7y agoNow you're chasing your own tail. You've gone from "I can losslessly compress everything" to "I can losslessly compress exactly one thing only".
- yters 7y agoI'm arguing it's the same as this image compression technique. They rely on a huge neural network which must exist wherever the image is to be decompressed. If I'm allowed to bring along an unlimited amount of background data, then I can compress everything down to zero bits. In contrast, an algorithm like LZ78 can expressed in a 5 line python script and perform decently on a wide variety of data types.
- ebg13 7y ago> If I'm allowed to bring along an unlimited amount of background data, then I can compress everything down to zero bits. If by "background data" you mean the decompressor, this is patently false. No matter how much information is contained in the decompressor (The Algorithm + stable weights that don't change), you can only compress one thing down to any given new representation ( low resolution image + differential from rescale using stable weights ). If by "background data" you mean new data that the decompressor doesn't already have, then you're ignoring the definition of compression. Your compressed data is all bits sent on the fly that aren't already possessed by the side doing the decompression regardless of obtuse naming scheme. > I'm arguing it's the same as this image compression technique. That's wrong, because this scheme doesn't claim to send a custom image generator instead of each image, which is what you're proposing.
- atorodius 7y agoYou are missing the point that you can use the same algorithm to compress N → infinity images. So the algorithm size amortizes.
- yters 7y agoIs that true?
- nullc 7y agoUnless it's overfit on some particular inputs, but if so-- it's bad science. Ideally they would have trained the network on a non-overlapping collection of images from their testing but if they did that I don't see it mentioned in the paper. The model is only 15.72 MiB (after compression with xz), so it would amortize pretty quickly... even if it was trained on the input it looks like it still may be pretty competitive at a fairly modest collection size.
- pbhjpbhj 7y agoSo this "https://news.ycombinator.com/reply?id=22804687&goto=threads%3Fid%3Dpbhjpbhj%2322804687" https://news.ycombinator.com/reply?id=22804687&goto=threads%... is a lossless encoding of your comment because it returns the content? That doesn't seem right to me.
- chickenpotpie 7y agoWe're talking about lossless compression. A URL is a way to locate a resource, it is not compression. Compression is taking an existing recourse and transforming it into something smaller. A URL isn't a transformation. If I delete my comment the URL no longer refers to anything.
- jfkebwjsbx 7y agoNo, because that uses external data.
- pbhjpbhj 7y agoI guess this is the crux of it, a NN seems like a concentration of data, more data-y than algorithmic to me (not a computer scientist). Lossless compression has an inference of essential data being intrinsic in the compressed file, but with the arrangement of the OP it seems like some of that data is extrinsic - some of the essential data is in the NN. Whilst you might make that claim for any regular algo, it seems to me this has a different complexion to it. Ultimately an algo could use all extent online images, then use reverse image search and be 'just' providing an internal link to return. Another way of looking at it is that you could have a 3D model of a person, as used for CG in movies, and then have an error map + config data to return an image of the person that is exactly the same as a mask of a photo that was taken. The error map + config data wouldn't really be a "lossless compression". Much of the data would lie in the 3D model. Do you agree that this would not be "lossless compression"? So, there's a dividing line somewhere?!
- tverbeure 7y agoWhen you consider the compression algorithm itself a form of information, your point about it not being quite lossless could be applied to any lossless compression method.
- pbhjpbhj 7y agoYes, but there's a line somewhere, isn't there? A link to a database isn't "lossless compression", even if it returns an artefact unchanged.
- c3534l 7y agoThis is true of all compression formats. The receiver has to know how to decode it. A good compression algorithm will attempt to send only the data that the receiver can't predict. If we both know you're sending English words, then I shouldn't have to tell you "q then u" - we should assume there's a "u" after "q" unless otherwise specified. This isn't new to this technique, it's a very common and old one (it's one of the first ones I learned watching a series of youtube lectures on compression or maybe it was just information theory in general) and it has been commonly called lossless compression none the less.
- pbhjpbhj 7y agohttps://news.ycombinator.com/item?id=22807000 https://news.ycombinator.com/item?id=22807000 [Aside: I've heard they know nothing of qi in Qatar, ;oP]
- c3534l 7y agoYou're just not sending the database - you're sending whether or not it's the database. If you can only send a binary "is the database or is not the database" then 0 and 1 is indeed fully losslessly compressed information. If that's really what you want, then that's how you would do it. Full, perfect, lossless compression reduces your data down to only that information not shared between the sender and the receiver. Sending either 1 or 0 is, in fact, exactly what you want to do if the receiver already knows the contents of the database. Compression asks the question "what is the smallest amount of data I have to receive for the person on the other side to reconstruct the original data?" If the answer is "1 bit" then that's a perfectly valid message - the only information the receiver is missing is a single bit.