K-DAREK

Distance Aware Error for Kurkova Kolmogorov Networks

Masoud Ataei

University of Maine

Masoud.Ataei@maine.edu

Vikas Dhiman

University of Maine

Vikas.Dhiman@maine.edu

Mohammad Javad Khojasteh

Rochester Institute of Technology

mjkeme@rit.edu

Abstract

K-DAREK is a novel extension of DAREK that introduces distance-aware error bounds for more robust function approximation. By measuring uncertainty based on the distance to training data, it produces tighter and more meaningful confidence estimates. Evaluations on safe control tasks show K-DAREK is faster, more scalable, and safer than methods like Gaussian Processes, Deep Ensembles, and earlier versions such as DAREK.

DAREK Abstract Illustration
DAREK Abstract Illustration

Interactive Demo of Newton Polynomial

Lipschitz constant
Knots
Newton
Polynomial
Interpolate
Error
GP-mean
GP-std

Click and drag any circle. Newton polynomial and interpolation error bounds.

Highlights

Results

Base GIF

Multi agent simulation.

Cite This Work