The authors demonstrate that the Kryptonite-N challenge datasets are solvable by logistic regression with polynomial expansion and L1 regularization, and identify their construction as a high-dimensional XOR problem with 1/3 redundant features.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Kryptonite-N: Machine Learning Strikes Back
The authors demonstrate that the Kryptonite-N challenge datasets are solvable by logistic regression with polynomial expansion and L1 regularization, and identify their construction as a high-dimensional XOR problem with 1/3 redundant features.