MKAN adds hard unconstrained monotonicity to KANs via reparameterization and proves a size bound of at most 2N* for monotone equivalents of ball-partition feature extractors.
Avoiding resentment via monotonic fairness.arXiv preprint arXiv:1909.01251,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Bias
MKAN adds hard unconstrained monotonicity to KANs via reparameterization and proves a size bound of at most 2N* for monotone equivalents of ball-partition feature extractors.