collaborators

8 papers

cs.GT2026

Zero-determinant Strategy for Moving Target Defense: Existence, Performance, and Computation

Zhaoyang Cheng, Guanpu Chen, Yiguang Hong +2

Moving Target Defense (MTD) is commonly formulated as a repeated security game to mitigate persistent threats. Although the strong Stackelberg equilibrium (SSE) characterizes the d…

cs.LG2026

A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning

Dario Filatrella, Ragnar Thobaben, Mikael Skoglund

We study expected generalization bounds for the Hierarchical Federated Learning (HFL) setup using Wasserstein distance. We introduce a generalized framework in which data is sample…

cs.IT2026

Sparse Point-wise Privacy Leakage: Mechanism Design and Fundamental Limits

Amirreza Zamani, Sajad Daei, Parastoo Sadeghi +1

We study an information-theoretic privacy mechanism design problem, where an agent observes useful data that is arbitrarily correlated with sensitive data , and design discl…

cs.IT2026

Privacy-Utility Trade-offs Under Multi-Level Point-Wise Leakage Constraints

Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund

An information-theoretic privacy mechanism design is studied, where an agent observes useful data which is correlated with the private data . The agent wants to reveal the i…

cs.IT2025

An Information Geometric Approach to Fairness With Equalized Odds Constraint

Amirreza Zamani, Ayfer Özgür, Mikael Skoglund

We study the statistical design of a fair mechanism that attains equalized odds, where an agent uses some useful data (database) to solve a task . Since both and are…

cs.IT2025

On Information Theoretic Fairness With A Bounded Point-Wise Statistical Parity Constraint: An Information Geometric Approach

Amirreza Zamani, Ayfer Özgür, Mikael Skoglund

In this paper, we study an information-theoretic problem of designing a fair representation under a bounded point-wise statistical (demographic) parity constraint. More specificall…