SearcharxivSearch

arXiv subjects

David Maughan

Publications and source records attributed to David Maughan.

3 recordsLinked to original sources

Lightweight Language Models are Prone to Reasoning Errors for Complex Computational Phenotyping Tasks

Although computational phenotyping is a central informatics activity with resulting cohorts supporting a wide variety of applications, it is time-intensive because of manual data review. We previously assessed the ability of LLMs to perform computational phenotyping tasks using computable phenotypes for ARF respiratory support therapies. They successfully performed concept classification and classification of single-therapy phenotypes but underperformed on multi-therapy phenotypes. To better understand issues with these complex tasks, we expanded PHEONA, a generalizable framework for evaluation of LLMs, to include methods specifically for evaluating faulty reasoning. We assessed the responses of two lightweight non-reasoning LLMs (Mistral Small 24 billion and Phi-4 14 billion) and one lightweight reasoning LLM (Qwen-distilled DeepSeek-r1 32 billion) both with and without prompt modifications to identify explanation correctness errors and unfaithfulness errors during phenotyping. For experiments without prompt modifications, both errors were present in responses from all models. For experiments with prompt modifications, we measured the mean absolute change in accuracy relative to the unbiased prompt across biasing conditions. Adding specific few-shot examples aligned with an incorrect phenotype reduced accuracy by at least 5% and up to 10% depending on the model and CoT type. Since reasoning errors were ubiquitous across models, our enhancement of PHEONA to include a component for assessing faulty reasoning provides a practical framework for evaluating LLM reasoning and empirical evidence that reasoning errors occur during complex computational phenotyping.

q-bio.QM

A Data Driven Approach to Learning The Hamiltonian Matrix in Quantum Mechanics

We present a new machine learning technique which calculates a real-valued, time independent, finite dimensional Hamiltonian matrix from only experimental data. A novel cost function is given along with a proof that the cost function has the theoretically correct Hamiltonian as a global minimum. We present results based on data simulated on a classical computer and results based on simulations of quantum systems on IBM's ibmqx2 quantum computer. We conclude with a discussion on the limitations of this data driven framework, as well as several possible extensions of this work. We also note that algorithm presented in this article not only serves as an example of using domain knowledge to design a machine learning framework, but also as an example of using domain knowledge to improve the speed of such algorithm.

quant-ph

Affine Symmetry, Geodesics, and Homogeneous Spacetimes

We show that the conservation laws for the geodesic equation which are associated to affine symmetries can be obtained from symmetries of the Lagrangian for affinely parametrized geodesics according to Noether's theorem, in contrast to claims found in the literature. In particular, using Aminova's classification of affine motions of Lorentzian manifolds, we show in detail how affine motions define generalized symmetries of the geodesic Lagrangian. We compute all infinitesimal proper affine symmetries and the corresponding geodesic conservation laws for all homogeneous solutions to the Einstein field equations in four spacetime dimensions with each of the following energy-momentum contents: vacuum, cosmological constant, perfect fluid, pure radiation, and homogeneous electromagnetic fields.

gr-qc