mlsanityData to 14 Oct 2026

Local Control Networks (LCNs): Optimizing Flexibility in Neural Network Data Pattern Capture

arXiv 2501.14000 ↗First posted 23 Jan 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

The widespread use of Multi-layer perceptrons (MLPs) often relies on a fixed activation function (e.g., ReLU, Sigmoid, Tanh) for all nodes within the hidden layers. While effective in many scenarios, this uniformity may limit the networks ability to capture complex data patterns. We argue that employing the same activation function at every node is suboptimal and propose leveraging different activation functions at each node to increase flexibility and adaptability. To achieve this, we introduce Local Control Networks (LCNs), which leverage B-spline functions to enable distinct activation curves at each node. Our mathematical analysis demonstrates the properties and benefits of LCNs over conventional MLPs. In addition, we demonstrate that more complex architectures, such as Kolmogorov-Arnold Networks (KANs), are unnecessary in certain scenarios, and LCNs can be a more efficient alternative. Empirical experiments on various benchmarks and datasets validate our theoretical findings. In computer vision tasks, LCNs achieve marginal improvements over MLPs and outperform KANs by approximately 5%, while also being more computationally efficient than KANs. In basic machine learning tasks, LCNs show a 1% improvement over MLPs and a 0.6% improvement over KANs. For symbolic formula representation tasks, LCNs perform on par with KANs, with both architectures outperforming MLPs. Our findings suggest that diverse activations at the node level can lead to improved performance and efficiency.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 20 references that are in the map. First posted on arXiv 23 Jan 2025.

Builds on

13 of 20 references.

References · 13

  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  2. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  3. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  4. 2024KAN: Kolmogorov-Arnold Networkscited by 649
  5. 2016Understanding Deep Neural Networks with Rectified Linear Unitscited by 257
  6. 2017Optimal approximation of piecewise smooth functions using deep ReLU neural networkscited by 179
  7. 2021Activation Functions in Deep Learning: A Comprehensive Survey and Benchmarkcited by 155
  8. 2017The Consciousness Priorcited by 107
  9. 2020The Kolmogorov-Arnold representation theorem revisitedcited by 89
  10. 2024KAN or MLP: A Fairer Comparisoncited by 73
  11. 2017Deep linear neural networks with arbitrary loss: All local minima are globalcited by 65
  12. 2022ExSpliNet: An interpretable and expressive spline-based neural networkcited by 33
1 more
  1. 2017Evolving Parsimonious Networks by Mixing Activation Functionscited by 8

Built on by

Not cited yet.