kooplearn: A Scikit-Learn Compatible Library of Algorithms for Evolution Operator Learning

• URL: http://arxiv.org/abs/2512.21409v1
• Date: Wed, 24 Dec 2025 20:15:41 GMT
• Title: kooplearn: A Scikit-Learn Compatible Library of Algorithms for Evolution Operator Learning
• Abstract summary: kooplearn is a machine-learning library that implements linear, kernel, and deep-learning estimators of dynamical operators.<n>kooplearn can model both discrete-time evolution operators (Koopman/Transfer) and continuous-time infinitesimal generators.
• Score: 27.938061370129148
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: kooplearn is a machine-learning library that implements linear, kernel, and deep-learning estimators of dynamical operators and their spectral decompositions. kooplearn can model both discrete-time evolution operators (Koopman/Transfer) and continuous-time infinitesimal generators. By learning these operators, users can analyze dynamical systems via spectral methods, derive data-driven reduced-order models, and forecast future states and observables. kooplearn's interface is compliant with the scikit-learn API, facilitating its integration into existing machine learning and data science workflows. Additionally, kooplearn includes curated benchmark datasets to support experimentation, reproducibility, and the fair comparison of learning algorithms. The software is available at https://github.com/Machine-Learning-Dynamical-Systems/kooplearn.

Related papers

• A Library for Learning Neural Operators [75.14579433742178]
  We present NeuralOperator, an open-source Python library for operator learning.<n> Neural operators generalize neural networks to maps between function spaces instead of finite-dimensional Euclidean spaces.<n>Built on top of PyTorch, NeuralOperator provides all the tools for training and deploying neural operator models.
  arXiv  Detail & Related papers  (2024-12-13T18:49:37Z)
• Attribute-to-Delete: Machine Unlearning via Datamodel Matching [65.13151619119782]
  Machine unlearning -- efficiently removing a small "forget set" training data on a pre-divertrained machine learning model -- has recently attracted interest. Recent research shows that machine unlearning techniques do not hold up in such a challenging setting.
  arXiv  Detail & Related papers  (2024-10-30T17:20:10Z)
• How to unlearn a learned Machine Learning model ? [0.0]
  I will present an elegant algorithm for unlearning a machine learning model and visualize its abilities. I will elucidate the underlying mathematical theory and establish specific metrics to evaluate both the unlearned model's performance on desired data and its level of ignorance regarding unwanted data.
  arXiv  Detail & Related papers  (2024-10-13T17:38:09Z)
• Fast Exact Unlearning for In-Context Learning Data for LLMs [30.06631665962119]
  We show that for large language models we can efficiently unlearn "fine-tuning data"<n>We show that accurate in-context learning can be done with quantized k-means, which allows for effectively constant time unlearning operations.
  arXiv  Detail & Related papers  (2024-02-01T16:43:04Z)
• Learn to Unlearn for Deep Neural Networks: Minimizing Unlearning Interference with Gradient Projection [56.292071534857946]
  Recent data-privacy laws have sparked interest in machine unlearning. Challenge is to discard information about the forget'' data without altering knowledge about remaining dataset. We adopt a projected-gradient based learning method, named as Projected-Gradient Unlearning (PGU) We provide empirically evidence to demonstrate that our unlearning method can produce models that behave similar to models retrained from scratch across various metrics even when the training dataset is no longer accessible.
  arXiv  Detail & Related papers  (2023-12-07T07:17:24Z)
• biquality-learn: a Python library for Biquality Learning [0.0]
  Biquality Learning is proposed as a framework to design algorithms capable of handling weaknesses of supervision and dataset shifts. Python library for Biquality Learning with an intuitive and consistent API to learn machine learning models from biquality data.
  arXiv  Detail & Related papers  (2023-08-18T16:01:18Z)
• What learning algorithm is in-context learning? Investigations with linear models [87.91612418166464]
  We investigate the hypothesis that transformer-based in-context learners implement standard learning algorithms implicitly. We show that trained in-context learners closely match the predictors computed by gradient descent, ridge regression, and exact least-squares regression. Preliminary evidence that in-context learners share algorithmic features with these predictors.
  arXiv  Detail & Related papers  (2022-11-28T18:59:51Z)
• ModelDiff: A Framework for Comparing Learning Algorithms [86.19580801269036]
  We study the problem of (learning) algorithm comparison, where the goal is to find differences between models trained with two different learning algorithms. We present ModelDiff, a method that leverages the datamodels framework to compare learning algorithms based on how they use their training data.
  arXiv  Detail & Related papers  (2022-11-22T18:56:52Z)
• Few-Shot Non-Parametric Learning with Deep Latent Variable Model [50.746273235463754]
  We propose Non-Parametric learning by Compression with Latent Variables (NPC-LV) NPC-LV is a learning framework for any dataset with abundant unlabeled data but very few labeled ones. We show that NPC-LV outperforms supervised methods on all three datasets on image classification in low data regime.
  arXiv  Detail & Related papers  (2022-06-23T09:35:03Z)
• Deeptime: a Python library for machine learning dynamical models from time series data [3.346668383314945]
  Deeptime is a general purpose Python library offering various tools to estimate dynamical models based on time-series data. In this paper we introduce the main features and structure of the deeptime software.
  arXiv  Detail & Related papers  (2021-10-28T10:53:03Z)
• Deep Reinforcement Learning for Adaptive Learning Systems [4.8685842576962095]
  We formulate the problem of how to find an individualized learning plan based on learner's latent traits. We apply a model-free deep reinforcement learning algorithm that can effectively find the optimal learning policy. We also develop a transition model estimator that emulates the learner's learning process using neural networks.
  arXiv  Detail & Related papers  (2020-04-17T18:04:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.