Forced-choice associative recognition: Implications for global-memory models.

1993 ◽  
Vol 19 (4) ◽  
pp. 871-881 ◽  
Author(s):  
Steven E. Clark ◽  
Alden Hori ◽  
Daniel E. Callan
Keyword(s):  
Forced Choice ◽  
Memory Models ◽  
Associative Recognition ◽  
Global Memory

Nonsense Syllables in Associative Recognition Tasks: Implications for Global Memory Models

1998 ◽  
Vol 82 (1) ◽  
pp. 95-105
Author(s):  
Michael P. Kaschak ◽  
Carl J. Charnetski
Keyword(s):  
Recognition Task ◽  
Empirical Support ◽  
Memory Models ◽  
Associative Recognition ◽  
Global Memory ◽  
Superior Performance ◽  
Common Component ◽  
List Length Effect ◽  
Nonsense Syllables

Recent research into global memory models has focused on gaining empirical support for the predictions these models make. Clark and his colleagues produced no conditions in which a test item and a distractor shared a common component within a number of experiments using an associative recognition task and have reasoned that recall might play a role in the task. This experiment used nonsense syllables to reduce further the role of recall in the associative recognition task and produce the predicted advantage from overlap. The manipulations produced equal performance between test conditions (overlapping vs nonoverlapping) and superior performance on a long list versus a short list, i.e., a negative list-length effect. The implications of these findings for various global memory models are discussed.

Testing global memory models using ROC curves.

1992 ◽  
Vol 99 (3) ◽  
pp. 518-535 ◽  
Author(s):  
Roger Ratcliff ◽  
Ching-fan Sheu ◽  
Scott D. Gronlund
Keyword(s):  
Roc Curves ◽  
Memory Models ◽  
Global Memory

What are the functional deficits produced by hippocampal and perirhinal cortex lesions?

1999 ◽  
Vol 22 (3) ◽  
pp. 460-461 ◽  
Author(s):  
A. R. Mayes ◽  
R. van Eijk ◽  
P. A. Gooding ◽  
C. L. Isaac ◽  
J. S. Holdstock
Keyword(s):  
Perirhinal Cortex ◽  
Item Recognition ◽  
Memory Deficit ◽  
Associative Recognition ◽  
Global Memory ◽  
Functional Deficits ◽  
Target Article ◽  
Papez Circuit ◽  
Item Item

A hippocampal patient is described who shows preserved item recognition and simple recognition-based recollection but impaired recall and associative recognition. These data and other evidence suggest that contrary to Aggleton & Brown's target article, Papez circuit damage impairs only complex item-item-context recollection. A patient with perirhinal cortex damage and a delayed global memory deficit, apparently inconsistent with A&B's framework, is also described.

scholarly journals The effects of age in four alternative forced-choice item and associative recognition tasks.

2010 ◽  
Vol 25 (1) ◽  
pp. 235-238 ◽  
Author(s):  
Meredith M. Patterson ◽  
Christopher Hertzog
Keyword(s):  
Forced Choice ◽  
Associative Recognition

A competitive manifesto

2000 ◽  
Vol 23 (4) ◽  
pp. 487-488
Author(s):  
R. Hans Phaf ◽  
Gezinus Wolters
Keyword(s):  
Associative Learning ◽  
Forced Choice ◽  
Memory Models ◽  
Competitive Learning ◽  
Perceptual Identification ◽  
Distributed Representations

The distinction made by Page between localist and distributed representations seems confounded by the distinction between competitive and associative learning. His manifesto can also be read as a plea for competitive learning. The power of competitive models can even be extended further, by simulating similarity effects in forced-choice perceptual identification (Ratcliff & McKoon 1997) that have defied explanation by most memory models.

scholarly journals Mice in a labyrinth exhibit rapid learning, sudden insight, and efficient exploration

eLife ◽  
2021 ◽  
Vol 10 ◽  
Author(s):  
Matthew Rosenberg ◽  
Tony Zhang ◽  
Pietro Perona ◽  
Markus Meister
Keyword(s):  
Search Algorithm ◽  
Forced Choice ◽  
Learning Rate ◽  
Global Memory ◽  
Complex Tasks ◽  
Rapid Learning ◽  
Efficient Exploration

Animals learn certain complex tasks remarkably fast, sometimes after a single experience. What behavioral algorithms support this efficiency? Many contemporary studies based on two-alternative-forced-choice (2AFC) tasks observe only slow or incomplete learning. As an alternative, we study the unconstrained behavior of mice in a complex labyrinth and measure the dynamics of learning and the behaviors that enable it. A mouse in the labyrinth makes ~2000 navigation decisions per hour. The animal explores the maze, quickly discovers the location of a reward, and executes correct 10-bit choices after only 10 reward experiences - a learning rate 1000-fold higher than in 2AFC experiments. Many mice improve discontinuously from one minute to the next, suggesting moments of sudden insight about the structure of the labyrinth. The underlying search algorithm does not require a global memory of places visited and is largely explained by purely local turning rules.

scholarly journals Mice in a labyrinth: Rapid learning, sudden insight, and efficient exploration

2021 ◽  
Author(s):  
Matthew Rosenberg ◽  
Tony Zhang ◽  
Pietro Perona ◽  
Markus Meister
Keyword(s):  
Search Algorithm ◽  
Forced Choice ◽  
Learning Rate ◽  
Global Memory ◽  
Complex Tasks ◽  
Rapid Learning ◽  
Efficient Exploration

AbstractAnimals learn certain complex tasks remarkably fast, sometimes after a single experience. What behavioral algorithms support this efficiency? Many contemporary studies based on two-alternative-forced-choice (2AFC) tasks observe only slow or incomplete learning. As an alternative, we study the unconstrained behavior of mice in a complex labyrinth and measure the dynamics of learning and the behaviors that enable it. A mouse in the labyrinth makes ~2000 navigation decisions per hour. The animal quickly discovers the location of a reward in the maze and executes correct 10-bit choices after only 10 reward experiences – a learning rate 1000-fold higher than in 2AFC experiments. Many mice improve discontinuously from one minute to the next, suggesting moments of sudden insight about the structure of the labyrinth. The underlying search algorithm does not require a global memory of places visited and is largely explained by purely local turning rules.

Forced Choice Associative Recognition

1992 ◽  
Author(s):  
Steven E. Clark ◽  
Alden Hori ◽  
Daniel E. Callan
Keyword(s):  
Forced Choice ◽  
Associative Recognition
Sign in / Sign up

Export Citation Format

Share Document