Papers
Topics
Authors
Recent
Search
2000 character limit reached

Koopman Regularization

Published 17 Mar 2024 in math.DS and math.DG | (2403.11302v2)

Abstract: \emph{Koopman Regularization} is a constrained optimization-based method to learn the governing equations from sparse and corrupted samples of the vector field. \emph{Koopman Regularization} extracts a functionally independent set of Koopman eigenfunctions from the samples. This set implements the principle of parsimony, since, even though its cardinality is finite, it restores the dynamics precisely. \emph{Koopman Regularization} formulates the Koopman Partial Differential Equation as the objective function and the condition of functional independence as the feasible region. Then, this work suggests a barrier method-based algorithm to solve this constrained optimization problem that yields promising results in denoising, generalization, and dimensionality reduction.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.