Publications
|
Journals |
Aditya Narayan Ravi, Alireza Vahid and Ilan Shomorony
IEEE Transactions on Molecular, Biological, and Multi-Scale Communications (submitted)
|
Aditya Narayan Ravi, Alireza Vahid and Ilan Shomorony
IEEE Transactions on Information Theory (submitted)
|
Grant Greenberg, Aditya Narayan Ravi and Ilan Shomorony
Bioinformatics 2023
|
Aditya Narayan Ravi, Alireza Vahid and Ilan Shomorony
IEEE Journal on Selected Areas in Information Theory 2022
|
Aditya Narayan Ravi, Sibi Raj B. Pillai, Vinod M. Prabhakaran and Michèle Wigger
IEEE Transactions on Information Theory 2021
|
Conferences |
Aditya Narayan Ravi and Ilan Shomorony
Submitted to AISTATS 2024
|
Aditya Narayan Ravi, Alireza Vahid and Ilan Shomorony
Presented at the International Symposium on Information Theory 2022
|
Aditya Narayan Ravi, Alireza Vahid and Ilan Shomorony
Presented at the International Symposium on Information Theory 2021
|
Aditya Narayan Ravi, Sibi Raj B. Pillai, Vinod M. Prabhakaran and Michèle Wigger
Presented at the International Symposium on Information Theory 2021
|
Aditya Narayan Ravi, Sibi Raj B. Pillai, Vinod M. Prabhakaran and Michèle Wigger
Presented at the International Symposium on Information Theory 2020
|
Aditya Narayan Ravi*, Pranav Poduval* and Sharayu Moharir
Presented at COMSNETS 2020
|
Research
|
|
Prioritization in Federated Learning
Aditya Narayan Ravi,
Ilan Shomorony
arXiv, 2023
Federated Learning (FL) is a distributed machine learning approach to learn models on decentralized heterogeneous data, without the need for clients to share their data. We introduce a framework to model the natural, inherent prioritization of some clients in federated learning, in subscriber settings or recommender systems. Our novel algorithm FedALIGN, is a communication efficient client selection scheme, that has theoretical convergence guarantees and state of the art performance over baselines.
|
|
|
LexicHash: Sequence Similarity Estimation via Lexicographic Comparison of Hashes
Grant Greenberg
Aditya Narayan Ravi,
Ilan Shomorony
Bioinformatics, 2023
Pairwise sequence alignment in the context of gene sequencing is a heavy computational burden. This issue is commonly addressed by approximately estimating sequence similarities using a hash-based method such as MinHash. In MinHash, all k-mers in a read are hashed and the minimum hash value, the min-hash, is stored. We introduce a new similarity estimation method called LexicHash, which is effectively independent of the choice of k and attains the high precision of large-k and the high sensitivity of small-k MinHash. In our experiments the area under the Precision-Recall Curves obtained by LexicHash had an average improvement of 20.9% over MinHash. As an added benefit, the LexicHash framework lends itself naturally to an efficient search of the top-T best alignments out of all pairs, yielding an O(n) time algorithm for finding the top-T pairwise similarities, circumventing the seemingly fundamental O(n2) scaling associated with pairwise similarity search.
|
|
|