Dataset Information

Optimizing the depth and the direction of prospective planning using information values.

ABSTRACT: Evaluating the future consequences of actions is achievable by simulating a mental search tree into the future. Expanding deep trees, however, is computationally taxing. Therefore, machines and humans use a plan-until-habit scheme that simulates the environment up to a limited depth and then exploits habitual values as proxies for consequences that may arise in the future. Two outstanding questions in this scheme are "in which directions the search tree should be expanded?", and "when should the expansion stop?". Here we propose a principled solution to these questions based on a speed/accuracy tradeoff: deeper expansion in the appropriate directions leads to more accurate planning, but at the cost of slower decision-making. Our simulation results show how this algorithm expands the search tree effectively and efficiently in a grid-world environment. We further show that our algorithm can explain several behavioral patterns in animals and humans, namely the effect of time-pressure on the depth of planning, the effect of reward magnitudes on the direction of planning, and the gradual shift from goal-directed to habitual behavior over the course of training. The algorithm also provides several predictions testable in animal/human experiments.

SUBMITTER: Sezener CE

PROVIDER: S-EPMC6440644 | biostudies-literature | 2019 Mar

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Optimizing the depth and the direction of prospective planning using information values.

Sezener Can Eren CE Dezfouli Amir A Keramati Mehdi M

PLoS computational biology 20190312 3

Evaluating the future consequences of actions is achievable by simulating a mental search tree into the future. Expanding deep trees, however, is computationally taxing. Therefore, machines and humans use a plan-until-habit scheme that simulates the environment up to a limited depth and then exploits habitual values as proxies for consequences that may arise in the future. Two outstanding questions in this scheme are "in which directions the search tree should be expanded?", and "when should the ...[more]

PMID: 30861001

Similar Datasets

Project description:BACKGROUND: Residue depth allows determining how deeply a given residue is buried, in contrast to the solvent accessibility that differentiates between buried and solvent-exposed residues. When compared with the solvent accessibility, the depth allows studying deep-level structures and functional sites, and formation of the protein folding nucleus. Accurate prediction of residue depth would provide valuable information for fold recognition, prediction of functional sites, and protein design. RESULTS: A new method, RDPred, for the real-value depth prediction from protein sequence is proposed. RDPred combines information extracted from the sequence, PSI-BLAST scoring matrices, and secondary structure predicted with PSIPRED. Three-fold/ten-fold cross validation based tests performed on three independent, low-identity datasets show that the distance based depth (computed using MSMS) predicted by RDPred is characterized by 0.67/0.67, 0.66/0.67, and 0.64/0.65 correlation with the actual depth, by the mean absolute errors equal 0.56/0.56, 0.61/0.60, and 0.58/0.57, and by the mean relative errors equal 17.0%/16.9%, 18.2%/18.1%, and 17.7%/17.6%, respectively. The mean absolute and the mean relative errors are shown to be statistically significantly better when compared with a method recently proposed by Yuan and Wang [Proteins 2008; 70:509-516]. The results show that three-fold cross validation underestimates the variability of the prediction quality when compared with the results based on the ten-fold cross validation. We also show that the hydrophilic and flexible residues are predicted more accurately than hydrophobic and rigid residues. Similarly, the charged residues that include Lys, Glu, Asp, and Arg are the most accurately predicted. Our analysis reveals that evolutionary information encoded using PSSM is characterized by stronger correlation with the depth for hydrophilic amino acids (AAs) and aliphatic AAs when compared with hydrophobic AAs and aromatic AAs. Finally, we show that the secondary structure of coils and strands is useful in depth prediction, in contrast to helices that have relatively uniform distribution over the protein depth. Application of the predicted residue depth to prediction of buried/exposed residues shows consistent improvements in detection rates of both buried and exposed residues when compared with the competing method. Finally, we contrasted the prediction performance among distance based (MSMS and DPX) and volume based (SADIC) depth definitions. We found that the distance based indices are harder to predict due to the more complex nature of the corresponding depth profiles. CONCLUSION: The proposed method, RDPred, provides statistically significantly better predictions of residue depth when compared with the competing method. The predicted depth can be used to provide improved prediction of both buried and exposed residues. The prediction of exposed residues has implications in characterization/prediction of interactions with ligands and other proteins, while the prediction of buried residues could be used in the context of folding predictions and simulations.

Project description:Laser interstitial thermal therapy (LITT) is an alternative to open surgery for drug-resistant focal mesial temporal lobe epilepsy (MTLE). Studies suggest maximal ablation of the mesial hippocampal head and amygdalohippocampal complex (AHC) improves seizure freedom rates while better neuropsychological outcomes are associated with sparing of the parahippocampal gyrus (PHG). Optimal trajectories avoid sulci and CSF cavities and maximize distance from vasculature. Computer-assisted planning (CAP) improves these metrics, but the combination of entry and target zones has yet to be determined to maximize ablation of the AHC while sparing the PHG. We apply a machine learning approach to predict entry and target parameters and utilize these for CAP. Ten patients with hippocampal sclerosis were identified from a prospectively managed database. CAP LITT trajectories were generated using entry regions that include the inferior occipital, middle occipital, inferior temporal, and middle temporal gyri. Target points were varied by sequential AHC erosions and transformations of the centroid of the amygdala. A total of 7600 trajectories were generated, and ablation volumes of the AHC and PHG were calculated. Two machine learning approaches (random forest and linear regression) were investigated to predict composite ablation scores and determine entry and target point combinations that maximize ablation of the AHC while sparing the PHG. Random forest and linear regression predictions had a high correlation with the calculated values in the test set (ρ = 0.7) for both methods. Maximal composite ablation scores were associated with entry points around the junction of the inferior occipital, middle occipital, and middle temporal gyri. The optimal target point was the anteromesial amygdala. These parameters were then used with CAP to generate clinically feasible trajectories that optimize safety metrics. Machine learning techniques accurately predict composite ablation score. Prospective studies are required to determine if this improves seizure-free outcome while reducing neuropsychological morbidity following LITT for MTLE.

Dataset Information

Optimizing the depth and the direction of prospective planning using information values.

Publications

Optimizing the depth and the direction of prospective planning using information values.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets