Decision theory | Models of computation | Mathematical psychology
Decision field theory (DFT) is a dynamic-cognitive approach to human decision making. It is a cognitive model that describes how people actually make decisions rather than a rational or normative theory that prescribes what people should or ought to do. It is also a dynamic model of decision making rather than a static model, because it describes how a person's preferences evolve across time until a decision is reached rather than assuming a fixed state of preference. The preference evolution process is mathematically represented as a stochastic process called a diffusion process. It is used to predict how humans make decisions under uncertainty, how decisions change under time pressure, and how choice context changes preferences. This model can be used to predict not only the choices that are made but also decision or response times. The paper "Decision Field Theory" was published by Jerome R. Busemeyer and James T. Townsend in 1993. The DFT has been shown to account for many puzzling findings regarding human choice behavior including violations of stochastic dominance, violations of strong stochastic transitivity, violations of independence between alternatives, serial-position effects on preference, speed accuracy tradeoff effects, inverse relation between probability and decision time, changes in decisions under time pressure, as well as preference reversals between choices and prices. The DFT also offers a bridge to neuroscience. Recently, the authors of decision field theory also have begun exploring a new theoretical direction called Quantum Cognition. (Wikipedia).
(ML 3.1) Decision theory (Basic Framework)
A simple example to motivate decision theory, along with definitions of the 0-1 loss and the square loss. A playlist of these Machine Learning videos is available here: http://www.youtube.com/my_playlists?p=D0F06AA0D2E8FFBA
From playlist Machine Learning
(ML 11.8) Bayesian decision theory
Choosing an optimal decision rule under a Bayesian model. An informal discussion of Bayes rules, generalized Bayes rules, and the complete class theorems.
From playlist Machine Learning
(ML 11.2) Decision theory terminology in different contexts
Comparison of decision theory terminology and notation in three different contexts: in general, for estimators, and for regression/classification.
From playlist Machine Learning
(ML 11.4) Choosing a decision rule - Bayesian and frequentist
Choosing a decision rule, from Bayesian and frequentist perspectives. To make the problem well-defined from the frequentist perspective, some additional guiding principle is introduced such as unbiasedness, minimax, or invariance.
From playlist Machine Learning
Introduction to Decision Trees | Decision Trees for Machine Learning | Part 1
The decision tree algorithm belongs to the family of supervised learning algorithms. Just like other supervised learning algorithms, decision trees model relationships, and dependencies between the predictive outputs and the input features. As the name suggests, the decision tree algorit
From playlist Introduction to Machine Learning 101
Decision trees are powerful and surprisingly straightforward. Here's how they are grown. Code: https://github.com/brohrer/brohrer.github.io/blob/master/code/decision_tree.py Slides: https://docs.google.com/presentation/d/1fyGhGxdGcwt_eg-xjlMKiVxstLhw42XfGz3wftSzRjc/edit?usp=sharing PERM
From playlist Data Science
01 Decision analysis as a science
Introduction to decision making under uncertainty
From playlist QUSS GS 260
(PP 6.1) Multivariate Gaussian - definition
Introduction to the multivariate Gaussian (or multivariate Normal) distribution.
From playlist Probability Theory
If you are interested in learning more about this topic, please visit http://www.gcflearnfree.org/ to view the entire tutorial on our website. It includes instructional text, informational graphics, examples, and even interactives for you to practice and apply what you've learned.
From playlist Design Thinking
Modified Navier–Stokes and Decision Process Theory
As a next step in investigating decision process theory, Jerry Thomas considers steady-state non-streamline solutions to a 3D model. The equations are modified Navier–Stokes equations. Using NDSolve, he shows that these steady-state solutions are not dissimilar to fluid flow solutions desp
From playlist Wolfram Technology Conference 2020
Lec 7 | MIT 6.451 Principles of Digital Communication II
Introduction to Finite Fields View the complete course: http://ocw.mit.edu/6-451S05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT 6.451 Principles of Digital Communication II
What is Social Psychology? An Introduction
Learn more about Social Psychology: https://practicalpie.com/social-psychology/ Enroll in my 30 Day Brain Bootcamp: https://practicalpie.com/30-day-brain-bootcamp-plan/ --- Invest in yourself and support this channel! --- ❤️ Psychology of Attraction: https://practicalpie.com/POA ⏰ Psycho
From playlist Social Psychology
Learning To See [Part 15: Information]
In this series, we'll explore the complex landscape of machine learning and artificial intelligence through one example from the field of computer vision: using a decision tree to count the number of fingers in an image. It's gonna be crazy. Supporting Code: https://github.com/stephencwe
From playlist Learning To See
Aspect of De Sitter Space (Lecture - 03) by Dionysios Anninos
Infosys-ICTS String Theory Lectures Aspect of De Sitter Space Speaker: Dionysios Anninos (King's College London, United Kingdom) Date: 29 October 2018, 11:00 to 01 November 2018, 11:00 Venue: Madhava Lecture Hall, ICTS campus We overview some aspects of asymptotically de Sitter space
From playlist Infosys-ICTS String Theory Lectures
Can p-adic integrals be computed? - Thomas Hales
Automorphic Forms Thomas Hales April 6, 2001 Concepts, Techniques, Applications and Influence April 4, 2001 - April 7, 2001 Support for this conference was provided by the National Science Foundation Conference Page: https://www.math.ias.edu/conf-automorphicforms Conference Agena: ht
From playlist Mathematics
Game Theory: Winning the Game of Life
Game Theory: Winning the Game of Life - Game Theory Explained Sign up and start learning today for FREE: https://brilliant.org/aperture Follow me!: https://www.instagram.com/mcewen/ Game Theory is an interesting subject. It has implications on all of our lives, and it's not something that
From playlist Philosophy & Psychology 🧠
Séminaire Bourbaki - 21/06/2014 - 3/4 - Thomas C. HALES
Developments in formal proofs A for mal proof is a proof that can be read and verified by computer, directly from the fundamental rules of logic and the foundational axioms of mathematics. The technology behind for mal proofs has been under development for decades and grew out of efforts i
From playlist Bourbaki - 21 juin 2014
History of MAS research in UK - Michael Wooldridge, University of Oxford
The AI Programme at the Turing will host an interactive UK Symposium on Multi-Agent Systems (UK-MAS). The goal of the symposium is to bring together UK-based research labs at universities and industry who have a significant focus on MAS research, to explore the MAS research landscape in th
From playlist UK multi-agent systems symposium
Kristin Lauter, Microsoft Research Redmond The Mathematics of Modern Cryptography http://simons.berkeley.edu/talks/kristin-lauter-2015-07-07
From playlist My Collaborators
Powered by https://www.numerise.com/ Formulating a linear programming problem
From playlist Linear Programming - Decision Maths 1