Varun S. Jog

Orcid: 0000-0003-4159-0900

According to our database1, Varun S. Jog authored at least 50 papers between 2010 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024
The Many Faces of Adversarial Risk: An Expanded Study.
IEEE Trans. Inf. Theory, January, 2024

Communication-Constrained Hypothesis Testing: Optimality, Robustness, and Reverse Data Processing Inequalities.
IEEE Trans. Inf. Theory, January, 2024

On the Extreme Points of the (0, δ) - Differential Privacy Polytope.
Proceedings of the IEEE International Symposium on Information Theory, 2024

The Sample Complexity of Simple Binary Hypothesis Testing.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Simple Binary Hypothesis Testing under Local Differential Privacy and Communication Constraints.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Simple Binary Hypothesis Testing under Communication Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Teaching and Learning in Uncertainty.
IEEE Trans. Inf. Theory, 2021

Reverse Euclidean and Gaussian Isoperimetric Inequalities for Parallel Sets With Applications.
IEEE Trans. Inf. Theory, 2021

Robustifying Deep Networks for Medical Image Segmentation.
J. Digit. Imaging, 2021

The Many Faces of Adversarial Risk.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Extracting Robust and Accurate Features via a Robust Information Bottleneck.
IEEE J. Sel. Areas Inf. Theory, 2020

Entropy and Information Inequalities.
Entropy, 2020

Robust regression with covariate filtering: Heavy tails and adversarial contamination.
CoRR, 2020

Reverse Lebesgue and Gaussian isoperimetric inequalities for parallel sets with applications.
CoRR, 2020

Adversarial Risk via Optimal Transport and Optimal Couplings.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Robustifying deep networks for image segmentation.
CoRR, 2019

Estimating location parameters in entangled single-sample distributions.
CoRR, 2019

Channels, Learning, Queueing and Remote Estimation Systems With A Utilization-Dependent Component.
CoRR, 2019

Mean estimation for entangled single-sample distributions.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Adversarial Influence Maximization.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Teaching and learning in uncertainty.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Dual Loomis-Whitney inequalities via information theory.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Intrinsic Entropies of Log-Concave Distributions.
IEEE Trans. Inf. Theory, 2018

Persistence of centrality in random growing trees.
Random Struct. Algorithms, 2018

Generalization error bounds using Wasserstein distances.
Proceedings of the IEEE Information Theory Workshop, 2018

Convexity of mutual information along the Ornstein-Uhlenbeck flow.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Convexity of Mutual Information Along the Heat Flow.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Generalization Error Bounds for Noisy, Iterative Algorithms.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

An Entropy Inequality for Symmetric Random Variables.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Graph-Based Ascent Algorithms for Function Maximization.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Analysis of Centrality in Sublinear Preferential Attachment Trees via the Crump-Mode-Jagers Branching Process.
IEEE Trans. Netw. Sci. Eng., 2017

Information and estimation in Fokker-Planck channels.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A convolution inequality for entropy over Z2.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Computationally Efficient Influence Maximization in Stochastic and Adversarial Models: Algorithms and Analysis.
CoRR, 2016

Analysis of centrality in sublinear preferential attachment trees via the CMJ branching process.
CoRR, 2016

Computing and maximizing influence in linear threshold and triggering models.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Convex geometric tools in information theory.
PhD thesis, 2015

Information-theoretic bounds for exact recovery in weighted stochastic block models using the Renyi divergence.
CoRR, 2015

On model misspecification and KL separation for Gaussian graphical models.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the geometry of convex typical sets.
Proceedings of the IEEE International Symposium on Information Theory, 2015

A geometric analysis of the AWGN channel with a (σ, ρ)-power constraint.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Recovering communities in weighted stochastic block models.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
An energy harvesting AWGN channel with a finite battery.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Convex relative entropy decay in Markov chains.
Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

2013
An Information Inequality and Evaluation of Marton's Inner Bound for Binary Input Broadcast Channels.
IEEE Trans. Inf. Theory, 2013

The Entropy Power Inequality and Mrs. Gerber's Lemma for groups of order 2<sup>n</sup>.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
The Entropy Power Inequality and Mrs. Gerber's Lemma for Abelian Groups of Order 2^n
CoRR, 2012

2010
An information inequality for the BSSC broadcast channel.
Proceedings of the Information Theory and Applications Workshop, 2010


  Loading...