HorNets: Learning from Discrete and Continuous Signals with Routing Neural Networks
Not on the map. Why?
Abstract (arXiv)
Construction of neural network architectures suitable for learning from both continuous and discrete tabular data is a challenging research endeavor. Contemporary high-dimensional tabular data sets are often characterized by a relatively small instance count, requiring data-efficient learning. We propose HorNets (Horn Networks), a neural network architecture with state-of-the-art performance on synthetic and real-life data sets from scarce-data tabular domains. HorNets are based on a clipped polynomial-like activation function, extended by a custom discrete-continuous routing mechanism that decides which part of the neural network to optimize based on the input's cardinality. By explicitly modeling parts of the feature combination space or combining whole space in a linear attention-like manner, HorNets dynamically decide which mode of operation is the most suitable for a given piece of data with no explicit supervision. This architecture is one of the few approaches that reliably retrieves logical clauses (including noisy XNOR) and achieves state-of-the-art classification performance on 14 real-life biomedical high-dimensional data sets. HorNets are made freely available under a permissive license alongside a synthetic generator of categorical benchmarks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 55 references that are in the map. First posted on arXiv 24 Jan 2025.
Builds on
24 of 55 references.
References · 24
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 829
- 2019TabNet: Attentive Interpretable Tabular Learningcited by 640
- 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
- 2019Fooling LIME and SHAP: Adversarial Attacks on Post hoc Explanation Methodscited by 440
- 2019Neural Probabilistic Logic Programming in DeepProbLogcited by 389
- 2020Neurosymbolic AI: The 3rd Wavecited by 253
- 2019Differentiation of Blackbox Combinatorial Solverscited by 224
- 2019Neural Logic Machinescited by 144
- 2016Time for a change: a tutorial for comparing multiple classifiers through Bayesian analysiscited by 92
12 more
- 2020Inductive logic programming at 30: a new introductioncited by 83
- 2019LassoNet: A Neural Network with Feature Sparsitycited by 81
- 2023Not All Neuro-Symbolic Concepts Are Created Equal: Analysis and Mitigation of Reasoning Shortcutscited by 63
- 2020Closed Loop Neural-Symbolic Learning via Integrating Neural Perception, Grammar Parsing, and Symbolic Reasoningcited by 58
- 2016Feature Selection: A Data Perspectivecited by 50
- 2020Neuro-Symbolic Visual Reasoning: Disentangling "Visual" from "Reasoning"cited by 35
- 2021Learning Accurate and Interpretable Decision Rule Sets from Neural Networkscited by 25
- 2020Feature Importance Estimation with Self-Attention Networkscited by 21
- 2019Learning Relational Representations with Auto-encoding Logic Programscited by 13
- 2020Propositionalization and Embeddings: Two Sides of the Same Coincited by 8
- 2019Embedding-based Silhouette Community Detectioncited by 4
- 2021An Empirical Investigation into Deep and Shallow Rule Learningcited by 4
Built on by
Not cited yet.