default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPradeep Kr. Banerjee
Person information
- affiliation (PhD 2020): Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
- affiliation (former): Indian Institute of Technology Kharagpur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Guido Montúfar, Jürgen Jost:
Continuity and additivity properties of information decompositions. Int. J. Approx. Reason. 161: 108979 (2023)- [c11]Kedar Karhadkar, Pradeep Kr. Banerjee, Guido Montúfar:
FoSR: First-order spectral rewiring for addressing oversquashing in GNNs. ICLR 2023 - 2022
- [c10]Pradeep Kr. Banerjee, Kedar Karhadkar, Yuguang Wang, Uri Alon, Guido Montúfar:
Oversquashing in GNNs through the lens of information contraction and graph expansion. Allerton 2022: 1-8 - [c9]Hui Jin, Pradeep Kr. Banerjee, Guido Montúfar:
Learning Curves for Gaussian Process Regression with Power-Law Priors and Targets. ICLR 2022 - [i16]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Guido Montúfar, Jürgen Jost:
Continuity and Additivity Properties of Information Decompositions. CoRR abs/2204.10982 (2022) - [i15]Pradeep Kr. Banerjee, Kedar Karhadkar, Yu Guang Wang, Uri Alon, Guido Montúfar:
Oversquashing in GNNs through the lens of information contraction and graph expansion. CoRR abs/2208.03471 (2022) - [i14]Kedar Karhadkar, Pradeep Kr. Banerjee, Guido Montúfar:
FoSR: First-order spectral rewiring for addressing oversquashing in GNNs. CoRR abs/2210.11790 (2022) - 2021
- [c8]Pradeep Kr. Banerjee, Guido Montúfar:
Information Complexity and Generalization Bounds. ISIT 2021: 676-681 - [i13]Pradeep Kr. Banerjee, Guido Montúfar:
Information Complexity and Generalization Bounds. CoRR abs/2105.01747 (2021) - [i12]Hui Jin, Pradeep Kr. Banerjee, Guido Montúfar:
Learning curves for Gaussian process regression with power-law priors and targets. CoRR abs/2110.12231 (2021) - 2020
- [b1]Pradeep Kr. Banerjee:
Unique information and the Blackwell order. Leipzig University, Germany, 2020, pp. 1-129 - [c7]Pradeep Kr. Banerjee, Guido Montúfar:
The Variational Deficiency Bottleneck. IJCNN 2020: 1-8
2010 – 2019
- 2019
- [c6]Johannes Rauh
, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost:
Unique Information and Secret Key Decompositions. ISIT 2019: 3042-3046 - [i11]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost:
Unique Information and Secret Key Decompositions. CoRR abs/1901.08007 (2019) - 2018
- [c5]Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Johannes Rauh:
Unique Informations and Deficiencies. Allerton 2018: 32-38 - [c4]Pradeep Kr. Banerjee, Johannes Rauh, Guido Montúfar:
Computing the Unique Information. ISIT 2018: 141-145 - [i10]Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Johannes Rauh:
Unique Informations and Deficiencies. CoRR abs/1807.05103 (2018) - [i9]Pradeep Kr. Banerjee, Guido Montúfar:
The Variational Deficiency Bottleneck. CoRR abs/1810.11677 (2018) - 2017
- [j2]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Nils Bertschinger:
On Extractable Shared Information. Entropy 19(7): 328 (2017) - [j1]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Nils Bertschinger, David H. Wolpert:
Coarse-Graining and the Blackwell Order. Entropy 19(10): 527 (2017) - [i8]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Nils Bertschinger, David H. Wolpert:
Coarse-graining and the Blackwell order. CoRR abs/1701.07602 (2017) - [i7]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Nils Bertschinger:
On extractable shared information. CoRR abs/1701.07805 (2017) - [i6]Pradeep Kr. Banerjee, Johannes Rauh, Guido Montúfar:
Computing the Unique Information. CoRR abs/1709.07487 (2017) - 2015
- [c3]Pradeep Kr. Banerjee, Nirmal B. Chakrabarti:
Noise sensitivity of Teager-Kaiser energy operators and their ratios. ICACCI 2015: 2265-2271 - [c2]Pradeep Kr. Banerjee:
Multipartite monotones for secure sampling by public discussion from noisy correlations. IWCIT 2015: 1-6 - [c1]Pradeep Kr. Banerjee:
A Secret Common Information Duality for Tripartite Noisy Correlations. SSCC 2015: 329-341 - [i5]Pradeep Kr. Banerjee:
Multipartite Monotones for Secure Sampling by Public Discussion From Noisy Correlations. CoRR abs/1502.05773 (2015) - [i4]Pradeep Kr. Banerjee:
Common Information Duality in Relation to Bounds on the Secret Key Rate. CoRR abs/1502.05775 (2015) - [i3]Pradeep Kr. Banerjee:
Some new insights into information decomposition in complex systems based on common information. CoRR abs/1503.00709 (2015) - [i2]Pradeep Kr. Banerjee, Nirmal B. Chakrabarti:
Noise Sensitivity of Teager-Kaiser Energy Operators and Their Ratios. CoRR abs/1504.08177 (2015) - [i1]Pradeep Kr. Banerjee, Virgil Griffith:
Synergy, Redundancy and Common Information. CoRR abs/1509.03706 (2015)
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-25 20:18 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:
