4 citations · 6 across the 7 of their papers we have counts for
7 papers
Direct sampling of short paths for contiguous partitioning
Wesley Pegden, Anish Sevekari
In this paper, we provide a family of dynamic programming based algorithms to sample nearly-shortest self avoiding walks between two points of the integer lattice . W…
Provable benefits of score matching
Chirag Pabbaraju, Dhruv Rohatgi, Anish Sevekari +3
Score matching is an alternative to maximum likelihood (ML) for estimating a probability distribution parametrized up to a constant of proportionality. By fitting the ''score'' of…
Progressive Ensemble Distillation: Building Ensembles for Efficient Inference
Don Kurian Dennis, Abhishek Shetty, Anish Sevekari +2
We study the problem of progressive ensemble distillation: Given a large, pretrained teacher model , we seek to decompose the model into smaller, low-inference cost student mode…
Pitfalls of Gaussians as a noise distribution in NCE
Holden Lee, Chirag Pabbaraju, Anish Sevekari +1
Noise Contrastive Estimation (NCE) is a popular approach for learning probability density functions parameterized up to a constant of proportionality. The main idea is to design a…
Universal Approximation for Log-concave Distributions using Well-conditioned Normalizing Flows
Holden Lee, Chirag Pabbaraju, Anish Sevekari +1
Normalizing flows are a widely used class of latent-variable generative models with a tractable likelihood. Affine-coupling (Dinh et al, 2014-16) models are a particularly common t…
Comb inequalities for typical Euclidean TSP instances
Wesley Pegden, Anish Sevekari
We prove that even in average case, the Euclidean Traveling Salesman Problem exhibits an integrality gap of for when the Held-Karp Linear Programming relaxation is au…
Linear orderings of combinatorial cubes
Boris Bukh, Anish Sevekari
We show that, for every linear ordering of , there is a large subcube on which the ordering is lexicographic. We use this to deduce that every long sequence contains a long…