The paper fully characterizes the parameterized complexity of approximate first-order stationarity testing for continuous piecewise-affine functions and shallow ReLU CNN losses with respect to the dimension parameter, including XP algorithms, W[1]-hardness, and ETH lower bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
The paper fully characterizes the parameterized complexity of approximate first-order stationarity testing for continuous piecewise-affine functions and shallow ReLU CNN losses with respect to the dimension parameter, including XP algorithms, W[1]-hardness, and ETH lower bounds.