SearcharxivSearch

arXiv subjects

Keli Zheng

Publications and source records attributed to Keli Zheng.

5 recordsLinked to original sources

Medical Heuristic Learning: An LLM-Driven Framework for Interpretable and Auditable Clinical Decision Rules

Predictive modeling for clinical decision support requires both strong predictive performance and transparent, auditable, and human-reviewable decision logic. Although deep learning and tree-based ensemble methods can achieve high accuracy, their black-box nature remains a major obstacle to trustworthy clinical deployment. Moreover, clinical prediction often operates under practical constraints, including limited sample sizes, severe class imbalance, and feature evolution arising from changes in diagnostic criteria or clinical documentation practices. We propose Medical Heuristic Learning (MHL), a constrained paradigm for LLM-assisted rule learning. Rather than relying on updates to implicit model weights, MHL integrates statistical probes, medical knowledge probes, initial rule synthesis, and iterative rule optimization to construct an executable rule-based expert system. The resulting rule system is expressed entirely using the native logical and control-flow constructs of a programming language. Valid rule versions are recorded and retained along the search trajectory, making the decision logic explicit, interpretable, and auditable. MHL also supports continual learning by using previously validated rules as a starting point and iteratively revising them in response to updated feature information under data drift or feature evolution. MHL is not tied to any specific programming language. Comprehensive experiments on medical datasets show that MHL achieves predictive performance comparable to that of state-of-the-art methods, performs favorably in small-sample and highly imbalanced settings, and supports the transfer and adaptive revision of validated rules under feature evolution. Overall, these findings suggest that non-gradient-based heuristic systems offer an approach to balancing predictive performance and transparency in clinical decision support.

cs.AI

SOFT: a high-performance simulator for universal fault-tolerant quantum circuits

Circuit simulation tools are critical for developing and assessing quantum-error-correcting and fault-tolerant strategies. In this work, we present SOFT, a high-performance SimulatOr for universal Fault-Tolerant quantum circuits. Integrating the generalized stabilizer formalism and highly optimized GPU parallelization, SOFT enables the simulation of noisy quantum circuits containing non-Clifford gates at a scale not accessible with existing tools. To provide a concrete demonstration, we simulate the state-of-the-art magic state cultivation (MSC) protocol at code distance $d=5$, involving 42 qubits, 72 $T$ / $T^\dagger$ gates, and mid-circuit measurements. Using only modest GPU resources, SOFT performs over 200 billion shots and achieves the first ground-truth simulation of the cultivation protocol at a non-trivial scale. This endeavor not only certifies the MSC's effectiveness for generating high-fidelity logical $T$-states, but also reveals a large discrepancy between the actual logical error rate and the previously reported values. Our work demonstrates the importance of reliable simulation tools for fault-tolerant architecture design, advancing the field from simulating quantum memory to simulating a universal quantum computer.

quant-ph

Synergy: End-to-end Concept Model

In this paper, we present Synergy, a language model that bridges different levels of abstraction in an end-to-end fashion through a learned routing mechanism. Focusing on low-level linguistic abstraction, we trained our model as a byte-level language model. Our model spontaneously learns to tokenize bytes, producing fewer concept tokens than Byte-level Byte Pair Encoder (BBPE) tokenizers while keeping comparable performance. By comparing with Llama3, we observed an advantage of Synergy under the same model scale and training dataset size. Further studies show that the middle part (the higher abstraction part) of our model performs better when positional encodings are removed, suggesting the emergence of position-independent concepts. These findings demonstrate the feasibility of tokenizer-free architectures, paving the way for more robust and flexible pipelines.

cs.CL

Some properties of generalized reduced Verma modules over $\mathbb{Z}$-graded modular Lie superalgebras

This paper is primarily concerned with generalized reduced Verma modules over $\mathbb{Z}$-graded modular Lie superalgebras. Some properties of the generalized reduced Verma modules and the coinduced modules are obtained. Moreover, the invariant forms on the generalized reduced Verma modules are considered. In particular, we prove that the generalized reduced Verma module is isomorphic to the mixed product for modules of $\mathbb{Z}$-graded modular Lie superalgebras of Cartan type.

math.RA

The matrix representation of the first cohomology of $\frak{gl}_{0|2}$ with coefficients in the generalized Witt Lie superalgebra

This paper is primarily concerned with the first cohomology of $\frak{gl}_{0|2}$ with coefficients in the generalized Witt Lie superalgebra, where $\frak{gl}_{0|2}$ is a subalgebra of the general linear Lie superalgebra. The derivations and inner derivations from $\frak{gl}_{0|2}$ into submodules of the generalized Witt Lie superalgebra are represented by matrices, respectively. Then the first cohomology of $\frak{gl}_{0|2}$ with coefficients in the generalized Witt Lie superalgebra is completely determined by matrices.

math.RA