Publications (21)
Query complexity of sampling and small geometric partitions
Navin Goyal, Luis Rademacher, Santosh Vempala
Non-Gaussian Component Analysis using Entropy Methods
Navin Goyal, Abhishek Shetty
On Computing Maximal Independent Sets of Hypergraphs in Parallel
Ioana O. Bercea, Navin Goyal, David G. Harris +1
Better Analysis of GREEDY Binary Search Tree on Decomposable Sequences
Navin Goyal, Manoj Gupta
Dynamic vs Oblivious Routing in Network Design
Navin Goyal, Neil Olver, F. Bruce Shepherd
Lower Bounds for the Average and Smoothed Number of Pareto Optima
Navin Goyal, Luis Rademacher
Fourier PCA and Robust Tensor Decomposition
Navin Goyal, Santosh Vempala, Ying Xiao
The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures
Joseph Anderson, Mikhail Belkin, Navin Goyal +2
Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections
Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
Analysis of Thompson Sampling for the multi-armed bandit problem
Shipra Agrawal, Navin Goyal
Annotations for Sparse Data Streams
Amit Chakrabarti, Graham Cormode, Navin Goyal +1
Expanders via Random Spanning Trees
Navin Goyal, Luis Rademacher, Santosh Vempala
Heavy-tailed Independent Component Analysis
Joseph Anderson, Navin Goyal, Anupama Nandi +1
Thompson Sampling for Contextual Bandits with Linear Payoffs
Shipra Agrawal, Navin Goyal
Efficient learning of simplices
Joseph Anderson, Navin Goyal, Luis Rademacher
Heavy-Tailed Analogues of the Covariance Matrix for ICA
Joseph Anderson, Navin Goyal, Anupama Nandi +1
Further Optimal Regret Bounds for Thompson Sampling
Shipra Agrawal, Navin Goyal
Learning convex bodies is hard
Navin Goyal, Luis Rademacher
Deterministic Algorithms for the Lovasz Local Lemma
Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
The paper presents deterministic and parallelizable algorithms that efficiently construct solutions guaranteed by the Lovász Local Lemma, improving on previous deterministic method…
On Dynamic Optimality for Binary Search Trees
Navin Goyal, Manoj Gupta
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
Vicky Choi, Navin Goyal