English
Related papers

Related papers: Subjective Distortion: Achievability and Outer Bou…

200 papers

We study learning algorithms when there is a mismatch between the distributions of the training and test datasets of a learning algorithm. The effect of this mismatch on the generalization error and model misspecification are quantified.…

Information Theory · Computer Science 2022-08-11 Saeed Masiha , Amin Gohari , Mohammad Hossein Yassaee , Mohammad Reza Aref

An algorithm effects a causal representation of relations between features and labels in the human's perception. Such a representation might conflict with the human's prior belief. Explanations can direct the human's attention to the…

Human-Computer Interaction · Computer Science 2024-02-14 Charles Wan , Rodrigo Belo , Leid Zejnilović , Susana Lavado

The relation between nonanticipative Rate Distortion Function (RDF) and filtering theory is discussed on abstract spaces. The relation is established by imposing a realizability constraint on the reconstruction conditional distribution of…

Information Theory · Computer Science 2016-11-15 Charalambos D. Charalambous , Photios A. Stavrou , Nasir U. Ahmed

We consider the problem of causal source coding and causal decoding of a Gauss--Markov source, where the decoder has causal access to a side-information signal. We define the information causal rate-distortion function with causal decoder…

Information Theory · Computer Science 2020-08-13 Omri Lev , Anatoly Khina

Many machine learning approaches are characterized by information constraints on how they interact with the training data. These include memory and sequential access constraints (e.g. fast first-order methods to solve stochastic…

Machine Learning · Computer Science 2014-10-29 Ohad Shamir

We investigate the Wyner-Ziv coding in which the statistics of the principal source is known but the statistics of the channel generating the side-information is unknown except that it is in a certain class. The class consists of channels…

Information Theory · Computer Science 2013-05-06 Shun Watanabe , Shigeaki Kuzuoka

For several styles of fidelity constraints -- guaranteed distortion, conditional excess distortion, excess distortion -- we show mutual information upper bounds on the minimum expected description length needed to represent a random…

Information Theory · Computer Science 2026-02-10 Victoria Kostina

We consider a popular family of constrained optimization problems arising in machine learning that involve optimizing a non-decomposable evaluation metric with a certain thresholded form, while constraining another metric of interest.…

Machine Learning · Computer Science 2021-07-30 Abhishek Kumar , Harikrishna Narasimhan , Andrew Cotter

The enormous size of modern deep neural networks makes it challenging to deploy those models in memory and communication limited scenarios. Thus, compressing a trained model without a significant loss in performance has become an…

Information Theory · Computer Science 2019-01-25 Weihao Gao , Yu-Han Liu , Chong Wang , Sewoong Oh

We propose a fair machine learning algorithm to model interpretable differences between observed and desired human decision-making, with the latter aimed at reducing disparity in a downstream outcome impacted by the human decision. Prior…

Machine Learning · Computer Science 2025-05-26 Pavan Ravishankar , Rushabh Shah , Daniel B. Neill

Optical networks are vulnerable to physical layer attacks; wiretappers can improperly receive messages intended for legitimate recipients. Our work considers an aspect of this security problem within the domain of multimode fiber (MMF)…

Cryptography and Security · Computer Science 2016-11-17 Eva C. Song , Emina Soljanin , Paul Cuff , H. Vincent Poor , Kyle Guan

Snapshots of "best" (or "worst") experience are known to dominate human memory and may thus also have a significant effect on future behaviour. We consider here a model of repeated decision-making where, at every time step, an agent takes…

Statistical Mechanics · Physics 2022-02-18 Evangelos Mitsokapas , Rosemary J. Harris

In this paper, we introduce new lower bounds on the distortion of scalar fixed-rate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a…

Information Theory · Computer Science 2014-11-18 Avraham Reani , Neri Merhav

The problem of private information "leakage" (inadvertently or by malicious design) from the myriad large centralized searchable data repositories drives the need for an analytical framework that quantifies unequivocally how safe private…

Information Theory · Computer Science 2010-02-09 Lalitha Sankar , S. Raj Rajagopalan , H. Vincent Poor

In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…

Computer Science and Game Theory · Computer Science 2023-12-11 Yannai A. Gonczarowski , Gregory Kehne , Ariel D. Procaccia , Ben Schiffer , Shirley Zhang

In this paper, we study rate-distortion theory for general sources with an emphasis on the existence of optimal reconstruction distributions on noncompact alphabets. Classical attainability results typically rely on compactness of the…

Information Theory · Computer Science 2026-05-05 Jiayang Zou , Luyao Fan , Jiayang Gao , Jia Wang

We define the complexity of a continuous-time linear system to be the minimum number of bits required to describe its forward increments to a desired level of fidelity, and compute this quantity using the rate distortion function of a…

Systems and Control · Electrical Eng. & Systems 2023-06-06 Eric Wendel , John Baillieul , Joseph Hollmann

We consider the rate distortion problem with side information at the decoder posed and investigated by Wyner and Ziv. The rate distortion function indicating the trade-off between the rate on the data compression and the quality of data…

Information Theory · Computer Science 2016-04-27 Yasutada Oohama

Transfer learning is beneficial by allowing the expressive features of models pretrained on large-scale datasets to be finetuned for the target task of smaller, more domain-specific datasets. However, there is a concern that these…

Computer Vision and Pattern Recognition · Computer Science 2023-08-21 Angelina Wang , Olga Russakovsky

We derive quantum counterparts of two key theorems of classical information theory, namely, the rate distortion theorem and the source-channel separation theorem. The rate-distortion theorem gives the ultimate limits on lossy data…

Quantum Physics · Physics 2012-12-21 Nilanjana Datta , Min-Hsiu Hsieh , Mark M. Wilde