activity
20122024
most citedInformation Measures: the Curious Case of the Binary Alphabet

32 citations · 73 across the 10 of their papers we have counts for

collaborators

10 papers

cs.CV2024

Differentially Private Adaptation of Diffusion Models via Noisy Aggregated Embeddings

Pura Peetathawatchai, Wei-Ning Chen, Berivan Isik +2

Personalizing large-scale diffusion models poses serious privacy risks, especially when adapting to small, sensitive datasets. A common approach is to fine-tune the model using dif…

cs.CR2024

Improved Communication-Privacy Trade-offs in Mean Estimation under Streaming Differential Privacy

Wei-Ning Chen, Berivan Isik, Peter Kairouz +3

We study mean estimation under central differential privacy and communication constraints, and address two key challenges: firstly, existing mean estimation schemes that simu…

cs.LG2023★ 4 cited

Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimation

Berivan Isik, Wei-Ning Chen, Ayfer Ozgur +2

We study the mean estimation problem under communication and local differential privacy constraints. While previous work has proposed \emph{order}-optimal algorithms for the same p…

cs.LG2021★ 9 cited

An Information-Theoretic Justification for Model Pruning

Berivan Isik, Tsachy Weissman, Albert No

We study the neural network (NN) compression problem, viewing the tension between the compression ratio and NN performance through the lens of rate-distortion theory. We choose a d…

cs.IT2017

Universality of Logarithmic Loss in Lossy Compression

Albert No, Tsachy Weissman

We establish two strong senses of universality of logarithmic loss as a distortion criterion in lossy compression: For any fixed length lossy compression problem under an arbitrary…

cs.IT2015★ 2 cited

Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff

Albert No, Amir Ingber, Tsachy Weissman

We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similarly to the classical definition of a successively refinable source, we s…

cs.IT2014★ 2 cited

Rateless Lossy Compression via the Extremes

Albert No, Tsachy Weissman

We begin by presenting a simple lossy compressor operating at near-zero rate: The encoder merely describes the indices of the few maximal source components, while the decoder's rec…

cs.IT2014★ 32 cited

Information Measures: the Curious Case of the Binary Alphabet

Jiantao Jiao, Thomas Courtade, Albert No +2

Four problems related to information divergence measures defined on finite alphabets are considered. In three of the cases we consider, we illustrate a contrast which arises betwee…

cs.IT2013★ 2 cited

Minimax Filtering via Relations between Information and Estimation

Albert No, Tsachy Weissman

We investigate the problem of continuous-time causal estimation under a minimax criterion. Let be governed by the probability law from a class o…

cs.IT2012★ 22 cited

Reference Based Genome Compression

Bobbie Chern, Idoia Ochoa, Alexandros Manolakos +3

DNA sequencing technology has advanced to a point where storage is becoming the central bottleneck in the acquisition and mining of more data. Large amounts of data are vital for g…