arXiv Machine Learning

Manifold Constrained Tabular Deep Neural Networks

arXiv:2607. 09710v1 Announce Type: new Abstract: Tabular classification is often governed by local, condition-triggered rules rather than smooth global patterns.

arXiv Machine Learning
Aug 11

SPD Learn: A Geometric Deep Learning Python Library for Neural Decoding Through Trivialization

arXiv:2602. 22895v2 Announce Type: replace-cross Abstract: Implementations of symmetric positive definite (SPD) matrix-based neural networks for neural decoding remain fragmented across research codebases and Python packages.

By Bruno Aristimunha, Ce Ju, Antoine Collas, Florent Bouchard, Ammar Mian, Bertrand Thirion, Sylvain Chevallier, Reinmar Kobler
arXiv AI
Aug 11

Tabular Numeric Stretch Transformation

arXiv:2608. 09162v1 Announce Type: cross Abstract: Tabular data presents unique challenges for deep learning due to its heterogeneous nature, where numeric features exhibit diverse distributions, scales, and statistical properties.

By Zihao Ye, Juyong Kim, Johnna Sundberg, Burak Varici, Pradeep Ravikumar
arXiv Machine Learning
Sep 15

Neuron Activation-based Computation of Logical Explanations for Deep Neural Networks

The paper introduces a flexible symbolic framework that efficiently computes logical explanations for deep neural networks by parameterizing explanations with internal neuron activations and leveraging general-purpose logical engines like SMT solvers. Unlike previous methods that rely on specialized verifiers or are limited to individual input features, this approach is not restricted in shape and can scale to deep architectures. Experiments on image recognition and medical benchmarks demonstrate improved computational efficiency and the ability to explain networks that were previously intractable for logic-based methods.

By Tom\'a\v{s} Kol\'arik, Faezeh Labbaf, Fabrizio Leopardi, Grigory Fedyukovich, Michael Wand, Natasha Sharygina
arXiv AI
Aug 24

Lightweight Adaptive ReduNet via Hyperspherical Manifold Learning

The paper introduces LA-ReduNet, a lightweight adaptive version of the ReduNet neural network that uses hyperspherical manifold learning and adaptive step sizes to reduce the number of layers needed for the maximal coding rate reduction (MCR$^2$) objective to stabilize. By refining the layer‑wise update rule, LA-ReduNet achieves comparable classification accuracy while requiring far fewer layers and significantly less parameter storage—about 1/29 of the unfolded ReduNet module under the tested settings.

By Zhenglin Huang, Qifa Yan, Bin Dai, Xiaohu Tang
arXiv AI
Aug 25

Which Algorithms Can Graph Neural Networks Learn?

arXiv:2602.13106v2 Announce Type: replace-cross Abstract: In recent years, there has been growing interest in understanding neural architectures' ability to learn to execute discrete algorithms, a li...

By Solveig Wittig, Antonis Vasileiou, Robert R. Nerem, Timo Stoll, Floris Geerts, Yusu Wang, Christopher Morris