University of Colorado Boulder

Reasoning Under Uncertainty

University of Colorado Boulder

Reasoning Under Uncertainty

Rhonda Hoenigman

位教师:Rhonda Hoenigman

包含在 Coursera Plus

深入了解一个主题并学习基础知识。
中级 等级
需要一些相关经验
1 周 完成
在 10 小时 一周
灵活的计划
自行安排学习进度
深入了解一个主题并学习基础知识。
中级 等级
需要一些相关经验
1 周 完成
在 10 小时 一周
灵活的计划
自行安排学习进度

了解顶级公司的员工如何掌握热门技能

Petrobras, TATA, Danone, Capgemini, P&G 和 L'Oreal 的徽标

该课程共有4个模块

This module introduces how intelligent agents reason and make decisions in environments where information is incomplete, noisy, or uncertain. Students will learn the foundations of probability, including Bayes’ Rule and independence assumptions, and use these tools to perform probabilistic inference and update beliefs based on evidence. The module emphasizes both the sources of uncertainty and the methods AI systems use to act rationally despite it.

涵盖的内容

7个视频1篇阅读材料2个作业

This module focuses on using Bayesian Networks as tools for probabilistic reasoning and decision-making under uncertainty. Students will learn how to interpret a given network, compute probabilities, and perform inference—both exact and approximate—using techniques such as direct sampling and Gibbs sampling. Emphasis is placed on applying Bayes Nets to answer queries, update beliefs with evidence, and reason efficiently in complex domains.

涵盖的内容

5个视频1篇阅读材料1个作业1个编程作业

This module introduces temporal probabilistic models, focusing on how AI systems reason about hidden states that evolve over time. Students will learn to apply inference techniques such as filtering, prediction, smoothing, and the Viterbi algorithm to update beliefs and infer the most likely state sequences from observations. Emphasis is placed on using Hidden Markov Models to perform calculations and interpret how evidence shapes reasoning in dynamic, uncertain environments.

涵盖的内容

6个视频1篇阅读材料2个作业

This module introduces how AI agents make optimal decisions in uncertainty environments over time using the framework of Markov Decision Processes. Students will learn how to represent sequential decision problems with states, actions, rewards, and policies, and how to compute optimal behavior using value iteration, policy iteration, and the Bellman equation. Emphasis is placed on selecting actions that maximize expected utility in uncertain, sequential environments.

涵盖的内容

4个视频1个作业1个编程作业

位教师

Rhonda Hoenigman
University of Colorado Boulder
2 门课程345 名学生

提供方

从 Algorithms 浏览更多内容

人们为什么选择 Coursera 来帮助自己实现职业发展

Felipe M.

自 2018开始学习的学生
''能够按照自己的速度和节奏学习课程是一次很棒的经历。只要符合自己的时间表和心情,我就可以学习。'

Jennifer J.

自 2020开始学习的学生
''我直接将从课程中学到的概念和技能应用到一个令人兴奋的新工作项目中。'

Larry W.

自 2021开始学习的学生
''如果我的大学不提供我需要的主题课程,Coursera 便是最好的去处之一。'

Chaitanya A.

''学习不仅仅是在工作中做的更好:它远不止于此。Coursera 让我无限制地学习。'
Coursera Plus

通过 Coursera Plus 开启新生涯

无限制访问 10,000+ 世界一流的课程、实践项目和就业就绪证书课程 - 所有这些都包含在您的订阅中

通过在线学位推动您的职业生涯

获取世界一流大学的学位 - 100% 在线

加入超过 3400 家选择 Coursera for Business 的全球公司

提升员工的技能,使其在数字经济中脱颖而出

常见问题