---
title: "Self-Supervised Learning of Universal Latent Spaces for Operator Learning"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2611.05735v1"
permalink: "https://feed.astralor.com/items/itm_daefe569e2462078a27bcaf4"
published: "2026-11-03T23:10:27.000Z"
score: 60
channel: "tech"
tags: ["推理效率","多模态","Self-Supervised Learning","Universal Latent Spaces","Operator Learning Neural","Following","Neural","PDEs"]
---

# Self-Supervised Learning of Universal Latent Spaces for Operator Learning

## At a glance

Neural operators fit their representation of functions to the task they are trained on, so every new task rebuilds a reduced space from labeled data. Following the self-supervised pre-training that made representations …

## Key points

- Neural operators fit their representation of functions to the task they are trained on, so every new task rebuilds a reduced space from labeled data.
- Following the self-supervised pre-training that made representations shareable in natural language processing and computer vision, we decouple representation learning from operator learning.
- A functional autoencoder is pre-trained on analytic functions synthesized on the fly, with no solver and no labels, to represent functions on arbitrary point clouds, and the latent space it induces is frozen and reused …

## Full text

Neural operators fit their representation of functions to the task they are trained on, so every new task rebuilds a reduced space from labeled data. Following the self-supervised pre-training that made representations shareable in natural language processing and computer vision, we decouple representation learning from operator learning. A functional autoencoder is pre-trained on analytic functions synthesized on the fly, with no solver and no labels, to represent functions on arbitrary point clouds, and the latent space it induces is frozen and reused across tasks. The representation is exactly equivariant to translation, dilation, and amplitude, and reconstructs solutions of partial differential equations (PDEs) and natural images on geometries it never saw. Being task-agnostic, the latent space can be interpreted in its own right. The whole space is used and decodes to valid fields, it preserves the ordering of distances between physical fields, its geodesics interpolate physical evolutions, and edit directions transfer across fields. With frozen representation maps, a dataset is encoded once and a neural operator is trained entirely on cached embeddings, which saves memory and training time. On 28 tasks in fluid dynamics, solid mechanics, acoustics, and the Helmholtz and Poisson equations, this paradigm can exceed the accuracy of state-of-the-art end-to-end architectures, with up to an order of magnitude higher throughput and memory savings that fit models nearly two orders of magnitude larger on consumer-grade GPUs. At inference, latent rollouts run up to an order of magnitude faster than regular rollouts, and chunked inference processes functions of over half a billion points on a single consumer-grade GPU.

---

Verify against the original before citing; curated by Astral Feed: https://feed.astralor.com/items/itm_daefe569e2462078a27bcaf4