3 citations · 9 across the 6 of their papers we have counts for
8 papers · 1 filter
Multi-Armed Bandits with Self-Information Rewards
Nir Weinberger, Michal Yemini
This paper introduces the informational multi-armed bandit (IMAB) model in which at each round, a player chooses an arm, observes a symbol, and receives an unobserved reward in the…
Error Probability Bounds for Coded-Index DNA Storage
Nir Weinberger
The DNA storage channel is considered, in which a codeword is comprised of unordered DNA molecules. At reading time, molecules are sampled with replacement, and then each m…
The Compound Information Bottleneck Outlook
Michael Dikshtein, Nir Weinberger, Shlomo Shamai
We formulate and analyze the compound information bottleneck programming. In this problem, a Markov chain is assumed wi…
Large Deviations Behavior of the Logarithmic Error Probability of Random Codes
Ran Tamir, Neri Merhav, Nir Weinberger +1
This work studies the deviations of the error exponent of the constant composition code ensemble around its expectation, known as the error exponent of the typical random code (TRC…
Guessing with a Bit of Help
Nir Weinberger, Ofer Shayevitz
What is the value of a single bit to a guesser? We study this problem in a setup where Alice wishes to guess an i.i.d. random vector, and can procure one bit of information from Bo…
Expurgated Bounds for the Asymmetric Broadcast Channel
Ran Averbuch, Nir Weinberger, Neri Merhav
This work contains two main contributions concerning the expurgation of hierarchical ensembles for the asymmetric broadcast channel. The first is an analysis of the optimal maximum…