:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Weinberger, Nir, Zamir, Ram
Format:	Preprint
Publié:	2025
Sujets:	Information Theory Machine Learning
Accès en ligne:	https://arxiv.org/abs/2506.20261
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics
par: Freirich, Dror, et autres
Publié: (2024)

A representation-learning game for classes of prediction tasks
par: Uzan, Neria, et autres
Publié: (2024)

Quantum Maximum Likelihood Prediction via Hilbert Space Embeddings
par: Sreekumar, Sreejith, et autres
Publié: (2026)

BICompFL: Stochastic Federated Learning with Bi-Directional Compression
par: Egger, Maximilian, et autres
Publié: (2025)

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

Cross-Domain Lossy Compression via Constrained Minimum Entropy Coupling
par: Nguyen, Nam, et autres
Publié: (2026)

Maximal-Capacity Discrete Memoryless Channel Identification
par: Egger, Maximilian, et autres
Publié: (2024)

Alternate Learning and Compression Approaching R(D)
par: Zamir, Ram, et autres
Publié: (2024)

Learning is Forgetting: LLM Training As Lossy Compression
par: Conklin, Henry C., et autres
Publié: (2026)

Scaling Training Data with Lossy Image Compression
par: Mentzer, Katherine L., et autres
Publié: (2024)

Navigating the Exploration-Exploitation Tradeoff in Inference-Time Scaling of Diffusion Models
par: Su, Xun, et autres
Publié: (2025)

The Gap Between Principle and Practice of Lossy Image Coding
par: Zhang, Haotian, et autres
Publié: (2025)

Optimal Overlap Detection of Shotgun Reads
par: Luria, Nir, et autres
Publié: (2025)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
par: Zurek, Matthew, et autres
Publié: (2025)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
par: Zamir, Guy, et autres
Publié: (2026)

Supervised Learning as Lossy Compression: Characterizing Generalization and Sample Complexity via Finite Blocklength Analysis
par: Sugiyama, Kosuke, et autres
Publié: (2026)

Output-Constrained Lossy Source Coding With Application to Rate-Distortion-Perception Theory
par: Xie, Li, et autres
Publié: (2024)

Optimal Neural Compressors for the Rate-Distortion-Perception Tradeoff
par: Lei, Eric, et autres
Publié: (2025)

Pool-based Active Learning as Noisy Lossy Compression: Characterizing Label Complexity via Finite Blocklength Analysis
par: Sugiyama, Kosuke, et autres
Publié: (2026)

Rate-Distortion-Perception Tradeoff Based on the Conditional-Distribution Perception Measure
par: Salehkalaibar, Sadaf, et autres
Publié: (2024)

Generative Decompression: Optimal Lossy Decoding Against Distribution Mismatch
par: Khosravirad, Saeed R., et autres
Publié: (2026)

Intrinsic Fairness-Accuracy Tradeoffs under Equalized Odds
par: Zhong, Meiyu, et autres
Publié: (2024)

Generalized Lagrange Coded Computing: A Flexible Computation-Communication Tradeoff for Resilient, Secure, and Private Computation
par: Zhu, Jinbao, et autres
Publié: (2022)

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

Deep Dict: Deep Learning-based Lossy Time Series Compressor for IoT Data
par: Liu, Jinxin, et autres
Publié: (2024)

Rapid and Power-Aware Learned Optimization for Modular Receive Beamforming
par: Levy, Ohad, et autres
Publié: (2024)

Breaking the Communication-Privacy-Accuracy Tradeoff with $f$-Differential Privacy
par: Jin, Richeng, et autres
Publié: (2023)

A Synonymous Variational Perspective on the Rate-Distortion-Perception Tradeoff
par: Liang, Zijian, et autres
Publié: (2026)

Achievable Rates and Error Probability Bounds of Frequency-based Channels of Unlimited Input Resolution
par: Tamir, Ran, et autres
Publié: (2025)

A Toolbox for Refined Information-Theoretic Analyses with Applications
par: Merhav, Neri, et autres
Publié: (2024)

Universal Rate-Distortion-Classification Representations for Lossy Compression
par: Nguyen, Nam, et autres
Publié: (2025)

Lossy Common Information in a Learnable Gray-Wyner Network
par: de Andrade, Anderson, et autres
Publié: (2026)

Frame Codes for the Block-Erasure Channel -- Extended Version
par: Jacoby, Itamar, et autres
Publié: (2024)

A Unified View of Group Fairness Tradeoffs Using Partial Information Decomposition
par: Hamman, Faisal, et autres
Publié: (2024)

Rateless DeepJSCC for Broadcast Channels: a Rate-Distortion-Complexity Tradeoff
par: Qin, Zijun, et autres
Publié: (2026)

Privacy-Utility Tradeoffs in Quantum Information Processing
par: Nuradha, Theshani, et autres
Publié: (2026)

Learning to Compress: Local Rank and Information Compression in Deep Neural Networks
par: Patel, Niket, et autres
Publié: (2024)

Latency-Distortion Tradeoffs in Communicating Classification Results over Noisy Channels
par: Teku, Noel, et autres
Publié: (2024)

FibQuant: Universal Vector Quantization for Random-Access KV-Cache Compression
par: Lee, Namyoon, et autres
Publié: (2026)

On Achievable Rates Over Noisy Nanopore Channels
par: Rameshwar, V. Arvind, et autres
Publié: (2025)