Fixed-Rank Manifold: Tangent Spaces and Local Defining Functions

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 3 of 3

Introduces Manopt, a toolbox for optimization on manifolds, covering gradient and Hessian checks, solver calls, and manual caching.

Algorithmic Complexity: Theta Notation

Explores algorithmic complexity, comparing growth rates using Theta notation and characterizing different complexity classes.

Tangent spaces to submanifolds

Introduces tangent spaces to submanifolds and their properties in optimization on manifolds.

Computational Complexity

Covers the basics of computational complexity, including big O notation and complexity classes.

Distributed Intelligent Systems: Division of Labor and Multi-Robot Coordination

Explores division of labor in natural systems, multi-robot coordination, and the challenges of uncertainty in market-based algorithms.

Complexity & Induction: Algorithms & Proofs

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Tangent vectors without embedding space: Making tangent spaces linear

Explores making tangent spaces linear, defining tangent vectors without an embedding space and their operations, as well as the equivalence of different tangent space notions.

Naive Bayes: Gaussian Discriminant Analysis

Covers the Naive Bayes assumption, Gaussian Discriminant Analysis, ML estimates, and Kernel trick.

Algorithmic Complexity: Travel Time Analysis

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Direct Methods for Linear Equations

Covers direct methods for solving linear equations and computation complexity of substitution.