32 citations · 96 across the 21 of their papers we have counts for
5 papers · 1 filter
Convexity of mutual information along the Ornstein-Uhlenbeck flow
Andre Wibisono, Varun Jog
We study the convexity of mutual information as a function of time along the flow of the Ornstein-Uhlenbeck process. We prove that if the initial distribution is strongly log-conca…
Graph-Based Ascent Algorithms for Function Maximization
Muni Sreenivas Pydi, Varun Jog, Po-Ling Loh
We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus…
Generalization Error Bounds for Noisy, Iterative Algorithms
Ankit Pensia, Varun Jog, Po-Ling Loh
In statistical learning theory, generalization error is used to quantify the degree to which a supervised machine learning algorithm may overfit to training data. Recent work [Xu a…
An entropy inequality for symmetric random variables
Jing Hao, Varun Jog
We establish a lower bound on the entropy of weighted sums of (possibly dependent) random variables possessing a symmetric joint distribution. Our lower bo…
Convexity of mutual information along the heat flow
Andre Wibisono, Varun Jog
We study the convexity of mutual information along the evolution of the heat equation. We prove that if the initial distribution is log-concave, then mutual information is always a…