Manifoldron: Direct Space Partition via Manifold Discovery
Not on the map. Why?
Abstract (arXiv)
A neural network with the widely-used ReLU activation has been shown to partition the sample space into many convex polytopes for prediction. However, the parameterized way a neural network and other machine learning models use to partition the space has imperfections, textite.textitg., the compromised interpretability for complex models, the inflexibility in decision boundary construction due to the generic character of the model, and the risk of being trapped into shortcut solutions. In contrast, although the non-parameterized models can adorably avoid or downplay these issues, they are usually insufficiently powerful either due to over-simplification or the failure to accommodate the manifold structures of data. In this context, we first propose a new type of machine learning models referred to as Manifoldron that directly derives decision boundaries from data and partitions the space via manifold structure discovery. Then, we systematically analyze the key characteristics of the Manifoldron such as manifold characterization capability and its link to neural networks. The experimental results on 4 synthetic examples, 20 public benchmark datasets, and 1 real-world application demonstrate that the proposed Manifoldron performs competitively compared to the mainstream machine learning models. We have shared our code in urlhttps://github.com/wdayang/Manifoldron for free download and evaluation.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 96 references that are in the map. First posted on arXiv 14 Jan 2022.
Builds on
20 of 96 references.
References · 20
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2021Tabular Data: Deep Learning is Not All You Needcited by 530
- 2021Deep Neural Networks and Tabular Data: A Surveycited by 489
- 2015A Random Forest Guided Tourcited by 168
- 2021Can contrastive learning avoid shortcut solutions?cited by 114
- 2020On Interpretability of Artificial Neural Networks: A Surveycited by 88
- 2016Scalable Bayesian Rule Listscited by 64
- 2021Learning in High Dimension Always Amounts to Extrapolationcited by 62
- 2018Mad Max: Affine Spline Insights into Deep Learningcited by 54
- 2020Why Attentions May Not Be Interpretable?cited by 41
- 2021Scalable Rule-Based Representation Learning for Interpretable Classificationcited by 40
- 2019Chart Auto-Encoders for Manifold Structured Datacited by 32
8 more
- 2018Exact and Consistent Interpretation for Piecewise Linear Neural Networks: A Closed Form Solutioncited by 31
- 2019Enhancing Explainability of Neural Networks through Architecture Constraintscited by 29
- 2021TED-net: Convolution-free T2T Vision Transformer-based Encoder-decoder Dilation network for Low-dose CT Denoisingcited by 21
- 2021On Expressivity and Trainability of Quadratic Networkscited by 19
- 2019Transparent Classification with Multilayer Logical Perceptrons and Random Binarizationcited by 16
- 2018Learning with Interpretable Structure from Gated RNNcited by 13
- 2020Quasi-Equivalence of Width and Depth of Neural Networkscited by 7
- 2018Learning from Pseudo-Randomness With an Artificial Neural Network - Does God Play Pseudo-Dice?cited by 3
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.
2 papers.