Tankut Can

Statistical Mechanics of Semantic Compression

It is argued that while the problem of finding a meaning-preserving compression is computationally hard in the worst case, there exist efficient algorithms which achieve near optimal performance in the typical case.