mlsanityData to 14 Oct 2026

Homological Convolutional Neural Networks

arXiv 2308.13816 ↗First posted 26 Aug 2023cs.LG cs.AI cs.CCcited by 4

Not on the map. Why?

Abstract (arXiv)

Deep learning methods have demonstrated outstanding performances on classification and regression tasks on homogeneous data types (e.g., image, audio, and text data). However, tabular data still pose a challenge, with classic machine learning approaches being often computationally cheaper and equally effective than increasingly complex deep learning architectures. The challenge arises from the fact that, in tabular data, the correlation among features is weaker than the one from spatial or semantic relationships in images or natural language, and the dependency structures need to be modeled without any prior information. In this work, we propose a novel deep learning architecture that exploits the data structural organization through topologically constrained network representations to gain relational information from sparse tabular inputs. The resulting model leverages the power of convolution and is centered on a limited number of concepts from network topology to guarantee: (i) a data-centric and deterministic building pipeline; (ii) a high level of interpretability over the inference process; and (iii) an adequate room for scalability. We test our model on 18 benchmark datasets against 5 classic machine learning and 3 deep learning models, demonstrating that our approach reaches state-of-the-art performances on these challenging datasets. The code to reproduce all our experiments is provided at https://github.com/FinancialComputingUCL/HomologicalCNN.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 55 of its 137 references that are in the map. First posted on arXiv 26 Aug 2023.

Builds on

55 of 137 references.

References · 55

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  4. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  6. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  7. 2020Longformer: The Long-Document Transformercited by 3,413
  8. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  9. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  10. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  11. 2020Big Bird: Transformers for Longer Sequencescited by 1,684
  12. 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,593
38 more
  1. 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
  2. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  3. 2021Revisiting Deep Learning Models for Tabular Datacited by 740
  4. 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 674
  5. 2019TabNet: Attentive Interpretable Tabular Learningcited by 648
  6. 2017Self-Normalizing Neural Networkscited by 598
  7. 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 592
  8. 2021Tabular Data: Deep Learning is Not All You Needcited by 535
  9. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  10. 2015Deep Speech 2: End-to-End Speech Recognition in English and Mandarincited by 451
  11. 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 426
  12. 2020TabTransformer: Tabular Data Modeling Using Contextual Embeddingscited by 409
  13. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 320
  14. 2021SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Trainingcited by 319
  15. 2019Learning Deep Transformer Models for Machine Translationcited by 309
  16. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  17. 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 223
  18. 2020Classification-Based Anomaly Detection for General Datacited by 211
  19. 2019Neural Oblivious Decision Ensembles for Deep Learning on Tabular Datacited by 203
  20. 2022Why do tree-based models still outperform deep learning on tabular data?cited by 199
  21. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
  22. 2017OpenML Benchmarking Suitescited by 178
  23. 2016Exploring the Limits of Language Modelingcited by 173
  24. 2021Well-tuned Simple Nets Excel on Tabular Datasetscited by 151
  25. 2020Simplicial Neural Networkscited by 110
  26. 2019Deep Learning for Audio Signal Processingcited by 92
  27. 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
  28. 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
  29. 2020The Tree Ensemble Layer: Differentiability meets Conditional Computationcited by 57
  30. 2020Trust Issues: Uncertainty Estimation Does Not Enable Reliable OOD Detection On Medical Tabular Datacited by 52
  31. 2020Gradient Boosting Neural Networks: GrowNetcited by 46
  32. 2022Revisiting Pretraining Objectives for Tabular Deep Learningcited by 43
  33. 2021Simplicial Convolutional Neural Networkscited by 40
  34. 2020Sequential Deep Learning for Credit Risk Monitoring with Tabular Financial Datacited by 39
  35. 2015Network Filtering for Big Data: Triangulated Maximally Filtered Graphcited by 17
  36. 2020Neural Parameter Allocation Searchcited by 15
  37. 2016Parsimonious modeling with Information Filtering Networkscited by 14
  38. 2019DeepSZ: A Novel Framework to Compress Deep Neural Networks by Using Error-Bounded Lossy Compressioncited by 11

50 most cited of 55 All 55 (JSON)

Built on by

Cited by year

Citing papers per year: 2024: 3; 2025: 1.

4 papers.