arXiv:2606. 23942v1 Announce Type: new Abstract: We present a large-scale empirical study isolating the contributions of the Derivative Regularization penalty (DREG).
By Rowan Martnishn
arXiv:2608. 09523v1 Announce Type: new Abstract: Deep neural network (DNN) training with stochastic gradient descent (SGD) and its variants achieves strong empirical performance, yet classical optimization theory does not fully explain this success.
By Binchuan Qi
arXiv:2606. 29951v1 Announce Type: new Abstract: Interpretable Mesomorphic Neural Networks (IMNs) offer a promising framework that combines the predictive power of deep neural networks with the interpretability of linear models.
By Hugo L. Hammer, Vajira Thambawita, Kristoffer Herland Hellton, P{\aa}l Halvorsen
arXiv:2606. 27759v1 Announce Type: new Abstract: Training binary neural networks (BNNs) from scratch is dominated by the straight-through estimator (STE), whose forward/backward mismatch produces severe accuracy degradation as networks deepen.
By Evan Gibson Smith, Bashima Islam
RecKAN introduces a learnable recursive polynomial basis for Kolmogorov–Arnold Networks, replacing fixed bases like B-splines or Chebyshev polynomials. The basis is defined by a second‑order polynomial recurrence whose five coefficients are jointly learned with the network, enabling it to encompass classical families such as Chebyshev, Fibonacci, Pell, and Jacobsthal. Experiments across image, text, biomedical time‑series classification, and forecasting tasks show RecKAN outperforming parameter‑matched KAN baselines and achieving state‑of‑the‑art results on several benchmarks.
By Amirhosein Azarpour
arXiv:2605.06240v2 Announce Type: replace-cross
Abstract: Forward-Forward (FF) training lets each layer learn from a local goodness criterion. In cumulative-goodness variants, later layers can inheri...
By Amirhossein Yousefiramandi