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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications Jg. 73; H. 11; S. 10976 - 10988
Hauptverfasser:	Yuan, Deheng, Guo, Tao, Huang, Zhongyi, Jin, Shi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.11.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!