Image de couverture de livre

Log-Likelihood Loss for Semantic Compression

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yadav, Anuj Kumar, Song, Dan, Shkel, Yanina, Özgür, Ayfer
Format:	Preprint
Publié:	2026
Sujets:	Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Geometry of Rényi Entropy on the Majorization Lattice
par: Yadav, Anuj Kumar, et autres
Publié: (2026)

Locally Private Parametric Methods for Change-Point Detection
par: Yadav, Anuj Kumar, et autres
Publié: (2026)

The Performance of Compression-Based Denoisers
par: Song, Dan, et autres
Publié: (2025)

Composition Theorems for Multiple Differential Privacy Constraints
par: Cadir, Cemre, et autres
Publié: (2026)

$L_q$ Lower Bounds on Distributed Estimation via Fisher Information
par: Chen, Wei-Ning, et autres
Publié: (2024)

An Information Geometric Approach to Fairness With Equalized Odds Constraint
par: Zamani, Amirreza, et autres
Publié: (2025)

On Information Theoretic Fairness With A Bounded Point-Wise Statistical Parity Constraint: An Information Geometric Approach
par: Zamani, Amirreza, et autres
Publié: (2025)

Information Compression in the AI Era: Recent Advances and Future Challenges
par: Chen, Jun, et autres
Publié: (2024)

Universal Exact Compression of Differentially Private Mechanisms
par: Liu, Yanxiao, et autres
Publié: (2024)

Training generative models from privatized data
par: Reshetova, Daria, et autres
Publié: (2023)

Optimal binary codes from $\mathcal{C}_{D}$-codes over a non-chain ring
par: Yadav, Ankit, et autres
Publié: (2025)

Leave-One-Out Learning with Log-Loss
par: Fogel, Yaniv, et autres
Publié: (2025)

Wiretapped Commitment over Binary Channels
par: Yadav, Anuj Kumar, et autres
Publié: (2024)

On the Information Loss of the Max-Log Approximation in BICM Systems
par: Ivanov, Mikhail, et autres
Publié: (2014)

On the Euclidean duals of the cyclic codes generated via cyclotomic polynomials
par: Bhagat, Anuj Kumar, et autres
Publié: (2026)

Semantic Compression with Information Lattice Learning
par: Yu, Haizi, et autres
Publié: (2024)

Subfield codes of $C_D$-codes over $\mathbb{F}_2[x]/\langle x^3-x \rangle$ are really nice!
par: Bhagat, Anuj Kumar, et autres
Publié: (2024)

Row-Column Twisted Reed-Solomon codes
par: Bhagat, Anuj Kumar, et autres
Publié: (2025)

Heavy-Tailed and Long-Range Dependent Noise in Stochastic Approximation: A Finite-Time Analysis
par: Chandak, Siddharth, et autres
Publié: (2026)

Likelihood-free hypothesis testing
par: Gerber, Patrik Róbert, et autres
Publié: (2022)

Cryptographic Applications of Twisted Goppa Codes
par: Singh, Harshdeep, et autres
Publié: (2026)

Asymptotically Minimax Robust Likelihood Ratio Test
par: Gül, Gökhan
Publié: (2026)

On Self-Adaptive Perception Loss Function for Sequential Lossy Compression
par: Salehkalaibar, Sadaf, et autres
Publié: (2025)

Embracing Off-the-Grid Samples
par: López, Oscar, et autres
Publié: (2022)

Achievable Rates for Information Extraction from a Strategic Sender
par: Vora, Anuj S., et autres
Publié: (2023)

Semantic Security with Unreliable Entanglement Assistance: Interception and Loss
par: Lederman, Meir, et autres
Publié: (2024)

Joint Data and Semantics Lossy Compression: Nonasymptotic Converse Bounds and Second-Order Asymptotics
par: Yang, Huiyuan, et autres
Publié: (2024)

Graph Compression with Side Information at the Decoder
par: Vippathalla, Praneeth Kumar, et autres
Publié: (2023)

Compression Beyond Pixels: Semantic Compression with Multimodal Foundation Models
par: Shen, Ruiqi, et autres
Publié: (2025)

An Information Theory of Compute-Optimal Size Scaling, Emergence, and Plateaus in Language Models
par: Nayak, Anuj K., et autres
Publié: (2024)

Low-Complexity Run-Length-Limited ISI-Mitigation (RLIM) Codes for Molecular Communication
par: Şahin, Melih, et autres
Publié: (2026)

Local Differential Privacy for Molecular Communication Networks
par: Şahin, Melih, et autres
Publié: (2026)

Extended Functional Representation Lemma: A Tool For Privacy, Semantic Representation, Caching, and Compression Design
par: Zamani, Amirreza, et autres
Publié: (2024)

Run-Length-Limited ISI-Mitigation (RLIM) Coding for Molecular Communication
par: Şahin, Melih, et autres
Publié: (2024)

Semantic Rate-Distortion Theory: Deductive Compression and Closure Fidelity
par: Xu, Jianfeng
Publié: (2026)

Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRAND
par: Wan, Li, et autres
Publié: (2024)

Policy-Guided MCTS for near Maximum-Likelihood Decoding of Short Codes
par: Tian, Y., et autres
Publié: (2025)

On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
par: Cheng, Kuan, et autres
Publié: (2023)

Sparse Superposition Codes with Binomial Dictionary are Capacity-Achieving with Maximum Likelihood Decoding
par: Takeishi, Yoshinari, et autres
Publié: (2025)

Likelihood Scouting Via Map Inversion For A Posterior-Sampled Particle Filter
par: Servadio, Simone
Publié: (2024)