Fetching the paper…
Reading the bibliography…
Estimating the entropy of a discrete random variable is a fundamental problem in information theory and related fields.
G. Miller, “Note on the bias of information estimates,” Information theory in psychology: Problems and methods , 1955
1955
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, H. White et al. , “Multilayer feedforward networks are universal approximators.” Neural networks , vol. 2, no. 5, pp. 359–366, 1989
1989
Earlier work this paper cites.
K. Newey and D. McFadden, “Large sample estimation and hypothesis,” Handbook of Econometrics, IV, Edited by RF Engle and DL McFadden , pp. 2112–2245, 1994
1994
Earlier work this paper cites.
F. M. Willems, “The context-tree weighting method: Extensions,” IEEE Transactions on Information Theory , vol. 44, no. 2, pp. 792–798, 1998
1998
Earlier work this paper cites.
F. A. Gers, J. Schmidhuber, and F. Cummins, “Learning to forget: Continual prediction with lstm,” 1999
1999
Earlier work this paper cites.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” arXiv preprint physics/0004057 , 2000
2000
Earlier work this paper cites.
R. Marschinski and H. Kantz, “Analysing the information flow between financial time series,” The European Physical Journal B-Condensed Matter and Complex Systems , vol. 30, no. 2, pp. 275–281, 2002
2002
Earlier work this paper cites.
L. Paninski, “Estimation of entropy and mutual information,” Neural computation , vol. 15, no. 6, pp. 1191–1253, 2003
2003
Earlier work this paper cites.
A. Chao and T.-J. Shen, “Nonparametric estimation of shannon’s index of diversity when there are unseen species in sample,” Environmental and ecological statistics , vol. 10, no. 4, pp. 429–443, 2003
2003
Earlier work this paper cites.
F. Fleuret, “Fast binary feature selection with conditional mutual information,” Journal of Machine learning research , vol. 5, no. Nov, pp. 1531–1555, 2004
2004
Earlier work this paper cites.
A. Kraskov, H. Stögbauer, and P. Grassberger, “Estimating mutual information,” Physical review E , vol. 69, no. 6, p. 066138, 2004
2004
Earlier work this paper cites.
H. Peng, F. Long, and C. Ding, “Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy,” IEEE Transactions on Pattern Analysis & Machine Intelligence , no. 8, pp. 1226–1238, 2005
2005
Earlier work this paper cites.
K. Sachs, O. Perez, D. Pe’er, D. A. Lauffenburger, and G. P. Nolan, “Causal protein-signaling networks derived from multiparameter single-cell data,” Science , vol. 308, no. 5721, pp. 523–529, 2005
2005
Earlier work this paper cites.
L. M. d. Campos, “A scoring function for learning bayesian networks based on mutual information and conditional independence tests,” Journal of Machine Learning Research , vol. 7, no. Oct, pp. 2149–2187, 2006
2006
Earlier work this paper cites.
K. Hlaváčková-Schindler, M. Paluš, M. Vejmelka, and J. Bhattacharya, “Causality detection based on information-theoretic approaches in time series analysis,” Physics Reports , vol. 441, no. 1, pp. 1–46, 2007
2007
Earlier work this paper cites.
I. Ben-Gal, “Bayesian networks,” Encyclopedia of statistics in quality and reliability , vol. 1, 2008
2008
Earlier work this paper cites.
L. Barnett, A. B. Barrett, and A. K. Seth, “Granger causality and transfer entropy are equivalent for gaussian variables,” Physical review letters , vol. 103, no. 23, p. 238701, 2009
2009
Earlier work this paper cites.
J. Hausser and K. Strimmer, “Entropy inference and the james-stein estimator, with application to nonlinear gene association networks,” Journal of Machine Learning Research , vol. 10, no. 50, pp. 1469–1484, 2009. [Online]. Available: http://jmlr.org/papers/v10/hausser09a.html
2009
Earlier work this paper cites.
X. Nguyen, M. J. Wainwright, and M. I. Jordan, “Estimating divergence functionals and the likelihood ratio by convex risk minimization,” IEEE Transactions on Information Theory , vol. 56, no. 11, pp. 5847–5861, 2010
2010
Earlier work this paper cites.
R. Vicente, M. Wibral, M. Lindner, and G. Pipa, “Transfer entropy—a model-free measure of effective connectivity for the neurosciences,” Journal of computational neuroscience , vol. 30, no. 1, pp. 45–67, 2011
2011
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of information theory . John Wiley & Sons, 2012
2012
Cited alongside, same era.
J. Runge, J. Heitzig, V. Petoukhov, and J. Kurths, “Escaping the curse of dimensionality in estimating multivariate transfer entropy,” Physical review letters , vol. 108, no. 25, p. 258701, 2012
2012
Cited alongside, same era.
Y. Liu and S. Aviyente, “The relationship between transfer entropy and directed information,” in 2012 IEEE Statistical Signal Processing Workshop (SSP) . IEEE, 2012, pp. 73–76
2012
Cited alongside, same era.
T. Bossomaier, L. Barnett, M. Harré, and J. T. Lizier, “An introduction to transfer entropy,” Cham: Springer International Publishing , pp. 65–95, 2016
2016
Later among the works it cites.
B. Uria, M.-A. Côté, K. Gregor, I. Murray, and H. Larochelle, “Neural autoregressive distribution estimation,” The Journal of Machine Learning Research , vol. 17, no. 1, pp. 7184–7220, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
R. Sen, A. T. Suresh, K. Shanmugam, A. G. Dimakis, and S. Shakkottai, “Model-powered conditional independence test,” in Advances in Neural Information Processing Systems , 2017, pp. 2951–2961
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
P. Duan, F. Yang, T. Chen, and S. L. Shah, “Direct causality detection via the transfer entropy approach,” IEEE transactions on control systems technology , vol. 21, no. 6, pp. 2052–2066, 2013
2013
Cited alongside, same era.
J. Jiao, H. H. Permuter, L. Zhao, Y.-H. Kim, and T. Weissman, “Universal estimation of directed information,” IEEE Transactions on Information Theory , vol. 59, no. 10, pp. 6220–6242, 2013
2013
Cited alongside, same era.
T. Dimpfl and F. J. Peter, “Using transfer entropy to measure information flows between financial markets,” Studies in Nonlinear Dynamics and Econometrics , vol. 17, no. 1, pp. 85–102, 2013
2013
Cited alongside, same era.
A. Statnikov, N. I. Lytkin, J. Lemeire, and C. F. Aliferis, “Algorithms for discovery of multiple markov boundaries,” Journal of Machine Learning Research , vol. 14, no. Feb, pp. 499–566, 2013
2013
Cited alongside, same era.
P. Wollstadt, M. Martinez-Zarzuela, R. Vicente, F. J. Diaz-Pernas, and M. Wibral, “Efficient transfer entropy analysis of non-stationary neural time series,” PloS one , vol. 9, no. 7, 2014
2014
Cited alongside, same era.
T. Dimpfl and F. J. Peter, “The impact of the financial crisis on transatlantic information flows: An intraday analysis,” Journal of International Financial Markets, Institutions and Money , vol. 31, pp. 1–13, 2014
2014
Cited alongside, same era.
A. Montalto, L. Faes, and D. Marinazzo, “Mute: a matlab toolbox to compare established and novel estimators of the multivariate transfer entropy,” PloS one , vol. 9, no. 10, p. e109462, 2014
2014
Cited alongside, same era.
2018
Later among the works it cites.
A. Painsky and G. Wornell, “On the universality of the logistic loss function,” in 2018 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2018, pp. 936–940
2018
Later among the works it cites.
2018
Later among the works it cites.
Z. Zhang and M. Sabuncu, “Generalized cross entropy loss for training deep neural networks with noisy labels,” in Advances in neural information processing systems , 2018, pp. 8778–8788
2018
Later among the works it cites.
A. Painsky and G. W. Wornell, “Bregman divergence bounds and universality properties of the logarithmic loss,” IEEE Transactions on Information Theory , vol. 66, no. 3, pp. 1658–1673, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
S. Verdú, “Empirical estimation of information measures: A literature guide,” Entropy , vol. 21, no. 8, p. 720, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Y. Shalev and I. Ben-Gal, “Context based predictive information,” Entropy , vol. 21, no. 7, p. 645, 2019
2019
Later among the works it cites.
D. McAllester and K. Stratos, “Formal limitations on the measurement of mutual information,” in International Conference on Artificial Intelligence and Statistics , 2020, pp. 875–884
2020
Closest in time.