Skip to content
DraconiticResearch
Search Sources API
179,152 studies31 sourcesUpdated 12 min ago
PreprintCC BY-NC-SA 4.0arXiv

Tractable Inference with Kolmogorov-Arnold Networks

Abstract

Machine-learning surrogates in computational science often require not only accurate predictions but also expectations, variances, conserved integrals, and normalization constants. Conventional neural networks, including Kolmogorov--Arnold networks (KANs), generally evaluate these quantities through Monte Carlo sampling or multidimensional quadrature, making repeated inference costly, particularly in high dimensions. We introduce KANs with Tractable Operators for Uncertainty and Constraints (TOUCKANs), whose finite-degree polynomial outer functions yield a decomposable sum--product representation. Under factorizing input measures, expectations and higher moments then reduce algebraically to deterministic recursions over one-dimensional leaf integrals. Independent and shared inner-block variants form a parameter-efficiency hierarchy, and a universal-approximation proof for its most restricted member extends to the complete class. The same deterministic operators allow conserved integrals and normalization to be imposed throughout training. Across uniform and Gaussian benchmarks through 50 dimensions, deterministic mean and variance errors remained below the median fixed-budget Monte Carlo errors in every case. TOUCKANs also conserved Cahn--Hilliard mass to machine precision and imposed normalization and orthogonality through deterministic moments, enabling joint computation of the lowest four Schrödinger eigenpairs in two, three, and five dimensions. TOUCKANs therefore connect KAN approximation with tractable probabilistic circuits, making statistical operators and integral constraints directly available within an expressive neural surrogate.

Related

  1. Kolmogorov-Arnold Networks for Free-Boundary Partial Differential Equations
    Tan Phuong Dong Le
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. AKAPINN: Adaptive Kolmogorov-Arnold Physics-Informed Neural Networks for approximating solutions to quasilinear partial differential equations
    B. Veena S. N. Rao
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  3. Mesh-Free Numerical Approximation of the Biharmonic Equation via Optimized Kolmogorov--Arnold Neural Networks
    B. Veena S. N. Rao
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  4. Optimization Risk Bounds for Kolmogorov-Arnold Networks Trained by DP-SGD with Correlated Noise
    Puyu Wang, Jan Schuchardt, Nikita Kalinin +5
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Higher-Order Kolmogorov-Arnold Networks for Dynamics
    Kevin Slote, Jeremie Fish
    arXivPreprintCC BY 4.0Full textDynamical systemsarXiv
BibTeX
@misc{toscano2026tractable,
  title = {{Tractable Inference with Kolmogorov-Arnold Networks}},
  author = {Juan Diego Toscano and Sascha Ranftl and Zhiwei Gao and Li-Lian Wang and George Em Karniadakis},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.29909},
  eprint = {2610.29909},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.29909},
  note = {CC BY-NC-SA 4.0},
}
RIS
TY  - UNPB
TI  - Tractable Inference with Kolmogorov-Arnold Networks
AU  - Juan Diego Toscano
AU  - Sascha Ranftl
AU  - Zhiwei Gao
AU  - Li-Lian Wang
AU  - George Em Karniadakis
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.29909
UR  - https://arxiv.org/abs/2610.29909
AB  - Machine-learning surrogates in computational science often require not only accurate predictions but also expectations, variances, conserved integrals, and normalization constants. Conventional neural networks, including Kolmogorov--Arnold networks (KANs), generally evaluate these quantities through Monte Carlo sampling or multidimensional quadrature, making repeated inference costly, particularly in high dimensions. We introduce KANs with Tractable Operators for Uncertainty and Constraints (TOUCKANs), whose finite-degree polynomial outer functions yield a decomposable sum--product representation. Under factorizing input measures, expectations and higher moments then reduce algebraically to deterministic recursions over one-dimensional leaf integrals. Independent and shared inner-block variants form a parameter-efficiency hierarchy, and a universal-approximation proof for its most restricted member extends to the complete class. The same deterministic operators allow conserved integrals and normalization to be imposed throughout training. Across uniform and Gaussian benchmarks through 50 dimensions, deterministic mean and variance errors remained below the median fixed-budget Monte Carlo errors in every case. TOUCKANs also conserved Cahn--Hilliard mass to machine precision and imposed normalization and orthogonality through deterministic moments, enabling joint computation of the lowest four Schrödinger eigenpairs in two, three, and five dimensions. TOUCKANs therefore connect KAN approximation with tractable probabilistic circuits, making statistical operators and integral constraints directly available within an expressive neural surrogate.
ER  -