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


Yiyang Jia has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Polynomial–Petri Certificate Framework for Reordering in a Straight-Line MLIR Transform IR Core

    by Zheng Wei, Yiyang Jia

    Reordering operations in a declared finite, straight-line MLIR Transform IR core must preserve request availability, handle phases, effects, and completed outcomes. We present a model-relative certificate framework for this core, restricted to operation handles and matcher-generated carriers. Polynomial interfaces describe request menus, completed coalgebras represent success and failure, and exact branch descriptors compile to ordinary fixed-unit Petri nets. For total-success paths, our reordering theorem constructs the swapped path from residual guards and derives Petri interchange from disjoint compiled supports. With exact atomic source summaries, concrete-to-rich refinement, and an exact target quotient as premises, the two paths have equivalent concrete outcomes. Two worked instances cover unit annotations and guarded handle generation. An independent finite-model audit validates 29 complete-marking transitions and 12 local exchange squares, and rejects seven targeted semantic mutations. Checks of 39 archived MLIR cases in each of two runs confirm the expected payload outputs and diagnostics. A repeated evaluation across 522 files in a fixed corpus available during development constructs 617 V3 kernel records, compared with 292 for V2, and records five native successes among six candidates. A mirror benchmark over 39 conditions confirms the structural count formulas. These results validate the finite model-to-Petri construction and show that the frozen pipeline operates reproducibly on the declared corpus.

  • Open Access

    Modeling GRNs with a Probabilistic Categorical Framework

    by Yiyang Jia, Zheng Wei, Zheng Yang, Guohong Peng

    Understanding the complex and stochastic nature of Gene Regulatory Networks (GRNs) remains a central challenge in systems biology. Existing modeling paradigms often struggle to effectively capture the intricate, multi-factor regulatory logic and to rigorously manage the dual uncertainties of network structure and kinetic parameters. In response, this work introduces the Probabilistic Categorical GRN(PC-GRN) framework. It is a novel theoretical approach founded on the synergistic integration of three core methodologies. Firstly, category theory provides a formal language for the modularity and composition of regulatory pathways. Secondly, Bayesian Typed Petri Nets (BTPNs) serve as an interpretable,mechanistic substrate for modeling stochastic cellular processes, with kinetic parameters themselves represented as probability distributions. The central innovation of PC-GRN is its end-to-end generative Bayesian inference engine, which learns a full posterior distribution over BTPN models (P (G, Θ|D)) directly from data. This is achieved by the novel interplay of a GFlowNet, which learns a policy to sample network topologies, and a HyperNetwork, which performs amortized inference to predict their corresponding parameter distributions. The resulting framework provides a mathematically rigorous, biologically interpretable, and uncertainty-aware representation of GRNs, advancing predictive modeling and systems-level analysis.

  • Open Access

    Category-Theoretical and Topos-Theoretical Frameworks in Machine Learning: A Survey

    by Yiyang Jia, Guohong Peng, Zheng Yang, Tianhao Chen

    In this survey, we provide an overview of category theory-derived machine learning from four mainstream perspectives: gradient-based learning, probability-based learning, invariance and equivalence-based learning, and topos-based learning. For the first three topics, we primarily review research in the past five years, updating and expanding on the previous survey by Shiebler et al. The fourth topic, which delves into higher category theory, particularly topos theory, is surveyed for the first time in this paper. In certain machine learning methods, the compositionality of functors plays a vital role, prompting the development of specific categorical frameworks. However, when considering how the global properties of a network reflect in local structures and how geometric properties and semantics are expressed with logic, the topos structure becomes particularly significant and profound.


  • Open Access

    Category-Theoretical and Topos-Theoretical Frameworks in Machine Learning: A Survey

    by Yiyang Jia, Guohong Peng, Zheng Yang, Tianhao Chen

    In this survey, we provide an overview of category theory-derived machine learning from four mainstream perspectives: gradient-based learning, probability-based learning, invariance and equivalence-based learning, and topos-based learning. For the first three topics, we primarily review research in the past five years, updating and expanding on the previous survey by Shiebler et al.. The fourth topic, which delves into higher category theory, particularly topos theory, is surveyed for the first time in this paper. In certain machine learning methods, the compositionality of functors plays a vital role, prompting the development of specific categorical frameworks. However, when considering how the global properties of a network reflect in local structures and how geometric properties are expressed with logic, the topos structure becomes particularly significant and profound.

  • Open Access

    ORDER THEORY IN STRIP FOLDING

    by Yiyang Jia, Jun Mitani

    Despite of considerable algorithmic research on strip folding, an abstract mathematical approach to this topic is yet to be established. This paper demonstrates the possibility of constructing an ordering system within the framework of strip folding, and subsequently develops a unique systematized order theory in this context. In this study, we first utilize basic terms from order theory to arrange the relationship between folding objects and folding processes, avoiding the use of complicated terms from category theory. Next, we discuss various topics related to the representation of different folding models within this system, the meet and join operations of the preorder defined in this paper, upper sets, and their corresponding functors. In doing so, we limit our use of category theory to the minimum necessary and use a more accessible approach that utilizes fundamental concepts from order theory. Furthermore, graph theory is employed to represent the ordering system, and a sheaf structure is defined based on the graph. This methodology enables the efficient representation of strip folding in an abstract manner, thus, facilitating the exploration of various algebraic and abstract geometric structures, including sheaves and sites, among others. Received: June 28, 2023 Accepted: August 1, 2023


  • Logical Matrix Representations in Map Folding

    by Yiyang Jia, Jun Mitani, Ryuhei Uehara

    Logical matrices are binary matrices often used to represent relations. In the map folding problem, each folded state corresponds to a unique partial order on the set of squares and thus could be described with a logical matrix. The logical matrix representation is powerful than graphs or other common representations considering its association with category theory and homology theory and its generalizability to solve other computational problems. On the application level, such representations allow us to recognize map folding intuitively. For example, we can give a precise mathematical description of a folding process using logical matrices so as to solve problems like how to represent the up-and-down relations between all the layers according to their adjacency in a flat-folded state, how to check self-penetration, and how to deduce a folding process from a given order of squares that is supposed to represent a folded state of the map in a mathematical and natural manner. In this paper, we give solutions to these problems and analyze their computational complexity.