Micro-fault diagnosis of vehicle driving motor bearings can significantly bring safety and economic benefits in preventing major accidents and extending equipment lifespan. However, under variable operating conditions, effectively capturing and diagnosing fault-related weak current fluctuation or high-frequency noise features, presents substantial technical challenges. Regarding these issues, this paper proposes multi-residual neural networks (multi-ResNets) and an evidential reasoning rule (ER Rule)-based fault diagnosis model. The model employs a benchmark condition generalization mechanism, which selects multiple typical load conditions as diagnostic anchor points based on a multi-residual neural network structure. Furthermore, by integrating a sub-model credibility assessment mechanism to perform diagnostic condition assessment and category assessment based on ER rule. The experimental results indicate that compared to the traditional machine learning algorithms, the proposed multi-ResNets-ER Rule-based model achieves higher diagnostic accuracy and result reliability for micro-faults under variable operating conditions.
{"title":"Micro Fault Diagnosis of Driving Motor Bearings Based on Multi-Residual Neural Networks and Evidence Reasoning Rule.","authors":"Aoxiang Zhang, Lihong Tang, Guanyu Hu","doi":"10.3390/e28010053","DOIUrl":"10.3390/e28010053","url":null,"abstract":"<p><p>Micro-fault diagnosis of vehicle driving motor bearings can significantly bring safety and economic benefits in preventing major accidents and extending equipment lifespan. However, under variable operating conditions, effectively capturing and diagnosing fault-related weak current fluctuation or high-frequency noise features, presents substantial technical challenges. Regarding these issues, this paper proposes multi-residual neural networks (multi-ResNets) and an evidential reasoning rule (ER Rule)-based fault diagnosis model. The model employs a benchmark condition generalization mechanism, which selects multiple typical load conditions as diagnostic anchor points based on a multi-residual neural network structure. Furthermore, by integrating a sub-model credibility assessment mechanism to perform diagnostic condition assessment and category assessment based on ER rule. The experimental results indicate that compared to the traditional machine learning algorithms, the proposed multi-ResNets-ER Rule-based model achieves higher diagnostic accuracy and result reliability for micro-faults under variable operating conditions.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12839700/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146061016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we investigate the m-spotty weight enumerators over the mixed alphabet ZpRk. Specifically, we construct the Gray map from Zpα×Rkβ to Zpα+kβ, where Rk=Zp+vZp+v2Zp+⋯+vk-1Zp with vk=0 and k≥5. Based on this framework, we establish the MacWilliams identity for the m-spotty weight enumerators between a linear code and its dual over ZpRk, by employing the generalized Hadamard transform and the canonical additive character of Zp. Finally, an example is presented to illustrate and validate the theoretical results.
{"title":"The MacWilliams Identity for the <i>m</i>-Spotty Weight Enumerators over <b>ZpRk</b>.","authors":"Juan Wang, An Jiang, Patrick Solé","doi":"10.3390/e28010059","DOIUrl":"10.3390/e28010059","url":null,"abstract":"<p><p>In this paper, we investigate the <i>m</i>-spotty weight enumerators over the mixed alphabet ZpRk. Specifically, we construct the Gray map from Zpα×Rkβ to Zpα+kβ, where Rk=Zp+vZp+v2Zp+⋯+vk-1Zp with vk=0 and k≥5. Based on this framework, we establish the MacWilliams identity for the <i>m</i>-spotty weight enumerators between a linear code and its dual over ZpRk, by employing the generalized Hadamard transform and the canonical additive character of Zp. Finally, an example is presented to illustrate and validate the theoretical results.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12840224/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146060879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Artstein-Avidan and Milman [Annals of mathematics (2009), (169):661-674] characterized invertible reverse-ordering transforms in the space of lower, semi-continuous, extended, real-valued convex functions as affine deformations of the ordinary Legendre transform. In this work, we first prove that all those generalized Legendre transforms of functions correspond to the ordinary Legendre transform of dually corresponding affine-deformed functions. In short, generalized convex conjugates are ordinary convex conjugates of dually affine-deformed functions. Second, we explain how these generalized Legendre transforms can be derived from the dual Hessian structures of information geometry.
{"title":"Generalized Legendre Transforms Have Roots in Information Geometry.","authors":"Frank Nielsen","doi":"10.3390/e28010044","DOIUrl":"10.3390/e28010044","url":null,"abstract":"<p><p>Artstein-Avidan and Milman [Annals of mathematics (2009), (169):661-674] characterized invertible reverse-ordering transforms in the space of lower, semi-continuous, extended, real-valued convex functions as affine deformations of the ordinary Legendre transform. In this work, we first prove that all those generalized Legendre transforms of functions correspond to the ordinary Legendre transform of dually corresponding affine-deformed functions. In short, generalized convex conjugates are ordinary convex conjugates of dually affine-deformed functions. Second, we explain how these generalized Legendre transforms can be derived from the dual Hessian structures of information geometry.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12840504/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146061002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The tasks of community detection in complex networks have garnered increasing attention from researchers. Concurrently, with the emergence of graph neural networks (GNNs), these models have rapidly become the mainstream approach for solving this task. However, GNNs frequently encounter the Laplacian oversmoothing problem, which dilutes the crucial neighborhood signals essential for community identification. These signals, particularly those from first-order neighbors, are the core source information defining community structure and identity. To address this contradiction, this paper proposes a novel training strategy focused on strengthening these key local signals. We design a multi-branch learning structure that injects a gradient into the GNN layer during backpropagation. This gradient is then modulated by the GNN's native message-passing path, precisely supplementing the parameters of the initial layers with first-order topological information. Based on this, we construct the network structure-informed GNN (NIGNN). A large number of experiments show that the proposed method achieves a 0.6-3.6% improvement in multiple indicators compared with the basic model in the community detection task, and performs well in the t-test. The framework has good general applicability and can be effectively applied to GCN, GAT, and GraphSAGE architectures, and shows strong robustness in networks with incomplete information. This work offers a novel solution for effectively preserving core local information in deep GNNs.
{"title":"A Multi-Branch Training Strategy for Enhancing Neighborhood Signals in GNNs for Community Detection.","authors":"Yuning Guo, Qiang Wu, Linyuan Lü","doi":"10.3390/e28010046","DOIUrl":"10.3390/e28010046","url":null,"abstract":"<p><p>The tasks of community detection in complex networks have garnered increasing attention from researchers. Concurrently, with the emergence of graph neural networks (GNNs), these models have rapidly become the mainstream approach for solving this task. However, GNNs frequently encounter the Laplacian oversmoothing problem, which dilutes the crucial neighborhood signals essential for community identification. These signals, particularly those from first-order neighbors, are the core source information defining community structure and identity. To address this contradiction, this paper proposes a novel training strategy focused on strengthening these key local signals. We design a multi-branch learning structure that injects a gradient into the GNN layer during backpropagation. This gradient is then modulated by the GNN's native message-passing path, precisely supplementing the parameters of the initial layers with first-order topological information. Based on this, we construct the network structure-informed GNN (NIGNN). A large number of experiments show that the proposed method achieves a 0.6-3.6% improvement in multiple indicators compared with the basic model in the community detection task, and performs well in the t-test. The framework has good general applicability and can be effectively applied to GCN, GAT, and GraphSAGE architectures, and shows strong robustness in networks with incomplete information. This work offers a novel solution for effectively preserving core local information in deep GNNs.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12840294/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146060841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Due to their simplicity and ease of visualization, lattice models can be useful to illustrate basic concepts in thermodynamics. The recipe to obtain classical thermodynamic expressions from lattice models is usually based on invoking the thermodynamic limit, and the ideal gas law can easily be obtained as the density of non-interacting particles vanishes. We present a lattice-based analysis that shows that, when a gas consisting of non-interacting particles evolves towards mechanical equilibrium with the environment, the ideal gas law can be obtained with no recourse to unnecessary assumptions regarding the size or particle density of the lattice. We also present a statistical mechanical analysis that considers a quantized volume and reproduces the process obtained for the discrete lattice model. We show how the alternative use of a well-known and accessible model (the non-interacting lattice gas) can give microscopic insights into thermal systems and the assumptions that underlie the laws used to describe them, including local vs. global equilibrium, irreversible processes, and the sometimes subtle difference between physical assumptions and mathematically convenient approximations.
{"title":"A Pedagogical Reinforcement of the Ideal (Hard Sphere) Gas Using a Lattice Model: From Quantized Volume to Mechanical Equilibrium.","authors":"Rodrigo de Miguel","doi":"10.3390/e28010045","DOIUrl":"10.3390/e28010045","url":null,"abstract":"<p><p>Due to their simplicity and ease of visualization, lattice models can be useful to illustrate basic concepts in thermodynamics. The recipe to obtain classical thermodynamic expressions from lattice models is usually based on invoking the thermodynamic limit, and the ideal gas law can easily be obtained as the density of non-interacting particles vanishes. We present a lattice-based analysis that shows that, when a gas consisting of non-interacting particles evolves towards mechanical equilibrium with the environment, the ideal gas law can be obtained with no recourse to unnecessary assumptions regarding the size or particle density of the lattice. We also present a statistical mechanical analysis that considers a quantized volume and reproduces the process obtained for the discrete lattice model. We show how the alternative use of a well-known and accessible model (the non-interacting lattice gas) can give microscopic insights into thermal systems and the assumptions that underlie the laws used to describe them, including local vs. global equilibrium, irreversible processes, and the sometimes subtle difference between physical assumptions and mathematically convenient approximations.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12840467/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146060905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We investigate the thermodynamic properties of a generalized de Sitter-like configuration. This investigation proceeds in two essential steps: (1) first, we construct a spacetime whose energy-momentum tensor asymptotically reproduces quintessence while maintaining isotropic pressures, despite being fueled by a nonconstant energy-momentum tensor; (2) second, we define a finite domain of validity for the solution, within which an additional Cauchy horizon emerges. Afterwards, we analyze the thermodynamic behavior of this configuration and compare it with the standard de Sitter case. Our results indicate that the extra parameter introduced in the metric does not lead to a positive specific heat; this value remains negative, suggesting that the role of such a parameter is thermodynamically nonessential.
{"title":"Entropy of a Quasi-de Sitter Spacetime and the Role of Specific Heat.","authors":"Orlando Luongo, Maryam Azizinia, Kuantay Boshkayev","doi":"10.3390/e28010043","DOIUrl":"10.3390/e28010043","url":null,"abstract":"<p><p>We investigate the thermodynamic properties of a generalized de Sitter-like configuration. This investigation proceeds in two essential steps: (1) first, we construct a spacetime whose energy-momentum tensor asymptotically reproduces quintessence while maintaining isotropic pressures, despite being fueled by a nonconstant energy-momentum tensor; (2) second, we define a finite domain of validity for the solution, within which an additional Cauchy horizon emerges. Afterwards, we analyze the thermodynamic behavior of this configuration and compare it with the standard de Sitter case. Our results indicate that the extra parameter introduced in the metric does not lead to a positive specific heat; this value remains negative, suggesting that the role of such a parameter is thermodynamically nonessential.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12840505/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146061019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The year 1975 marked the beginning of an entirely new direction for thermodynamics with the publication of Curzon and Ahlborn's innocent-looking short paper "Efficiency of a Carnot engine at maximum power output" [...].
{"title":"The First Fifty Years of Finite-Time Thermodynamics.","authors":"Bjarne Andresen, Peter Salamon","doi":"10.3390/e28010049","DOIUrl":"10.3390/e28010049","url":null,"abstract":"<p><p>The year 1975 marked the beginning of an entirely new direction for thermodynamics with the publication of Curzon and Ahlborn's innocent-looking short paper \"<i>Efficiency of a Carnot engine at maximum power output</i>\" [...].</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12839596/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146060919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ioana Ciuclea, Giorgio Longari, Alice Barbora Tumpach
Most datasets encountered in computer vision and medical applications present symmetries that should be taken into account in classification tasks. A typical example is the symmetry by rotation and/or scaling in object detection. A common way to build neural networks that learn the symmetries is to use data augmentation. In order to avoid data augmentation and build more sustainable algorithms, we present an alternative method to mod out symmetries based on the notion of section of a principal fiber bundle. This framework allows to use simple metrics on the space of objects in order to measure dissimilarities between orbits of objects under the symmetry group. Moreover, the section used can be optimized to maximize separation of classes. We illustrate this methodology on a dataset of contours of objects for the groups of translations, rotations, scalings and reparameterizations. In particular, we present a 2-parameter family of canonical parameterizations of curves, containing the constant-speed parameterization as a special case, which we believe is interesting in its own right. We hope that this simple application will serve to convey the geometric concepts underlying this method, which have a wide range of possible applications.
{"title":"Geometric Learning of Canonical Parameterizations of 2<i>D</i>-Curves.","authors":"Ioana Ciuclea, Giorgio Longari, Alice Barbora Tumpach","doi":"10.3390/e28010048","DOIUrl":"10.3390/e28010048","url":null,"abstract":"<p><p>Most datasets encountered in computer vision and medical applications present symmetries that should be taken into account in classification tasks. A typical example is the symmetry by rotation and/or scaling in object detection. A common way to build neural networks that learn the symmetries is to use data augmentation. In order to avoid data augmentation and build more sustainable algorithms, we present an alternative method to mod out symmetries based on the notion of section of a principal fiber bundle. This framework allows to use simple metrics on the space of objects in order to measure dissimilarities between orbits of objects under the symmetry group. Moreover, the section used can be optimized to maximize separation of classes. We illustrate this methodology on a dataset of contours of objects for the groups of translations, rotations, scalings and reparameterizations. In particular, we present a 2-parameter family of canonical parameterizations of curves, containing the constant-speed parameterization as a special case, which we believe is interesting in its own right. We hope that this simple application will serve to convey the geometric concepts underlying this method, which have a wide range of possible applications.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12839573/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146060978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The International Agreement on the Carriage of Perishable Foodstuffs and on the Special Equipment to Be Used for Such Carriage (usually known as ATP Treaty) defines a standardized isothermal test for qualifying refrigerated containers, but its current protocol is lengthy, costly and lacks scientific justification. This paper presents a combined theoretical and experimental study aimed at optimizing this procedure. First, a heat-transfer framework based on transient conduction and thermal diffusivity is developed to estimate stabilization times using dimensionless criteria. Then, extensive experimental tests on ATP containers validate these predictions and reveal additional phenomena such as air leakage and chimney effects. Based on these findings, a revised protocol is proposed that reduces the test duration from more than 18 h to approximately 2 h while preserving the thermal stabilization conditions required by ATP. Experimental results show that the uncertainty in the determination of the global heat-transfer coefficient K is reduced from about 2-2.3% in the classical ATP procedure to roughly 0.7-1.0% with the new protocol. In addition, the method suppresses secondary physical effects-such as chimney-driven air leakage and latent-heat losses due to water evaporation-thus improving the physical representativeness of the measured K value. The proposed accelerated protocol offers a scientifically grounded, cost-effective alternative for future ATP standards.
{"title":"Optimizing ATP Isothermal Tests: A Theoretical and Experimental Approach.","authors":"Juan P Martínez-Val Piera, Alberto Ramos Millán","doi":"10.3390/e28010047","DOIUrl":"10.3390/e28010047","url":null,"abstract":"<p><p>The International Agreement on the Carriage of Perishable Foodstuffs and on the Special Equipment to Be Used for Such Carriage (usually known as ATP Treaty) defines a standardized isothermal test for qualifying refrigerated containers, but its current protocol is lengthy, costly and lacks scientific justification. This paper presents a combined theoretical and experimental study aimed at optimizing this procedure. First, a heat-transfer framework based on transient conduction and thermal diffusivity is developed to estimate stabilization times using dimensionless criteria. Then, extensive experimental tests on ATP containers validate these predictions and reveal additional phenomena such as air leakage and chimney effects. Based on these findings, a revised protocol is proposed that reduces the test duration from more than 18 h to approximately 2 h while preserving the thermal stabilization conditions required by ATP. Experimental results show that the uncertainty in the determination of the global heat-transfer coefficient <i>K</i> is reduced from about 2-2.3% in the classical ATP procedure to roughly 0.7-1.0% with the new protocol. In addition, the method suppresses secondary physical effects-such as chimney-driven air leakage and latent-heat losses due to water evaporation-thus improving the physical representativeness of the measured <i>K</i> value. The proposed accelerated protocol offers a scientifically grounded, cost-effective alternative for future ATP standards.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12840328/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146060803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As conventional computing architectures face fundamental physical limitations and the von Neumann bottleneck constrains computational efficiency, neuromorphic systems have emerged as a promising paradigm for next-generation information processing. Memristive neurons, particularly third-order circuits operating near the edge of chaos, exhibit rich neuromorphic dynamics that closely mimic biological neural activities but present significant prediction challenges due to their complex nonlinear behavior. Current approaches typically require complete system state measurements, which is often impractical in real-world neuromorphic hardware implementations where only partial state information is accessible. This paper addresses this critical limitation by proposing an innovative hybrid machine learning framework that integrates a Modified Next-Generation Reservoir Computing (MNGRC) with XGBoost regression. The core novelty lies in its dual-path prediction architecture designed specifically for partial state observability scenarios. The primary path employs NGRC to capture and forecast the system's temporal dynamics using available state variables and input stimuli, while the secondary path leverages XGBoost as an efficient state estimator to infer unobserved state variables from minimal measurements. This strategic combination enables accurate prediction of diverse neuromorphic patterns with significantly reduced sensor requirements. Experimentally, the framework demonstrates its capability to identify and predict the complex spectrum of neuromorphic behaviors exhibited by the third-order memristive neuron. This includes accurately capturing all 18 distinct neuronal patterns, which are theoretically grounded in Hopf bifurcation analysis near the edge of chaos. Additionally, the framework successfully addresses the inverse problem of input stimulus reconstruction. By achieving accurate prediction of complex dynamics from limited states, our approach represents a key breakthrough, where full state access is often impossible, thereby addressing a critical challenge in edge AI and brain-inspired computing.
{"title":"Machine Learning-Based Prediction Framework for Complex Neuromorphic Dynamics of Third-Order Memristive Neurons at the Edge of Chaos.","authors":"Tao Luo, Lin Yan, Weiqing Liu","doi":"10.3390/e28010042","DOIUrl":"10.3390/e28010042","url":null,"abstract":"<p><p>As conventional computing architectures face fundamental physical limitations and the von Neumann bottleneck constrains computational efficiency, neuromorphic systems have emerged as a promising paradigm for next-generation information processing. Memristive neurons, particularly third-order circuits operating near the edge of chaos, exhibit rich neuromorphic dynamics that closely mimic biological neural activities but present significant prediction challenges due to their complex nonlinear behavior. Current approaches typically require complete system state measurements, which is often impractical in real-world neuromorphic hardware implementations where only partial state information is accessible. This paper addresses this critical limitation by proposing an innovative hybrid machine learning framework that integrates a Modified Next-Generation Reservoir Computing (MNGRC) with XGBoost regression. The core novelty lies in its dual-path prediction architecture designed specifically for partial state observability scenarios. The primary path employs NGRC to capture and forecast the system's temporal dynamics using available state variables and input stimuli, while the secondary path leverages XGBoost as an efficient state estimator to infer unobserved state variables from minimal measurements. This strategic combination enables accurate prediction of diverse neuromorphic patterns with significantly reduced sensor requirements. Experimentally, the framework demonstrates its capability to identify and predict the complex spectrum of neuromorphic behaviors exhibited by the third-order memristive neuron. This includes accurately capturing all 18 distinct neuronal patterns, which are theoretically grounded in Hopf bifurcation analysis near the edge of chaos. Additionally, the framework successfully addresses the inverse problem of input stimulus reconstruction. By achieving accurate prediction of complex dynamics from limited states, our approach represents a key breakthrough, where full state access is often impossible, thereby addressing a critical challenge in edge AI and brain-inspired computing.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"28 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12840450/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146060938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}