Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
51 tokens/sec
2000 character limit reached

Koopman Regularization (2403.11302v2)

Published 17 Mar 2024 in math.DS and math.DG

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)

X Twitter Logo Streamline Icon: https://streamlinehq.com