The Markovian and Memoryless Properties of Visual System: Evidence from Serial Face Processing
The visual system can be viewed and studied as an information processing system. If so, then the visual system should follow specific fundamental properties: either a memory or a memoryless system. Previous studies in serial dependence in vision found that the perception of the current stimulus is positively determined by the previous one. However, we are not entirely sure whether this phenomenon is a Markov processing. In this study, participants were asked to rate the social characteristics (attractiveness, trustworthiness, and dominance) of a face, either followed by the same characteristic (the one-trait condition) or another one (the two-trait condition) in randomized orders. By doing so, we can directly test the contribution of the previous input and output to the current output and thus study the properties of the system. Using Derivative of Gaussian, Markov Chain and Linear Mixed effect modeling, convergent results suggested that the serial dependence was absent and the memoryless and Markovian properties were violated in the two-trait condition when testing both attractiveness and dominance, but not in the other conditions. Thus, different facets of (presumably) the same computational task may follow asymmetrical system properties. The study also develops serial dependence as an effective technique to reveal the relationships between different computation tasks.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Practical and scalable simulations of non-Markovian stochastic processes and temporal networks with individual node properties
Discrete stochastic processes are prevalent in natural systems, with applications in physics, biochemistry, epidemiology, sociology, and finance. While analytic solutions often cannot be derived, existing simulation fram…
AttributeEpidemiologySociologyNon-Markovian policies occupancy measures
A central object of study in Reinforcement Learning (RL) is the Markovian policy, in which an agent's actions are chosen from a memoryless probability distribution, conditioned only on its current state. The family of Ma…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Memoryless Policy Iteration for Episodic POMDPs
Memoryless and finite-memory policies offer a practical alternative for solving partially observable Markov decision processes (POMDPs), as they operate directly in the output space rather than in the high-dimensional be…
Accurate stochastic simulation algorithm for multiscale models of infectious diseases
In the infectious disease literature, significant effort has been devoted to studying dynamics at a single scale. For example, compartmental models describing population-level dynamics are often formulated using differen…
Volterra Generative Models
Score-based diffusion models typically use Brownian perturbations, which provide tractable reverse-time dynamics but impose memoryless noising. We introduce Volterra generative models, a continuous-time score-based frame…