Cover Image

$(\ell,δ)$-Diversity: Linkage-Robustness via a Composition Theorem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rameshwar, V. Arvind, Tandon, Anshoo
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Improving the Composition Privacy Loss in Differential Privacy for Fixed Estimation Error
by: Rameshwar, V. Arvind, et al.
Published: (2024)

Bounding User Contributions for User-Level Differentially Private Mean Estimation
by: Rameshwar, V. Arvind, et al.
Published: (2025)

Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs
by: Rameshwar, V. Arvind, et al.
Published: (2024)

Refined Differentially Private Linear Regression via Extension of a Free Lunch Result
by: S, Sasmita Harini, et al.
Published: (2026)

Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets
by: Rameshwar, V. Arvind, et al.
Published: (2024)

An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC
by: Rameshwar, V. Arvind, et al.
Published: (2024)

On Achievable Rates Over Noisy Nanopore Channels
by: Rameshwar, V. Arvind, et al.
Published: (2025)

Information Rates Over Multi-View Channels
by: Rameshwar, V. Arvind, et al.
Published: (2024)

Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
by: Jain, Shreyas, et al.
Published: (2024)

On the Error Probability of RPA Decoding of Reed-Muller Codes over BMS Channels
by: Fathollahi, Dorsa, et al.
Published: (2026)

SKALD: Scalable K-Anonymisation for Large Datasets
by: Reddy, Kailash, et al.
Published: (2025)

SPLITZ: Certifiable Robustness via Split Lipschitz Randomized Smoothing
by: Zhong, Meiyu, et al.
Published: (2024)

Building a Privacy Web with SPIDEr -- Secure Pipeline for Information De-Identification with End-to-End Encryption
by: Chakraborty, Novoneel, et al.
Published: (2024)

Fine-Grained Uncertainty Quantification via Collisions
by: Friedbaum, Jesse, et al.
Published: (2024)

Speeding up Speculative Decoding via Sequential Approximate Verification
by: Zhong, Meiyu, et al.
Published: (2025)

Composition Theorems for f-Differential Privacy
by: Fernandes, Natasha, et al.
Published: (2025)

On the Optimal Number of Grids for Differentially Private Non-Interactive $K$-Means Clustering
by: Muthukrishnan, Gokularam, et al.
Published: (2026)

Composition Theorems for Multiple Differential Privacy Constraints
by: Cadir, Cemre, et al.
Published: (2026)

Intrinsic Fairness-Accuracy Tradeoffs under Equalized Odds
by: Zhong, Meiyu, et al.
Published: (2024)

Inference Privacy: Properties and Mechanisms
by: Tian, Fengwei, et al.
Published: (2024)

Prompt Fairness: Sub-group Disparities in LLMs
by: Zhong, Meiyu, et al.
Published: (2025)

CURATE: Scaling-up Differentially Private Causal Graph Discovery
by: Bhattacharjee, Payel, et al.
Published: (2024)

Support Recovery and $\ell_2$-Error Bound for Sparse Regression with Quadratic Measurements via Weakly-Convex-Concave Regularization
by: Fan, Jun, et al.
Published: (2026)

Sparse Phase Retrieval with Redundant Dictionary via $\ell_q (0<q\le 1)$-Analysis Model
by: Huo, Haiye, et al.
Published: (2025)

Bounds and Constructions of $\ell$-Read Codes under the Hamming Metric
by: Sun, Yubo, et al.
Published: (2024)

Revisiting mean estimation over $\ell_p$ balls: Is the MLE optimal?
by: Aolaritei, Liviu, et al.
Published: (2025)

Discrete Aware Tensor Completion via Convexized $\ell_0$-Norm Approximation
by: Führling, Niclas, et al.
Published: (2026)

New Constructions of Optimal $(r,δ)$-LRCs via Algebraic Function Fields
by: Gao, Yuan, et al.
Published: (2025)

Learning Sparsifying Transforms for mmWave Communication via $\ell^4$-Norm Maximization
by: Taner, Sueda, et al.
Published: (2026)

Secrecy Analysis of Energy-Harvesting Backscatter Communications with Tag Selection in Nakagami-m Fading
by: Nafees, Mohammad, et al.
Published: (2025)

On the $(k,\ell)$-multiset anonymity measure for social graphs
by: Estrada-Moreno, Alejandro, et al.
Published: (2025)

Trustworthy Actionable Perturbations
by: Friedbaum, Jesse, et al.
Published: (2024)

MARS: Margin and Semantic-Aware Data Augmentation for Reward Modeling
by: Bhattacharjee, Payel, et al.
Published: (2026)

Filtered Randomized Smoothing: A New Defense for Robust Modulation Classification
by: Zhang, Wenhan, et al.
Published: (2024)

Central Limit Theorem for Mutation Systems
by: Koram, Liav, et al.
Published: (2026)

Robust Composite DNA Storage under Sampling Randomness, Substitution, and Insertion-Deletion Errors
by: Tegin, Busra, et al.
Published: (2026)

Latency-Distortion Tradeoffs in Communicating Classification Results over Noisy Channels
by: Teku, Noel, et al.
Published: (2024)

Generalization Bounds for Neural Belief Propagation Decoders
by: Adiga, Sudarshan, et al.
Published: (2023)

Coding Theorem for Generalized Reed-Solomon Codes
by: Zheng, Xiangping, et al.
Published: (2025)

Theoretical limits of descending $\ell_0$ sparse-regression ML algorithms
by: Stojnic, Mihailo
Published: (2024)