Semantic Compression with Information Lattice Learning

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Yu, Haizi, Varshney, Lav R.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916192384450560
author Yu, Haizi
Varshney, Lav R.
author_facet Yu, Haizi
Varshney, Lav R.
contents Data-driven artificial intelligence (AI) techniques are becoming prominent for learning in support of data compression, but are focused on standard problems such as text compression. To instead address the emerging problem of semantic compression, we argue that the lattice theory of information is particularly expressive and mathematically precise in capturing notions of abstraction as a form of lossy semantic compression. As such, we demonstrate that a novel AI technique called information lattice learning, originally developed for knowledge discovery and creativity, is powerful for learning to compress in a semantically-meaningful way. The lattice structure further implies the optimality of group codes and the successive refinement property for progressive transmission.
format Preprint
id arxiv_https___arxiv_org_abs_2404_03131
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Semantic Compression with Information Lattice Learning
Yu, Haizi
Varshney, Lav R.
Information Theory
Data-driven artificial intelligence (AI) techniques are becoming prominent for learning in support of data compression, but are focused on standard problems such as text compression. To instead address the emerging problem of semantic compression, we argue that the lattice theory of information is particularly expressive and mathematically precise in capturing notions of abstraction as a form of lossy semantic compression. As such, we demonstrate that a novel AI technique called information lattice learning, originally developed for knowledge discovery and creativity, is powerful for learning to compress in a semantically-meaningful way. The lattice structure further implies the optimality of group codes and the successive refinement property for progressive transmission.
title Semantic Compression with Information Lattice Learning
topic Information Theory
url https://arxiv.org/abs/2404.03131