Jiang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jiang Zhang has a total of 156 co-authors. Here are the top co-authors by number of shared publications:
Zhang Zhang
Beijing Normal University
14 shared publications- Jun Cai
China National Center for Bioinformation, Beijing, China
12 shared publications Lingfei Wu
1] School of Human Evolution and Social Change, Arizona State University [2] Center for the Study of Institutional Diversity, Arizona State University
9 shared publicationsRui Nie
China National Center for Bioinformation, Beijing, China
8 shared publicationsRuyi Tao
School of Systems Science, Beijing Normal University, Beijing, China
8 shared publications- Kaiwei Liu
School of Systems Sciences Beijing Normal University 100875 Beijing China
7 shared publications
Latest Publications
- 6 October 2026
- Published by Elsevier in Atmospheric Environment
- Vol. 387
Physics-inspired inductive spatiotemporal kriging for PM2.5 with satellite gradient constraints
- 6 October 2026
- Published by Elsevier in Atmospheric Environment
- Vol. 387
Physics-inspired inductive spatiotemporal kriging for PM2.5 with satellite gradient constraints
- Open Access
Self-Referential Introspection in Large Language Models: The Critical Threshold for Recursive Self-Improvement
The pursuit of self-evolving AI raises a critical question: when is autonomous self-improvement sustainable rather than degenerative? Drawing an analogy to von Neumann’s complexity threshold for self-reproducing automata, we argue that sustainable recursive self-improvement in large language models (LLMs) requires a functional analogue: introspection—the system’s capacity to simulate its own operations and target modifications. Grounded in Kleene’s Second Recursion Theorem, we construct such introspective self-improvement programs and prove their key properties: completeness of self-modification, necessity of the reflective architecture, undecidability of improvement in general, and equivalence with Schmidhuber’s Gödel machine under a rewrite-equivalence notion, which transfers the global optimality guarantee. An empirical review, organized around these functional criteria, suggests that current LLMs exhibit only quasi-introspection.The available evidence does not establish complete introspection in the formal sense developed here, while pointing to several candidate structural bottlenecks, including incomplete self-access, feedforward processing, and limited computational depth. We outline architectural paths toward the threshold and discuss the safety implications of crossing it.
Open AccessSelf-Referential Introspection in Large Language Models: The Critical Threshold for Recursive Self-Improvement
The pursuit of self-evolving AI raises a critical question: when is autonomous self-improvement sustainable rather than degenerative? Drawing an analogy to von Neumann’s complexity threshold for self-reproducing automata, we argue that sustainable recursive self-improvement in large language models (LLMs) requires a functional analogue: introspection—the system’s capacity to simulate its own operations and target modifications. Grounded in Kleene’s Second Recursion Theorem, we construct such introspective self-improvement programs and prove their key properties: completeness of self-modification, necessity of the reflective architecture, undecidability of improvement in general, and equivalence with Schmidhuber’s Gödel machine under a rewrite-equivalence notion, which transfers the global optimality guarantee. An empirical review, organized around these functional criteria, suggests that current LLMs exhibit only quasi-introspection.The available evidence does not establish complete introspection in the formal sense developed here, while pointing to several candidate structural bottlenecks, including incomplete self-access, feedforward processing, and limited computational depth. We outline architectural paths toward the threshold and discuss the safety implications of crossing it.
- 24 November 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (5) , 054225
Singular-value-decomposition-based causal emergence for Gaussian iterative systems
Causal emergence (CE) based on effective information (EI) demonstrates that macrostates can exhibit stronger causal effects than microstates in dynamics. However, the identification of CE and the maximization of EI both rely on coarse-graining strategies, which is a key challenge. A recently proposed CE framework based on approximate dynamical reversibility, utilizing singular-value decomposition (SVD), is independent of coarse-graining. Still, it is limited to transition probability matrices in discrete states. To address this, this article proposes a CE quantification framework for Gaussian iterative systems, based on approximate dynamical reversibility derived from the SVD of inverse covariance matrices in forward and backward dynamics. The positive correlation between SVD-based and EI-based CE, along with the equivalence condition, is given analytically. After that, we provide precise coarse-graining strategies directly from singular-value spectra and orthogonal matrices. This new framework can be applied to any dynamical system with continuous states and Gaussian noise, such as autoregressive growth models, Markov-Gaussian systems, and even SIR modeling using neural networks. Numerical simulations on typical cases validate our theory and offer a new approach to studying the CE phenomenon, emphasizing noise and covariance over dynamical functions in both known models and machine learning.
- 24 November 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (5) , 054225
Singular-value-decomposition-based causal emergence for Gaussian iterative systems
Causal emergence (CE) based on effective information (EI) demonstrates that macrostates can exhibit stronger causal effects than microstates in dynamics. However, the identification of CE and the maximization of EI both rely on coarse-graining strategies, which is a key challenge. A recently proposed CE framework based on approximate dynamical reversibility, utilizing singular-value decomposition (SVD), is independent of coarse-graining. Still, it is limited to transition probability matrices in discrete states. To address this, this article proposes a CE quantification framework for Gaussian iterative systems, based on approximate dynamical reversibility derived from the SVD of inverse covariance matrices in forward and backward dynamics. The positive correlation between SVD-based and EI-based CE, along with the equivalence condition, is given analytically. After that, we provide precise coarse-graining strategies directly from singular-value spectra and orthogonal matrices. This new framework can be applied to any dynamical system with continuous states and Gaussian noise, such as autoregressive growth models, Markov-Gaussian systems, and even SIR modeling using neural networks. Numerical simulations on typical cases validate our theory and offer a new approach to studying the CE phenomenon, emphasizing noise and covariance over dynamical functions in both known models and machine learning.
- Open Access
Physics-Guided Inductive Spatiotemporal Kriging for PM2.5 with Satellite Gradient Constraints
High-resolution mapping of fine particulate matter (PM2.5) is a cornerstone of sustainable urbanism but remains critically hindered by the spatial sparsity of ground monitoring networks. While traditional data-driven methods attempt to bridge this gap using satellite Aerosol Optical Depth (AOD), they often suffer from severe, non-random data missingness (e.g., due to cloud cover or nighttime) and inversion biases. To overcome these limitations, this study proposes the Spatiotemporal Physics-Guided Inference Network (SPIN), a novel framework designed for inductive spatiotemporal kriging. Unlike conventional approaches, SPIN synergistically integrates domain knowledge into deep learning by explicitly modeling physical advection and diffusion processes via parallel graph kernels. Crucially, we introduce a paradigm-shifting training strategy: rather than using error-prone AOD as a direct input, we repurpose it as a spatial gradient constraint within the loss function. This allows the model to learn structural pollution patterns from satellite data while remaining robust to data voids. Validated in the highly polluted Beijing-Tianjin-Hebei and Surrounding Areas (BTHSA), SPIN achieves a new state-of-the-art with a Mean Absolute Error (MAE) of 9.52 ug/m^3, effectively generating continuous, physically plausible pollution fields even in unmonitored areas. This work provides a robust, low-cost, and all-weather solution for fine-grained environmental management.
Open AccessPhysics-Guided Inductive Spatiotemporal Kriging for PM2.5 with Satellite Gradient Constraints
High-resolution mapping of fine particulate matter (PM2.5) is a cornerstone of sustainable urbanism but remains critically hindered by the spatial sparsity of ground monitoring networks. While traditional data-driven methods attempt to bridge this gap using satellite Aerosol Optical Depth (AOD), they often suffer from severe, non-random data missingness (e.g., due to cloud cover or nighttime) and inversion biases. To overcome these limitations, this study proposes the Spatiotemporal Physics-Guided Inference Network (SPIN), a novel framework designed for inductive spatiotemporal kriging. Unlike conventional approaches, SPIN synergistically integrates domain knowledge into deep learning by explicitly modeling physical advection and diffusion processes via parallel graph kernels. Crucially, we introduce a paradigm-shifting training strategy: rather than using error-prone AOD as a direct input, we repurpose it as a spatial gradient constraint within the loss function. This allows the model to learn structural pollution patterns from satellite data while remaining robust to data voids. Validated in the highly polluted Beijing-Tianjin-Hebei and Surrounding Areas (BTHSA), SPIN achieves a new state-of-the-art with a Mean Absolute Error (MAE) of 9.52 ug/m^3, effectively generating continuous, physically plausible pollution fields even in unmonitored areas. This work provides a robust, low-cost, and all-weather solution for fine-grained environmental management.
- Open Access
- 29 September 2025
- Published by UK Scientific Publishing Limited in Digital Technologies Research and Applications
- Vol. 4 (3) , 22-34
Quantifying System‑Environment Synergistic Information by Effective Information Decomposition
Living systems maintain structural and functional stability while adapting to environmental changes, a capability independent of specific system‑environment states. Existing frameworks, such as self‑organization theory and free energy principles, cannot measure system‑environment interaction at the causal level. In this article, we propose a new causal indicator, Flexibility, to measure a system’s ability to respond to its environment. We construct this indicator based on information theory and interventional operations from causal inference, which implies the indicator depends only on the dynamical causal mechanism. We show this indicator satisfies the axiom system of the partial information decomposition (PID) framework and decomposes into two components, Expansiveness and Introversion, which correspond to different strategic tendencies for environmental adaptation. This decomposition reveals that Flexibility depends on the entanglement between system‑environment variables and noise magnitude. Through experiments on cellular automata (CA), random Boolean networks, and real gene regulatory networks (GRNs), we validate that the indicator identifies the most complex and computationally capable CA (Langton’s parameter at 0.5), while demonstrating that feedback loops carrying important biological functions in GRNs exhibit the highest flexibility. We also find that flexibility peaks at a moderate level of dynamical noise. Furthermore, we combine this framework with machine learning techniques to demonstrate its applicability when the underlying dynamics are unknown.
- 29 September 2025
- Published by UK Scientific Publishing Limited in Digital Technologies Research and Applications
- Vol. 4 (3) , 22-34
Open AccessQuantifying System‑Environment Synergistic Information by Effective Information Decomposition
Living systems maintain structural and functional stability while adapting to environmental changes, a capability independent of specific system‑environment states. Existing frameworks, such as self‑organization theory and free energy principles, cannot measure system‑environment interaction at the causal level. In this article, we propose a new causal indicator, Flexibility, to measure a system’s ability to respond to its environment. We construct this indicator based on information theory and interventional operations from causal inference, which implies the indicator depends only on the dynamical causal mechanism. We show this indicator satisfies the axiom system of the partial information decomposition (PID) framework and decomposes into two components, Expansiveness and Introversion, which correspond to different strategic tendencies for environmental adaptation. This decomposition reveals that Flexibility depends on the entanglement between system‑environment variables and noise magnitude. Through experiments on cellular automata (CA), random Boolean networks, and real gene regulatory networks (GRNs), we validate that the indicator identifies the most complex and computationally capable CA (Langton’s parameter at 0.5), while demonstrating that feedback loops carrying important biological functions in GRNs exhibit the highest flexibility. We also find that flexibility peaks at a moderate level of dynamical noise. Furthermore, we combine this framework with machine learning techniques to demonstrate its applicability when the underlying dynamics are unknown.
- Open Access
Causal Emergence of Consciousness through Learned Multiscale Neural Dynamics in Mice
Consciousness spans macroscopic experience and microscopic neuronal activity, yet linking these scales remains challenging. Prevailing theories, such as Integrated Information Theory, focus on a single scale, overlooking how causal power and its dynamics unfold across scales. Progress is constrained by scarce cross-scale data and difficulties in quantifying multiscale causality and dynamics. Here, we present a machine learning framework that infers multiscale causal variables and their dynamics from near-cellular-resolution calcium imaging in the mouse dorsal cortex. At lower levels, variables primarily aggregate input-driven information, whereas at higher levels they realize causality through metastable or saddle-point dynamics during wakefulness, collapsing into localized, stochastic dynamics under anesthesia. A one-dimensional top-level conscious variable captures the majority of causal power, yet variables across other scales also contribute substantially, giving rise to high emergent complexity in the conscious state. Together, these findings provide a multiscale causal framework that links neural activity to conscious states.
Open AccessCausal Emergence of Consciousness through Learned Multiscale Neural Dynamics in Mice
Consciousness spans macroscopic experience and microscopic neuronal activity, yet linking these scales remains challenging. Prevailing theories, such as Integrated Information Theory, focus on a single scale, overlooking how causal power and its dynamics unfold across scales. Progress is constrained by scarce cross-scale data and difficulties in quantifying multiscale causality and dynamics. Here, we present a machine learning framework that infers multiscale causal variables and their dynamics from near-cellular-resolution calcium imaging in the mouse dorsal cortex. At lower levels, variables primarily aggregate input-driven information, whereas at higher levels they realize causality through metastable or saddle-point dynamics during wakefulness, collapsing into localized, stochastic dynamics under anesthesia. A one-dimensional top-level conscious variable captures the majority of causal power, yet variables across other scales also contribute substantially, giving rise to high emergent complexity in the conscious state. Together, these findings provide a multiscale causal framework that links neural activity to conscious states.
- Open Access
PCDCNet: A Surrogate Model for Air Quality Forecasting with Physical-Chemical Dynamics and Constraints
Air quality forecasting (AQF) is critical for public health and environmental management, yet remains challenging due to the complex interplay of emissions, meteorology, and chemical transformations. Traditional numerical models, such as CMAQ and WRF-Chem, provide physically grounded simulations but are computationally expensive and rely on uncertain emission inventories. Deep learning models, while computationally efficient, often struggle with generalization due to their lack of physical constraints. To bridge this gap, we propose PCDCNet, a surrogate model that integrates numerical modeling principles with deep learning. PCDCNet explicitly incorporates emissions, meteorological influences, and domain-informed constraints to model pollutant formation, transport, and dissipation. By combining graph-based spatial transport modeling, recurrent structures for temporal accumulation, and representation enhancement for local interactions, PCDCNet achieves state-of-the-art (SOTA) performance in 72-hour station-level PM2.5 and O3 forecasting while significantly reducing computational costs. Furthermore, our model is deployed in an online platform, providing free, real-time air quality forecasts, demonstrating its scalability and societal impact. By aligning deep learning with physical consistency, PCDCNet offers a practical and interpretable solution for AQF, enabling informed decision-making for both personal and regulatory applications.
Open AccessPCDCNet: A Surrogate Model for Air Quality Forecasting with Physical-Chemical Dynamics and Constraints
Air quality forecasting (AQF) is critical for public health and environmental management, yet remains challenging due to the complex interplay of emissions, meteorology, and chemical transformations. Traditional numerical models, such as CMAQ and WRF-Chem, provide physically grounded simulations but are computationally expensive and rely on uncertain emission inventories. Deep learning models, while computationally efficient, often struggle with generalization due to their lack of physical constraints. To bridge this gap, we propose PCDCNet, a surrogate model that integrates numerical modeling principles with deep learning. PCDCNet explicitly incorporates emissions, meteorological influences, and domain-informed constraints to model pollutant formation, transport, and dissipation. By combining graph-based spatial transport modeling, recurrent structures for temporal accumulation, and representation enhancement for local interactions, PCDCNet achieves state-of-the-art (SOTA) performance in 72-hour station-level PM2.5 and O3 forecasting while significantly reducing computational costs. Furthermore, our model is deployed in an online platform, providing free, real-time air quality forecasts, demonstrating its scalability and societal impact. By aligning deep learning with physical consistency, PCDCNet offers a practical and interpretable solution for AQF, enabling informed decision-making for both personal and regulatory applications.
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 903-906
LLM-powered Heterogeneous Information Network Analytics
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 903-906
Open AccessLLM-powered Heterogeneous Information Network Analytics
- Top Cited PapersOpen Access
- 13 February 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-11
Coarse-graining network flow through statistical physics and machine learning
Information dynamics plays a crucial role in complex systems, from cells to societies. Recent advances in statistical physics have made it possible to capture key network properties, such as flow diversity and signal speed, using entropy and free energy. However, large system sizes pose computational challenges. We use graph neural networks to identify suitable groups of components for coarse-graining a network and achieve a low computational complexity, suitable for practical application. Our approach preserves information flow even under significant compression, as shown through theoretical analysis and experiments on synthetic and empirical networks. We find that the model merges nodes with similar structural properties, suggesting they perform redundant roles in information transmission. This method enables low-complexity compression for extremely large networks, offering a multiscale perspective that preserves information flow in biological, social, and technological networks better than existing methods mostly focused on network structure.
- 13 February 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-11
Top Cited PapersOpen AccessCoarse-graining network flow through statistical physics and machine learning
Information dynamics plays a crucial role in complex systems, from cells to societies. Recent advances in statistical physics have made it possible to capture key network properties, such as flow diversity and signal speed, using entropy and free energy. However, large system sizes pose computational challenges. We use graph neural networks to identify suitable groups of components for coarse-graining a network and achieve a low computational complexity, suitable for practical application. Our approach preserves information flow even under significant compression, as shown through theoretical analysis and experiments on synthetic and empirical networks. We find that the model merges nodes with similar structural properties, suggesting they perform redundant roles in information transmission. This method enables low-complexity compression for extremely large networks, offering a multiscale perspective that preserves information flow in biological, social, and technological networks better than existing methods mostly focused on network structure.
- Open Access
- 25 January 2025
- Published by Springer Nature in npj Complexity
- Vol. 2 (1) , 1-11
Dynamical reversibility and a new theory of causal emergence based on SVD
- 25 January 2025
- Published by Springer Nature in npj Complexity
- Vol. 2 (1) , 1-11
Open AccessDynamical reversibility and a new theory of causal emergence based on SVD