{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,5]],"date-time":"2026-09-05T05:16:57Z","timestamp":1788585417385,"version":"build-2803163510"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["NSTC113-2221-E-002-175-MY3"],"award-info":[{"award-number":["NSTC113-2221-E-002-175-MY3"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s00521-026-12411-6","type":"journal-article","created":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T03:47:12Z","timestamp":1786420032000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Applied Fano\u2019s inequality: a bound estimation on regression error with conditional entropy estimators"],"prefix":"10.1007","volume":"38","author":[{"given":"Yu-Hsueh","family":"Fang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2928-3337","authenticated-orcid":false,"given":"Chia-Yen","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"12411_CR1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3483948","author":"S Abdullah","year":"2024","unstructured":"Abdullah S, Ali N, Hasanin T (2024) Analysis of medical diagnosis using double hierarchical linguistic information and hamacher t-norms. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2024.3483948","journal-title":"IEEE Access"},{"issue":"2","key":"12411_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s40747-024-01623-9","volume":"11","author":"SS Abosuliman","year":"2025","unstructured":"Abosuliman SS, Abdullah S, Ali N (2025) Barriers and enhance strategies for green supply chain management using continuous linear diophantine neural networks. Complex & Intelligent Systems 11(2):163","journal-title":"Complex & Intelligent Systems"},{"issue":"1","key":"12411_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TIT.1972.1054753","volume":"18","author":"S Arimoto","year":"1972","unstructured":"Arimoto S (1972) An algorithm for computing the capacity of arbitrary discrete memoryless channels. IEEE Trans Inf Theory 18(1):14\u201320","journal-title":"IEEE Trans Inf Theory"},{"issue":"8","key":"12411_CR4","doi-asserted-by":"publisher","first-page":"3498","DOI":"10.1109\/TIT.2006.878110","volume":"52","author":"DM Arnold","year":"2006","unstructured":"Arnold DM, Loeliger HA, Vontobel PO et al (2006) Simulation-based computation of information rates for channels with memory. IEEE Trans Inf Theory 52(8):3498\u20133508","journal-title":"IEEE Trans Inf Theory"},{"key":"12411_CR5","unstructured":"Belghazi MI, Baratin A, Rajeshwar S et\u00a0al (2018) Mutual Information Neural Estimation. In: Proceedings of the 35th International Conference on Machine Learning, Proceedings of Machine Learning Research, pp 531\u2013540, URL https:\/\/proceedings.mlr.press\/v80\/belghazi18a.html, iSSN: 2640-3498"},{"issue":"4","key":"12411_CR6","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1109\/TIT.1972.1054855","volume":"18","author":"R Blahut","year":"2003","unstructured":"Blahut R (2003) Computation of channel capacity and rate-distortion functions. IEEE Trans Inf Theory 18(4):460\u2013473","journal-title":"IEEE Trans Inf Theory"},{"key":"12411_CR7","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C (2016) Xgboost: a scalable tree boosting system. Proceedings of International Conference on Knowledge Discovery and Data mining. pp 785\u2013794","DOI":"10.1145\/2939672.2939785"},{"key":"12411_CR8","unstructured":"Cheng P, Hao W, Dai S (2020) Club: a contrastive log-ratio upper bound of mutual information. International Conference on Machine Learning, Proceedings of Machine Learning Research. pp 1779\u20131788"},{"key":"12411_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/B:VLSI.0000027493.48841.39","volume":"37","author":"D Erdogmus","year":"2004","unstructured":"Erdogmus D, Principe JC (2004) Lower and upper bounds for misclassification probability based on renyi\u2019s information. Journal of VLSI signal processing systems for signal image and video technology 37:305\u2013317","journal-title":"Journal of VLSI signal processing systems for signal image and video technology"},{"key":"12411_CR10","doi-asserted-by":"crossref","unstructured":"Fang S, Skoglund M, Johansson KH (2019) Generic variance bounds on estimation and prediction errors in time series analysis: an entropy perspective. IEEE Information Theory Workshop. IEEE, pp 1\u20135","DOI":"10.1109\/ITW44776.2019.8989240"},{"key":"12411_CR11","volume-title":"Transmission of information: a statistical theory of communications","author":"RM Fano","year":"1968","unstructured":"Fano RM (1968) Transmission of information: a statistical theory of communications. MIT press"},{"key":"12411_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.neunet.2018.12.010","volume":"111","author":"M Fern\u00e1ndez-Delgado","year":"2019","unstructured":"Fern\u00e1ndez-Delgado M, Sirsat MS, Cernadas E et al (2019) An extensive experimental survey of regression methods. Neural Netw 111:11\u201334","journal-title":"Neural Netw"},{"issue":"12","key":"12411_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10994-025-06924-9","volume":"114","author":"JM de Freitas","year":"2025","unstructured":"de Freitas JM, Geiger BC (2025) Trustworthy representation learning via information funnels and bottlenecks. Mach Learn 114(12):267","journal-title":"Mach Learn"},{"key":"12411_CR14","doi-asserted-by":"crossref","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Ann Stat 1189\u20131232","DOI":"10.1214\/aos\/1013203451"},{"key":"12411_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neunet.2013.07.003","volume":"48","author":"B Fr\u00e9nay","year":"2013","unstructured":"Fr\u00e9nay B, Doquire G, Verleysen M (2013) Is mutual information adequate for feature selection in regression? Neural Netw 48:1\u20137. https:\/\/doi.org\/10.1016\/j.neunet.2013.07.003","journal-title":"Neural Netw"},{"key":"12411_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts P, Ernst D, Wehenkel L (2006) Extremely randomized trees. Mach Learn 63:3\u201342","journal-title":"Mach Learn"},{"issue":"4","key":"12411_CR17","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/TIT.1970.1054466","volume":"16","author":"M Hellman","year":"1970","unstructured":"Hellman M, Raviv J (1970) Probability of error, equivocation, and the chernoff bound. IEEE Trans Inf Theory 16(4):368\u2013372","journal-title":"IEEE Trans Inf Theory"},{"key":"12411_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110345","volume":"142","author":"D Huang","year":"2023","unstructured":"Huang D, Chen Y, Liu F et al (2023) Feature selection for multiset-valued data based on fuzzy conditional information entropy using iterative model and matrix operation. Appl Soft Comput 142:110345","journal-title":"Appl Soft Comput"},{"key":"12411_CR19","doi-asserted-by":"crossref","unstructured":"Huber MF, Bailey T, Durrant-Whyte H (2008) On entropy approximation for gaussian mixture random vectors. IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems. IEEE, pp 181\u2013188","DOI":"10.1109\/MFI.2008.4648062"},{"key":"12411_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2025.130372","author":"M Jiang","year":"2025","unstructured":"Jiang M, Fan J, Huang L et al (2025) Mdiffsr: mutual information and diffusion model in image super-resolution. Neurocomputing. https:\/\/doi.org\/10.1016\/j.neucom.2025.130372","journal-title":"Neurocomputing"},{"key":"12411_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.neucom.2018.07.099","volume":"396","author":"Y Jiang","year":"2020","unstructured":"Jiang Y, Yang N, Yao Q et al (2020) Real-time moisture control in sintering process using offline-online narx neural networks. Neurocomputing 396:209\u2013215","journal-title":"Neurocomputing"},{"key":"12411_CR22","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.neucom.2019.01.039","volume":"335","author":"X Jun","year":"2019","unstructured":"Jun X, Lu Y, Lei Z et al (2019) Conditional entropy based classifier chains for multi-label classification. Neurocomputing 335:185\u2013194","journal-title":"Neurocomputing"},{"key":"12411_CR23","first-page":"3146","volume":"30","author":"G Ke","year":"2017","unstructured":"Ke G, Meng Q, Finley T et al (2017) Lightgbm: a highly efficient gradient boosting decision tree. Adv Neural Inf Process Syst 30:3146\u20133154","journal-title":"Adv Neural Inf Process Syst"},{"key":"12411_CR24","volume-title":"Information theory and statistics","author":"S Kullback","year":"1997","unstructured":"Kullback S (1997) Information theory and statistics. Courier Corporation"},{"key":"12411_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2022.103607","volume":"138","author":"G Li","year":"2022","unstructured":"Li G, Knoop VL, van Lint H (2022) Estimate the limit of predictability in short-term traffic forecasting: an entropy-based approach. Transp Res C Emerg Technol 138:103607","journal-title":"Transp Res C Emerg Technol"},{"key":"12411_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.111149","volume":"151","author":"Z Li","year":"2024","unstructured":"Li Z, Zhang Q, Liu S et al (2024) Information fusion and attribute reduction for multi-source incomplete mixed data via conditional information entropy and ds evidence theory. Appl Soft Comput 151:111149","journal-title":"Appl Soft Comput"},{"key":"12411_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126392","volume":"548","author":"Z Liu","year":"2023","unstructured":"Liu Z, Wang C, Han C et al (2023) Learning graph representation by aggregating subgraphs via mutual information maximization. Neurocomputing 548:126392","journal-title":"Neurocomputing"},{"key":"12411_CR28","unstructured":"Lu Z, Pu H, Wang F (2017) The expressive power of neural networks: a view from the width. Advances in neural information processing systems 30"},{"key":"12411_CR29","doi-asserted-by":"crossref","unstructured":"Luo L, Yang J, Xie Y (2023) Class-specific attribute reduction based on neighborhood conditional entropy. International Conference on Cyber-Physical Social Intelligence (ICCSI). IEEE, pp 479\u2013484","DOI":"10.1109\/ICCSI58851.2023.10303887"},{"issue":"1","key":"12411_CR30","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1093\/imanum\/16.1.13","volume":"16","author":"V Maz\u2019ya","year":"1996","unstructured":"Maz\u2019ya V, Schmidt G (1996) On approximate approximations using gaussian kernels. IMA J Numer Anal 16(1):13\u201329","journal-title":"IMA J Numer Anal"},{"key":"12411_CR31","unstructured":"McAllester D, Stratos K (2020) Formal limitations on the measurement of mutual information. In: International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, pp 875\u2013884"},{"key":"12411_CR32","unstructured":"Morishita T, Morio G, Horiguchi S (2022) Rethinking fano\u2019s inequality in ensemble learning. International Conference on Machine Learning, Proceedings of Machine Learning Research. pp 15976\u201316016"},{"issue":"11","key":"12411_CR33","doi-asserted-by":"publisher","first-page":"5847","DOI":"10.1109\/TIT.2010.2068870","volume":"56","author":"X Nguyen","year":"2010","unstructured":"Nguyen X, Wainwright MJ, Jordan MI (2010) Estimating divergence functionals and the likelihood ratio by convex risk minimization. IEEE Trans Inf Theory 56(11):5847\u20135861","journal-title":"IEEE Trans Inf Theory"},{"key":"12411_CR34","unstructured":"Avd O, Li Y, Vinyals O (2018) Representation learning with contrastive predictive coding. arXiv:1807.03748 arXiv preprint"},{"key":"12411_CR35","unstructured":"Oymak S, Soltanolkotabi M (2019) Overparameterized nonlinear learning: gradient descent takes the shortest path? In: International Conference on Machine Learning, Proceedings of Machine Learning Research, pp 4951\u20134960"},{"key":"12411_CR36","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A et al (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"key":"12411_CR37","unstructured":"Pichler G, Colombo P, Boudiaf M (2022) A differential entropy estimator for training neural networks. International Conference on Machine Learning, Proceedings of Machine Learning Research. pp 17691\u201317715"},{"issue":"7","key":"12411_CR38","doi-asserted-by":"publisher","first-page":"4327","DOI":"10.1109\/TIT.2019.2891529","volume":"65","author":"I Pinelis","year":"2019","unstructured":"Pinelis I (2019) Exact upper and lower bounds on the misclassification probability. IEEE Trans Inf Theory 65(7):4327\u20134334","journal-title":"IEEE Trans Inf Theory"},{"key":"12411_CR39","unstructured":"Quinlan JR (1992) Learning with continuous classes. 5th Australian joint conference on artificial intelligence. World Scientific, pp 343\u2013348"},{"key":"12411_CR40","unstructured":"Rothfuss J, Ferreira F, Walther S et\u00a0al (2019) Conditional density estimation with neural networks: Best practices and benchmarks. arXiv:1903.00954"},{"key":"12411_CR41","unstructured":"Rothfuss J, Ferreira F, Boehm S et\u00a0al (2020) Noise regularization for conditional density estimation. arXiv:1907.08982"},{"issue":"3","key":"12411_CR42","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. The Bell system technical journal 27(3):379\u2013423","journal-title":"The Bell system technical journal"},{"key":"12411_CR43","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.neunet.2015.05.005","volume":"69","author":"F Stulp","year":"2015","unstructured":"Stulp F, Sigaud O (2015) Many regression algorithms, one unified model: a review. Neural Netw 69:60\u201379","journal-title":"Neural Netw"},{"issue":"1","key":"12411_CR44","volume":"1","author":"T Takaguchi","year":"2011","unstructured":"Takaguchi T, Nakamura M, Sato N et al (2011) Predictability of conversation partners. Phys Rev X 1(1):011008","journal-title":"Phys Rev X"},{"issue":"291\u2013292","key":"12411_CR45","first-page":"246","volume":"2","author":"F Tops\u00f8e","year":"1967","unstructured":"Tops\u00f8e F (1967) An information theoretical identity and a problem involving capacity. Stud Sci Math Hung 2(291\u2013292):246","journal-title":"Stud Sci Math Hung"},{"key":"12411_CR46","unstructured":"Wongso S, Ghosh R, Motani M (2023) Using sliced mutual information to study memorization and generalization in deep neural networks. International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research. pp 11608\u201311629"},{"issue":"1","key":"12411_CR47","first-page":"1033","volume":"14","author":"MJ Zhao","year":"2013","unstructured":"Zhao MJ, Edakunni N, Pocock A et al (2013) Beyond fano\u2019s inequality: bounds on the optimal f-score, ber, and cost-sensitive risk and their implications. The Journal of Machine Learning Research 14(1):1033\u20131090","journal-title":"The Journal of Machine Learning Research"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-026-12411-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-026-12411-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-026-12411-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,5]],"date-time":"2026-09-05T04:46:55Z","timestamp":1788583615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-026-12411-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":47,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["12411"],"URL":"https:\/\/doi.org\/10.1007\/s00521-026-12411-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"23 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that there are no financial interests\/personal relationships which may be considered as potential competing interests or could have appeared to influence the work reported in this paper.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"659"}}