Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
N-step TD Methods: SARSA and Expected SARSA
Graph Chatbot
Related lectures (28)
Previous
Page 1 of 3
Next
Numerical Methods: Euler and Crank-Nicolson
Covers Euler and Crank-Nicolson methods for solving differential equations.
System of ODEs
Explores numerical methods for solving ODE systems, stability regions, and absolute stability importance.
High Order Methods: Space Discretisation
Covers high order methods for space discretisation in linear differential systems.
Reinforcement Learning: Policy Gradient and Actor-Critic Methods
Provides an overview of reinforcement learning, focusing on policy gradient and actor-critic methods for deep artificial neural networks.
Optimal Transport: Gradient Flows in Rd
Explores optimal transport and gradient flows in Rd, emphasizing convergence and the role of Lipschitz and Picard-Lindelöf theorems.
Explicit Stabilised Methods: Stochastic Differential Equations
Covers explicit stabilized methods for stiff stochastic differential equations, analyzing their properties and applications.
Neural Networks: Multilayer Learning
Covers the fundamentals of multilayer neural networks and deep learning, including back-propagation and network architectures like LeNet, AlexNet, and VGG-16.
Runge-Kutta Methods
Explains the Runge-Kutta methods, particularly the explicit scheme of order 4 (ERK4), and how to optimize parameters for accuracy.
Euler Backward Method: ODEs
Explores the Euler backward method for ODEs, discussing stability, error reduction, and implicit vs explicit methods.
Runge Kutta and Multistep Methods
Explores Runge Kutta and multistep methods for solving ODEs, including Backward Euler and Crank-Nicolson.