14 citations · 31 across the 20 of their papers we have counts for
26 papers
On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1
Madiman and Tetali established strong and weak fractional inequalities that subsume classical entropy subset inequalities such as Han's inequality and Shearer's lemma. In this work…
Extreme Points of the -LDP Polytope with Small Input Size and Arbitrary Output Sizes
Supriya Rawat, Myna Vajha, Gowtham R. Kurri +1
The structure of locally differentially private (LDP) mechanisms can be understood through the geometry of the corresponding privacy polytope. While the extreme points of the \( (ε…
Secure Distributed Hypothesis Testing
Gowtham R. Kurri, Varun Narayanan, Vinod M. Prabhakaran +1
In distributed hypothesis testing, a central server performs hypothesis testing based on information received from distributed sensors/clients. We study a secure variant of this pr…
Conditioning Strengthens Classical Entropy and Matrix Inequalities: A Submodular Approach
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1
Dembo, Cover, and Thomas (1991) developed an elegant information-theoretic framework for proving determinantal inequalities for positive definite matrices, which relies on the stru…
On the Optimal Message Size in PIR Under Arbitrary Collusion Patterns
Guru S. Dornadula, Manikya Pant, Gowtham R. Kurri +1
A private information retrieval protocol (PIR) scheme under an arbitrary collusion pattern enables a client to retrieve one message from a library of equal-sized…
Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1
It is well known that there is a strong connection between entropy inequalities and submodularity, since the entropy of a collection of random variables is a submodular function. U…
Converse Bounds for Sun-Jafar-type Weak Private Information Retrieval
Chandan Anand, Jayesh Seshadri, Prasad Krishnan +1
Building on the well-established capacity-achieving schemes of Sun-Jafar (for replicated storage) and the closely related scheme of Banawan-Ulukus (for MDS-coded setting), a recent…
Generalized Dual Discriminator GANs
Penukonda Naga Chandana, Tejas Srivastava, Gowtham R. Kurri +1
Dual discriminator generative adversarial networks (D2 GANs) were introduced to mitigate the problem of mode collapse in generative adversarial networks. In D2 GANs, two discrimina…
Sun-Jafar-Type Schemes for Weak Private Information Retrieval
Chandan Anand, Jayesh Seshadri, Prasad Krishnan +1
In information-theoretic private information retrieval (PIR), a client wants to retrieve one desired file out of files, stored across servers, while keeping the index of th…
Fractional Subadditivity of Submodular Functions: Equality Conditions and Their Applications
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1
Submodular functions are known to satisfy various forms of fractional subadditivity. This work investigates the conditions for equality to hold exactly or approximately in the frac…
Maximal Guesswork Leakage
Gowtham R. Kurri, Malhar Managoli, Vinod M. Prabhakaran
We introduce the study of information leakage through \emph{guesswork}, the minimum expected number of guesses required to guess a random variable. In particular, we define \emph{m…
Addressing GAN Training Instabilities via Tunable Classification Losses
Monica Welfert, Gowtham R. Kurri, Kyle Otstot +1
Generative adversarial networks (GANs), modeled as a zero-sum game between a generator (G) and a discriminator (D), allow generating synthetic data with formal guarantees. Noting t…
Unifying Privacy Measures via Maximal -Leakage (MbeL)
Atefeh Gilani, Gowtham R. Kurri, Oliver Kosut +1
We introduce a family of information leakage measures called maximal -leakage (MbeL), parameterized by real numbers and greater than or equal to 1. The measure is…
-GANs: Addressing GAN Training Instabilities via Dual Objectives
Monica Welfert, Kyle Otstot, Gowtham R. Kurri +1
In an effort to address the training instabilities of GANs, we introduce a class of dual-objective GANs with different value functions (objectives) for the generator (G) and discri…
An Alphabet of Leakage Measures
Atefeh Gilani, Gowtham R. Kurri, Oliver Kosut +1
We introduce a family of information leakage measures called maximal -leakage, parameterized by real numbers and . The measure is formalized via an operational definiti…
An Operational Approach to Information Leakage via Generalized Gain Functions
Gowtham R. Kurri, Lalitha Sankar, Oliver Kosut
We introduce a \emph{gain function} viewpoint of information leakage by proposing \emph{maximal -leakage}, a rich class of operationally meaningful leakage measures that subsume…
-GAN: Convergence and Estimation Guarantees
Gowtham R. Kurri, Monica Welfert, Tyler Sypherd +1
We prove a two-way correspondence between the min-max optimization of general CPE loss function GANs and the minimization of associated -divergences. We then focus on -GAN, d…
A Variational Formula for Infinity-Rényi Divergence with Applications to Information Leakage
Gowtham R. Kurri, Oliver Kosut, Lalitha Sankar
We present a variational characterization for the Rényi divergence of order infinity. Our characterization is related to guessing: the objective functional is a ratio of maximal ex…
Evaluating Multiple Guesses by an Adversary via a Tunable Loss Function
Gowtham R. Kurri, Oliver Kosut, Lalitha Sankar
We consider a problem of guessing, wherein an adversary is interested in knowing the value of the realization of a discrete random variable on observing another correlated rand…
Realizing GANs via a Tunable Loss Function
Gowtham R. Kurri, Tyler Sypherd, Lalitha Sankar
We introduce a tunable GAN, called -GAN, parameterized by , which interpolates between various -GANs and Integral Probability Metric based GANs (under constr…
Multiple Access Channel Simulation
Gowtham R. Kurri, Viswanathan Ramachandran, Sibi Raj B. Pillai +1
We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically dist…
Secure Computation to Hide Functions of Inputs
Gowtham R. Kurri, Vinod M. Prabhakaran
We consider a two-user secure computation problem in which Alice and Bob communicate interactively in order to compute some deterministic functions of the inputs. The privacy requi…
Coordination Through Shared Randomness
Gowtham R. Kurri, Vinod M. Prabhakaran, Anand D. Sarwate
We study a distributed sampling problem where a set of processors want to output (approximately) independent and identically distributed samples from a joint distribution with the…
Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation
Yanjun Han, Kedar Tatwawadi, Gowtham R. Kurri +3
We study common randomness generation problems where players aim to generate same sequences of random coin flips where some subsets of the players share an independent common c…