Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Mohammad Hossein Yassaee"'
Publikováno v:
IEEE Transactions on Information Theory. :1-1
In this paper, we provide three applications for $f$-divergences: (i) we introduce Sanov's upper bound on the tail probability of the sum of independent random variables based on super-modular $f$-divergence and show that our generalized Sanov's boun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e80fbe48c8a2123a8825b3253253d917
https://doi.org/10.1109/tit.2023.3268527
https://doi.org/10.1109/tit.2023.3268527
Publikováno v:
ISIT
We study learning algorithms when there is a mismatch between the distributions of the training and test datasets of a learning algorithm. The effect of this mismatch on the generalization error and model misspecification are quantified. Moreover, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b92381c91e73b95dc6062eecb9926d59
https://doi.org/10.1109/isit45174.2021.9517732
https://doi.org/10.1109/isit45174.2021.9517732
We consider fundamental limits for communicating over a compound channel when the state of the channel needs to be masked. Our model is closely related to an area of study known as covert communication that is a setting in which the transmitter wishe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59e70574e00c903c93e61f38a3f67b27
http://arxiv.org/abs/2012.01706
http://arxiv.org/abs/2012.01706
Autor:
Amin Gohari, Mohammad Reza Aref, Mohammad Mahdi Mojahedian, Mohammad Hossein Yassaee, Salman Beigi
Publikováno v:
ISIT
In this paper, a new measure of correlation is introduced. This measure depends on a parameter α, and is defined in terms of vector-valued L p norms. The measure is within a constant of the exponential of α-Renyi mutual information, and reduces to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e9fca36450c6a069b7a948015bc6b4a
https://doi.org/10.1109/isit.2019.8849703
https://doi.org/10.1109/isit.2019.8849703
Publikováno v:
ISIT
In this paper, we study covert communication over a compound discrete memoryless channel (DMC). There are two channel states in which one of them is arbitrarily chosen and remains fixed during the transmission. The objective is to reliably send a mes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::914659c5c65b34883ed67d3740a64dae
https://doi.org/10.1109/isit.2019.8849494
https://doi.org/10.1109/isit.2019.8849494
A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set. We use a w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0f5cc7def08e2d30d5bf27b00a98d6a
Publikováno v:
ISIT
New one-shot bounds for multivariate covering are derived via a weighted sum technique and a one-sided concentration inequality which is stronger than the McDiarmid inequality. The new bounds are more compact and sharper than known bounds in the lite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47b6b6c29fa1771c34adf199327a7149
https://doi.org/10.1109/isit.2017.8006612
https://doi.org/10.1109/isit.2017.8006612
Autor:
Mohammad Hossein Yassaee
Publikováno v:
ISIT
This paper provides a universal framework for establishing one-shot achievability results for coordination and secrecy problems. The framework is built on our previous framework [Yassaee et al. 13] for proving one-shot achievability results in the co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ec5628fc327fa9f7b18e75ace626b23
https://doi.org/10.1109/isit.2015.7282465
https://doi.org/10.1109/isit.2015.7282465
Publikováno v:
ITW
In this paper, we study the problem of simulating a DMC channel from another DMC channel. We assume that the input to the channel we are simulating is i.i.d. and that the transmitter and receivers are provided with common randomness at limited rates.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::737d97ebd7b8dfa79d4e7150770eeb8c
https://doi.org/10.1109/itw.2013.6691333
https://doi.org/10.1109/itw.2013.6691333
In this paper, we study the problem of simulating a DMC channel from another DMC channel under an average-case and an exact model. We present several achievability and infeasibility results, with tight characterizations in special cases. In particula
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b011d98e4deed8b9c5ee414292b120f
http://arxiv.org/abs/1305.5901
http://arxiv.org/abs/1305.5901