Pith. sign in

REVIEW 2 cited by

LeMON: Learning to Learn Multi-Operator Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.16168 v2 pith:CLQO62CM submitted 2024-08-28 cs.LG

classification cs.LG
keywords learningoperatorsmulti-operatormodelnumberoperatorfamiliesfine-tuning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Single-operator learning involves training a deep neural network to learn a specific operator, whereas recent work in multi-operator learning uses an operator embedding structure to train a single neural network on data from multiple operators. Thus, multi-operator learning is capable of predicting a range of operators within one model. In this work, we propose pretraining and fine-tuning strategies for solving PDEs using multi-operator learning. One key aspect is that by increasing the number of families of operators used in pretraining, a PDE foundation model can be fine-tuned to downstream tasks involving new PDEs with a limited number of samples, thus outperforming single operator neural networks. Specifically, a multi-operator learning model pre-trained with data from diverse PDE families can predict unseen operators after fine-tuning with only a limited number of operators from the new family, enabling them to serve as a data-free PDE solver. We also show that the proposed training and fine-tuning method is able to predict new operators in zero-shot prediction without samples. Additionally, we introduce a PDE-agnostic meta-learning algorithm to improve the adaptability of the model to various PDEs by providing a better parameter initialization process. To address the needs of applications with limited computing resources, we explore low-rank adaptation methods that reduce computational costs while enhancing solver accuracy. Lastly, by examining the scaling law with respect to the number of operator families, we establish and highlight its potential for broad adaptation in PDE-solving tasks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PDEformer-2: A Versatile Foundation Model for Two-Dimensional Partial Differential Equations

    math.NA 2025-07 conditional novelty 6.0 of 10

    PDEformer-2 is a pretrained graph-transformer and implicit-neural-representation model that solves a broad class of 2D PDEs from their symbolic form, with zero-shot, few-shot, and inverse-problem capabilities.

  2. Stochastic and Non-local Closure Modeling for Nonlinear Dynamical Systems via Latent Score-based Generative Models

    cs.LG 2025-06 conditional novelty 4.0 of 10

    Joint training of autoencoders with diffusion models in latent space gives stochastic turbulence closure accuracy close to physical-space diffusion models at roughly 5-7x lower cost.

Pith tools