default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Rauh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]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)- 2022
- [i18]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) - 2021
- [j21]Johannes Rauh
, Maik Schünemann, Jürgen Jost:
Properties of unique information. Kybernetika 57(3): 383-403 (2021) - 2020
- [j20]Oliver Clarke, Fatemeh Mohammadi, Johannes Rauh:
Conditional independence ideals with hidden variables. Adv. Appl. Math. 117: 102029 (2020) - [j19]Radim Jirousek, Václav Kratochvíl, Johannes Rauh:
A note on the approximation of Shenoy's expectation operator using probabilistic transforms. Int. J. Gen. Syst. 49(1): 48-63 (2020) - [j18]Johannes Rauh:
Maximizing the Bregman divergence from a Bregman family. Kybernetika 56(5): 875-885 (2020) - [i17]Johannes Rauh, Frantisek Matús:
Maximizing the Bregman divergence from a Bregman family. CoRR abs/2001.08813 (2020)
2010 – 2019
- 2019
- [c10]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost:
Unique Information and Secret Key Decompositions. ISIT 2019: 3042-3046 - [i16]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost:
Unique Information and Secret Key Decompositions. CoRR abs/1901.08007 (2019) - [i15]Johannes Rauh, Maik Schünemann:
Properties of Unique Information. CoRR abs/1912.12505 (2019) - 2018
- [c9]Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Johannes Rauh:
Unique Informations and Deficiencies. Allerton 2018: 32-38 - [c8]Pradeep Kr. Banerjee, Johannes Rauh, Guido Montúfar:
Computing the Unique Information. ISIT 2018: 141-145 - [i14]Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Johannes Rauh:
Unique Informations and Deficiencies. CoRR abs/1807.05103 (2018) - 2017
- [j17]Éva Czabarka, Johannes Rauh, Kayvan Sadeghi, Taylor Short, László A. Székely:
On the Number of Non-Zero Elements of Joint Degree Vectors. Electron. J. Comb. 24(1): 1 (2017) - [j16]Johannes Rauh:
The Polytope of k-Star Densities. Electron. J. Comb. 24(1): 1 (2017) - [j15]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Nils Bertschinger:
On Extractable Shared Information. Entropy 19(7): 328 (2017) - [j14]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) - [j13]Johannes Rauh:
Secret Sharing and Shared Information. Entropy 19(11): 601 (2017) - [j12]Guido Montúfar, Johannes Rauh:
Hierarchical models as marginals of hierarchical models. Int. J. Approx. Reason. 88: 531-546 (2017) - [c7]Guido Montúfar, Johannes Rauh:
Geometry of Policy Improvement. GSI 2017: 282-290 - [i13]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) - [i12]Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost, Nils Bertschinger:
On extractable shared information. CoRR abs/1701.07805 (2017) - [i11]Guido Montúfar, Johannes Rauh:
Geometry of Policy Improvement. CoRR abs/1704.01785 (2017) - [i10]Johannes Rauh:
Secret Sharing and Shared Information. CoRR abs/1706.06998 (2017) - [i9]Pradeep Kr. Banerjee, Johannes Rauh, Guido Montúfar:
Computing the Unique Information. CoRR abs/1709.07487 (2017) - 2016
- [j11]Johannes Rauh, Seth Sullivant:
Lifting Markov bases and higher codimension toric fiber products. J. Symb. Comput. 74: 276-307 (2016) - 2015
- [j10]Eckehard Olbrich, Nils Bertschinger, Johannes Rauh:
Information Decomposition and Synergy. Entropy 17(5): 3501-3517 (2015) - [c6]Keyan Ghazi-Zahedi, Johannes Rauh:
Quantifying Morphological Computation based on an Information Decomposition of the Sensorimotor Loop. ECAL 2015: 70-77 - [i8]Keyan Ghazi-Zahedi, Johannes Rauh:
Quantifying Morphological Computation based on an Information Decomposition of the Sensorimotor Loop. CoRR abs/1503.05113 (2015) - [i7]Guido Montúfar, Johannes Rauh:
Hierarchical Models as Marginals of Hierarchical Models. CoRR abs/1508.03606 (2015) - 2014
- [j9]Nils Bertschinger, Johannes Rauh, Eckehard Olbrich, Jürgen Jost, Nihat Ay:
Quantifying Unique Information. Entropy 16(4): 2161-2183 (2014) - [j8]Guido Montúfar, Johannes Rauh, Nihat Ay:
On the Fisher Metric of Conditional Probability Polytopes. Entropy 16(6): 3207-3233 (2014) - [j7]Guido F. Montúfar, Johannes Rauh:
Scaling of model approximation errors and expected entropy distances. Kybernetika 50(2): 234-245 (2014) - [j6]Johannes Rauh, Nihat Ay:
Robustness, canalyzing functions and systems design. Theory Biosci. 133(2): 63-78 (2014) - [c5]Johannes Rauh, Nils Bertschinger, Eckehard Olbrich, Jürgen Jost:
Reconsidering unique information: Towards a multivariate information decomposition. ISIT 2014: 2232-2236 - [c4]Nils Bertschinger, Johannes Rauh:
The Blackwell relation defines no lattice. ISIT 2014: 2479-2483 - [i6]Nils Bertschinger, Johannes Rauh:
The Blackwell relation defines no lattice. CoRR abs/1401.3146 (2014) - [i5]Johannes Rauh, Nils Bertschinger, Eckehard Olbrich, Jürgen Jost:
Reconsidering unique information: Towards a multivariate information decomposition. CoRR abs/1404.3146 (2014) - 2013
- [j5]Johannes Rauh:
Generalized binomial edge ideals. Adv. Appl. Math. 50(3): 409-414 (2013) - [j4]Johannes Rauh:
Optimally approximating exponential families. Kybernetika 49(2): 199-215 (2013) - [c3]Guido Montúfar, Johannes Rauh, Nihat Ay:
Maximal Information Divergence from Statistical Models Defined by Neural Networks. GSI 2013: 759-766 - [i4]Nils Bertschinger, Johannes Rauh, Eckehard Olbrich, Jürgen Jost, Nihat Ay:
Quantifying unique information. CoRR abs/1311.2852 (2013) - 2012
- [i3]Nils Bertschinger, Johannes Rauh, Eckehard Olbrich, Jürgen Jost:
Shared Information -- New Insights and Problems in Decomposing Information in Complex Systems. CoRR abs/1210.5902 (2012) - [i2]Johannes Rauh, Nihat Ay:
Robustness, Canalyzing Functions and Systems Design. CoRR abs/1210.7719 (2012) - 2011
- [j3]Johannes Rauh, Thomas Kahle, Nihat Ay:
Support sets in exponential families and oriented matroid theory. Int. J. Approx. Reason. 52(5): 613-626 (2011) - [j2]Johannes Rauh:
Finding the Maximizers of the Information Divergence From an Exponential Family. IEEE Trans. Inf. Theory 57(6): 3236-3247 (2011) - [c2]Frantisek Matús, Johannes Rauh:
Maximization of the information divergence from an exponential family and criticality. ISIT 2011: 903-907 - [c1]Guido Montúfar, Johannes Rauh, Nihat Ay:
Expressive Power and Approximation Errors of Restricted Boltzmann Machines. NIPS 2011: 415-423 - 2010
- [j1]Jürgen Herzog, Takayuki Hibi, Freyja Hreinsdóttir, Thomas Kahle, Johannes Rauh:
Binomial edge ideals and conditional independence statements. Adv. Appl. Math. 45(3): 317-333 (2010)
2000 – 2009
- 2009
- [i1]Johannes Rauh:
Finding the Maximizers of the Information Divergence from an Exponential Family. CoRR abs/0912.4660 (2009)
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-10-07 21:21 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:
