Evidence map›Paper›PMID 31619756›Full record

ArticleScientific reports2019

Sub-optimality in motor planning is not improved by explicit observation of motor uncertainty.

Keiji Ota, Masahiro Shinya, Laurence T Maloney, Kazutoshi Kudo

Abstract read
In one paragraph

Article in Scientific reports, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Keiji OtaDepartment of Psychology, New York University, New York, USA. keiji.ota@nyu.edu.
Masahiro ShinyaDepartment of Human Sciences, Graduate School of Integrated Arts and Sciences, Hiroshima University, Hiroshima, Japan.
Laurence T MaloneyDepartment of Psychology, New York University, New York, USA.
Kazutoshi KudoLaboratory of Sports Sciences, Department of Life Sciences, Graduate School of Arts and Sciences, The University of Tokyo, Tokyo, Japan. kudo@idaten.c.u-tokyo.ac.jp.ORCID http://orcid.org/0000-0002-3199-9449

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

To make optimal decisions under risk, one must correctly weight potential rewards and penalties by the probabilities of receiving them. In motor decision tasks, the uncertainty in outcome is a consequence of motor uncertainty. When participants perform suboptimally as they often do in such tasks, it could be because they have insufficient information about their motor uncertainty: with more information, their performance could converge to optimal as they learn their own motor uncertainty. Alternatively, their suboptimal performance may reflect an inability to make use of the information they have or even to perform the correct computations. To discriminate between these two possibilities, we performed an experiment spanning two days. On the first day, all participants performed a reaching task with trial-by-trial feedback of motor error. At the end of the day, their aim points were still typically suboptimal. On the second day participants were divided into two groups one of which repeated the task of the first day and the other of which repeated the task but were intermittently given additional information summarizing their motor errors. Participants receiving additional information did not perform significantly better than those who did not.

Indexed as

FeedbackLearningMovementPsychomotor PerformanceUncertaintyAdultHumansMaleRewardSportsYoung Adult

Identifiers

PMID31619756
PMCPMC6795881

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.