You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: glossary.md
+37Lines changed: 37 additions & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -21,16 +21,24 @@ Abstraction is selecting data from a larger pool to show only the relevant detai
21
21
It hides the complexity of the system and allows individuals to work on different modules of the hierarchy at the same time.
22
22
23
23
## accessibility relations
24
+
24
25
In modal logic, an accessibility relation R is a binary relation such that R⊆ W×W where W is a set of possible worlds. The accessibility relation determines for each world w ∈ W which worlds ẃ are accessible from w.
26
+
25
27
## action monitoring
28
+
29
+
Checking the preconditions of each action as it is executed, rather than checking the preconditions of the entire remaining plan.
30
+
26
31
## action schema
32
+
27
33
## action-utility function
34
+
28
35
## actions
29
36
30
37
The things that an agent can do. We model this with a function, **Actions(s)**, that returns a collection of actions
31
38
that the agent can execute in state *s*.
32
39
33
40
## activation
41
+
34
42
## activation function
35
43
36
44
A mathematical function that transforms the input or set of inputs received at a neuron to produce an output.
@@ -43,11 +51,13 @@ as well as reaping immediate rewards from the environment.
43
51
This is in contrast to a passive learning agent, which learns from its observations, but the actions the agent takes are not influenced by the learning process.
44
52
45
53
## actor
54
+
46
55
## adaptive dynamic programming
47
56
48
57
Also known as Approximate Dynamic Programming; it is a type of Reinforcement Learning where local rewards and transitions depend on unknown parameters - we set an initial control policy and update it until it converges to an optimal control policy.
49
58
50
59
## add list
60
+
51
61
## admissible heuristic
52
62
53
63
A **heuristic** is a function that scores alternatives at each branching in a search algorithm. An **admissible heuristic** is one that *never overestimates* the cost to reach the goal. Admissible heuristics are **optimistic** in nature as they believe the cost of reaching the goal is less than it actually is.
@@ -57,6 +67,7 @@ A **heuristic** is a function that scores alternatives at each branching in a se
57
67
Traversing a tree data structure to find all possible moves. It is usually used in a two-player game; each available move is represented using gain and loss for an individual player. An important application of it is in zero sum games, as in those games, one players' loss is the other players' gain.
58
68
59
69
## adversary argument
70
+
60
71
## agent
61
72
62
73
An **agent** is anything that can be viewed as perceiving its **environment** through **sensors** and acting upon that environment through **actuators**.
@@ -74,34 +85,57 @@ _Internally,_ the agent function for an artificial agent will be implemented by
74
85
It is a category of hierarchical clustering which uses a bottom-up approach. All observations start in their own cluster and different pairs of clusters are merged as you move up levels in the hierarchy. Its results are represented using a dendrogram.
75
86
76
87
## aggregation
88
+
77
89
## algorithm
78
90
79
91
An **algorithm** is a sequence of **unambiguous finite steps** that when carried out on a given problem produce the expected outcome and terminate in **finite time**.
80
92
81
93
## alignment method
94
+
82
95
## alpha-beta
96
+
83
97
**alpha** (**α**) is the value of the best (i.e., highest-value) choice we have found so far at any choice point along the path for MAX and **beta**(**β**) is the value of the best (i.e., lowest-value) choice we have found so far at any choice point along the path for MIN in a standard minimax tree.
98
+
84
99
## alpha-beta pruning
100
+
85
101
**alpha—beta pruning** is applied to a standard minimax tree to prune away branches that cannot possibly influence the final minimax decision.
102
+
86
103
## ambient illumination
87
104
105
+
Light that is already present in a scene, before any additional lighting is added. It usually refers to natural light.
106
+
88
107
## ambiguity
89
108
90
109
It is the state of being uncertain or doubtful.
91
110
92
111
## ambiguity aversion
112
+
113
+
Ambiguity aversion (also known as uncertainty aversion) is a preference for known risks over unknown risks.
114
+
93
115
## analogical reasoning
116
+
117
+
Analogical reasoning is any type of thinking that relies upon an analogy. An analogical argument is an explicit representation of a form of analogical reasoning that cites accepted similarities between two systems to support the conclusion that some further similarity exists.
118
+
94
119
## anchoring effect
95
120
96
121
It is a type of cognitive bias which makes people focus on the first piece of information (the "anchor") that was given to them, to make decisions. To explain this with an example; when buying a product if you're told a high price by the seller, your mind estimates the worth of that product as that initial/anchor price you're told, and then when you're offered a discount on it, you are more inclined to buy it thinking that you're getting it for cheap.
97
122
98
123
## And-Elimination
124
+
99
125
## AND-parallelism
126
+
100
127
## angelic nondeterminism
128
+
101
129
## angelic semantics
130
+
102
131
## answer literal
132
+
103
133
## answer set programming
134
+
135
+
Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model (answer set) semantics of logic programming.
136
+
104
137
## answer sets
138
+
105
139
## aortic coarctation
106
140
107
141
It is a Medical term which means the narrowing of aorta - the largest artery in the body which starts from the heart.
@@ -119,6 +153,9 @@ It is a very broad term; however, it is generally used to refer to the structure
119
153
In logic, mathematics, and computer science, the arity of a function or operation is the number of arguments or operands that the function takes.
120
154
121
155
## artificial life
156
+
157
+
Artificial life (often abbreviated ALife or A-Life) is a field of study wherein researchers examine systems related to natural life, its processes, and its evolution, through the use of simulations with computer models, robotics, and biochemistry.
0 commit comments