49 citations · 98 across the 7 of their papers we have counts for
11 papers
Sketching and Sequence Alignment: A Rate-Distortion Perspective
Ilan Shomorony, Govinda M. Kamath
Pairwise alignment of DNA sequencing data is a ubiquitous task in bioinformatics and typically represents a heavy computational burden. A standard approach to speed up this task is…
Knowledge Distillation as Semiparametric Inference
Tri Dao, Govinda M Kamath, Vasilis Syrgkanis +1
A popular approach to model compression is to train an inexpensive student model to mimic the class probabilities of a highly accurate but cumbersome teacher model. Surprisingly, t…
Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment
Govinda M. Kamath, Tavor Z. Baharav, Ilan Shomorony
Pairwise alignment of DNA sequencing data is a ubiquitous task in bioinformatics and typically represents a heavy computational burden. State-of-the-art approaches to speed up this…
Bandit-Based Monte Carlo Optimization for Nearest Neighbors
Vivek Bagaria, Tavor Z. Baharav, Govinda M. Kamath +1
The celebrated Monte Carlo method estimates an expensive-to-compute quantity by random sampling. Bandit-based Monte Carlo optimization is a general technique for computing the mini…
Medoids in almost linear time via multi-armed bandits
Vivek Bagaria, Govinda M. Kamath, Vasilis Ntranos +2
Computing the medoid of a large number of points in high-dimensional space is an increasingly common operation in many data science problems. We present an algorithm Med-dit which…
Partial DNA Assembly: A Rate-Distortion Perspective
Ilan Shomorony, Govinda M. Kamath, Fei Xia +2
Earlier formulations of the DNA assembly problem were all in the context of perfect assembly; i.e., given a set of reads from a long genome sequence, is it possible to perfectly re…
Community Recovery in Graphs with Locality
Yuxin Chen, Govinda Kamath, Changho Suh +1
Motivated by applications in domains such as social networks and computational biology, we study the problem of community recovery in graphs with locality. In this problem, pairwis…
Optimal Haplotype Assembly from High-Throughput Mate-Pair Reads
Govinda M. Kamath, Eren Şaşoğlu, David Tse
Humans have pairs of homologous chromosomes. The homologous pairs are almost identical pairs of chromosomes. For the most part, differences in homologous chromosome occur at c…
Explicit MBR All-Symbol Locality Codes
Govinda M. Kamath, Natalia Silberstein, N. Prakash +5
Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e.…
Codes with Local Regeneration
Govinda M. Kamath, N. Prakash, V. Lalitha +1
Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situati…
Optimal Linear Codes with a Local-Error-Correction Property
N. Prakash, Govinda M. Kamath, V. Lalitha +1
Motivated by applications to distributed storage, Gopalan \textit{et al} recently introduced the interesting notion of information-symbol locality in a linear code. By this it is m…