Tag Info

35

The terms strong and weak don't actually refer to processing, or optimization power, or any interpretation leading to "strong AI" being stronger than "weak AI". It holds conveniently in practice, but the terms come from elsewhere. In 1980, John Searle coined the following statements: AI hypothesis, strong form: an AI system can think and have a mind (in the ...

33

TLDR: The convolutional-neural-network is a subclass of neural-networks which have at least one convolution layer. They are great for capturing local information (e.g. neighbor pixels in an image or surrounding words in a text) as well as reducing the complexity of the model (faster training, needs fewer samples, reduces the chance of overfitting). See ...

27

It's true that the term has become a buzzword, and is now widely used to a point of confusion - however if you look at the definition provided by Stuart Russell and Peter Norvig, they write it as follows: We define AI as the study of agents that receive percepts from the environment and perform actions. Each such agent implements a function that maps ...

25

If I'm not mistaken you're looking for Roko's Basilisk, in which an otherwise benevolent future AI system tortures simulations of those who did not work to bring the system into existence

22

The technological singularity is a theoretical point in time at which a self-improving artificial general intelligence becomes able to understand and manipulate concepts outside of the human brain's range, that is, the moment when it can understand things humans, by biological design, can't. The fuzziness about the singularity comes from the fact that, from ...

22

I believe it would be more accurate to say that (some) search engines use AI. Broadly saying "search engines are AI" is not really correct. At the core, most search engines are nothing more than an inverted text index using something like tf–idf scoring. That's a very mechanical/simple thing that nobody would really call AI. But more sophisticated search ...

20

Whenever a problem becomes solvable by a computer, people start arguing that it does not require intelligence. John McCarthy is often quoted: "As soon as it works, no one calls it AI anymore" (Referenced in CACM). One of my teachers in college said that in the 1950's, a professor was asked what he thought was intelligent for a machine. The professor ...

20

In reinforcement learning (RL), an agent interacts with an environment in time steps. On each time step, the agent takes an action in a certain state and the environment emits a percept or perception, which is composed of a reward and an observation, which, in the case of fully-observable MDPs, is the next state (of the environment and the agent). The goal ...

14

Although OCR is now a mainstream technology, it remains true that none our methods genuinely have the recognition facilities of a 5 year old (claimed success with CAPTCHAs notwithstanding). We don't know how to achieve this using well-understood techniques, so OCR should still rightfully be considered an AI problem. To see why this might be so, it is ...

14

Convolutional Neural Networks (CNNs) are neural networks with architectural constraints to reduce computational complexity and ensure translational invariance (the network interprets input patterns the same regardless of translation— in terms of image recognition: a banana is a banana regardless of where it is in the image). Convolutional Neural Networks ...

14

To complete the first answer that is rather graph oriented, I will write a little about deep learning on manifolds, which is quite general in terms of GDL thanks to the nature of manifolds. Note that the description of GDL through the explanation of what are DL on graphs and manifolds, in opposition to DL on euclidean domains, comes from the 2017 paper ...

13

"Backprop" is the same as "backpropagation": it's just a shorter way to say it. It is sometimes abbreviated as "BP".

12

A deep neural network (DNN) is nothing but a neural network which has multiple layers, where multiple can be subjective. IMHO, any network which has 6 or 7 or more layers is considered deep. So, the above would form a very basic definition of a deep network.

12

There is always a lot of confusion about this concept, because the naming is misleading, given that both tree and graph searches produce a tree (from which you can derive a path) while exploring the search space, which is usually represented as a graph. Differences Firstly, we have to understand that the underlying problem (or search space) is almost ...

11

Good question! AlphaZero, though a major milestone, is most definitely not an AGI :) AlphaGo, though strong at the game of Go, is narrowly strong ("strong-narrow AI"), defined as strength in a single problem or type of problem (such as Go and other non-chance, perfect information games.) AGI, at minimum, must be about as strong as humans in all problems ...

10

In the blog post Building powerful image classification models using very little data, bottleneck features are mentioned. What are the bottleneck features? It's clearly written in the link you gave the "bottleneck features" from the VGG16 model: the last activation maps before the fully-connected layers. Do they change with the architecture that is used? ...

10

In English, the fringe is (also) defined as the outer, marginal, or extreme part of an area, group, or sphere of activity. In the context of AI search algorithms, the state (or search) space is usually represented as a graph, where nodes are states and the edges are the connections (or actions) between the corresponding states. If you're performing a tree (...

10

The dynamic programming algorithms (like policy iteration and value iteration) are often presented in the context of reinforcement learning (in particular, in the book Reinforcement Learning: An Introduction by Barto and Sutton) because they are very related to reinforcement learning algorithms, like $Q$-learning. They are all based on the assumption that ...

10

I believe the term you are looking for is "(technological) singularity". https://en.wikipedia.org/wiki/Technological_singularity

9

Non-Euclidian geometry can be generally boiled down to the phrase the shortest path between 2 points isn't necessarily a straight line. Or, put in a way that lends itself very much to machine learning, things that are similar to each other are not necessarily close if one uses Euclidean distance as a metric (aka the triangle inequality doesn't hold). You ...

9

A recurrent neural network (RNN) is an artificial neural network that contains backward or self-connections, as opposed to just having forward connections, like in a feed-forward neural network (FFNN). The adjective "recurrent" thus refers to this backward or self-connections, which create loops in these networks. An RNN can be trained using back-...

9

Agent The other answer defines an agent as a policy (as it's defined in reinforcement learning). However, although this definition is fine for most current purposes, given that currently agents are mainly used to solve video games, in the real world, an intelligent agent will also need to have a body, which Russell and Norvig call an architecture (section 2....

8

In contrast to the philosophical definitions, which rely on terms like "mind" and "think," there are also definitions that hinge on observables. That is, a Strong AI is an AI that understands itself well enough to self-improve. Even if it is philosophically not equivalent to a human, or unable to perform all cognitive tasks that a human can, this AI can ...

8

There are at least two questions in your question: What are some of the methods used to program the successful go playing program? and Are those methods considered to be artificial intelligence? The first question is deep and technical, the second broad and philosophical. The methods have been described in: Mastering the Game of Go with Deep Neural ...

8

TL:DR: Hyper-heuristics are metaheuristics, suited for solving the same kind of optimization problems, but (in principle) affording a "rapid prototyping" approach for non-expert practitioners. In practice, there are issues with the prevailing approach, motivating an emerging perspective on 'whitebox' hyper-heuristics. In more detail: Metaheuristics are ...

8

"Trap" functions were introduced as a way to discuss how GAs behave on functions where sampling most of the search space would provide pressure for the algorithm to move in the wrong direction (wrong in the sense of away from the global optimum). For example, consider a four-bit function f(x) such that f(0000) = 5 f(0001) = 1 f(0010) = 1 f(0011) = 2 f(0100)...

8

There are no distinguishable hardware examples for each IA class. The same mobile robot architecture with proper sensors can be implemented to behave as any IA class. The way you can determine the class of an intelligent agent is from the way it processes the percept. Based on chapter 2 of Artificial Intelligent: A Modern Approach I will try to give a ...

7

The authors do actually give an English definition in terms of the well-known agent formulation of AI: We intend this usage to be intuitive: death means that one sees no more percepts, and takes no more actions. It would seem that this becomes possible for a reinforcement learning agent such as AIXI in a formulation that uses semi-measures of ...

7

'Backprop' is short for 'backpropagation of error' in order to avoid confusion when using backpropagation term. Basically backpropagation refers to the method for computing the gradient of the case-wise error function with respect to the weights for a feedforward networkWerbos. And backprop refers to a training method that uses backpropagation to compute ...

7

In some iterative learning methods the more iterations you apply the more specific your model becomes about the training set. If there are too many iterations, your model will become too specifically trained for the training samples and will score less on other samples that are not seen during the training phase. This is call over-fitting, though over-...

Only top voted, non community-wiki answers of a minimum length are eligible