A continuous Graham Scan constructs exact convex envelopes of univariate polynomials for strong convex relaxations of polynomial Kolmogorov-Arnold Networks.
The complexity of the matrix eigenproblem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Efficient Convexification of Kolmogorov-Arnold Networks with Polynomial Functional Forms Via a Continuous Graham Scan Approach
A continuous Graham Scan constructs exact convex envelopes of univariate polynomials for strong convex relaxations of polynomial Kolmogorov-Arnold Networks.