300 Pasteur Drive, Palo Alto, CA 94304
Welcome! I am a postdoctoral researcher in functional genomics and machine learning in the lab of Anshul Kundaje at Stanford University. My genomics work focuses on predicting human transcription regulation, while my machine learning and statistics research includes methods for semi-supervised, representation, and sequential learning.
I completed my PhD at UC San Diego in machine learning, where I was advised by Yoav Freund. During my PhD, I developed semi-supervised algorithms to combine ensembles of predictors, and also worked on stochastic processes.
Linking Generative Adversarial Learning and Binary Classification. [arXiv]Generative adversarial learning of a distribution, using a classifier learned by risk minimization, is always equivalent to f-divergence minimization.
Semantically Decomposing the Latent Spaces of Generative Adversarial Networks. [arXiv]When learning a latent space for generating data, any given axis of variation in the data can be disentangled from the rest in the latent space, using an efficient model-agnostic pairwise training strategy.
Muffled Semi-Supervised Learning. [arXiv]There are several ways to achieve significant off-the-shelf improvements on supervised classification performance using unlabeled data, by "muffling" supervised recommendations by imputing the opposite labels on unlabeled data.
Learning to Abstain from Binary Prediction. [arXiv]The problem of binary classification with an abstaining predictor centers around the tradeoff between abstaining and making a prediction error, which we optimally characterize theoretically and with efficient algorithms that use labeled and unlabeled data.
PAC-Bayes Iterated Logarithm Bounds for Martingale Mixtures. [arXiv]Any mixture of stochastic processes with high probability stays within an optimally characterized range of its conditional mean, at all times along its sample path, and with respect to all "posterior" mixing distributions.
Sharp Finite-Time Iterated-Logarithm Martingale Concentration. [arXiv]Any stochastic process with high probability stays within a narrow, optimally characterized range of its conditional mean, at all times along its sample path.
Optimal Binary Autoencoding with Pairwise Correlations. [arXiv] [code] [discussion]Efficient and practical biconvex learning of binary autoencoders is strongly optimal, using pairwise correlations between encoding and decoding layers.
International Conference on Learning Representations (ICLR), 2017 (conference track).
Optimal Binary Classifier Aggregation for General Losses. [arXiv]The minimax optimal way to combine a set of binary classifiers of varying competences with unlabeled data is an artificial neuron, with a sigmoid-shaped transfer function that only depends on the evaluation loss function.
Neural Information Processing Systems (NIPS), 2016.
Short version in Workshop on Learning Faster from Easy Data, NIPS, 2015.
Sequential Nonparametric Testing with the Law of the Iterated Logarithm. [arXiv]When performing non-parametric testing of the difference in mean between two distributions (and many other problems besides), we devise rigorous sequential tests that use as few samples as possible, adapting to the unknown mean difference.
Conference on Uncertainty in Artificial Intelligence (UAI), 2016.
Instance-Dependent Regret Bounds for Dueling Bandits. [paper]Online learning from limited (bandit) pairwise feedback between actions is easy when a few actions are better than the rest and the matrix of pairwise preferences is well-conditioned.
Conference on Learning Theory (COLT), 2016.
Scalable Semi-Supervised Aggregation of Classifiers. [arXiv]There is an efficient way to use unlabeled data to combine the trees of a random forest, which often performs better than random forests for binary classification.
Neural Information Processing Systems (NIPS), 2015.
Optimally Combining Classifiers Using Unlabeled Data. [arXiv]The minimax optimal way to combine a set of binary classifiers of known competences with unlabeled data resembles a weighted majority vote, and is efficiently learnable.
Conference on Learning Theory (COLT), 2015.
The Fast Convergence of Incremental PCA. [arXiv]Natural algorithms for incremental linear-time and -space principal component analysis (PCA) converge quickly to the optimum, despite the problem's nonconvexity.
Neural Information Processing Systems (NIPS), 2013.
An Empirical Comparison of Sparse vs. Embedding Techniques on Many-Class Text Classification.Rare features can be usefully predictive in (text) classification problems with many classes and features.
Workshop on Extreme Classification, NIPS, 2013.
Playing Games to Reduce Supervision in Learning.
The Utility of Abstaining in Binary Classification.
Research Exam (requirement for M.S.), UC San Diego. March 2013.
Click on each paper title for a very unofficial one-sentence summary.
Before the PhD, I was an Associate at Strand Life Sciences, where I did statistical genomics, developing tools for genomics researchers (CV). Previously, I received a B.S. (High Honors) in Electrical Engineering and Computer Science at UC Berkeley in December 2008. On the way to that degree, I minored in (quantum) physics at Berkeley as well. Before that, I lived in various parts of India, the US, and Singapore.
I used to play the violin (and occasionally still do); before college, I got a distinction in it (unfortunately recordings are lost!). I also played the Carnatic classical style, which is less polyphonic but melodically richer. I have always enjoyed traveling and do so whenever the opportunity arises. I like running, occasionally structured. In my free time, I sometimes write on history and philosophy tidbits I find interesting.
This site is (still and perennially) under construction.