CMChristian Muise

Christian Muise

*This is an algorithmically generated author record based on publicly available information.

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


Christian Muise has a total of 44 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Radiomic signatures from baseline CT predict chemotherapy response in unresectable colorectal liver metastases

    by Mane Piliposyan, Jacob J. Peoples, Mohammad Hamghalam, Ramtin Mojtahedi, Kaitlyn Kobayashi, E. Claire Bunker, Natalie Gangai, Hyunseon C. Kang, Yun Shin Chun, Christian Muise, et al.

    PurposeColorectal cancer is the third most common cancer globally, with a high mortality rate due to metastatic progression, particularly in the liver. Surgical resection remains the main curative treatment, but only a small subset of patients is eligible for surgery at diagnosis. For patients with initially unresectable colorectal liver metastases (CRLM), neoadjuvant chemotherapy can downstage tumors, potentially making surgery feasible. We investigate whether radiomic signatures—quantitative imaging biomarkers derived from baseline computed tomography (CT) scans—can noninvasively predict chemotherapy response in patients with unresectable CRLM, offering a pathway toward personalized treatment planning.ApproachWe used radiomics combined with a stacking classifier (SC) to predict treatment outcome. Baseline CT imaging data from 355 patients with initially unresectable CRLM were analyzed using two regions of interest (ROIs) separately (all tumors in the liver and the largest tumor by volume). From each ROI, 107 radiomic features were extracted. The dataset was split into training and testing sets, and multiple machine learning models were trained and integrated via stacking to enhance prediction. Logistic regression coefficients were used to derive radiomic signatures.ResultsThe SC achieved strong predictive performance, with an area under the receiver operating characteristic curve of up to 0.77 for response prediction. Logistic regression identified 12 and 7 predictive features for treatment response in all tumors and the largest tumor ROIs, respectively.ConclusionOur findings demonstrate that radiomic features from baseline CT scans can serve as robust, interpretable biomarkers for predicting chemotherapy response, offering insights to guide personalized treatment in unresectable CRLM.


  • Open Access

    BPMN to PDDL: Translating Business Workflows for AI Planning

    by Jasper Nie, Christian Muise, Victoria Armstrong

    Business Process Model and Notation (BPMN) is a widely used standard for modelling business processes. While automated planning has been proposed as a method for simulating and reasoning about BPMN workflows, most implementations remain incomplete or limited in scope. This project builds upon prior theoretical work to develop a functional pipeline that translates BPMN 2.0 diagrams into PDDL representations suitable for planning. The system supports core BPMN constructs, including tasks, events, sequence flows, and gateways, with initial support for parallel and inclusive gateway behaviour. Using a non-deterministic planner, we demonstrate how to generate and evaluate valid execution traces. Our implementation aims to bridge the gap between theory and practical tooling, providing a foundation for further exploration of translating business processes into well-defined plans.

  • Open Access

    Make Planning Research Rigorous Again!

    by Michael Katz, Harsha Kokel, Christian Muise, Shirin Sohrabi, Sarath Sreedharan

    In over sixty years since its inception, the field of planning has made significant contributions to both the theory and practice of building planning software that can solve a never-before-seen planning problem. This was done through established practices of rigorous design and evaluation of planning systems. It is our position that this rigor should be applied to the current trend of work on planning with large language models. One way to do so is by correctly incorporating the insights, tools, and data from the automated planning community into the design and evaluation of LLM-based planners. The experience and expertise of the planning community are not just important from a historical perspective; the lessons learned could play a crucial role in accelerating the development of LLM-based planners. This position is particularly important in light of the abundance of recent works that replicate and propagate the same pitfalls that the planning community has encountered and learned from. We believe that avoiding such known pitfalls will contribute greatly to the progress in building LLM-based planners and to planning in general.

  • Top Cited Papers
    Open Access

    LLMs as Planning Formalizers: A Survey for Leveraging Large Language Models to Construct Automated Planning Models

    by Marcus Tantakoun, Christian Muise, Xiaodan Zhu

    Marcus Tantakoun, Christian Muise, Xiaodan Zhu. Findings of the Association for Computational Linguistics: ACL 2025. 2025.


  • Open Access

    KP-PINNs: Kernel Packet Accelerated Physics Informed Neural Networks

    by Pascal Bercher, Patrik Haslum, Christian Muise

    Differential equations are involved in modeling many engineering problems. Many efforts have been devoted to solving differential equations. Due to the flexibility of neural networks, Physics Informed Neural Networks (PINNs) have recently been proposed to solve complex differential equations and have demonstrated superior performance in many applications. While the L2 loss function is usually a default choice in PINNs, it has been shown that the corresponding numerical solution is incorrect and unstable for some complex equations. In this work, we propose a new PINNs framework named Kernel Packet accelerated PINNs (KP-PINNs), which gives a new expression of the loss function using the reproducing kernel Hilbert space (RKHS) norm and uses the Kernel Packet (KP) method to accelerate the computation. Theoretical results show that KP-PINNs can be stable across various differential equations. Numerical experiments illustrate that KP-PINNs can solve differential equations effectively and efficiently. This framework provides a promising direction for improving the stability and accuracy of PINNs-based solvers in scientific computing.


  • Open Access

    Attention-based Conditional Random Field for Financial Fraud Detection

    by Prakash Jamakatel, Rebecca De Venezia, Christian Muise, Jane Jean Kiam

    Financial fraud detection is critical for market transparency and regulatory compliance. Existing methods often ignore the temporal patterns in financial data, which are essential for understanding dynamic financial behaviors and detecting fraud. Moreover, they also treat companies as independent entities, overlooking the valuable interrelationships. To address these issues, we propose ACRF-RNN, a Recurrent Neural Network (RNN) with Attention-based Conditional Random Field (CRF) for fraud detection. Specifically, we use an RNN with a sliding window to capture temporal dependencies from historical data, and an attention-based CRF feature transformer to model inter-company relationships. This transforms raw financial data into optimized features, fed into a multi-layer perceptron for classification. Besides, we also use the focal loss to alleviate the class imbalance problem caused by rare fraudulent cases. This work presents a novel real-world dataset to evaluate the performance of ACRF-RNN. Extensive experiments show that ACRF-RNN outperforms the state-of-the-art methods by 15.28% in KS and 4.04% in Recall. Data and code are available at: https://github.com/XNetLab/ACRF-RNN.git.


  • Planning with mental models – Balancing explanations and explicability

    by Sarath Sreedharan, Tathagata Chakraborti, Christian Muise, Subbarao Kambhampati


  • Open Access

    PRP Rebooted: Advancing the State of the Art in FOND Planning

    by Christian Muise, Sheila A. McIlraith, J. Christopher Beck

    Fully Observable Non-Deterministic (FOND) planning is a variant of classical symbolic planning in which actions are nondeterministic, with an action's outcome known only upon execution. It is a popular planning paradigm with applications ranging from robot planning to dialogue-agent design and reactive synthesis. Over the last 20 years, a number of approaches to FOND planning have emerged. In this work, we establish a new state of the art, following in the footsteps of some of the most powerful FOND planners to date. Our planner, PR2, decisively outperforms the four leading FOND planners, at times by a large margin, in 17 of 18 domains that represent a comprehensive benchmark suite. Ablation studies demonstrate the impact of various techniques we introduce, with the largest improvement coming from our novel FOND-aware heuristic.


  • Open Access

    PRP Rebooted: Advancing the State of the Art in FOND Planning

    by Christian Muise, Sheila A. McIlraith, J. Christopher Beck

    Fully Observable Non-Deterministic (FOND) planning is a variant of classical symbolic planning in which actions are nondeterministic, with an action's outcome known only upon execution. It is a popular planning paradigm with applications ranging from robot planning to dialogue-agent design and reactive synthesis. Over the last 20 years, a number of approaches to FOND planning have emerged. In this work, we establish a new state of the art, following in the footsteps of some of the most powerful FOND planners to date. Our planner, PR2, decisively outperforms the four leading FOND planners, at times by a large margin, in 17 of 18 domains that represent a comprehensive benchmark suite. Ablation studies demonstrate the impact of various techniques we introduce, with the largest improvement coming from our novel FOND-aware heuristic.

  • Open Access

    Planning with Epistemic Preferences

    by Toryn Q. Klassen, Christian Muise, Sheila A. McIlraith

    Within the field of automated planning, two areas of study are planning with preferences and epistemic planning. Planning with preferences involves generating plans that optimize for properties of ...