Nir Weinberger

IEEE Trans. Inf. Theory, February, 2025

BICompFL: Stochastic Federated Learning with Bi-Directional Compression.

[BibT_eX]

[DOI]

CoRR, February, 2025

Achievable Rates and Error Probability Bounds of Frequency-Based Channels of Unlimited Input Resolution.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2025

On Achievable Rates Over Noisy Nanopore Channels.

[BibT_eX]

[DOI]

V Arvind Rameshwar

IEEE J. Sel. Areas Inf. Theory, 2025

Error Exponents for DNA Storage Codes With a Variable Number of Reads.

[BibT_eX]

[DOI]

Yan Hao Ling

Jonathan Scarlett

IEEE J. Sel. Areas Inf. Theory, 2025

Input Optimization in the Composite DNA Storage Channel.

[BibT_eX]

[DOI]

Adir Kobovich

IEEE J. Sel. Areas Inf. Theory, 2025

A Toolbox for Refined Information-Theoretic Analyses.

[BibT_eX]

[DOI]

Found. Trends Commun. Inf. Theory, 2025

Exploration-Exploitation Tradeoff in Universal Lossy Compression.

[BibT_eX]

[DOI]

Ram Zamir

Proceedings of the IEEE International Symposium on Information Theory, 2025

Entropy Estimation from Queries and Auxiliary Distribution Samples.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2025

Achievable Rates of Frequency-based Channels of Unlimited Input Resolution.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2025

Optimal Overlap Detection of Shotgun Reads.

[BibT_eX]

[DOI]

Nir Luria

Proceedings of the IEEE International Symposium on Information Theory, 2025

DeepDIVE: Optimizing Input-Constrained Distributions for Composite DNA Storage via Multinomial Channel.

[BibT_eX]

[DOI]

Adir Kobovich

Eitan Yaakobi

Proceedings of the IEEE International Symposium on Information Theory, 2025

Mean Estimation in High-Dimensional Binary Timeinhomogeneous Markov Gaussian Mixture Models.

[BibT_eX]

[DOI]

Abd El Latif Kadry

Yihan Zhang

Proceedings of the IEEE International Symposium on Information Theory, 2025

Multi-Terminal Remote Generation and Estimation Over a Broadcast Channel with Correlated Priors.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2025

When Diffusion Models Memorize: Inductive Biases in Probability Flow of Minimum-Norm Shallow Neural Nets.

[BibT_eX]

[DOI]

Proceedings of the Forty-second International Conference on Machine Learning, 2025

On Bits and Bandits: Quantifying the Regret-Information Trade-off.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024

A Toolbox for Refined Information-Theoretic Analyses with Applications.

[BibT_eX]

[DOI]

CoRR, 2024

Information Rates Over DMCs with Many Independent Views.

[BibT_eX]

[DOI]

V Arvind Rameshwar

Proceedings of the IEEE International Symposium on Information Theory, 2024

Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations.

[BibT_eX]

[DOI]

Yuval Gerzon

Ilan Shomorony

Proceedings of the IEEE International Symposium on Information Theory, 2024

Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics.

[BibT_eX]

[DOI]

Dror Freirich

Ron Meir

Proceedings of the IEEE International Symposium on Information Theory, 2024

Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

A representation-learning game for classes of prediction tasks.

[BibT_eX]

[DOI]

Neria Uzan

Proceedings of the Twelfth International Conference on Learning Representations, 2024

The Joint Effect of Task Similarity and Overparameterization on Catastrophic Forgetting - An Analytical Model.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Statistical curriculum learning: An elimination algorithm achieving an oracle risk.

[BibT_eX]

[DOI]

Omer Cohen

Ron Meir

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Multi-Armed Bandits With Self-Information Rewards.

[BibT_eX]

[DOI]

Michal Yemini

IEEE Trans. Inf. Theory, November, 2023

Design of optimal labeling patterns for optical genome mapping via information theory.

[BibT_eX]

[DOI]

Bioinform., October, 2023

Learning Maximum Margin Channel Decoders.

[BibT_eX]

[DOI]

Amit Tsvieli

IEEE Trans. Inf. Theory, June, 2023

M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel.

[BibT_eX]

[DOI]

Adir Kobovich

Eitan Yaakobi

CoRR, 2023

Quantifying the Loss of Acyclic Join Dependencies.

[BibT_eX]

[DOI]

Batya Kenig

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

How do Minimum-Norm Shallow Denoisers Look in Function Space?

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fundamental Limits of Reference-Based Sequence Reordering.

[BibT_eX]

[DOI]

Ilan Shomorony

Proceedings of the IEEE International Symposium on Information Theory, 2023

Maximal-Capacity Discrete Memoryless Channel Identification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

On Mismatched Oblivious Relaying.

[BibT_eX]

[DOI]

Shlomo Shamai Shitz

Proceedings of the IEEE International Symposium on Information Theory, 2023

Robust Linear Regression for General Feature Distribution.

[BibT_eX]

[DOI]

Tom Norman

Kfir Y. Levy

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Error Probability Bounds for Coded-Index DNA Storage Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Generalization Bounds and Algorithms for Learning to Communicate Over Additive Noise Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

The EM Algorithm is Adaptively-Optimal for Unbalanced Symmetric Gaussian Mixtures.

[BibT_eX]

[DOI]

Guy Bresler

J. Mach. Learn. Res., 2022

Error Probability Bounds for Coded-Index DNA Storage.

[BibT_eX]

[DOI]

CoRR, 2022

The Compound Information Bottleneck Outlook.

[BibT_eX]

[DOI]

Shlomo Shamai

CoRR, 2022

Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models.

[BibT_eX]

[DOI]

Yihan Zhang

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On Information Bottleneck for Gaussian Processes.

[BibT_eX]

[DOI]

Shlomo Shamai Shitz

Proceedings of the IEEE Information Theory Workshop, 2022

Upper Confidence Interval Strategies for Multi-Armed Bandits with Entropy Rewards.

[BibT_eX]

[DOI]

Michal Yemini

Proceedings of the IEEE International Symposium on Information Theory, 2022

The DNA Storage Channel: Capacity and Error Probability Bounds.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

On Information-Theoretic Determination of Misspecified Rates of Convergence.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Learning Maximum Margin Channel Decoders for Non-linear Gaussian Channels.

[BibT_eX]

[DOI]

Amit Tsvieli

Proceedings of the IEEE International Symposium on Information Theory, 2022

The Compound Information Bottleneck Program.

[BibT_eX]

[DOI]

Shlomo Shamai Shitz

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

The DNA Storage Channel: Capacity and Error Probability.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Large Deviations Behavior of the Logarithmic Error Probability of Random Codes.

[BibT_eX]

[DOI]

Albert Guillén i Fàbregas

IEEE Trans. Inf. Theory, 2020

Guessing with a Bit of Help.

[BibT_eX]

[DOI]

Entropy, 2020

Learning Additive Noise Channels: Generalization Bounds and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Expurgated Bounds for the Asymmetric Broadcast Channel.

[BibT_eX]

[DOI]

Ran Averbuch

IEEE Trans. Inf. Theory, 2019

Exponent Trade-off for Hypothesis Testing Over Noisy Channels.

[BibT_eX]

[DOI]

Yuval Kochman

Michèle A. Wigger

Proceedings of the IEEE International Symposium on Information Theory, 2019

k-vectors: An Alternating Minimization Algorithm for Learning Regression Functions.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018

Self-Predicting Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Guessing with a Boolean Helper.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection.

[BibT_eX]

[DOI]

Yuval Kochman

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Channel Detection in Coded Communication.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Lower bounds on parameter modulation-estimation under bandwidth constraints.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On the VC-dimension of binary codes.

[BibT_eX]

[DOI]

Sihuang Hu

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

On the optimal boolean function for prediction under quadratic loss.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

A large deviations approach to secure lossy compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Optimum Tradeoffs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian-Wolf Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Erasure/list random coding error exponents are not universally achievable.

[BibT_eX]

[DOI]

Wasim Huleihel

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Simplified erasure/list decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Optimum trade-offs between error exponent and excess-rate exponent of Slepian-Wolf coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Codeword or noise? Exact random coding exponents for slotted asynchronism.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Large deviations analysis of variable-rate Slepian-Wolf coding.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2011

Universal decoding over Gaussian fading channels - metric calculation and performance evaluation.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2008

Universal decoding for linear Gaussian fading channels in the competitive minimax sense.

[BibT_eX]

[DOI]