The paper derives closed-form minimum achievable rates under semantic distance and complexity constraints for Gaussian and binary sources, demonstrating a fundamental three-way tradeoff validated on image and video data.
Measuring the VC-dimension of a learning machine,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Rate-Distortion-Complexity Tradeoff for Semantic Communication
The paper derives closed-form minimum achievable rates under semantic distance and complexity constraints for Gaussian and binary sources, demonstrating a fundamental three-way tradeoff validated on image and video data.