Jayson Sia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jayson Sia has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Paul Bogdan
Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, USA
6 shared publications - Edmond Jonckheere
Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA
2 shared publications - Chang Qian
Department of Materials Science and Engineering, Grainger College of Engineering, University of Illinois, Urbana, IL, USA
1 shared publication - David Edward Cook
Department of Plant Pathology, Kansas State University, Manhattan, USA
1 shared publication - Delia J. Milliron
University of Texas at Austin
1 shared publication - Dingwen Qian
Department of Chemical Engineering, University of Michigan, Ann Arbor, MI, USA
1 shared publication
Latest Publications
- 14 May 2026
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 392 (6799) , eaeb5134
Decoding collective dynamics and complexity in nanoparticle assemblies using graph theory
Being intermediate in scale between molecules and colloids, nanoparticles combine characteristics of both. The structure of their self-assembled states combining order and disorder is difficult to quantify using traditional symmetry-based descriptors. Here, we applied graph theory (GT) to analyze assemblies of 400 to 10,000 nanoparticles across three material systems. We show that GT metrics, augmented Forman-Ricci curvature (AFRC) and Ollivier-Ricci curvature (ORC), capture local and global structural transitions from small clusters to extended networks. AFRC reflects the energetic state of the assembly, whereas ORC quantifies structural complexity and reveals a “Goldilocks” regime that maximizes plasmonic response. The generality of this approach is demonstrated for gold nanocubes, gold nanoprisms, and indium tin oxide nanospheres, providing a unified framework for describing and optimizing complex nanoparticle assemblies.
- 14 May 2026
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 392 (6799) , eaeb5134
Decoding collective dynamics and complexity in nanoparticle assemblies using graph theory
Being intermediate in scale between molecules and colloids, nanoparticles combine characteristics of both. The structure of their self-assembled states combining order and disorder is difficult to quantify using traditional symmetry-based descriptors. Here, we applied graph theory (GT) to analyze assemblies of 400 to 10,000 nanoparticles across three material systems. We show that GT metrics, augmented Forman-Ricci curvature (AFRC) and Ollivier-Ricci curvature (ORC), capture local and global structural transitions from small clusters to extended networks. AFRC reflects the energetic state of the assembly, whereas ORC quantifies structural complexity and reveals a “Goldilocks” regime that maximizes plasmonic response. The generality of this approach is demonstrated for gold nanocubes, gold nanoprisms, and indium tin oxide nanospheres, providing a unified framework for describing and optimizing complex nanoparticle assemblies.
- Open Access
Analyzing Neural Network Information Flow Using Differential Geometry
This paper provides a fresh view of the neural network (NN) data flow problem, i.e., identifying the NN connections that are most important for the performance of the full model, through the lens of graph theory. Understanding the NN data flow provides a tool for symbolic NN analysis, e.g.,~robustness analysis or model repair. Unlike the standard approach to NN data flow analysis, which is based on information theory, we employ the notion of graph curvature, specifically Ollivier-Ricci curvature (ORC). The ORC has been successfully used to identify important graph edges in various domains such as road traffic analysis, biological and social networks. In particular, edges with negative ORC are considered bottlenecks and as such are critical to the graph's overall connectivity, whereas positive-ORC edges are not essential. We use this intuition for the case of NNs as well: we 1)~construct a graph induced by the NN structure and introduce the notion of neural curvature (NC) based on the ORC; 2)~calculate curvatures based on activation patterns for a set of input examples; 3)~aim to demonstrate that NC can indeed be used to rank edges according to their importance for the overall NN functionality. We evaluate our method through pruning experiments and show that removing negative-ORC edges quickly degrades the overall NN performance, whereas positive-ORC edges have little impact. The proposed method is evaluated on a variety of models trained on three image datasets, namely MNIST, CIFAR-10 and CIFAR-100. The results indicate that our method can identify a larger number of unimportant edges as compared to state-of-the-art pruning methods.
Open AccessAnalyzing Neural Network Information Flow Using Differential Geometry
This paper provides a fresh view of the neural network (NN) data flow problem, i.e., identifying the NN connections that are most important for the performance of the full model, through the lens of graph theory. Understanding the NN data flow provides a tool for symbolic NN analysis, e.g.,~robustness analysis or model repair. Unlike the standard approach to NN data flow analysis, which is based on information theory, we employ the notion of graph curvature, specifically Ollivier-Ricci curvature (ORC). The ORC has been successfully used to identify important graph edges in various domains such as road traffic analysis, biological and social networks. In particular, edges with negative ORC are considered bottlenecks and as such are critical to the graph's overall connectivity, whereas positive-ORC edges are not essential. We use this intuition for the case of NNs as well: we 1)~construct a graph induced by the NN structure and introduce the notion of neural curvature (NC) based on the ORC; 2)~calculate curvatures based on activation patterns for a set of input examples; 3)~aim to demonstrate that NC can indeed be used to rank edges according to their importance for the overall NN functionality. We evaluate our method through pruning experiments and show that removing negative-ORC edges quickly degrades the overall NN performance, whereas positive-ORC edges have little impact. The proposed method is evaluated on a variety of models trained on three image datasets, namely MNIST, CIFAR-10 and CIFAR-100. The results indicate that our method can identify a larger number of unimportant edges as compared to state-of-the-art pruning methods.
- 21 November 2024
- Published by Wiley in New Phytologist
- Vol. 245 (2) , 785-806
Machine learning‐based identification of general transcriptional predictors for plant disease
Summary: This study investigated the generalizability of Arabidopsis thaliana immune responses across diverse pathogens, including Botrytis cinerea, Sclerotinia sclerotiorum, and Pseudomonas syringae, using a data‐driven, machine learning approach. Machine learning models were trained to predict disease development from early transcriptional responses. Feature selection techniques based on network science and topology were used to train models employing only a fraction of the transcriptome. Machine learning models trained on one pathosystem where then validated by predicting disease development in new pathosystems. The identified feature selection gene sets were enriched for pathways related to biotic, abiotic, and stress responses, though the specific genes involved differed between feature sets. This suggests common immune responses to diverse pathogens that operate via different gene sets. The study demonstrates that machine learning can uncover both established and novel components of the plant's immune response, offering insights into disease resistance mechanisms. These predictive models highlight the potential to advance our understanding of multigenic outcomes in plant immunity and can be further refined for applications in disease prediction.
- 21 November 2024
- Published by Wiley in New Phytologist
- Vol. 245 (2) , 785-806
Machine learning‐based identification of general transcriptional predictors for plant disease
Summary: This study investigated the generalizability of Arabidopsis thaliana immune responses across diverse pathogens, including Botrytis cinerea, Sclerotinia sclerotiorum, and Pseudomonas syringae, using a data‐driven, machine learning approach. Machine learning models were trained to predict disease development from early transcriptional responses. Feature selection techniques based on network science and topology were used to train models employing only a fraction of the transcriptome. Machine learning models trained on one pathosystem where then validated by predicting disease development in new pathosystems. The identified feature selection gene sets were enriched for pathways related to biotic, abiotic, and stress responses, though the specific genes involved differed between feature sets. This suggests common immune responses to diverse pathogens that operate via different gene sets. The study demonstrates that machine learning can uncover both established and novel components of the plant's immune response, offering insights into disease resistance mechanisms. These predictive models highlight the potential to advance our understanding of multigenic outcomes in plant immunity and can be further refined for applications in disease prediction.
- 15 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 520-527
Robust Learning Under Label Noise by Optimizing the Tails of the Loss Distribution
We introduce a novel optimization strategy that combines empirical risk minimization (ERM) with a sample weighting scheme to decrease the bias induced by training with noisy labels. We accomplish this by penalizing the tails of the loss distribution, as samples associated with the right tail (high loss values) are more likely to be mislabeled. We implement the proposed sample weighting scheme by minimizing a discriminatory risk that downweighs mislabeled samples. Moreover, we show that the proposed method enables us to optimize the location and shape of the loss distribution simultaneously. In addition, we couple our method with a distributionally robust optimization stage. The goal of this coupling is to increase the weight of correctly labeled but hard-to-Iearn samples that exhibit a high loss value. This coupling also improves model accuracy on underrepresented minority subsets when training with imbalanced classes. Experimental results show that for 60% noise contamination, our method, when compared to the ERM, improves the final accuracy on both Fashion-MNIST and CIFAR-10 by 18.4% and 8.5%, respectively.
- 15 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 520-527
Robust Learning Under Label Noise by Optimizing the Tails of the Loss Distribution
We introduce a novel optimization strategy that combines empirical risk minimization (ERM) with a sample weighting scheme to decrease the bias induced by training with noisy labels. We accomplish this by penalizing the tails of the loss distribution, as samples associated with the right tail (high loss values) are more likely to be mislabeled. We implement the proposed sample weighting scheme by minimizing a discriminatory risk that downweighs mislabeled samples. Moreover, we show that the proposed method enables us to optimize the location and shape of the loss distribution simultaneously. In addition, we couple our method with a distributionally robust optimization stage. The goal of this coupling is to increase the weight of correctly labeled but hard-to-Iearn samples that exhibit a high loss value. This coupling also improves model accuracy on underrepresented minority subsets when training with imbalanced classes. Experimental results show that for 60% noise contamination, our method, when compared to the ERM, improves the final accuracy on both Fashion-MNIST and CIFAR-10 by 18.4% and 8.5%, respectively.
- Open Access
- 20 October 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-18
A unified approach of detecting phase transition in time-varying complex networks
Deciphering the non-trivial interactions and mechanisms driving the evolution of time-varying complex networks (TVCNs) plays a crucial role in designing optimal control strategies for such networks or enhancing their causal predictive capabilities. In this paper, we advance the science of TVCNs by providing a mathematical framework through which we can gauge how local changes within a complex weighted network affect its global properties. More precisely, we focus on unraveling unknown geometric properties of a network and determine its implications on detecting phase transitions within the dynamics of a TVCN. In this vein, we aim at elaborating a novel and unified approach that can be used to depict the relationship between local interactions in a complex network and its global kinetics. We propose a geometric-inspired framework to characterize the network’s state and detect a phase transition between different states, to infer the TVCN’s dynamics. A phase of a TVCN is determined by its Forman–Ricci curvature property. Numerical experiments show the usefulness of the proposed curvature formalism to detect the transition between phases within artificially generated networks. Furthermore, we demonstrate the effectiveness of the proposed framework in identifying the phase transition phenomena governing the training and learning processes of artificial neural networks. Moreover, we exploit this approach to investigate the phase transition phenomena in cellular re-programming by interpreting the dynamics of Hi-C matrices as TVCNs and observing singularity trends in the curvature network entropy. Finally, we demonstrate that this curvature formalism can detect a political change. Specifically, our framework can be applied to the US Senate data to detect a political change in the United States of America after the 1994 election, as discussed by political scientists.
- 20 October 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-18
Open AccessA unified approach of detecting phase transition in time-varying complex networks
Deciphering the non-trivial interactions and mechanisms driving the evolution of time-varying complex networks (TVCNs) plays a crucial role in designing optimal control strategies for such networks or enhancing their causal predictive capabilities. In this paper, we advance the science of TVCNs by providing a mathematical framework through which we can gauge how local changes within a complex weighted network affect its global properties. More precisely, we focus on unraveling unknown geometric properties of a network and determine its implications on detecting phase transitions within the dynamics of a TVCN. In this vein, we aim at elaborating a novel and unified approach that can be used to depict the relationship between local interactions in a complex network and its global kinetics. We propose a geometric-inspired framework to characterize the network’s state and detect a phase transition between different states, to infer the TVCN’s dynamics. A phase of a TVCN is determined by its Forman–Ricci curvature property. Numerical experiments show the usefulness of the proposed curvature formalism to detect the transition between phases within artificially generated networks. Furthermore, we demonstrate the effectiveness of the proposed framework in identifying the phase transition phenomena governing the training and learning processes of artificial neural networks. Moreover, we exploit this approach to investigate the phase transition phenomena in cellular re-programming by interpreting the dynamics of Hi-C matrices as TVCNs and observing singularity trends in the curvature network entropy. Finally, we demonstrate that this curvature formalism can detect a political change. Specifically, our framework can be applied to the US Senate data to detect a political change in the United States of America after the 1994 election, as discussed by political scientists.
- 29 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (2) , 819-827
Phasor Measurement Unit Change-Point Detection of Frequency Hurst Exponent Anomaly With Time-to-Event
The objective of this paper is real-time detection of a change-point in the baseline distribution of the frequency signal generated by Phasor Measurement Units (PMUs) that could indicate potential for voltage collapse, false data injection, or other security threats. The alarm flags an anomaly event when the cumulative sum (CUSUM) of the log-likelihood departures of the Hurst exponent of the frequency from its baseline statistic exceeds a threshold set up as a compromise between the conflicting objectives of minimum detection delay and acceptable False Alarm Rate. As main theoretical contribution, an extra protection layer is developed that provides an estimate of the time to the alarm event, giving the Transmission System Operator (TSO) or an autonomous agent more time to deploy proactive measures to avoid large catastrophic system states. The proposed method is illustrated by a retrospective analysis of the 2012 Indian blackout that reveals that 10-12 minutes before the voltage collapse, a significant increase in the Hurst exponent of the frequency could have been detected. Conceptually, this shows that PMUs provide significant value towards ensuring autonomous cognition in the power grid by enabling the abnormal events to be fault-detected in an unsupervised fashion.
- 29 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (2) , 819-827
Phasor Measurement Unit Change-Point Detection of Frequency Hurst Exponent Anomaly With Time-to-Event
The objective of this paper is real-time detection of a change-point in the baseline distribution of the frequency signal generated by Phasor Measurement Units (PMUs) that could indicate potential for voltage collapse, false data injection, or other security threats. The alarm flags an anomaly event when the cumulative sum (CUSUM) of the log-likelihood departures of the Hurst exponent of the frequency from its baseline statistic exceeds a threshold set up as a compromise between the conflicting objectives of minimum detection delay and acceptable False Alarm Rate. As main theoretical contribution, an extra protection layer is developed that provides an estimate of the time to the alarm event, giving the Transmission System Operator (TSO) or an autonomous agent more time to deploy proactive measures to avoid large catastrophic system states. The proposed method is illustrated by a retrospective analysis of the 2012 Indian blackout that reveals that 10-12 minutes before the voltage collapse, a significant increase in the Hurst exponent of the frequency could have been detected. Conceptually, this shows that PMUs provide significant value towards ensuring autonomous cognition in the power grid by enabling the abnormal events to be fault-detected in an unsupervised fashion.
- Top Cited PapersOpen Access
- 5 July 2019
- Published by Springer Nature in Scientific Reports
- Vol. 9 (1) , 1-12
Ollivier-Ricci Curvature-Based Method to Community Detection in Complex Networks
Identification of community structures in complex network is of crucial importance for understanding the system’s function, organization, robustness and security. Here, we present a novel Ollivier-Ricci curvature (ORC) inspired approach to community identification in complex networks. We demonstrate that the intrinsic geometric underpinning of the ORC offers a natural approach to discover inherent community structures within a network based on interaction among entities. We develop an ORC-based community identification algorithm based on the idea of sequential removal of negatively curved edges symptomatic of high interactions (e.g., traffic, attraction). To illustrate and compare the performance with other community identification methods, we examine the ORC-based algorithm with stochastic block model artificial networks and real-world examples ranging from social to drug-drug interaction networks. The ORC-based algorithm is able to identify communities with either better or comparable performance accuracy and to discover finer hierarchical structures of the network. This opens new geometric avenues for analysis of complex networks dynamics.
- 5 July 2019
- Published by Springer Nature in Scientific Reports
- Vol. 9 (1) , 1-12
Top Cited PapersOpen AccessOllivier-Ricci Curvature-Based Method to Community Detection in Complex Networks
Identification of community structures in complex network is of crucial importance for understanding the system’s function, organization, robustness and security. Here, we present a novel Ollivier-Ricci curvature (ORC) inspired approach to community identification in complex networks. We demonstrate that the intrinsic geometric underpinning of the ORC offers a natural approach to discover inherent community structures within a network based on interaction among entities. We develop an ORC-based community identification algorithm based on the idea of sequential removal of negatively curved edges symptomatic of high interactions (e.g., traffic, attraction). To illustrate and compare the performance with other community identification methods, we examine the ORC-based algorithm with stochastic block model artificial networks and real-world examples ranging from social to drug-drug interaction networks. The ORC-based algorithm is able to identify communities with either better or comparable performance accuracy and to discover finer hierarchical structures of the network. This opens new geometric avenues for analysis of complex networks dynamics.