Zobrazeno 1 - 10
of 396
pro vyhledávání: '"De, Rajat"'
DNN training is time-consuming and requires efficient multi-accelerator parallelization, where a single training iteration is split over available accelerators. Current approaches often parallelize training using intra-batch parallelization. Combinin
Externí odkaz:
http://arxiv.org/abs/2410.14312
Autor:
Maitra, Chayan, De, Rajat K.
Visualizing high-dimensional datasets through a generalized embedding has been a challenge for a long time. Several methods have shown up for the same, but still, they have not been able to generate a generalized embedding, which not only can reveal
Externí odkaz:
http://arxiv.org/abs/2410.14223
Autor:
Zhang, Tao, Venkatesaraman, Rajagopal, De, Rajat K., Malin, Bradley A., Vorobeychik, Yevgeniy
Membership inference attacks (MIAs) expose significant privacy risks by determining whether an individual's data is in a dataset. While differential privacy (DP) mitigates such risks, it faces challenges in general when achieving an optimal balance b
Externí odkaz:
http://arxiv.org/abs/2410.07414
Autor:
Zhang, Tao, Venkatesaramani, Rajagopal, De, Rajat K., Malin, Bradley A., Vorobeychik, Yevgeniy
The advent of online genomic data-sharing services has sought to enhance the accessibility of large genomic datasets by allowing queries about genetic variants, such as summary statistics, aiding care providers in distinguishing between spurious geno
Externí odkaz:
http://arxiv.org/abs/2406.01811
Autor:
Dutta, Prasun, De, Rajat K.
Referring back to the original text in the course of hierarchical learning is a common human trait that ensures the right direction of learning. The models developed based on the concept of Non-negative Matrix Factorization (NMF), in this paper are i
Externí odkaz:
http://arxiv.org/abs/2405.13449
Autor:
De, Rajat, Kempa, Dominik
Grammar compression is a general compression framework in which a string $T$ of length $N$ is represented as a context-free grammar of size $n$ whose language contains only $T$. In this paper, we focus on studying the limitations of algorithms and da
Externí odkaz:
http://arxiv.org/abs/2307.08833
The task of dimensionality reduction and visualization of high-dimensional datasets remains a challenging problem since long. Modern high-throughput technologies produce newer high-dimensional datasets having multiple views with relatively new data t
Externí odkaz:
http://arxiv.org/abs/2304.01222
Publikováno v:
In Expert Systems With Applications 1 January 2025 259
Publikováno v:
In Neurocomputing 7 March 2024 573
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.