×

Quantifying Uncertainty

The concept of quantifying uncertainty relies on how an agent can keep away uncertainty with a degree of belief. The term uncertainty refers to that situation or information which is either unknown or imperfect.

Earlier, we have seen that the problem-solving agents rely on the belief states (which represents all possible states and generates the future plan) to handle uncertainty. But there were certain drawbacks created when the agent’s program was created:

  • Large and complex belief-state representations were created. It was impossible to handle each one of them.
  • If the right contingent plan (future plan) is selected, it can grow arbitrarily large.
  • There can be a condition sometimes when no plan guarantees to reach the goal. Thus, a method should be there to compare the pros and cons of the plans which are not guaranteed.

Need of Uncertainty

To understand the need, let’s see the below example of uncertain reasoning:

Consider the diagnosis of a cancer patient. By following the propositional logic, a rule can be derived as:

Cancer?age.

But this rule is incorrect as all cancers are not caused due to age effects. There can be other possible causes like environment, genetics, skin type, etc. We can rewrite the rule as:

Cancer?age V  genetics  V skin …

Unfortunately, this rule will also not work because there can be unlimited causes of cancer.

There is only one way to make the rule applicable, i.e., to make it logically exhaustive. But, using logic with such medical like domain fails due to the following reasons:

  • Laziness: It is difficult to list all set of antecedents or consequents required to ensure exceptionless rules. With this, it is too typical to use such rules.
  • Theoretical Ignorance: There is no complete theory of cancer in the medical science domain.
  • Practical Ignorance: Although, we know each rule, but it is uncertain for a specific patient as all tests cannot be run.

Note: Above described points are the demerits of using pure logic

As a result, the agent’s knowledge can only provide a degree of belief. The main tool used to deal with the degree of belief is Probability theory. The term probability theory is that the world is composed of facts which either hold or do not hold in any particular case.

Note: Probability enhances a way to summarize the uncertainty which occurs from the above described reasons, i.e., ignorance and laziness. Thereby solving the quantifying problems.

Decision Theory

Sometimes it is possible that the plan we choose may not be a rational plan. May be there would be a more better option available. Therefore, to make such choices, an agent should have knowledge about:

  • Outcomes: It is the result of different states which are completely specified states.
  • Preferences: The agent should have preferences between different possible outcomes of several plans.
  • Utility Theory: It is used to reason and represent with preferences. The concept of utility theory is that every state has a degree of utility (usefulness) to an agent, and a higher utility state will be preferred to the agent.          

Thus, preferences, when expressed via utilities and combined with probabilities are termed as Decision theory. Hence,

Decision theory = probability theory + utility theory  

The principle behind the decision theory is that an agent is rational if and only if it chooses the action which yields the highest expected utility, averaged over all the possible outcomes of the action. This principle is known as the principle of Maximum Expected Utility (MEU).

Basic Probability Notation

Probabilistic assertions define about all possible worlds. The set of all possible worlds is known as the sample space. All the possible worlds are mutually exclusive and exhaustive, i.e., both possible worlds cannot be the case, only one is possible.

A model namely, probability model associates a numerical probability as P() with each possible world. The theory describes that all possible worlds have probability values between 0 and 1. Therefore, the total probability of the sample space is 1.

Quantifying Uncertainty

Probabilistic assertions relate to the sets of particularly possible worlds. The sets are always defined via propositions in probability theory. The probability associated with the proposition is defined as the sum of probabilities of the possible worlds, i.e.,

Quantifying Uncertainty 1

Unconditional Probabilities

The probability which refers to the degrees of belief in propositions when no other information is available. It is also known as Prior probabilities (priors).

For example, the probability of rolling a fair dice is:

P(total=11) = P(5,6) +P(6,5)

                   = 1/36 + 1/36

                  = 1/18.      

Here, the P(total=11) is known as the prior or unconditional probability.

Therefore, an unconditional probability is the independent chance of occurrence of a single outcome from a set of all possible outcomes.

Conditional Probabilities

It is the probability of an event where it is given that an event has already occurred. Conditional probability is also known as Posterior probabilities (posterior).

For example, it is given that the probability of the person having fever is 5% only. Thus, the conditional probability is higher than 75% of those persons who are currently suffering from fever.

Mathematically, a conditional probability is derived in terms of unconditional probability for any propositions x and y.

Quantifying Uncertainty 2

The above rule can also be described in another form known as the Product rule.

Mathematically, it is represented as;

P(x ? y) = P(x|y) . P(y)

The product rule is based on the fact that, for every x and y to be true, value of y should be true. Also, the value of x should be true for a given value of y.

Language of propositions

There are following terms used to represent the propositions:

  • Factored representation: It is the representation of a possible world via a set of variable or value pairs.
  • Random variables: The variables used in the probability theory are known as random variables.
  • Domain: It is a set of all the possible values. Every random variable has a domain.
  • Probability Distribution: It is the bold P used to indicate the result for the random variables.
  • Probability density function (pdfs): This function enables a way to measure the sets of all possible worlds.
  • Full joint probability distribution: It derives the probability of the assignment of every completed value to the random variables.
  • Absolute Independence: It occurs between the subsets of the random variables. It allows the full joint distribution of the values factored into its smaller joint distributions.


Related Topics

Top 7 Artificial Intelligence and Machine Learning trends for 2024

Artificial Intelligence is the ability of machines to perform the same function as human beings, like problem-solving, learning, reasoning and recognizing. Machine Learning is another branch of Computer Science and...

6 minutes read.

Classical Planning

Classical Planning is the planning where an agent takes advantage of the problem structure to construct complex plans of an action. The agent performs three tasks in classical planning: Planning: The agent plans after...

4 minutes read.

Uninformed Search Strategies - Artificial Intelligence

Breadth-first search (BFS) It is a simple search strategy where the root node is expanded first, then covering all other successors of the root node, further move to expand the next...

8 minutes read.

Problem-solving in Artificial Intelligence

The reflex agents are known as the simplest agents because they directly map states into actions. Unfortunately, these agents fail to operate in an environment where the mapping is too large to...

7 minutes read.

Hidden Markov Models

Hidden Markov Model is a partially observable model, where the agent partially observes the states. This model is based on the statistical Markov model, where a system being modeled follows the Markov process...

4 minutes read.

Minimax Strategy

In artificial intelligence, minimax is a decision-making strategy under game theory, which is used to minimize the losing chances in a game and to maximize the winning chances. This strategy is also known...

3 minutes read.

Information Retrieval

Information Retrieval: In order to analyze and categorize the text, we'd like to be able to figure out information about the text, some meaning about the text as well. And,...

14 minutes read.

Knowledge Based Agents in AI

Knowledge is the basic element for a human brain to know and understand the things logically. When a person becomes knowledgeable about something, he is able to do that thing in a better...

4 minutes read.

Reinforcement Learning in AI

Reinforcement Learning in AI Reinforcement LearningMarkov’s Decision ProcessQ leaningGreedy Decision MakingNIM GameNIM Game Implementation with Python Reinforcement Learning Reinforcement Learning is about learning from experience, where agents are given a set of rewards...

15 minutes read.

Inference in First-order Logic

Inference in First-order Logic While defining inference, we mean to define effective procedures for answering questions in FOPL. FOPL offers the following inference rules: Inference rules for quantifiersUniversal Instantiation (UI): In this, we can infer any sentence by...

5 minutes read.

Informed Search/ Heuristic Search in AI

An informed search is more efficient than an uninformed search because in informed search, along with the current state information,  some additional information is also present, which make it easy to reach the...

6 minutes read.

Gradient Descent

Gradient Descent When training a neural network, an algorithm is used to minimize the loss. This algorithm is called as Gradient Descent. And loss refers to the incorrect outputs given by...

6 minutes read.

Top 10 Artificial Intelligence Technologies in 2024

Artificial Intelligence Technologies in 2020 1. Augmented Reality This is one of the most fascinating technology nowadays. Augmented Reality is the use of text, graphics, audio, etc. in real time. In Simple...

4 minutes read.

Dynamic Routing

Dynamic Routing Dynamic routing is used to update the routing table and find networks on the routers. It is easier than static routing and default routing, but it is more expensive in terms of...

3 minutes read.

Supervised Learning in AI

Supervised Learning in AI Learning Supervised LearningClassification TasksNearest Neighbor ClassificationK nearest neighbor AlgorithmPerceptron LearningSupport Vector MachineRegression TasksLoss FunctionOverfittingRegularizationScikit LearnK Nearest Neighbor ImplementationPerceptron Algorithm ImplementationSupport Vector Machine Algorithm ImplementationRegression Implementation Machine Learning In the Artificial...

33 minutes read.

Backward Chaining in AI: Artificial Intelligence

Backward Chaining is a backward approach which works in the backward direction. It begins its journey from the back of the goal. Like, forward chaining, we have backward chaining for Propositional logic as...

6 minutes read.

Integration of Blockchain and Artificial Intelligence

A Blockchain is a shared database or ledger where pieces of data are stored in data structures known as blocks. So, we can say that Blockchain is the distribution storage...

6 minutes read.

Hill Climbing Algorithm in AI

Hill Climbing Algorithm: Hill climbing search is a local search problem. The purpose of the hill climbing search is to climb a hill and reach the topmost peak/ point of...

4 minutes read.

What is Artificial Super Intelligence (ASI)

Before starting with Artificial Super Intelligence, first, we have to know what Artificial Intelligence is. Artificial Intelligence is a field which has a long history. Artificial intelligence is the ability...

3 minutes read.

Utility Functions in Artificial Intelligence

The agents use the utility theory for making decisions. It is the mapping from lotteries to the real numbers. An agent is supposed to have various preferences and can choose the one...

3 minutes read.