A runs-test 算法：偶发强化与反应跑结构。
A runs-test algorithm: contingent reinforcement and response run structures.
机构信息
Department of Psychology, Keio University, 2-15-45, Mita, Minato-ku, Tokyo 108-8345, Japan.
出版信息
J Exp Anal Behav. 2010 Jan;93(1):61-80. doi: 10.1901/jeab.2010.93-61.
Four rats' choices between two levers were differentially reinforced using a runs-test algorithm. On each trial, a runs-test score was calculated based on the last 20 choices. In Experiment 1, the onset of stimulus lights cued when the runs score was smaller than criterion. Following cuing, the correct choice was occasionally reinforced with food, and the incorrect choice resulted in a blackout. Results indicated that this contingency reduced sequential dependencies among successive choice responses. With one exception, subjects' choice rule was well described as biased coin flipping. In Experiment 2, cuing was removed and the reinforcement criterion was changed to a percentile score based on the last 20 reinforced responses. The results replicated those of Experiment 1 in successfully eliminating first-order dependencies in all subjects. For 2 subjects, choice allocation was approximately consistent with nonbiased coin flipping. These results suggest that sequential dependencies may be a function of reinforcement contingency.
四只老鼠通过运行测试算法对两个操纵杆进行了不同的强化选择。在每次试验中，根据最后 20 次选择计算一次运行测试得分。在实验 1 中，刺激灯的出现提示运行得分小于标准。提示后，正确的选择偶尔会得到食物强化，而错误的选择会导致黑屏。结果表明，这种条件作用减少了连续选择反应之间的序列依赖。除了一个例外，受试者的选择规则很好地描述为偏向硬币投掷。在实验 2 中，取消了提示，并将强化标准更改为基于最后 20 次强化反应的百分位数得分。结果成功地在所有受试者中消除了一阶依赖。对于 2 个受试者，选择分配与无偏硬币投掷大致一致。这些结果表明，序列依赖可能是强化条件作用的一个函数。
Zotero 插件