activity
20162020
most citedOn Sampling and Greedy MAP Inference of Constrained Determinantal Point Processes

8 citations · 15 across the 5 of their papers we have counts for

collaborators

8 papers

math.PR20203 cited

A Matrix Bernstein Inequality for Strong Rayleigh Distributions

Tarun Kathuria

The Entropy method provides a powerful framework for proving scalar concentration inequalities by establishing functional inequalities like Poincare and log-Sobolev inequalities. T…

cs.DS20203 cited

A Faster Interior Point Method for Semidefinite Programming

Haotian Jiang, Tarun Kathuria, Yin Tat Lee +2

Semidefinite programs (SDPs) are a fundamental class of optimization problems with important recent applications in approximation algorithms, quantum complexity, robust learning, a…

cs.DS2020

A Potential Reduction Inspired Algorithm for Exact Max Flow in Almost Time

Tarun Kathuria

We present an algorithm for computing - maximum flows in directed graphs in time. Our algorithm is inspired by potential reduction interi…

math.PR20201 cited

Scalar Poincaré Implies Matrix Poincaré

Ankit Garg, Tarun Kathuria, Nikhil Srivastava

We prove that every reversible Markov semigroup which satisfies a Poincaré inequality satisfies a matrix-valued Poincaré inequality for Hermitian matrix valued function…

math.PR2020

On Concentration Inequalities for Random Matrix Products

Tarun Kathuria, Satyaki Mukherjee, Nikhil Srivastava

Consider complex random matrices of size sampled i.i.d. from a distribution with mean . While the concentration of averages of these matric…

math.ST2019

Algorithms for Heavy-Tailed Statistics: Regression, Covariance Estimation, and Beyond

Yeshwanth Cherapanamjeri, Samuel B. Hopkins, Tarun Kathuria +2

We study efficient algorithms for linear regression and covariance estimation in the absence of Gaussian assumptions on the underlying distributions of samples, making assumptions…