activity
20132025
most citedDistributed Hypothesis Testing with Privacy Constraints

21 citations · 55 across the 14 of their papers we have counts for

collaborators

18 papers

cs.LG2025

On Self-Adaptive Perception Loss Function for Sequential Lossy Compression

Sadaf Salehkalaibar, Buu Phan, Likun Cai +4

We consider causal, low-latency, sequential lossy compression, with mean squared-error (MSE) as the distortion loss, and a perception loss function (PLF) to enhance the realism of…

cs.IT2024★ 11 cited

Rate-Distortion-Perception Tradeoff for Gaussian Vector Sources

Jingjing Qian, Sadaf Salehkalaibar, Jun Chen +5

This paper studies the rate-distortion-perception (RDP) tradeoff for a Gaussian vector source coding problem where the goal is to compress the multi-component source subject to dis…

cs.IT2024

Rate-Distortion-Perception Tradeoff Based on the Conditional-Distribution Perception Measure

Sadaf Salehkalaibar, Jun Chen, Ashish Khisti +1

This paper studies the rate-distortion-perception (RDP) tradeoff for a memoryless source model in the asymptotic limit of large block-lengths. The perception measure is based on a…

eess.IV2023★ 2 cited

On the Choice of Perception Loss Function for Learned Video Compression

Sadaf Salehkalaibar, Buu Phan, Jun Chen +2

We study causal, low-latency, sequential video compression when the output is subjected to both a mean squared-error (MSE) distortion loss as well as a perception loss to target re…

cs.LG2023

M22: A Communication-Efficient Algorithm for Federated Learning Inspired by Rate-Distortion

Yangyi Liu, Stefano Rini, Sadaf Salehkalaibar +1

In federated learning (FL), the communication constraint between the remote learners and the Parameter Server (PS) is a crucial bottleneck. For this reason, model updates must be c…

cs.LG2022★ 3 cited

Lossy Gradient Compression: How Much Accuracy Can One Bit Buy?

Sadaf Salehkalaibar, Stefano Rini

In federated learning (FL), a global model is trained at a Parameter Server (PS) by aggregating model updates obtained from multiple remote learners. Generally, the communication b…

cs.IT2022

On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources

Siyao Zhou, Sadaf Salehkalaibar, Jingjing Qian +4

A distributed lossy compression network with encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder pro…

cs.IT2021

Distributed Sequential Hypothesis Testing With Zero-Rate Compression

Sadaf Salehkalaibar, Vincent Y. F. Tan

In this paper, we consider sequential testing over a single-sensor, a single-decision center setup. At each time instant , the sensor gets samples and describes the…

cs.IT2020

State Masking Over a Two-State Compound Channel

Sadaf Salehkalaibar, Mohammad Hossein Yassaee, Vincent Y. F. Tan +1

We consider fundamental limits for communicating over a compound channel when the state of the channel needs to be masked. Our model is closely related to an area of study known as…

cs.IT2020

On Sum Secure Degrees of Freedom for K-User MISO Broadcast Channel With Alternating CSIT

Leyla Sadighi, Sadaf Salehkalaibar, Stefano Rini

In this paper, the sum secure degrees of freedom (SDoF) of the -user Multiple Input/Single Output (MISO) Broadcast Channel with Confidential Messages (BCCM) and alternating Chan…

cs.IT2020

Distributed Hypothesis Testing with Variable-Length Coding

Sadaf Salehkalaibar, Michele Wigger

The problem of distributed testing against independence with variable-length coding is considered when the \emph{average} and not the \emph{maximum} communication load is constrain…

cs.IT2019

Distributed Hypothesis Testing with Variable-Length Coding

Sadaf Salehkalaibar, Michele Wigger

This paper characterizes the optimal type-II error exponent for a distributed hypothesis testing-against-independence problem when the \emph{expected} rate of the sensor-detector l…

cs.IT2019★ 2 cited

Covert Communication Over a Compound Channel

Sadaf Salehkalaibar, Mohammad Hossein Yassaee, Vincent Y. F. Tan

In this paper, we consider fundamental communication limits over a compound channel. Covert communication in the information-theoretic context has been primarily concerned with fun…

cs.IT2018

Distributed Hypothesis Testing based on Unequal-Error Protection Codes

Sadaf Salehkalaibar, Michele Wigger

Coding and testing schemes for binary hypothesis testing over noisy networks are proposed and their corresponding type-II error exponents are derived. When communication is over a…

cs.IT2018★ 21 cited

Distributed Hypothesis Testing with Privacy Constraints

Atefeh Gilani, Selma Belhadj Amor, Sadaf Salehkalaibar +1

We revisit the distributed hypothesis testing (or hypothesis testing with communication constraints) problem from the viewpoint of privacy. Instead of observing the raw data direct…

cs.IT2017★ 6 cited

Hypothesis Testing Over the Two-hop Relay Network

Sadaf Salehkalaibar, Michele Wigger, Ligong Wang

Coding and testing schemes and the corresponding achievable type-II error exponents are presented for binary hypothesis testing over two-hop relay networks. The schemes are based o…

cs.IT2017★ 10 cited

On Hypothesis Testing Against Independence with Multiple Decision Centers

Sadaf Salehkalaibar, Michele Wigger, Roy Timo

A distributed binary hypothesis testing problem is studied with one observer and two decision centers. Achievable type-II error exponents are derived for testing against conditiona…

cs.CR2013

Key agreement over a 3-receiver broadcast channel

Mohsen Bahrami, Ali Bereyhi, Sadaf Salehkalaibar +1

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eaves…