paper-with-me

홈 › Papers

Universal Neural Functionals

2024-02-07 · Allan Zhou, Chelsea Finn, James Harrison

A challenging problem in many modern machine learning tasks is to process weight-space features, i.e., to transform or extract information from the weights and gradients of a neural network. Recent works have developed promising weight-space models that are equivariant to the permutation symmetries of simple feedforward networks. However, they are not applicable to general architectures, since the permutation symmetries of a weight space can be complicated by recurrence or residual connections. This work proposes an algorithm that automatically constructs permutation equivariant models, which we refer to as universal neural functionals (UNFs), for any weight space. Among other applications, we demonstrate how UNFs can be substituted into existing learned optimizer designs, and find promising improvements over prior methods when optimizing small image classifiers and language models. Our results suggest that learned optimizers can benefit from considering the (symmetry) structure of the weight space they optimize. We open-source our library for constructing UNFs at https://github.com/AllanYangZhou/universal_neural_functional.

📄 PDF Abstract BibTeX arXiv:2402.05232

Code (1)

allanyangzhou/universal_neural_functional 공식 구현 jax

Methods 이 논문이 사용한 방법론

Library 설명 없음

Similar Papers 제목 키워드 기반

Global universal approximation with Brownian signatures

2025-12-18 · Mihriban Ceylan, David J. Prömel arxiv

We establish $L^p$-universal approximation theorems for general path-dependent and non-anticipative functionals on suitable rough path spaces, showing that linear functionals acting on signatures of time-extended rough p…

Gaussian Processes

Universal approximation with signatures of non-geometric rough paths

2026-02-05 · Mihriban Ceylan, Anna P. Kwossek, David J. Prömel arxiv

We establish a universal approximation theorem for signatures of rough paths that are not necessarily weakly geometric. By extending the path with time and its rough path bracket terms, we prove that linear functionals o…

Global universality via discrete-time signatures

2026-03-10 · Mihriban Ceylan, David J. Prömel arxiv

We establish global universal approximation theorems for non-anticipative and general path-dependent functionals on spaces of piecewise linear paths, stating that linear functionals of the corresponding signatures are de…

Understanding Kernel Ridge Regression: Common behaviors from simple functions to density functionals

2015-01-16 · Kevin Vu, John Snyder, Li Li, Matthias Rupp 외

Accurate approximations to density functionals have recently been obtained via machine learning (ML). By applying ML to a simple function of one variable without any random sampling, we extract the qualitative dependence…

BIG-bench Machine Learningregression

Universal Approximation of Continuous Functionals on Compact Subsets via Linear Measurements and Scalar Nonlinearities

2026-02-03 · Andrey Krylov, Maksim Penkin arxiv

We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continu…