Computation of a Unified Graph-Based Rate Optimization Problem

We define a graph-based rate optimization problem and consider its computation, which provides a unified approach to the computation of various theoretical limits, including the (conditional) graph entropy, rate-distortion functions and capacity-cost functions with side information. Compared with th...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 73; no. 11; pp. 10976 - 10988
Main Authors:	Yuan, Deheng, Guo, Tao, Huang, Zhongyi, Jin, Shi
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms alternating optimization algorithm Bipartite graph capacity-cost with side information Computational efficiency Computing time Cost function Data mining Distortion Entropy graph characterization Minimization Optimization Random variables Rate-distortion Rate-distortion for lossy computing Training
ISSN:	0090-6778, 1558-0857
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!