Lecture

Fixed-Rank Manifold: Tangent Spaces and Local Defining Functions

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-512: Optimization on manifolds

We develop, analyze and implement numerical algorithms to solve optimization problems of the form min f(x) where x is a point on a smooth manifold. To this end, we first study differential and Riemannian geometry (with a focus dictated by computational con ...

Description

This lecture delves into the concept of fixed-rank matrices, exploring how to show that they form an embedded submanifold. The instructor explains the challenges in constructing local defining functions for the manifold and demonstrates how to determine the dimension and tangent spaces of the manifold using a practical approach. By representing matrices in a specific format, the lecture showcases how to efficiently compute tangent vectors at a given point on the manifold. The discussion emphasizes the importance of this approach in managing memory and computational complexity when working with high-dimensional matrices.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Nicolas Boumal

Teaching & PhD PhD Students Andreea-Alexandra Musat Past EPFL PhD Students Christopher Criscitiello, Quentin Rebjock Courses Continuous optimization MATH-329 This course introduces students to continuous, nonlinear optimization. We study the theory of optimization with continuous variables (with full proofs), and we analyze and implement important algorithms to solve constrained and unconstrained problems. Linear Algebra MATH-111(e) The purpose of the course is to introduce

Official source

Related concepts (21)

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Computational complexity theory

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.

Tangent space

In mathematics, the tangent space of a manifold is a generalization of to curves in two-dimensional space and to surfaces in three-dimensional space in higher dimensions. In the context of physics the tangent space to a manifold at a point can be viewed as the space of possible velocities for a particle moving on the manifold. In differential geometry, one can attach to every point of a differentiable manifold a tangent space—a real vector space that intuitively contains the possible directions in which one can tangentially pass through .

Submanifold

In mathematics, a submanifold of a manifold M is a subset S which itself has the structure of a manifold, and for which the inclusion map S → M satisfies certain properties. There are different types of submanifolds depending on exactly which properties are required. Different authors often have different definitions. In the following we assume all manifolds are differentiable manifolds of class Cr for a fixed r ≥ 1, and all morphisms are differentiable of class Cr.

Differentiable manifold

In mathematics, a differentiable manifold (also differential manifold) is a type of manifold that is locally similar enough to a vector space to allow one to apply calculus. Any manifold can be described by a collection of charts (atlas). One may then apply ideas from calculus while working within the individual charts, since each chart lies within a vector space to which the usual rules of calculus apply. If the charts are suitably compatible (namely, the transition from one chart to another is differentiable), then computations done in one chart are valid in any other differentiable chart.

Related lectures (64)

Projection Pursuit Regression: Nonlinear Modeling and Interpretability

Explores Projection Pursuit Regression for nonlinear modeling and the trade-offs with interpretability in neural networks.

Retractions vector fields and tangent bundles: Tangent bundles MOOC: Introduction to optimization on smooth manifolds: first order methods

Covers retractions, tangent bundles, and embedded submanifolds on manifolds with proofs and examples.

Learning from Probabilistic Models

Delves into challenges of learning from probabilistic models, covering computational complexity, data reconstruction, and statistical gaps.

From embedded to general manifolds: upgrading our foundations

Explores the transition from embedded to general manifolds, upgrading foundational concepts and discussing mathematical reasons for both approaches.

Tangent Spaces and Submersions