Function graph transformers use graph measures to provide a measure-theoretic framework where standard transformer components universally approximate operators between function spaces while preserving single-valued function outputs.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
Nonsmooth extension of the Brezzi-Rappaz-Raviart approximation theorem via metric regularity, applied to quasi-optimal finite-element error estimates for viscous Hamilton-Jacobi equations and second-order mean field games.
Spectral asymptotics for negative fractional powers of hypoelliptic operators on graded Lie groups generalize Birman-Solomyak and imply a version of Connes' integration formula.
Probabilistic programs of thought let LLMs produce many program variants from one generation by building a compact probabilistic representation of the token distribution.
citing papers explorer
-
Function graph transformers universally approximate operators between function spaces
Function graph transformers use graph measures to provide a measure-theoretic framework where standard transformer components universally approximate operators between function spaces while preserving single-valued function outputs.
-
A nonsmooth extension of the Brezzi-Rappaz-Raviart approximation theorem via metric regularity techniques and applications to nonlinear PDEs
Nonsmooth extension of the Brezzi-Rappaz-Raviart approximation theorem via metric regularity, applied to quasi-optimal finite-element error estimates for viscous Hamilton-Jacobi equations and second-order mean field games.
-
Weyl asymptotic formulas in the nilpotent Lie group setting
Spectral asymptotics for negative fractional powers of hypoelliptic operators on graded Lie groups generalize Birman-Solomyak and imply a version of Connes' integration formula.
-
Probabilistic Programs of Thought
Probabilistic programs of thought let LLMs produce many program variants from one generation by building a compact probabilistic representation of the token distribution.