Pith. sign in

REVIEW 1 cited by

DropKAN: Regularizing KANs by masking post-activations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.13044 v4 pith:AMCDAJTL submitted 2024-07-17 cs.LG cs.AI

classification cs.LGcs.AI
keywords kansdropkandropoutbetterconsistentlygeneralizationkolmogorov-arnoldlead
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose DropKAN (Dropout Kolmogorov-Arnold Networks) a regularization method that prevents co-adaptation of activation function weights in Kolmogorov-Arnold Networks (KANs). DropKAN functions by embedding the drop mask directly within the KAN layer, randomly masking the outputs of some activations within the KANs' computation graph. We show that this simple procedure that require minimal coding effort has a regularizing effect and consistently lead to better generalization of KANs. We analyze the adaptation of the standard Dropout with KANs and demonstrate that Dropout applied to KANs' neurons can lead to unpredictable behavior in the feedforward pass. We carry an empirical study with real world Machine Learning datasets to validate our findings. Our results suggest that DropKAN is consistently a better alternative to using standard Dropout with KANs, and improves the generalization performance of KANs. Our implementation of DropKAN is available at: \url{https://github.com/Ghaith81/dropkan}.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. KAA: Kolmogorov-Arnold Attention for Enhancing Attentive Graph Neural Networks

    cs.LG 2025-01 conditional novelty 5.0 of 10

    Swapping attentive GNN score mappings for a single-layer Kolmogorov-Arnold Network improves benchmark performance and, on a specially constructed input matrix, provably achieves zero maximum ranking error.

Pith tools