Artificial Intelligence
Artificial Intelligence
III. Philosophy of AI
An entity is intelligent if it cannot be distinguished from another intelligent entity by
observing its behavior, but does being human-like mean you are intelligent? The word
intelligent can also be replaced by conscious, because a machine doesn’t has a mind in the
way that a human has.
Is a self-driving car intelligent? The AI system in the car doesn’t see or understand its
environment, and it doesn’t know how to drive safely, in the way a human being sees,
understands, and knows. This means that the intelligent behavior of the system is
fundamentally different from actually being intelligent.
How much does philosophy matter in practice? The philosophy of AI is unlikely to have more
effect on the practice of AI research than philosophy of science generally has on the practice
of science. We continue investigating systems without asking too much whether they are
intelligent or just behave.
Key terminology:
1) General vs narrow AI: narrow refers to AI that handles one task, general AI (AGI) refers to
a machine that can handle any intellectual task. All the AI systems we use now are narrow,
while AGI is considered as science fiction.
2) Strong vs weak AI: strong: intelligent and self-conscious, weak: intelligent behavior,
despite being just computers.
Chapter 2: AI problem solving
I. Search and problem solving
There are many ways to solve a problem, some of them which may be more preferable in
terms of time, effort, cost or other criteria. Different search techniques may lead to different
solutions resulting in advanced search algorithms.
Two kinds of problems:
- Search and planning in static environments with only one “agent”
- Games with two-player (“agents”) competing against each other
First thing to do for the problem solving process = defining the choices and their
consequences. We also need to define what the goal is.
Key terminology:
1) The state space: the set of possible solutions, if the task navigate from place A to B, the
state space could be set of locations defined by their (x,y) coordinates that can be reached
from the starting point.
2) Transitions: are possible moves between one state and another. We only count direct
transitions that can be accomplished with a single action as transition. A sequence of multiple
transitions that follow each other, is called a path.
3) Costs: refer to the fact that, oftentimes the different transitions aren’t all alike. They can
differ in ways that make some transitions more preferable or cheaper and other more costly
(figuratively). If all transitions are equal, we can ignore the costs.
The minmax algorithm guarantees optimal game play in, theoretically speaking, any
deterministic, two-person, perfect information zero-sum game. The algorithm can be
implemented using a few lines of code.
Heuristic evaluation function takes as input a board position, including the information about
which player’s turn is next, and returns a score that should be an estimate of the likely
outcome of the game continuing from the given board position. Good heuristics for chess for
example is typically count the amount of material (pieces) weighted by their type.
In the image above, we use the geometric distance (Euclidean distance) to classify the input.
However, in some cases it might not be clear how the items are drawn in a geometric
representation and how distances should be measured. You should therefore choose the
distance metric on a case-by-case basis.
III. Regression
Linear regression
What is linear regression? AI Linear Regression is a supervised machine learning algorithm
with a continuous and constant slope expected performance. Rather than attempting to
classify values into groups (such as cats and dogs), it is used to estimate values within a
continuous range (such as price and revenue).
Linear regression produces a numerical prediction that is not constrained to be an integer, it is
better suited in situations where the output variable can be any number like the price of a
product, the distance to an obstacle,…
In linear regression, the main idea is to add up the effects of each of the feature variables to
produce the predicted value. The term of the process is called linear combination.
Example of linear regression as a shopping bill:
Suppose you go to the grocery store and buy 2.5kg potatoes, 1.0kg carrots, and two bottles of
milk. If the price of potatoes is 2€ per kg, the price of carrots is 4€ per kg, and a bottle of milk
costs 3€, then the bill, calculated by the cashier, totals 2.5 × 2€ + 1.0 × 4€ + 2 × 3€ = 15€. In
linear regression, the amount of potatoes, carrots, and milk are the inputs in the data. The
output is the cost of your shopping, which clearly depends on both the price and how much of
each product you buy.
Linear means that the increase in the output when one input feature is increased by some fixed
amount is always the same.
Key terminology:
Coefficients or weights: This are the prices of the different products, one of the main
advantages of linear regression is its easy interpretability: the learned weight may in fact be
more interesting than the predictions of the outputs.
The starting point for a calculation in linear regression is the intercept.
Some examples of applications of linear regression are: prediction of click rates in online
advertising, prediction of retail demand for products, prediction of software cost, prediction of
insurance cost, prediction of crime rates,…
Logistic regression
In logistic regression, we can turn the linear regression method’s outputs into predictions
about labels. We take the output from linear regression, which is a number, and predict one
label A if the output is greater than zero, and another label B if the output is less than or equal
to zero. Instead of just predicting one class or another, logistic regression can also give us a
measure of uncertainty of the prediction. It is also possible to use it to obtain predictions over
more than two possible labels.
Chapter 5: Neural networks
I. Neural network basics
A neural network can mean either a “real” biological network such as the one in our brain, or
an artificial neural network simulated in a computer.
Key terminology:
1)Deep learning refers to certain kinds of machine learning techniques where several “layers”
of simple processing units are connected in a network so that the input to the system is passed
through each one of them in turn.
2) Neurons, cell bodies and signals: A neural network consists of a large number of simple
units, neurons, that receive and transmit signals to each other. The neurons are very simple
processors of information, consisting of a cell body and wires that connect the neurons to each
other.
3) Dendrites, axons and synapses: Dendrites are wires that provide the input to the neurons.
The wire that transmits the outgoing signal is called an axon. Each axon may be connected to
one or more dendrites at intersections that are called synapses.
II. How neural networks are built
Once the linear combination has been computed, the neuron takes the linear combination and
puts it through a so-called activation function. Examples: identify function (do nothing and
just output the linear combination), step function (if the value of the linear combination is
greater than zero, send a pulse ON, otherwise do nothing OFF), sigmoid function (a “soft”
version of the step function).
The output of the neuron, determined by the linear combination and the activation function,
can be used to extract a prediction or a decision.
Key terminology
Layers: Often the network architecture is composed of layers. The input layer consists of
neurons that get their inputs directly from the data. Hidden layers use the other neurons’
outputs as their input, and whose output is used as the input to other layers of neurons. The
output layer produces the output of the whole network. All the neurons on a given layer gets
inputs from neurons on the previous layer and feed their output to the next.
Chapter 6: Implications
I. About predicting the future
Predicting the future of AI is nearly impossible, we don’t know what impact AI will have on
our life in the future. However, by understanding the history and present of AI we might be
able to set some predictions.
Prediction 1: AI will continue to be all around us; There will most likely be some applications
of AI in the future such as self-driving cars, recommendation systems, and image and video
processing.
Prediction 2: the Terminator isn’t coming; In this scenario, AI will continue to grow, but there
will robots with advanced killing techniques who wipes most of the humankind out of
existence with nukes.
Prediction 3: Doomsday scenario 1: There will be a powerful AI system who just becomes
conscious and decides that it really dislikes humanity.
Prediction 4: There will be a robot army controlled by an intelligent but not conscious AI
system that is in principle in human control.
However, some of these scenarios seem to be really unrealistic.