77 citations · 179 across the 54 of their papers we have counts for
64 papers
The Right to Be Forgotten under Correlation: Privacy-Utility Tradeoffs
Luis Massny, Rawad Bitar, Fangwei Ye +1
We study privacy-preserving algorithms that redact information from a correlated dataset. The goal is to reduce the information leakage about sensitive parts. We analytically chara…
RW-LoRA: Communication-Efficient Decentralized LoRA Fine-Tuning via Random Walks
Xingran Chen, Rohit Bhagat, Ghadir Ayache +3
Parameter-efficient fine-tuning methods such as LoRA have become a standard approach for adapting large foundation models. Adopting fine-tuning to distributed settings faces severa…
CSS Quantum LRCs with Intersecting Recovery Sets: Constructions and Bounds
Evagoras Stylianou, Vinayak Ramkumar, Holger Boche +1
In this work, we study quantum locally recoverable codes (qLRCs) with locality , recovery sets per qudit, and intersection parameter . We first show that, assum…
SeFoRA: Sketch-Aggregated Federated Low-Rank Adaptation with Heterogeneous Client Ranks
Yue Xia, Tayyebeh Jahani-Nezhad, Mayank Bakshi +1
We consider federated parameter efficient fine-tuning of large neural networks with low-rank adaptation (LoRA,~Hu et al.\ 2022). Combining LoRA with federated PEFT introduces chall…
Private Information Retrieval for Large-Scale DNA-Based Data Storage
Gökberk Erdoğan, Daniella Bar-Lev, Rawad Bitar +2
We investigate Private Information Retrieval (PIR) in the context of synthetic DNA-based data storage. While PIR is a well-studied primitive for digital databases, extending it to…
Random Access Expectation in DNA Storage and Fountain Codes
Christoph Hofmeister, Rawad Bitar, Eitan Yaakobi
Motivated by DNA data storage, we study the expected number of coded symbols drawn from a linear code until a desired information symbol can be decoded - the random access expectat…