Quantum dynamics I. Peter Kvam. Michigan State University Max Planck Institute for Human Development
|
|
- Alfred Barker
- 5 years ago
- Views:
Transcription
1 Quantum dynamics I Peter Kvam Michigan State University Max Planck Institute for Human Development Full-day workshop on quantum models of cognition 37 th Annual Meeting of the Cognitive Science Society
2 Dynamics Busemeyer, J. R., Wang, Z., & Townsend, J. T. (006). Quantum dynamics of human decision making. Journal of Mathematical Psychology, 50 (3), Kvam, P. D., Pleskac, T. J., Yu, S., & Busemeyer, J. R. (in press). Proceedings of the National Academy of Sciences.
3 Dynamics - Intro We talked a bit about superposition already
4 Superposition
5 Dynamics - Intro We talked a bit about superposition already Also, how to evaluate beliefs Taking a measurement of a quantum cognitive system This is one way of changing states
6 Measurement
7 Rescaling
8 Dynamics - Intro We talked a bit about superposition already Also, how to evaluate beliefs Taking a measurement of a quantum cognitive system This is one way of changing states Next, we ll examine how beliefs change over time with new information Rotations in n-dimensional Hilbert space Specified by unitary operators
9 Rotation
10 Unitary transformations Rotations are specified by unitary matrices Non-commutative with other operators Simple in geometric space, but more difficult to construct for higher-dimensional spaces we ll be using E.g. for response times Or for probability judgments (0, 10, 0,, 100%) Or for preferences on a Likert scale (1,, 3,, 9) We ll be using compatible states for multiple responses
11 Random walk / diffusion models Memory recognition Ratcliff (1978) Perceptual discrimination Link & Heath (1975) Usher & McClelland (001) Categorization Nosofsy & Palmeri (1997) Ashby (000) Preferential / risky decisions Busemeyer & Townsend (1993) Sensory processing Smith (1995) Rudd (1996) Multi-attribute decisions Roe, Busemeyer & Townsend (001) Diederich (1997) Neural activation Gold & Shadlen (007) Schall (003) Liu & Pleskac (011) Confidence judgments Pleskac & Busemeyer (010) Ratcliff & Starns (013)
12 Random walk / diffusion models A decision-maker has to choose between two options ( left and right ) Each new piece of information favors one or the other Increments or decrements current belief state Continues until a desired level of confidence is reached E.g. 30% / 70%
13 Diffusion path
14 Markov random walk A person is only in 1 state at any given time, but an external observer is uncertain about which state Represented as a distribution of probabilities across states: mixed state vector φ x (t) Transitions during time t are given by the transition matrix P(t) φ x t = P t φ x (0)
15 Quantum random walk A person can simultaneously entertain multiple levels of evidence / beliefs at the same time Represented as a distribution of probability amplitudes across states: superposition state vector ψ x (t) Transitions specified by the unitary matrix U(t) ψ x t = U t ψ x (0)
16 Specifying transition matrices Both models use a drift rate (μ) and a diffusion rate (σ ) Drift: average rate of true sampling Diffusion: average rate of random / noise sampling The Markov random walk uses an intensity matrix and the Kolmogorov forward equation to specify P(t): d ( t) Q ( t) dt Qt ( t) e (0) The quantum walk uses a (Hermitian) Hamiltonian and the Schrödinger equation to specify U(t): d ( t) i H ( t) dt iht ( t) e (0)
17 Specifying transition matrices For the Markov model, the columns of the intensity matrix must sum to zero, i q ij = 0 For the quantum model, the Hamiltonian must be Hermitian, h ij = h ji *
18 Specifying the intensity matrix (Markov model) 1,, 1, 1, 1 jj j j j j q q q Example: 5-state model Q
19 Specifying the intensity matrix (Markov model) 1,, 1, 1, 1 jj j j j j q q q Example: 5-state model Q Drift
20 Specifying the intensity matrix (Markov model) 1,, 1, 1, 1 jj j j j j q q q Example: 5-state model Q Diffusion
21 Specifying the Hamiltonian (Quantum model) h i,i = i and h i,i+1 = h i,i-1 = Example: 5-state model H 1 / m / m / m / m / m m = # of states
22 Specifying the Hamiltonian (Quantum model) Drift Diffusion h i,i = i and h i,i+1 = h i,i-1 = Example: 5-state model H 1 / m / m / m / m / m m = # of states
23 Initial state Markov random walk Quantum walk Mixed State Superposition State Pr( conf x t) ( t). Pr( conf x t) ( t) x x
24 After transitions Markov random walk Quantum walk μ μ P t e P t Q ( t1t0 ( ) ) ( ) q q q 1 0 j, j j1, j j1, j ( ) / ( ) / ( 1 0 ( ) ih t t t e ) ( t ) h h 1 0 j, j j ( * ) # states h j1, j j1, j
25 Response times Markov model 0.01 Stopping Time Density 0.7 Stopping Time Distribution Probability Correct InCorrect Probability Correct InCorrect Time in msec Time in msec Busemeyer, Wang, & Townsend (006)
26 Response times quantum model 0.07 Stopping Time Density 1 Stopping Time Distribution Probability Correct InCorrect Probability Correct InCorrect Time in msec Time in msec Busemeyer, Wang, & Townsend (006)
27 Response time comparison Markov random walk outperformed quantum walk in Busemeyer, Wang, & Townsend (006) A partially coherent quantum random walk outperformed the diffusion model in Fuss & Navarro (013)
28 Lunch? We ll start up again at 1 p.m. Afternoon: 1- p.m. Quantum Dynamics II Peter Kvam -:30 p.m. Advanced tools for building quantum models I James Yearsley :30-3 p.m. Coffee break 3-3:45 p.m. Advanced tools for building quantum models II James Yearsley 3:45-4 p.m. Discussion / questions Jennifer, James, Peter
29 Quantum Dynamics II Peter Kvam Michigan State University Max Planck Institute for Human Development Full-day workshop on quantum models of cognition 37 th Annual Meeting of the Cognitive Science Society
30 Multiple responses As in the earlier classical models, the Markov model obeys the law of total probability This applies to sequential responses as well: Pr C = x = Pr C = x A, t 1 Pr A, t 1 + Pr C = x ~A, t 1 Pr(~A, t 1 )
31 Multiple responses As in the earlier classical models, the Markov model obeys the law of total probability This applies to sequential responses as well: Pr C = x = Pr C = x A, t 1 Pr A, t 1 + Pr C = x ~A, t 1 Pr(~A, t 1 ) If a person chooses A at time t 1, it does not change their state Therefore, subsequent responses should not be affected (e.g. at time t ) We tested this using a -response task Choice (t 1 ) then confidence (t )
32 Markov prediction M y = Maps evidence states onto confidence M correct, M incorrect = Maps evidence onto correct / incorrect states L = sums the probabilities across states I = Identity matrix
33 Markov prediction Law of total probability holds Choice or no choice at t 1 should make no difference in marginal distributions of confidence ratings at t
34 Quantum prediction M y = Maps evidence states onto confidence M correct, M incorrect = Maps evidence onto correct / incorrect states L = sums the probabilities across states I = Identity matrix
35 Quantum prediction Law of total probability is violated A choice made at time t 1 should result in different marginal distributions of confidence when rated at time t
36 Random dot motion stimulus
37 Experiment Kvam, Pleskac, Yu, & Busemeyer (in press)
38 Model predictions Markov Random Walk w Quantum Random Walk w Mixed State Superposition State Pr( conf x t) ( t). Pr( conf x t) ( t) x x Kvam, Pleskac, Yu, & Busemeyer (in press)
39 Model predictions Markov Random Walk Quantum Random Walk Kvam, Pleskac, Yu, & Busemeyer (in press)
40 Model predictions Markov Random Walk Quantum Random Walk 1 Pr( correct t) ( t ) ( t ) ( t correct) n 1 n ( t1), ( t1) 1 ( t ) ( t ) n 1 n51 1 Pr( correct) ( t ) ( t ) x 1 x51 1 proj51 100( t1) proj50( t1) ( t 1 correct) 1 proj51 100( t1) proj50( t1) Kvam, Pleskac, Yu, & Busemeyer (in press)
41 Model predictions Markov Random Walk Quantum Random Walk ( 1 ( ) Q t t ) 1 t e ( t ) 1 ( t ) e ( t ) ih ( t t ) 1 Kvam, Pleskac, Yu, & Busemeyer (in press)
42 Model predictions Markov Random Walk Quantum Random Walk φ t no choice = φ t choice ψ t no choice ψ(t choice) Kvam, Pleskac, Yu, & Busemeyer (in press)
43 Experiment Kvam, Pleskac, Yu, & Busemeyer (in press)
44 Methods 4 conditions 4 levels of dot coherence ( / 4 / 8 / 16 %) 3 levels of second stage time (50 / 750 / 1500 ms) main conditions (choice / no-choice) 9 Participants, Michigan State University students Each attended 6 total sessions Total ~3600 trials per participant Modeled individual level data
45 Results Cumulative distribution of confidence ratings Clear difference between mean confidence in choice (M = Kvam, Pleskac, Yu, & Busemeyer (in press)
46 Results Kvam, Pleskac, Yu, & Busemeyer (in press)
47 Model fitting Interference effect is clear in the data Qualitative evidence against the Markov model Compare quantitative model fits 4 parameters: Drift multiplier (δ), gives drift as a linear function of coherence Diffusion (σ ) Starting point variability (w) Second-stage decay (γ), attenuates drift after t 1 Fitting method: Grid approximation of likelihood function Sampled evenly across 1 x 1 x 51 x 1 grid of the 4 parameters Computed Pr(Data Model) at each point Computed Bayes Factor using uniform priors over the grid
48 Results model fits Kvam, Pleskac, Yu, & Busemeyer (in press)
49 Results model fits Kvam, Pleskac, Yu, & Busemeyer (in press)
50 Results model fits Kvam, Pleskac, Yu, & Busemeyer (in press)
51 Interference effects More extreme judgments in no-choice relative to choice was unexpected Confirmation bias would suggest the opposite effect But there is some precedent: Sniezek et al (006) higher no choice than choice confidence in general knowledge task Old dissonance work by Walster (1964) and Brehm & Wicklund (1970) Crano & Messé (1970) suggest that effects in preference should change direction over time
52 Dissonance - Background Brehm, 1955; Festinger, 1957; Festinger, 1963 Dissonance theory is based on the finding that decisions between alternatives affect subsequent preferences Canonical finding is that people bring their preferences into alignment with their decisions Bolstering A B Choose A > B A B Time 1 Time
53 Free choice paradigm
54 Dissonance - Background Brehm, 1955; Festinger, 1957; Festinger, 1963 Dissonance theory is based on the finding that decisions between alternatives affect subsequent preferences Canonical finding is that people bring their preferences into alignment with their decisions Bolstering A B Choose A > B A B Time 1 Time Time-dependent bolstering
55 Dissonance - Suppression Early dissonance work also found the opposite effect, where preference for a chosen option decreased Suppression
56 Dissonance - Suppression Early dissonance work also found the opposite effect, where preference for a chosen option decreased Suppression Time-dependent suppression
57 Dissonance - Background Brehm, 1955; Festinger, 1957; Festinger, 1963 In theory, choice is the key factor A B Choose A > B A B Time 1 Time No A B A B Choice Time 1 Time Choice-dependent bolstering
58 Dissonance - Background Brehm, 1955; Festinger, 1957; Festinger, 1963 In theory, choice is the key factor Choose A > B A B A B Time 1 Time A B No Choice A B Time 1 Time Choice-dependent suppression
59 Issues Why do these effects occur? Dissonance theory suggests that a choice creates a new (conflicted) cognitive state Which effect occurs when? Effects depend on time and item type Time-dependent / choice-dependent, bolstering / suppression What models can account for these phenomena? Dissonance theory provides no quantitative predictions Extant models can predict time-dependent bolstering, but not time-dependent suppression Extant process models do not predict choice-dependent bolstering or suppression effects
60 Task Stimulus onset Response 1 (Choice / Click) Response (Rate preference)
61 Task 1 st response Worth $11 Rating: * * * Average Meal: $17 Distance: 4.7 miles < > Worth $13 Rating: * * * Average Meal: $1 Distance: 0. miles
62 Task nd response Worth $11 Rating: * * * Average Meal: $17 Distance: 4.7 miles Worth $13 Rating: * * * Average Meal: $1 Distance: 0. miles
63 Task Stimulus onset Response 1 Choice / No-choice Response (Rate preference)
64 Decision field theory (DFT) framework Busemeyer & Townsend, 1993
65 Classical (Markov) DFT Busemeyer & Townsend, 1993; Busemeyer & Diederich, 00 Preferences represented as a point A person can only give one response at any given time Mixed state vector Decisions and preferences are given by this point They do not change its position or system dynamics
66 Classical (Markov) DFT Busemeyer & Townsend, 1993; Busemeyer & Diederich, 00 Preferences represented as a point A person can only give one response at any given time Mixed state vector Decisions and preferences are given by this point They do not change its position or system dynamics Predicts no choice-dependent effects
67 Classical (Markov) DFT Busemeyer & Townsend, 1993; Busemeyer & Diederich, 00
68 Quantum DFT Based on the quantum random walk model (Busemeyer et al, 006; Kvam et al, in press) Preferences represented as a superposition across preference levels At any given point, they may be entertaining many possible preferences simultaneously Superposition state vector Preferences are constructed by collapsing this state onto possible preference levels
69 Quantum DFT Prefer B Indifferent Prefer A
70 Quantum DFT Prefer B Pr( A) x xa Indifferent Prefer A
71 Quantum DFT Prefer B Pr( y A) xa y x Indifferent Prefer A
72 Quantum DFT Choice condition No choice condition States after choice / click (t 1 )
73 Quantum DFT
74 Quantum DFT Time-dependent bolstering
75 Quantum DFT Time-dependent suppression
76 Quantum DFT Choice-dependent suppression
77 Quantum DFT Choice-dependent bolstering
78 Model predictions (review) Classical DFT Should be no choice-depdent bolstering or suppression effects or time-dependent suppression No choice = choice Mean preference strength should change monotonically Quantum DFT Should be time-dependent and choice-dependent bolstering and suppression effects No choice choice Mean preference strength should oscillate over time Preference should reach an asymptote and then stop changing Preference will vary back and forth, asymptote will be achieved late if at all
79 Task Stimulus onset Response 1 (Choice / Click) Response (Rate preference) 5 seconds 3 / 6 / 9 / 18 / 30 / 45 seconds 118 Participants, 48 trials each (8 each delay) Randomly assigned to choice / no choice Stimuli divided into low / medium / high contrast based on attributes
80 Results
81 Model fitting Each model used 4 parameters: Drift (µ): sets drift rate as a linear function of item difference, grouped by contrast level Diffusion (σ ): sets noise in accumulation process Initial distribution width (w): sets prior beliefs Decay (d): sets the amount of information processing per unit time after a decision is made (relative to pre-decision) Used a 31 x 31 x 31 x 10 grid approximation of likelihood: Joint distributions of preference ratings for all conditions Choice probabilities based on item attributes + weights Uniform priors used to calculate Bayes Factor
82 Model fits z
83 Model fits
84 Model fits
85 Model fits
86 Model fits Log Bayes Factor (QDFT : DFT) = (very strong evidence for QDFT)
87 Theory performance Accounts for Dissonance Classical DFT Quantum DFT Time-dependent bolstering Time-dependent suppression ~ ~ Choice-dependent bolstering ~ Choice-depedent suppression ~ ~ Time course of preference Memorylessness Oscillations in preference Yes ~ With modifications
88 Conclusions Dissonance study Dissonance is a verbal theory, doesn t offer a quantitative or dynamic account of preference Classical decision field theory doesn t offer a constructive characterization of decision-making Only preference formation via information gathering Quantum decision field theory addresses both issues + Predicts (surprising) oscillations in preference + Offers better fits to the empirical data than DFT
89 Remaining issues Confidence ratings are fit as nominal categories Errors in fit don t take ordinal properties into account Example: Predicting a rating of 50 when it was actually 100 is (fitness-wise) the same as predicting 95 when it was actually 100 Therefore, unless fit is nearly perfect, predictions for mean confidence will suffer By extension, so will fits to oscillations Where is the stable bolstering effect from dissonance studies? Delays may be too short Stimuli may be too objective (bolstering may rely on distortion)
90 Conclusions - Quantum Dynamics A quantum perspective on dynamic decision-making opens up a wealth of new questions Challenges assumptions about belief representation, measurement, and interaction with information accumulation Violations of the law of total probability: interference effects Quantum walks can out-perform Markov model (inference tasks) as well as decision field theory (preference tasks) Predicts a effects (bolstering, suppression) which have previously been absent from models of evidence accumulation But still more work to be done!
QUANTUM MODELS OF COGNITION AND DECISION
QUANTUM MODELS OF COGNITION AND DECISION Jerome R. Busemeyer Indiana University Supported by AFOSR WHAT IS THE GOAL OF QUANTUM COGNITION AND DECISION? Not a physical/neurobiological theory of the brain
More informationA Comparison of Sequential Sampling Models for Two-Choice Reaction Time
Psychological Review Copyright 2004 by the American Psychological Association 2004, Vol. 111, No. 2, 333 367 0033-295X/04/$12.00 DOI: 10.1037/0033-295X.111.2.333 A Comparison of Sequential Sampling Models
More informationQuantum Probability in Cognition. Ryan Weiss 11/28/2018
Quantum Probability in Cognition Ryan Weiss 11/28/2018 Overview Introduction Classical vs Quantum Probability Brain Information Processing Decision Making Conclusion Introduction Quantum probability in
More informationReminder:!! homework grades and comments are on OAK!! my solutions are on the course web site
PSY318 Week 10 Reminder: homework grades and comments are on OAK my solutions are on the course web site Modeling Response Times Nosofsky & Palmeri (1997) Nosofsky & Palmeri (1997) Palmeri (1997) Response
More informationJournal of Mathematical Psychology. Empirical comparison of Markov and quantum models of decision making
Journal of Mathematical Psychology 53 (2009) 423 433 Contents lists available at ScienceDirect Journal of Mathematical Psychology journal homepage: www.elsevier.com/locate/jmp Empirical comparison of Markov
More informationThe Diffusion Model of Speeded Choice, from a Rational Perspective
The Diffusion Model of Speeded Choice, from a Rational Perspective Matt Jones, University of Colorado August 7, 017 1 Binary Decision Tasks This chapter considers tasks in which an experimental subject
More informationMulti-stage sequential sampling models with finite or infinite time horizon and variable boundaries
1 2 3 4 5 6 Multi-stage sequential sampling models with finite or infinite time horizon and variable boundaries Adele Diederich & Peter Oswald a,b, a Department of Psychology & Methods, Jacobs University,
More informationJ. R. Busemeyer Psychological and Brain Sciences, Indiana University, Bloomington, In, 47405, USA
1 J. R. Busemeyer Psychological and Brain Sciences, Indiana University, Bloomington, In, 47405, USA E-mail: jbusemey@indiana.edu J. S. Trueblood Cognitive Science Program, Indiana University, Bloomington,
More informationExtending a biologically inspired model of choice: multialternatives, nonlinearity and value-based multidimensional choice
This article is in press in Philosophical Transactions of the Royal Society, B. Extending a biologically inspired model of choice: multialternatives, nonlinearity and value-based multidimensional choice
More information6 Extending a biologically inspired model of choice: multi-alternatives, nonlinearity, and value-based multidimensional choice
6 Extending a biologically inspired model of choice: multi-alternatives, nonlinearity, and value-based multidimensional choice Rafal Bogacz, Marius Usher, Jiaxiang Zhang, and James L. McClelland Summary
More informationIntroduction to Quantum Probability. for Social and Behavioral Scientists
Quantum Probability 1 Introduction to Quantum Probability for Social and Behavioral Scientists Jerome R. Busemeyer Indiana University June 1, 2008 Send correspondence to: Jerome R. Busemeyer Department
More informationA Computational Model for Constructing Preferences for Multiple Choice Options
A Computational Model for Constructing Preferences for Multiple Choice Options Lena M. Wollschlaeger (l.wollschlaeger@jacobs-university.de) Jacobs University Bremen, Psychology & Methods Campus Ring, 28759
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationGeneralisation and inductive reasoning. Computational Cognitive Science 2014 Dan Navarro
Generalisation and inductive reasoning Computational Cognitive Science 2014 Dan Navarro Where are we at? Bayesian statistics as a general purpose tool for doing inductive inference A specific Bayesian
More informationGeneral Recognition Theory Extended to Include Response Times: Predictions for a Class of Parallel Systems
Wright State University CORE Scholar Psychology Faculty Publications Psychology 1-1-2012 General Recognition Theory Extended to Include Response Times: Predictions for a Class of Parallel Systems James
More informationarxiv: v2 [quant-ph] 23 Aug 2018
Episodic source memory over distribution by quantum-like dynamics a model exploration. Broekaert, J., Busemeyer, J. Department of Psychological and Brain Sciences, Indiana University, Bloomington. jbbroeka@indiana.edu,
More informationA Stochastic Version of General Recognition Theory
Journal of Mathematical Psychology 44, 310329 (2000) doi:10.1006jmps.1998.1249, available online at http:www.idealibrary.com on A Stochastic Version of General Recognition Theory F. Gregory Ashby University
More informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
More informationA Glimpse of Quantum Computation
A Glimpse of Quantum Computation Zhengfeng Ji (UTS:QSI) QCSS 2018, UTS 1. 1 Introduction What is quantum computation? Where does the power come from? Superposition Incompatible states can coexist Transformation
More informationA Simple Model of Quantum Trajectories. Todd A. Brun University of Southern California
A Simple Model of Quantum Trajectories Todd A. Brun University of Southern California Outline 1. Review projective and generalized measurements. 2. A simple model of indirect measurement. 3. Weak measurements--jump-like
More informationPUBLISHED VERSION Massachusetts Institute of Technology. As per received 14/05/ /08/
PUBLISHED VERSION Michael D. Lee, Ian G. Fuss, Danieal J. Navarro A Bayesian approach to diffusion models of decision-making and response time Advances in Neural Information Processing Systems 19: Proceedings
More informationLecture 3: Constructing a Quantum Model
CS 880: Quantum Information Processing 9/9/010 Lecture 3: Constructing a Quantum Model Instructor: Dieter van Melkebeek Scribe: Brian Nixon This lecture focuses on quantum computation by contrasting it
More informationComparison of Quantum and Bayesian Inference Models
Comparison of Quantum and Bayesian Inference Models Jerome R. Busemeyer and Jennifer Trueblood 1 1 Cognitive Science, Indiana University 1101 E. 10 th Street, Bloomington Indiana, 47405 jbusemey@indiana.edu
More informationA Quantum Theoretical Explanation for Probability Judgment Errors
Psychological Review 2011 American Psychological Association 2011, Vol. 118, No. 2, 193 218 0033-295X/11/$12.00 DOI: 10.1037/a0022542 A Quantum Theoretical Explanation for Probability Judgment Errors Jerome
More informationRotations in Quantum Mechanics
Rotations in Quantum Mechanics We have seen that physical transformations are represented in quantum mechanics by unitary operators acting on the Hilbert space. In this section, we ll think about the specific
More informationBayesian Inference. Will Penny. 24th February Bayesian Inference. Will Penny. Bayesian Inference. References
24th February 2011 Given probabilities p(a), p(b), and the joint probability p(a, B), we can write the conditional probabilities p(b A) = p(a B) = p(a, B) p(a) p(a, B) p(b) Eliminating p(a, B) gives p(b
More informationAn Empirical Test of Type-Indeterminacy in the Prisoner s Dilemma
An Empirical Test of Type-Indeterminacy in the Prisoner s Dilemma Peter D. Kvam 1(&), Jerome R. Busemeyer 2, and Ariane Lambert-Mogiliansky 3 1 Michigan State University, East Lansing, MI, USA kvampete@msu.edu
More informationLecture 2. Estimating Single Population Parameters 8-1
Lecture 2 Estimating Single Population Parameters 8-1 8.1 Point and Confidence Interval Estimates for a Population Mean Point Estimate A single statistic, determined from a sample, that is used to estimate
More informationA Brief and Friendly Introduction to Mixed-Effects Models in Linguistics
A Brief and Friendly Introduction to Mixed-Effects Models in Linguistics Cluster-specific parameters ( random effects ) Σb Parameters governing inter-cluster variability b1 b2 bm x11 x1n1 x21 x2n2 xm1
More information1 Fundamental physical postulates. C/CS/Phys C191 Quantum Mechanics in a Nutshell I 10/04/07 Fall 2007 Lecture 12
C/CS/Phys C191 Quantum Mechanics in a Nutshell I 10/04/07 Fall 2007 Lecture 12 In this and the next lecture we summarize the essential physical and mathematical aspects of quantum mechanics relevant to
More informationApplying Quantum Principles to Psychology
Applying Quantum Principles to Psychology arxiv:1405.6427v1 [q-bio.nc] 25 May 2014 Jerome R Busemeyer Indiana University, USA Zheng Wang The Ohio State University, USA Andrei Khrennikov and Irina Basieva
More informationImplementing Competitive Learning in a Quantum System
Implementing Competitive Learning in a Quantum System Dan Ventura fonix corporation dventura@fonix.com http://axon.cs.byu.edu/dan Abstract Ideas from quantum computation are applied to the field of neural
More informationResponse Selection Using Neural Phase Oscillators
Response Selection Using Neural Phase Oscillators J. Acacio de Barros 1 A symposium on the occasion of Patrick Suppes 90th birthday March 10, 2012 1 With Pat Suppes and Gary Oas (Suppes et al., 2012).
More informationOn Quantum Decision Trees
On Quantum Decision Trees Subhash Kak Abstract Quantum decision systems are being increasingly considered for use in artificial intelligence applications. Classical and quantum nodes can be distinguished
More informationData Analysis for an Absolute Identification Experiment. Randomization with Replacement. Randomization without Replacement
Data Analysis for an Absolute Identification Experiment 1 Randomization with Replacement Imagine that you have k containers for the k stimulus alternatives The i th container has a fixed number of copies
More informationShort Course in Quantum Information Lecture 2
Short Course in Quantum Information Lecture Formal Structure of Quantum Mechanics Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture
More informationA quantum probability explanation for the inverse fallacy
A quantum probability explanation for the inverse fallacy Riccardo Franco Jerome Busemeyer Indiana University Send Correspondence to Riccardo Franco, riccardo.franco@polito.it Abstract This article presents
More informationEPSY 905: Fundamentals of Multivariate Modeling Online Lecture #7
Introduction to Generalized Univariate Models: Models for Binary Outcomes EPSY 905: Fundamentals of Multivariate Modeling Online Lecture #7 EPSY 905: Intro to Generalized In This Lecture A short review
More informationMathematics Standards for High School Financial Algebra A and Financial Algebra B
Mathematics Standards for High School Financial Algebra A and Financial Algebra B Financial Algebra A and B are two semester courses that may be taken in either order or one taken without the other; both
More information1 Mathematical preliminaries
1 Mathematical preliminaries The mathematical language of quantum mechanics is that of vector spaces and linear algebra. In this preliminary section, we will collect the various definitions and mathematical
More informationUnfalsifiability and Mutual Translatability of Major Modeling Schemes for Choice Reaction Time
This article may not exactly replicate the final version published in the APA journal. It is not the copy of record. URL for data and model code: http://matt.colorado.edu/universality Unfalsifiability
More informationStructure learning in human causal induction
Structure learning in human causal induction Joshua B. Tenenbaum & Thomas L. Griffiths Department of Psychology Stanford University, Stanford, CA 94305 jbt,gruffydd @psych.stanford.edu Abstract We use
More informationIntroduction to Quantum Mechanics
Introduction to Quantum Mechanics R. J. Renka Department of Computer Science & Engineering University of North Texas 03/19/2018 Postulates of Quantum Mechanics The postulates (axioms) of quantum mechanics
More informationIntroduction to Statistical Methods for High Energy Physics
Introduction to Statistical Methods for High Energy Physics 2011 CERN Summer Student Lectures Glen Cowan Physics Department Royal Holloway, University of London g.cowan@rhul.ac.uk www.pp.rhul.ac.uk/~cowan
More informationJoint, Conditional, & Marginal Probabilities
Joint, Conditional, & Marginal Probabilities The three axioms for probability don t discuss how to create probabilities for combined events such as P [A B] or for the likelihood of an event A given that
More informationChapter 1. Introduction
Chapter 1 Introduction Symbolical artificial intelligence is a field of computer science that is highly related to quantum computation. At first glance, this statement appears to be a contradiction. However,
More informationAlgorithm-Independent Learning Issues
Algorithm-Independent Learning Issues Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Spring 2007 c 2007, Selim Aksoy Introduction We have seen many learning
More informationGroup Sequential Designs: Theory, Computation and Optimisation
Group Sequential Designs: Theory, Computation and Optimisation Christopher Jennison Department of Mathematical Sciences, University of Bath, UK http://people.bath.ac.uk/mascj 8th International Conference
More informationProblem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30
Problem Set MAS 6J/1.16J: Pattern Recognition and Analysis Due: 5:00 p.m. on September 30 [Note: All instructions to plot data or write a program should be carried out using Matlab. In order to maintain
More informationIntroduction to Bayesian Statistics and Markov Chain Monte Carlo Estimation. EPSY 905: Multivariate Analysis Spring 2016 Lecture #10: April 6, 2016
Introduction to Bayesian Statistics and Markov Chain Monte Carlo Estimation EPSY 905: Multivariate Analysis Spring 2016 Lecture #10: April 6, 2016 EPSY 905: Intro to Bayesian and MCMC Today s Class An
More informationExperience Guided Search: A Bayesian Perspective on Cognitive Control
Collaborators Experience Guided Search: A Bayesian Perspective on Cognitive Control Michael C. Mozer Computer Science Department and Institute of Cognitive Science University of Colorado, Boulder Karthik
More information0.1 Schrödinger Equation in 2-dimensional system
0.1 Schrödinger Equation in -dimensional system In HW problem set 5, we introduced a simpleminded system describing the ammonia (NH 3 ) molecule, consisting of a plane spanned by the 3 hydrogen atoms and
More informationSerious limitations of (single-layer) perceptrons: Cannot learn non-linearly separable tasks. Cannot approximate (learn) non-linear functions
BACK-PROPAGATION NETWORKS Serious limitations of (single-layer) perceptrons: Cannot learn non-linearly separable tasks Cannot approximate (learn) non-linear functions Difficult (if not impossible) to design
More informationStochastic Processes
qmc082.tex. Version of 30 September 2010. Lecture Notes on Quantum Mechanics No. 8 R. B. Griffiths References: Stochastic Processes CQT = R. B. Griffiths, Consistent Quantum Theory (Cambridge, 2002) DeGroot
More informationPrinciples of Statistical Inference
Principles of Statistical Inference Nancy Reid and David Cox August 30, 2013 Introduction Statistics needs a healthy interplay between theory and applications theory meaning Foundations, rather than theoretical
More informationA NEW MODEL FOR THE FUSION OF MAXDIFF SCALING
A NEW MODEL FOR THE FUSION OF MAXDIFF SCALING AND RATINGS DATA JAY MAGIDSON 1 STATISTICAL INNOVATIONS INC. DAVE THOMAS SYNOVATE JEROEN K. VERMUNT TILBURG UNIVERSITY ABSTRACT A property of MaxDiff (Maximum
More informationThe Bayesian Brain. Robert Jacobs Department of Brain & Cognitive Sciences University of Rochester. May 11, 2017
The Bayesian Brain Robert Jacobs Department of Brain & Cognitive Sciences University of Rochester May 11, 2017 Bayesian Brain How do neurons represent the states of the world? How do neurons represent
More informationTI-games I: An Exploration of Type Indeterminacy in Strategic Decision-making
TI-games I: An Exploration of Type Indeterminacy in Strategic Decision-making J. Busemeyer (Indiana University) A. Lambert-Mogiliansky (PSE) CNAM February 9 2009 1 Introduction This paper belongs to a
More informationModeling User s Cognitive Dynamics in Information Access and Retrieval using Quantum Probability (ESR-6)
Modeling User s Cognitive Dynamics in Information Access and Retrieval using Quantum Probability (ESR-6) SAGAR UPRETY THE OPEN UNIVERSITY, UK QUARTZ Mid-term Review Meeting, Padova, Italy, 07/12/2018 Self-Introduction
More informationINTRODUCTION TO PATTERN RECOGNITION
INTRODUCTION TO PATTERN RECOGNITION INSTRUCTOR: WEI DING 1 Pattern Recognition Automatic discovery of regularities in data through the use of computer algorithms With the use of these regularities to take
More informationSome Examples of Contextuality in Physics
Some Examples of Contextuality in Physics and its implications to quantum cognition J. Acacio de Barros School of Humanities & Liberal Studies, San Francisco State University Winer Memorial Lectures, 2014
More informationA latent-mixture quantum probability model of causal reasoning within a Bayesian inference framework
A latent-mixture quantum probability model of causal reasoning within a Bayesian inference framework Percy K. Mistry (pkmistry@uci.edu) Jennifer S. Trueblood (jstruebl@uci.edu) Joachim Vandekerckhove (joachim@uci.edu)
More information+ + ( + ) = Linear recurrent networks. Simpler, much more amenable to analytic treatment E.g. by choosing
Linear recurrent networks Simpler, much more amenable to analytic treatment E.g. by choosing + ( + ) = Firing rates can be negative Approximates dynamics around fixed point Approximation often reasonable
More informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2014 Mika Hirvensalo Basics on quantum information 1 of 49 Brief
More informationEconometric Causality
Econometric (2008) International Statistical Review, 76(1):1-27 James J. Heckman Spencer/INET Conference University of Chicago Econometric The econometric approach to causality develops explicit models
More informationMulti-scale Geometric Summaries for Similarity-based Upstream S
Multi-scale Geometric Summaries for Similarity-based Upstream Sensor Fusion Duke University, ECE / Math 3/6/2019 Overall Goals / Design Choices Leverage multiple, heterogeneous modalities in identification
More informationA Higher-Order Interactive Hidden Markov Model and Its Applications Wai-Ki Ching Department of Mathematics The University of Hong Kong
A Higher-Order Interactive Hidden Markov Model and Its Applications Wai-Ki Ching Department of Mathematics The University of Hong Kong Abstract: In this talk, a higher-order Interactive Hidden Markov Model
More informationStochastic Quantum Dynamics I. Born Rule
Stochastic Quantum Dynamics I. Born Rule Robert B. Griffiths Version of 25 January 2010 Contents 1 Introduction 1 2 Born Rule 1 2.1 Statement of the Born Rule................................ 1 2.2 Incompatible
More informationLinear & nonlinear classifiers
Linear & nonlinear classifiers Machine Learning Hamid Beigy Sharif University of Technology Fall 1394 Hamid Beigy (Sharif University of Technology) Linear & nonlinear classifiers Fall 1394 1 / 34 Table
More informationRecurrences and Full-revivals in Quantum Walks
Recurrences and Full-revivals in Quantum Walks M. Štefaňák (1), I. Jex (1), T. Kiss (2) (1) Department of Physics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague,
More informationDynamic Data Modeling, Recognition, and Synthesis. Rui Zhao Thesis Defense Advisor: Professor Qiang Ji
Dynamic Data Modeling, Recognition, and Synthesis Rui Zhao Thesis Defense Advisor: Professor Qiang Ji Contents Introduction Related Work Dynamic Data Modeling & Analysis Temporal localization Insufficient
More information2. Introduction to quantum mechanics
2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian
More informationQuestion order experimental constraints on quantum-like models of judgement
Question order experimental constraints on quantum-like models of judgement Patrick Cassam-Chenaï To cite this version: Patrick Cassam-Chenaï. Question order experimental constraints on quantum-like models
More informationLecture 20. Parity and Time Reversal
Lecture 20 Parity and Time Reversal November 15, 2009 Lecture 20 Time Translation ( ψ(t + ɛ) = Û[T (ɛ)] ψ(t) = I iɛ ) h Ĥ ψ(t) Ĥ is the generator of time translations. Û[T (ɛ)] = I iɛ h Ĥ [Ĥ, Ĥ] = 0 time
More informationGroup Sequential Tests for Delayed Responses. Christopher Jennison. Lisa Hampson. Workshop on Special Topics on Sequential Methodology
Group Sequential Tests for Delayed Responses Christopher Jennison Department of Mathematical Sciences, University of Bath, UK http://people.bath.ac.uk/mascj Lisa Hampson Department of Mathematics and Statistics,
More informationIntroduction to Systems Analysis and Decision Making Prepared by: Jakub Tomczak
Introduction to Systems Analysis and Decision Making Prepared by: Jakub Tomczak 1 Introduction. Random variables During the course we are interested in reasoning about considered phenomenon. In other words,
More informationTheoretical and empirical reasons for considering the application of quantum probability theory to human cognition
Theoretical and empirical reasons for considering the application of quantum probability theory to human cognition Jerome R. Busemeyer and Jennifer S. Trueblood Indiana University, Bloomington Indiana
More informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2016 Mika Hirvensalo Basics on quantum information 1 of 52 Brief
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part II Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 13, 2011 Overview Outline Grover s Algorithm Quantum search A worked example Simon s algorithm
More informationDIFFERENT APPROACHES TO STATISTICAL INFERENCE: HYPOTHESIS TESTING VERSUS BAYESIAN ANALYSIS
DIFFERENT APPROACHES TO STATISTICAL INFERENCE: HYPOTHESIS TESTING VERSUS BAYESIAN ANALYSIS THUY ANH NGO 1. Introduction Statistics are easily come across in our daily life. Statements such as the average
More informationLecture 1: Probability Fundamentals
Lecture 1: Probability Fundamentals IB Paper 7: Probability and Statistics Carl Edward Rasmussen Department of Engineering, University of Cambridge January 22nd, 2008 Rasmussen (CUED) Lecture 1: Probability
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk
Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk We now turn to a second major topic in quantum algorithms, the concept
More informationProbabilities versus Amplitudes. John Baez, Jacob Biamonte, Brendan Fong Mathematical Trends in Reaction Network Theory 1 July 2015
Probabilities versus Amplitudes John Baez, Jacob Biamonte, Brendan Fong Mathematical Trends in Reaction Network Theory 1 July 2015 Chemistry is fundamentally quantum-mechanical. But the master equation
More informationHidden Markov Models. Vibhav Gogate The University of Texas at Dallas
Hidden Markov Models Vibhav Gogate The University of Texas at Dallas Intro to AI (CS 4365) Many slides over the course adapted from either Dan Klein, Luke Zettlemoyer, Stuart Russell or Andrew Moore 1
More informationOutline. Limits of Bayesian classification Bayesian concept learning Probabilistic models for unsupervised and semi-supervised category learning
Outline Limits of Bayesian classification Bayesian concept learning Probabilistic models for unsupervised and semi-supervised category learning Limitations Is categorization just discrimination among mutually
More informationThe Physics of Optimal Decision Making: A Formal Analysis of Models of Performance in Two-Alternative Forced-Choice Tasks
Psychological Review Copyright 6 by the American Psychological Association 6, Vol. 3, No. 4, 7 765 33-95X/6/$. DOI:.37/33-95X.3.4.7 The Physics of Optimal Decision Making: A Formal Analysis of Models of
More informationA Brief and Friendly Introduction to Mixed-Effects Models in Psycholinguistics
A Brief and Friendly Introduction to Mixed-Effects Models in Psycholinguistics Cluster-specific parameters ( random effects ) Σb Parameters governing inter-cluster variability b1 b2 bm x11 x1n1 x21 x2n2
More informationPrinciples of Statistical Inference
Principles of Statistical Inference Nancy Reid and David Cox August 30, 2013 Introduction Statistics needs a healthy interplay between theory and applications theory meaning Foundations, rather than theoretical
More informationComparing Means from Two-Sample
Comparing Means from Two-Sample Kwonsang Lee University of Pennsylvania kwonlee@wharton.upenn.edu April 3, 2015 Kwonsang Lee STAT111 April 3, 2015 1 / 22 Inference from One-Sample We have two options to
More informationQuantum Mechanics C (130C) Winter 2014 Final exam
University of California at San Diego Department of Physics Prof. John McGreevy Quantum Mechanics C (130C Winter 014 Final exam Please remember to put your name on your exam booklet. This is a closed-book
More informationQuantum Theory and Group Representations
Quantum Theory and Group Representations Peter Woit Columbia University LaGuardia Community College, November 1, 2017 Queensborough Community College, November 15, 2017 Peter Woit (Columbia University)
More information1 Planck-Einstein Relation E = hν
C/CS/Phys C191 Representations and Wavefunctions 09/30/08 Fall 2008 Lecture 8 1 Planck-Einstein Relation E = hν This is the equation relating energy to frequency. It was the earliest equation of quantum
More informationEnsembles and incomplete information
p. 1/32 Ensembles and incomplete information So far in this course, we have described quantum systems by states that are normalized vectors in a complex Hilbert space. This works so long as (a) the system
More information1 The postulates of quantum mechanics
1 The postulates of quantum mechanics The postulates of quantum mechanics were derived after a long process of trial and error. These postulates provide a connection between the physical world and the
More informationSqueezing Every Ounce of Information from An Experiment: Adaptive Design Optimization
Squeezing Every Ounce of Information from An Experiment: Adaptive Design Optimization Jay Myung Department of Psychology Ohio State University UCI Department of Cognitive Sciences Colloquium (May 21, 2014)
More informationRational preferences. Rational decisions. Outline. Rational preferences contd. Maximizing expected utility. Preferences
Rational preferences Rational decisions hapter 16 Idea: preferences of a rational agent must obey constraints. Rational preferences behavior describable as maximization of expected utility onstraints:
More informationLecture 5: Sept. 19, 2013 First Applications of Noether s Theorem. 1 Translation Invariance. Last Latexed: September 18, 2013 at 14:24 1
Last Latexed: September 18, 2013 at 14:24 1 Lecture 5: Sept. 19, 2013 First Applications of Noether s Theorem Copyright c 2005 by Joel A. Shapiro Now it is time to use the very powerful though abstract
More informationPrinciples Underlying Evaluation Estimators
The Principles Underlying Evaluation Estimators James J. University of Chicago Econ 350, Winter 2019 The Basic Principles Underlying the Identification of the Main Econometric Evaluation Estimators Two
More informationDecoherence on Szegedy s Quantum Walk
Decoherence on Szegedy s Quantum Walk Raqueline A. M. Santos, Renato Portugal. Laboratório Nacional de Computação Científica (LNCC) Av. Getúlio Vargas 333, 25651-075, Petrópolis, RJ, Brazil E-mail: raqueline@lncc.br,
More informationarxiv: v1 [physics.soc-ph] 3 Nov 2008
arxiv:0811.0253v1 [physics.soc-ph] 3 Nov 2008 TI-games : An Exploration of Type Indeterminacy in Strategic Decision-making Jerry Busemeyer, Ariane Lambert-Mogiliansky. February 19, 2009 Abstract In this
More information