Cover Image

Efficient and Provably Convergent Computation of Information Bottleneck: A Semi-Relaxed Approach

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Lingyi, Wu, Shitong, Ye, Jiachuan, Wu, Huihui, Zhang, Wenyi, Wu, Hao
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Expectation-Maximization Relaxed Method for Privacy Funnel
by: Chen, Lingyi, et al.
Published: (2024)

Efficient Computation of Marton's Error Exponent via Constraint Decoupling
by: Ye, Jiachuan, et al.
Published: (2025)

Neural Estimation of the Information Bottleneck Based on a Mapping Approach
by: Chen, Lingyi, et al.
Published: (2025)

On Convergence of Discrete Schemes for Computing the Rate-Distortion Function of Continuous Source
by: Chen, Lingyi, et al.
Published: (2024)

An Optimal Transport-Based Method for Computing LM Rate and Its Convergence Analysis
by: Wu, Shitong, et al.
Published: (2025)

A Double Maximization Approach for Optimizing the LM Rate of Mismatched Decoding
by: Chen, Lingyi, et al.
Published: (2024)

Estimating Rate-Distortion Functions Using the Energy-Based Model
by: Wu, Shitong, et al.
Published: (2025)

An Efficient Alternating Minimization Algorithm for Computing Quantum Rate-Distortion Function
by: Chen, Lingyi, et al.
Published: (2025)

A Constrained BA Algorithm for Rate-Distortion and Distortion-Rate Functions
by: Chen, Lingyi, et al.
Published: (2023)

Alternating Maximization Algorithm for Mismatch Capacity with Oblivious Relaying
by: Li, Xinwei, et al.
Published: (2024)

RDD Function: A Tradeoff Between Rate and Distortion-in-Distortion
by: Chen, Lingyi, et al.
Published: (2025)

A Convergent Primal-Dual Algorithm for Computing Rate-Distortion-Perception Functions
by: Chen, Chunhui, et al.
Published: (2025)

Exponential Error Bounds for Information Bottleneck Source Coding Problems
by: Wu, Han, et al.
Published: (2025)

Achieving $α$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach
by: Deng, Chaowen, et al.
Published: (2026)

Cross-Layer Security for Semantic Communications: Metrics and Optimization
by: Wang, Lingyi, et al.
Published: (2025)

Greedy Sampling Is Provably Efficient for RLHF
by: Wu, Di, et al.
Published: (2025)

Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel
by: Liu, Yuhao, et al.
Published: (2026)

Computation and Critical Transitions of Rate-Distortion-Perception Functions With Wasserstein Barycenter
by: Chen, Chunhui, et al.
Published: (2024)

Structured IB: Improving Information Bottleneck with Structured Feature Learning
by: Yang, Hanzhe, et al.
Published: (2024)

Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRAND
by: Wan, Li, et al.
Published: (2024)

Fast and Provable Hankel Tensor Completion for Multi-measurement Spectral Compressed Sensing
by: Li, Jinsheng, et al.
Published: (2025)

Breaking AR's Sampling Bottleneck: Provable Acceleration via Diffusion Language Models
by: Li, Gen, et al.
Published: (2025)

A Novel Coded Computing Approach for Distributed Multi-Task Learning
by: Cheng, Minquan, et al.
Published: (2025)

IRS-Enhanced Secure Semantic Communication Networks: Cross-Layer and Context-Awared Resource Allocation
by: Wang, Lingyi, et al.
Published: (2024)

Knowledge-Driven 3D Semantic Spectrum Map: KE-VQ-Transformer Based UAV Semantic Communication and Map Completion
by: Wu, Wei, et al.
Published: (2025)

Information Rates of Channels with Additive White Cauchy Noise
by: Pang, Shuqin, et al.
Published: (2024)

Knowledge Graph-Based Explainable and Generalized Zero-Shot Semantic Communications
by: Zhang, Zhaoyu, et al.
Published: (2025)

Hyper-VIB: A Hypernetwork-Enhanced Information Bottleneck Approach for Task-Oriented Communications
by: Peng, Jingchen, et al.
Published: (2025)

Differentiable Information Bottleneck for Deterministic Multi-view Clustering
by: Yan, Xiaoqiang, et al.
Published: (2024)

Entropic Isoperimetric and Cramér--Rao Inequalities for Rényi--Fisher Information
by: Wu, Hao, et al.
Published: (2025)

An Efficient Convex-Hull Relaxation Based Algorithm for Multi-User Discrete Passive Beamforming
by: Lai, Wenhai, et al.
Published: (2024)

Order Optimal Cascaded Code Distributed Computing With Low Complexity and Improved Flexibility
by: Zhang, Mingming, et al.
Published: (2023)

Improving Channel Resilience for Task-Oriented Semantic Communications: A Unified Information Bottleneck Approach
by: Lyu, Shuai, et al.
Published: (2024)

Cyclic and Negacyclic Codes with Optimal and Best Known Minimum Distances
by: Chen, Hao, et al.
Published: (2024)

A Finite-Blocklength Analysis for ORBGRAND
by: Li, Zhuang, et al.
Published: (2026)

Projection Head is Secretly an Information Bottleneck
by: Ouyang, Zhuo, et al.
Published: (2025)

A Remark on Downlink Massive Random Access
by: Liao, Yuchen, et al.
Published: (2026)

On Decentralized Linearly Separable Computation With the Minimum Computation Cost
by: Chen, Haoning, et al.
Published: (2024)

Linear Convergence in Hilbert's Projective Metric for Computing Augustin Information and a Rényi Information Measure
by: Tsai, Chung-En, et al.
Published: (2024)

Alkaid: Resilience to Edit Errors in Provably Secure Steganography via Distance-Constrained Encoding
by: Cao, Zhihan, et al.
Published: (2026)