default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVarun S. Jog
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Ankit Pensia
, Varun S. Jog, Po-Ling Loh:
Communication-Constrained Hypothesis Testing: Optimality, Robustness, and Reverse Data Processing Inequalities. IEEE Trans. Inf. Theory 70(1): 389-414 (2024)- [j15]Muni Sreenivas Pydi, Varun S. Jog:
The Many Faces of Adversarial Risk: An Expanded Study. IEEE Trans. Inf. Theory 70(1): 550-570 (2024) - [c27]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
The Sample Complexity of Simple Binary Hypothesis Testing. COLT 2024: 4205-4206 - [i28]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
The Sample Complexity of Simple Binary Hypothesis Testing. CoRR abs/2403.16981 (2024) - 2023
- [c26]Ankit Pensia, Amir-Reza Asadi, Varun S. Jog, Po-Ling Loh:
Simple Binary Hypothesis Testing under Local Differential Privacy and Communication Constraints. COLT 2023: 3229-3230 - [i27]Ankit Pensia, Amir-Reza Asadi, Varun S. Jog, Po-Ling Loh:
Simple Binary Hypothesis Testing under Local Differential Privacy and Communication Constraints. CoRR abs/2301.03566 (2023) - 2022
- [j14]Venkat Anantharam, Varun S. Jog, Chandra Nair:
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality. IEEE Trans. Inf. Theory 68(12): 7665-7684 (2022) - [c25]Ankit Pensia, Po-Ling Loh, Varun S. Jog:
Simple Binary Hypothesis Testing under Communication Constraints. ISIT 2022: 3297-3302 - [i26]Muni Sreenivas Pydi, Varun S. Jog:
The Many Faces of Adversarial Risk. CoRR abs/2201.08956 (2022) - [i25]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities. CoRR abs/2206.02765 (2022) - 2021
- [j13]Zheng Liu, Jinnian Zhang, Varun S. Jog, Po-Ling Loh, Alan B. McMillan:
Robustifying Deep Networks for Medical Image Segmentation. J. Digit. Imaging 34(5): 1279-1293 (2021) - [j12]Varun S. Jog, Po-Ling Loh:
Teaching and Learning in Uncertainty. IEEE Trans. Inf. Theory 67(1): 598-615 (2021) - [j11]Muni Sreenivas Pydi, Varun S. Jog:
Adversarial Risk via Optimal Transport and Optimal Couplings. IEEE Trans. Inf. Theory 67(9): 6031-6052 (2021) - [j10]Varun S. Jog:
Reverse Euclidean and Gaussian Isoperimetric Inequalities for Parallel Sets With Applications. IEEE Trans. Inf. Theory 67(10): 6368-6383 (2021) - [c24]Muni Sreenivas Pydi, Varun S. Jog:
The Many Faces of Adversarial Risk. NeurIPS 2021: 10000-10012 - 2020
- [j9]Varun S. Jog, James Melbourne:
Entropy and Information Inequalities. Entropy 22(3): 320 (2020) - [j8]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Extracting Robust and Accurate Features via a Robust Information Bottleneck. IEEE J. Sel. Areas Inf. Theory 1(1): 131-144 (2020) - [c23]Muni Sreenivas Pydi, Varun S. Jog:
Adversarial Risk via Optimal Transport and Optimal Couplings. ICML 2020: 7814-7823 - [i24]Varun S. Jog:
Reverse Lebesgue and Gaussian isoperimetric inequalities for parallel sets with applications. CoRR abs/2006.09568 (2020) - [i23]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Robust regression with covariate filtering: Heavy tails and adversarial contamination. CoRR abs/2009.12976 (2020)
2010 – 2019
- 2019
- [j7]Jing Hao, Varun S. Jog:
Dual Loomis-Whitney Inequalities via Information Theory. Entropy 21(8): 809 (2019) - [c22]Justin Khim, Varun S. Jog, Po-Ling Loh:
Adversarial Influence Maximization. ISIT 2019: 1-5 - [c21]Venkat Anantharam, Varun S. Jog, Chandra Nair:
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality. ISIT 2019: 1847-1851 - [c20]Varun S. Jog:
Teaching and learning in uncertainty. ISIT 2019: 2499-2503 - [c19]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Mean estimation for entangled single-sample distributions. ISIT 2019: 3052-3056 - [c18]Jing Hao, Varun S. Jog:
Dual Loomis-Whitney inequalities via information theory. ISIT 2019: 3067-3071 - [i22]Venkat Anantharam, Varun S. Jog, Chandra Nair:
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality. CoRR abs/1901.06619 (2019) - [i21]Jing Hao, Varun S. Jog:
Dual Loomis-Whitney inequalities via information theory. CoRR abs/1901.06789 (2019) - [i20]Varun S. Jog:
Teaching and learning in uncertainty. CoRR abs/1901.07063 (2019) - [i19]Varun S. Jog, Richard J. La, Nuno C. Martins:
Channels, Learning, Queueing and Remote Estimation Systems With A Utilization-Dependent Component. CoRR abs/1905.04362 (2019) - [i18]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Estimating location parameters in entangled single-sample distributions. CoRR abs/1907.03087 (2019) - [i17]Zheng Liu, Jinnian Zhang, Varun S. Jog, Po-Ling Loh, Alan B. McMillan:
Robustifying deep networks for image segmentation. CoRR abs/1908.00656 (2019) - [i16]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Extracting robust and accurate features via a robust information bottleneck. CoRR abs/1910.06893 (2019) - [i15]Muni Sreenivas Pydi, Varun S. Jog:
Adversarial Risk via Optimal Transport and Optimal Couplings. CoRR abs/1912.02794 (2019) - 2018
- [j6]Varun S. Jog, Po-Ling Loh:
Persistence of centrality in random growing trees. Random Struct. Algorithms 52(1): 136-157 (2018) - [j5]Varun S. Jog, Venkat Anantharam:
Intrinsic Entropies of Log-Concave Distributions. IEEE Trans. Inf. Theory 64(1): 93-108 (2018) - [c17]Muni Sreenivas Pydi, Varun S. Jog, Po-Ling Loh:
Graph-Based Ascent Algorithms for Function Maximization. Allerton 2018: 1-8 - [c16]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Generalization Error Bounds for Noisy, Iterative Algorithms. ISIT 2018: 546-550 - [c15]Jing Hao, Varun S. Jog:
An Entropy Inequality for Symmetric Random Variables. ISIT 2018: 1600-1604 - [c14]Andre Wibisono, Varun S. Jog:
Convexity of Mutual Information Along the Heat Flow. ISIT 2018: 1615-1619 - [c13]Andre Wibisono, Varun S. Jog:
Convexity of mutual information along the Ornstein-Uhlenbeck flow. ISITA 2018: 55-59 - [c12]Adrian Tovar Lopez, Varun S. Jog:
Generalization error bounds using Wasserstein distances. ITW 2018: 1-5 - [i14]Jing Hao, Varun S. Jog:
An entropy inequality for symmetric random variables. CoRR abs/1801.03868 (2018) - [i13]Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Generalization Error Bounds for Noisy, Iterative Algorithms. CoRR abs/1801.04295 (2018) - [i12]Andre Wibisono, Varun S. Jog:
Convexity of mutual information along the heat flow. CoRR abs/1801.06968 (2018) - [i11]Muni Sreenivas Pydi, Varun S. Jog, Po-Ling Loh:
Graph-Based Ascent Algorithms for Function Maximization. CoRR abs/1802.04475 (2018) - [i10]Andre Wibisono, Varun S. Jog:
Convexity of mutual information along the Ornstein-Uhlenbeck flow. CoRR abs/1805.01401 (2018) - 2017
- [j4]Varun S. Jog, Po-Ling Loh:
Analysis of Centrality in Sublinear Preferential Attachment Trees via the Crump-Mode-Jagers Branching Process. IEEE Trans. Netw. Sci. Eng. 4(1): 1-12 (2017) - [c11]Andre Wibisono, Varun S. Jog, Po-Ling Loh:
Information and estimation in Fokker-Planck channels. ISIT 2017: 2673-2677 - [c10]Varun S. Jog:
A convolution inequality for entropy over Z2. ISIT 2017: 3170-3174 - [i9]Varun S. Jog, Venkat Anantharam:
Intrinsic entropies of log-concave distributions. CoRR abs/1702.01203 (2017) - [i8]Andre Wibisono, Varun S. Jog, Po-Ling Loh:
Information and estimation in Fokker-Planck channels. CoRR abs/1702.03656 (2017) - 2016
- [j3]Varun S. Jog, Venkat Anantharam:
A Geometric Analysis of the AWGN Channel With a (σ, ρ)-Power Constraint. IEEE Trans. Inf. Theory 62(8): 4413-4438 (2016) - [c9]Justin T. Khim, Varun S. Jog, Po-Ling Loh:
Computing and maximizing influence in linear threshold and triggering models. NIPS 2016: 4538-4546 - [i7]Varun S. Jog, Po-Ling Loh:
Analysis of centrality in sublinear preferential attachment trees via the CMJ branching process. CoRR abs/1601.06448 (2016) - [i6]Justin Khim, Varun S. Jog, Po-Ling Loh:
Computationally Efficient Influence Maximization in Stochastic and Adversarial Models: Algorithms and Analysis. CoRR abs/1611.00350 (2016) - 2015
- [b1]Varun Suhas Jog:
Convex geometric tools in information theory. University of California, Berkeley, USA, 2015 - [c8]Varun S. Jog, Po-Ling Loh:
Recovering communities in weighted stochastic block models. Allerton 2015: 1308-1315 - [c7]Varun S. Jog, Venkat Anantharam:
A geometric analysis of the AWGN channel with a (σ, ρ)-power constraint. ISIT 2015: 121-125 - [c6]Varun S. Jog, Venkat Anantharam:
On the geometry of convex typical sets. ISIT 2015: 829-833 - [c5]Varun S. Jog, Po-Ling Loh:
On model misspecification and KL separation for Gaussian graphical models. ISIT 2015: 1174-1178 - [i5]Varun S. Jog, Po-Ling Loh:
On model misspecification and KL separation for Gaussian graphical models. CoRR abs/1501.02320 (2015) - [i4]Varun S. Jog, Venkat Anantharam:
A Geometric Analysis of the AWGN channel with a $(σ, ρ)$-Power Constraint. CoRR abs/1504.05182 (2015) - [i3]Varun S. Jog, Po-Ling Loh:
Information-theoretic bounds for exact recovery in weighted stochastic block models using the Renyi divergence. CoRR abs/1509.06418 (2015) - [i2]Varun S. Jog, Po-Ling Loh:
Persistence of centrality in random growing trees. CoRR abs/1511.01975 (2015) - 2014
- [j2]Varun S. Jog, Venkat Anantharam:
The Entropy Power Inequality and Mrs. Gerber's Lemma for Groups of Order 2n. IEEE Trans. Inf. Theory 60(7): 3773-3786 (2014) - [c4]Varun S. Jog, Venkat Anantharam:
Convex relative entropy decay in Markov chains. CISS 2014: 1-6 - [c3]Varun S. Jog, Venkat Anantharam:
An energy harvesting AWGN channel with a finite battery. ISIT 2014: 806-810 - 2013
- [j1]Yanlin Geng, Varun S. Jog, Chandra Nair, Zizhou Vincent Wang:
An Information Inequality and Evaluation of Marton's Inner Bound for Binary Input Broadcast Channels. IEEE Trans. Inf. Theory 59(7): 4095-4105 (2013) - [c2]Varun S. Jog, Venkat Anantharam:
The Entropy Power Inequality and Mrs. Gerber's Lemma for groups of order 2n. ISIT 2013: 594-598 - 2012
- [i1]Varun S. Jog, Venkat Anantharam:
The Entropy Power Inequality and Mrs. Gerber's Lemma for Abelian Groups of Order 2^n. CoRR abs/1207.6355 (2012) - 2010
- [c1]Varun S. Jog, Chandra Nair:
An information inequality for the BSSC broadcast channel. ITA 2010: 334-341
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-06 23:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
