Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Farzin Haddadpour"'
Autor:
Farzin Haddadpour, Viveck R. Cadambe, Pulkit Grover, Mohammad Fahim, Haewon Jeong, Sanghamitra Dutta
Publikováno v:
Allerton
We provide novel coded computation strategies for distributed matrix-matrix products that outperform the recent "Polynomial code" constructions in recovery threshold, i.e., the required number of successful workers. When $m$-th fraction of each matri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1378add45b70f1b37192b9c87bea696
https://doi.org/10.1109/tit.2019.2929328
https://doi.org/10.1109/tit.2019.2929328
It has been shown that dimension reduction methods such as PCA may be inherently prone to unfairness and treat data from different sensitive groups such as race, color, sex, etc., unfairly. In pursuit of fairness-enhancing dimensionality reduction, u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9902ab9f82cc17f68e82331a68d0254b
http://arxiv.org/abs/1911.04931
http://arxiv.org/abs/1911.04931
Publikováno v:
Allerton
We introduce the idea of cross-iteration coded computing, an approach to reducing communication costs for a large class of distributed iterative algorithms involving linear operations, including gradient descent and accelerated gradient descent for q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69b9fb92e87f0b51db2a88339ae1e1e4
https://doi.org/10.1109/allerton.2018.8635933
https://doi.org/10.1109/allerton.2018.8635933
Autor:
Viveck R. Cadambe, Farzin Haddadpour
Publikováno v:
ISIT
Recent work has developed coding theoretic approaches to add redundancy to distributed matrix-vector multiplications with the goal of speeding up the computation by mitigating the straggler effect in distributed computing. In this paper, we consider
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c92bd53103f4bb7dde98df76ffea7850
https://doi.org/10.1109/isit.2018.8437542
https://doi.org/10.1109/isit.2018.8437542
Publikováno v:
ISIT
The generalized belief propagation (GBP), introduced by Yedidia et al., is an extension of the belief propagation (BP) algorithm, which is widely used in different problems involved in calculating exact or approximate marginals of probability distrib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b855afc6c1d973c8594b67bd643f383
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
Publikováno v:
ISIT
In this work we study an Arbitrarily Varying Channel (AVC) with quadratic power constraints on the transmitter and a so-called "oblivious" jammer (along with additional AWGN) under a maximum probability of error criterion, and no private randomness b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2bb8552c2c712aae223520938dea6c8
https://doi.org/10.1109/isit.2013.6620230
https://doi.org/10.1109/isit.2013.6620230
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
Publikováno v:
IWCIT
In this paper, we investigate the diversity-multiplexing tradeoff (DMT) for multi-relay channels in finite-SNR regime. In our analysis, we consider the decode and forward (DF) relaying strategy and a line of sight path from source to destination. Fir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8611c7c4d91d7db5516377b56847c287
https://doi.org/10.1109/iwcit.2013.6555764
https://doi.org/10.1109/iwcit.2013.6555764
Publikováno v:
ISIT
In this paper, we study the problem of coordinating two nodes which can only exchange information via a relay at limited rates. The nodes are allowed to do a two-round interactive two-way communication with the relay, after which they should be able
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a01480fbfd534a975ba595ee1eb3c74f