Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.

# Tag Info

21

Yes, it has been done! However, the applications aren't to replace calculators or anything like that. The lab I'm associated with develops neural network models of equational reasoning to better understand how humans might solve these problems. This is a part of the field known as Mathematical Cognition. Unfortunately, our website isn't terribly informative,...

14

Artificial Intelligence is a very broad field and it covers many and very deep areas of computer science, mathematics, hardware design and even biology and psychology. As for the math: I think calculus, statistics and optimization are the most important topics, but learning as much math as you can won't hurt. There are many good free introductory resources ...

10

Start with Andrew Ng's introduction to Machine Learning course on Coursera. There are not many prerequisites for that course, but you will learn how to make some useful things. And, more importantly, it will clearly show you which subjects you need to learn next.

9

To excel in in AI you need a mathematical intuition or point of view. In order to become a full stack AI engineer, it is important that you have a firm understanding of the mathematical foundations of machine learning. My advice to anyone preparing to jump into the field is that learning mathematics is about doing. Remember the 20/80 rule. You need to ...

9

First, a small clarification; they do not say that "the gradient of a deterministic policy is 0" (I'm not sure what, if anything, "the gradient of a policy") would mean. They are talking about how "this gradient" (referring to the gradient on the slide visible in the video) is 0 in the case where the policy ($\pi$) is deterministic. Now, here is the ...

9

In artificial intelligence (sometimes called machine intelligence or computational intelligence), there are several problems that are based on mathematical topics, especially optimization, statistics, probability theory, calculus and linear algebra. Marcus Hutter has worked on a mathematical theory for artificial general intelligence, called AIXI, which is ...

8

Not really. Neural networks are good for determining non-linear relationships between inputs when there are hidden variables. In the examples above the relationships are linear, and there are no hidden variables. But even if they were non-linear, a traditional ANN design would not be well suited to accomplish this. By carefully constructing the layers and ...

8

It seems to me that you already understand the shortcomings of ReLUs and sigmoids (like dead neurons in the case of plain ReLU). I would suggest looking at ELU (exponential linear units) and SELU (self-normalising version of ELU). Under some mild assumptions, the latter have the nice property of self-normalisation, which mitigates the problem of vanishing ...

8

Good Mathematics Foundation Begin by ensuring full competency with intermediate algebra and some other foundations of calculus and discrete math, including the terminology and basic concepts within these topics. Infinite series Logical proofs Linear algebra and matrices Analytic geometry, especially the distinction between local and global extremes (minima ...

7

Let's start with the basics: Calculus (Derivatives, Integrals, and Series - get comfortable with summation and product notations). Multi-variable Calculus (Gradients, Directional Derivatives, Vectors) http://tutorial.math.lamar.edu/ (go to content in top left corner - work your way through Calculus 1, 2, 3. Linear Algebra (this is a big one , co-variance ...

7

The notation I'll be using is from two different lectures by David Silver and is also informed by these slides. The expected Bellman equation is $$v_\pi(s) = \sum_{a\in \cal{A}} \pi(a|s) \left(\cal{R}_s^a + \gamma\sum_{s' \in \cal{S}} \cal{P}_{ss'}^a v_\pi(s')\right) \tag 1$$ If we let $$\cal{P}_{ss'}^\pi = \sum\limits_{a \in \cal{A}} \pi(a|s)\cal{P}_{ss'}... 7 The MSE can be defined as (\hat{y} - y)^2, which should be equivalent to (y - \hat{y})^2 They are not just "equivalent". It is actually the exact same function, with two different ways to write it.$$(\hat{y} - y)^2 = (\hat{y} - y)(\hat{y} - y) = \hat{y}^2 -2\hat{y}y + y^2(y - \hat{y})^2 = (y -\hat{y})(y - \hat{y}) = y^2 -2y\hat{y} + \hat{y}^2$$... 6 I work as a professor, and recently designed the mathematics requirements for a new AI major, in consultation with many of my colleagues at other institutions. The other answers, particularly @FauChrisian's do a good job of cataloging all the specific topics that might be useful somewhere in AI, but not all of them are equally useful for understanding core ... 6 Existing production systems, developed over the last few decades, have the rules of inference coded into them. They are based on the vision of Leibniz that all classical logic can be encoded into symbolic language and processed mechanically. First order predicate logic was developed and a nomeclature was formalized. Although the vision of automatic ... 6 EE Math Refresh AI is an interdisciplinary field. You can begin by ensuring you are fresh in the mathematics you've already taken. You may already have all the books from your BS and MS. Infinite series Logical proofs Linear algebra and matrices Analytic geometry, especially the distinction between local and global extremes (minima and maxima), saddle ... 6 Let's start by looking at:$$\max_s \Bigl\lvert \mathbb{E}_{\pi} \left[ G_{t:t+n} \mid S_t = s \right] - v_{\pi}(s) \Bigr\rvert.We can rewrite this by plugging in the definition of G_{t:t+n}: \begin{aligned} & \max_s \Bigl\lvert \mathbb{E}_{\pi} \left[ G_{t:t+n} \mid S_t = s \right] - v_{\pi}(s) \Bigr\rvert \\ % =& \max_s \Bigl\lvert \mathbb{... 6 The derivative of \mathcal{L_1}(y, x) = (\hat{y} - y)^2 = (f(x) - y)^2 with respect to \hat{y}, where f is the model and \hat{y} = f(x) is the output of the model, is \begin{align} \frac{d}{d \hat{y}} \mathcal{L_1} &= \frac{d}{d \hat{y}} (\hat{y} - y)^2 \\ &= 2(\hat{y} - y) \frac{d}{d \hat{y}} (\hat{y} - y) \\ &= 2(\hat{y} - y) (1) \\ &... 6 If what you are asking is what is the intuition for using the derivative in backpropagation learning, instead of an in-depth mathematical explanation: Recall that the derivative tells you a function's sensitivity to change with respect to a change in its input. A high (absolute) value for the derivative at a certain point means that the function is very ... 5 AI is quite large in scope and it sits at the intersection of several areas. However, there are a few essential fields or topics that you need to know Set theory Logic Linear algebra Calculus Probability and statistics I would recommend you to first explore the AI algorithms that you might be interested in. I advise you to start with machine learning and ... 5 1) It is possible! In fact, it's an example of the popular deep learning framework Keras. Check out this link to see the source code. 2) This particular example uses a recurrent neural network (RNN) to process the problem as a sequence of characters, producing a sequence of characters which form the answer. Note that this approach is obviously different ... 5 To my knowledge, recursion does not play a strong role in the definition of modern AI techniques, although it does feature used in Lovasz's definition of 'Local Search' and Kurzweil is certainly an advocate. Recursion can be seen as an elegant 'architectural factorization' - building complexity by combining the results of smaller, similar patterns ... 5 You should begin from Dr Andrew Ng machine learning course on Coursera. It's probably the most popular course for newcomers in machine learning. It's a free course. You should also grab "Elements of Statistical Learning" ebook PDF. It's a free book. You may want to focus on: Regression Cross validation Bias-variance tradeoff Decision surface Gradient ... 5 You'll find that both Calculus and Linear Algebra have some application in AI/ML techniques. In many senses, you can argue that most of ML reduces to Linear Algebra, and Calculus is used in, eg. the backpropagation algorithm for training neural networks. You'd be well served to take a class or two in probability and statistics as well. Programming ... 5 In a genetic algorithm, crossover (recombination) is the analogy to mating in the real world. For example, you have some genetic information from each parent. In the case of an optimization where you have vectors of features (design variables), you could represent it as vector 1 and 2. Imagine each vector has 10 values. You grab the first 5 from vector 1, ... 5 Maybe. AI has a long history of encountering mathematical impossibilities and then working around them already. While the individuals who solved these problems don't get as much press as Newton, Einstein, or Hawking, a case could be made that their contributions to human knowledge are on a similar scale. Unfortunately, their results don't relate to physical ... 5 There is an assumption behind the theory training a neural network, or using any piece-wise learning method, that a training sample is representative of the data set as a whole - that it has been sampled fairly from the population that the learning algorithm has been set up to approximate. The term i.i.d. stands for "independent and identically distributed"... 5 g(x) = x^2 is indeed a parabola and thus has just one optimum. However, the \text{MSE}(\boldsymbol{x}, \boldsymbol{y}) = \sum_i (y_i - f(x_i))^2, where \boldsymbol{x} are the inputs, \boldsymbol{y} the corresponding labels and the function f is the model (e.g. a neural network), is not necessarily a parabola. In general, it is only a parabola if ... 5 This is conditioning in the sense of conditional probability. The idea is that the authors have some "standard physically-inspired features". They are splitting the data up into bins based on the values of these features, and then training a model for each bin. They are then examining the differences between the models. Usually this is done to learn ... 5 A stochastic process has the Markov property if the probability distribution of future states conditioned on both the present and past states depends only on the present state or, more formally, the following equality holds. p(s_{t+1} \mid s_{t}, s_{t-1:1}) = p(s_{t+1} \mid s_{t}), \forall t  The hidden Markov model (HMM) is an example of a model ...

4

When I got interested in AI, I started with the most basic things. My very first book was Russell&Norvig's Artificial Intelligence- A modern Approach. I think that's a good place to start, even if you're mostly interested in Deep Nets. It treats not just the basic AI concepts and algorithms (expert systems, depth-first and breadth-first search,knowledge ...

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