Negative Reinforcement and Backtrack-Points for Recurrent Neural Networks for Cost-Based Abduction

Abduction is the process of proceeding from data describing a set of observations or events, to a set of hypotheses which best explains or accounts for the data. Cost-based abduction (CKA) is an AI formalism in which evidence to be explained is treated as a goal to be proven, proofs have costs based on how much needs to be assumed to complete the proof, and the set of assumptions needed to complete the least-cost proof are taken as the best explanation for the given evidence. In this paper, we introduce two techniques for improving the performance of high order recurrent networks (HORN) applied to cost-based abduction. In the backtrack-points technique, we use heuristics to recognize early that the network trajectory is moving in the wrong direction; we then restore the network state to a previously-stored point, and apply heuristic perturbations to nudge the network trajectory in a different direction. In the negative reinforcement technique, we add hyperedges to the network to reduce the attractiveness of local-minima. We apply these techniques on a 300-hypothesis, 900-rule particularly-difficult instance of CBA

Machine learning-based prediction of breast cancer growth rate in-vivo

BackgroundDetermining the rate of breast cancer (BC) growth in vivo, which can predict prognosis, has remained elusive despite its relevance for treatment, screening recommendations and medicolegal practice. We developed a model that predicts the rate of in vivo tumour growth using a unique study cohort of BC patients who had two serial mammograms wherein the tumour, visible in the diagnostic mammogram, was missed in the first screen.MethodsA serial mammography-derived in vivo growth rate (SM-INVIGOR) index was developed using tumour volumes from two serial mammograms and time interval between measurements. We then developed a machine learning-based surrogate model called Surr-INVIGOR using routinely assessed biomarkers to predict in vivo rate of tumour growth and extend the utility of this approach to a larger patient population. Surr-INVIGOR was validated using an independent cohort.ResultsSM-INVIGOR stratified discovery cohort patients into fast-growing versus slow-growing tumour subgroups, wherein patients with fast-growing tumours experienced poorer BC-specific survival. Our clinically relevant Surr-INVIGOR stratified tumours in the discovery cohort and was concordant with SM-INVIGOR. In the validation cohort, Surr-INVIGOR uncovered significant survival differences between patients with fast-growing and slow-growing tumours.ConclusionOur Surr-INVIGOR model predicts in vivo BC growth rate during the pre-diagnostic stage and offers several useful applications

Molecular mechanisms of cell death: recommendations of the Nomenclature Committee on Cell Death 2018.

Over the past decade, the Nomenclature Committee on Cell Death (NCCD) has formulated guidelines for the definition and interpretation of cell death from morphological, biochemical, and functional perspectives. Since the field continues to expand and novel mechanisms that orchestrate multiple cell death pathways are unveiled, we propose an updated classification of cell death subroutines focusing on mechanistic and essential (as opposed to correlative and dispensable) aspects of the process. As we provide molecularly oriented definitions of terms including intrinsic apoptosis, extrinsic apoptosis, mitochondrial permeability transition (MPT)-driven necrosis, necroptosis, ferroptosis, pyroptosis, parthanatos, entotic cell death, NETotic cell death, lysosome-dependent cell death, autophagy-dependent cell death, immunogenic cell death, cellular senescence, and mitotic catastrophe, we discuss the utility of neologisms that refer to highly specialized instances of these processes. The mission of the NCCD is to provide a widely accepted nomenclature on cell death in support of the continued development of the field

A Connectionist Approach to Cost-Based Abduction

Cost-based abduction (CBA) is an important NP-hard problem in automated reasoning. in this formalism, evidence to be explained is treated as a goal to be proven. Proofs have costs based on how much needs to be assumed to complete the proof, and the set of assumptions needed to complete the leastcost proof are taken as the best explanation for the given evidence. in this paper, we present a connectionist approach to cost-based abduction. We begin by reviewing high order recurrent networks (HORN) and their use in combinatorial optimization. We then formally define the cost-based abduction problem and describe previous work on this problem. This is followed by a description of how HORN\u27s can be applied to the CBA problem and experimental results on a 60-hypothesis, 65-rule CBA problem. We conclude with some remarks on the potential advantages of the connectionist approach

Abductive Reasoning with Recurrent Neural Networks

Abduction is the process of proceeding from data describing a set of observations or events, to a set of hypotheses which best explains or accounts for the data. Cost-based abduction (CBA) is a formalism in which evidence to be explained is treated as a goal to be proven, proofs have costs based on how much needs to be assumed to complete the proof, and the set of assumptions needed to complete the least-cost proof are taken as the best explanation for the given evidence. In previous work, we presented a method for using high order recurrent networks to find least cost proofs for CBA instances. Here, we present a method that significantly reduces the size of the neural network that is produced for a given CBA instance. We present experimental results describing the performance of this method and comparing its performance to that of the previous method

Recurrent Neural Networks with Backtrack-points and Negative Reinforcement Applied to Cost-based Abduction

Abduction is the process of proceeding from data describing a set of observations or events, to a set of hypotheses which best explains or accounts for the data. Cost-based abduction (CBA) is an AI formalism in which evidence to be explained is treated as a goal to be proven, proofs have costs based on how much needs to be assumed to complete the proof, and the set of assumptions needed to complete the least-cost proof are taken as the best explanation for the given evidence. In this paper, we present two techniques for improving the performance of high order recurrent networks (HORN) applied to cost-based abduction. In the backtrack-points technique, we use heuristics to recognize early that the network trajectory is moving in the wrong direction; we then restore the network state to a previously stored point, and apply heuristic perturbations to nudge the network trajectory in a different direction. In the negative reinforcement technique, we add hyperedges to the network to reduce the attractiveness of local minima. We apply these techniques to a suite of six large CBA instances, systematically generated to be difficult

Apoptotic cell death in disease-Current understanding of the NCCD 2023

Apoptosis is a form of regulated cell death (RCD) that involves proteases of the caspase family. Pharmacological and genetic strategies that experimentally inhibit or delay apoptosis in mammalian systems have elucidated the key contribution of this process not only to (post-)embryonic development and adult tissue homeostasis, but also to the etiology of multiple human disorders. Consistent with this notion, while defects in the molecular machinery for apoptotic cell death impair organismal development and promote oncogenesis, the unwarranted activation of apoptosis promotes cell loss and tissue damage in the context of various neurological, cardiovascular, renal, hepatic, infectious, neoplastic and inflammatory conditions. Here, the Nomenclature Committee on Cell Death (NCCD) gathered to critically summarize an abundant pre-clinical literature mechanistically linking the core apoptotic apparatus to organismal homeostasis in the context of disease