DAREK -- Distance Aware Error for Kolmogorov Networks
원문 초록
In this paper, we provide distance-aware error bounds for Kolmogorov Arnold Networks (KANs). We call our new error bounds estimator DAREK -- Distance Aware Error for Kolmogorov networks. Z. Liu et al. provide error bounds, which may be loose, lack distance-awareness, and are defined only up to an unknown constant of proportionality. We review the error bounds for Newton's polynomial, which is then generalized to an arbitrary spline, under Lipschitz continuity assumptions. We then extend these bounds to nested compositions of splines, arriving at error bounds for KANs. We evaluate our method by estimating an object's shape from sparse laser scan points. We use KAN to fit a smooth function to the scans and provide error bounds for the fit. We find that our method is faster than Monte Carlo approaches, and that our error bounds enclose the true obstacle shape reliably.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Pushing the Performance of Synthetic Speech Detection with Kolmogorov-Arnold Networks and Self-Supervised Learning Models
Automated Modeling Method for Pathloss Model Discovery
"KAN you hear me?" Exploring Kolmogorov-Arnold Networks for Spoken Language Understanding
TK-Mamba: Marrying KAN with Mamba for Text-Driven 3D Medical Image Segmentation
X-KAN: Optimizing Local Kolmogorov-Arnold Networks via Evolutionary Rule-Based Machine Learning
Improving Generalizability of Kolmogorov-Arnold Networks via Error-Correcting Output Codes
토론
이 논문과 연결된 포럼 글이 아직 없습니다.