3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.LG2025
KAN/H: Kolmogorov-Arnold Network using Haar-like bases
Susumu Katayama
Function approximation using Haar basis systems offers an efficient implementation when compressed via Patricia trees while retaining the flexibility of wavelets for both global an…
cs.AI2018★ 3 cited
General-purpose Declarative Inductive Programming with Domain-Specific Background Knowledge for Data Wrangling Automation
Lidia Contreras-Ochando, César Ferri, José Hernández-Orallo +3
Given one or two examples, humans are good at understanding how to solve a problem independently of its domain, because they are able to detect what the problem is and to choose th…
cs.AI2018★ 1 cited
Computable Variants of AIXI which are More Powerful than AIXItl
Susumu Katayama
This paper presents Unlimited Computable AI, or UCAI, that is a family of computable variants of AIXI. UCAI is more powerful than AIXItl, that is a conventional family of computabl…