arXiv Machine Learning By K S Sesh Kumar

Geometry-Constrained Kolmogorov-Arnold Networks: Learning Edge Geometry via Banach Duality

Read the original on arXiv Machine Learning →

arXiv:2608. 25807v1 Announce Type: new Abstract: Kolmogorov-Arnold Networks (KANs) replace fixed activations in deep architectures with learnable univariate edge functions, making the choice of edge parametrisation central.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Jun 16

Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Bias

Monotonicity has been a long-running architectural inductive bias for neural networks, motivated by tabular, scientific, and economic settings where outputs are known to respond monotonically to certain inputs. Existing approaches are MLP- or flow-based and lack per-edge functional transparency; the only Kolmogorov--Arnold Network (KAN) variant with monotonicity, MonoKAN, enforces the constraint only on a restricted parameter subset and requires a projection-style training procedure.

arXiv Machine Learning
Oct 16

Kolmogorov-Arnold Networks: Curse of Dimensionality and Structural Bias

The paper investigates Kolmogorov‑Arnold networks (KANs) and their approximation properties. It shows that while KANs can achieve dimension‑independent approximation exponents for targets with smooth univariate edge functions, this advantage is tied to the target structure rather than the architecture itself. Empirical tests reveal that KANs outperform MLPs only when each nonlinear component depends on a single input coordinate; otherwise, MLPs can be more efficient, especially under tight parameter budgets or for interacting targets.

By Yunhao Ni, Yuxin Guo, Jie Luo, Wenjun Wu, Lei Huang
arXiv Machine Learning
Aug 4

An Embedded RISC-V Evaluation of Kolmogorov--Arnold Networks in Hard-Constrained Recurrent Physics-Informed Models

arXiv:2608. 00737v1 Announce Type: new Abstract: Hard-constrained recurrent physics-informed networks (HRPINNs) embed known dynamics inside a recurrent numerical integrator and restrict a neural branch to learning only the residual dynamics that the first-principles model does not capture.

By Enzo Nicolas Spotorno, Josafat Leal Filho