arXiv:2609.37177v1 Announce Type: cross
Abstract: Persistent homology (PH) is a frequently used tool for extracting and preserving topological information from image data, particularly in image segme...
By Alexander H. Berger, Marco Fontana, Daniel Rueckert, Johannes C. Paetzold, Laurin Lux, Ulrich Bauer
arXiv:2507. 07156v2 Announce Type: replace-cross Abstract: Supervised machine learning pipelines trained on features derived from persistent homology have been experimentally observed to ignore much of the information contained in a persistence diagram.
By Nicole Abreu, Parker B. Edwards, Francis Motta
arXiv:2606. 29763v1 Announce Type: cross Abstract: Topological data analysis (TDA), particularly persistent homology (PH), captures geometric structural properties in medical images (e.
By Guangyu Meng, Pengfei Gu, Xueyang Li, Yiyu Shi, Erin Wolf Chambers, Danny Z. Chen
Batch Before You Lift: Scalable Topological Deep Learning on Large Graphs introduces Cluster‑TNN, a framework that lifts graph data locally instead of globally, enabling efficient mini‑batch construction for higher‑order domains such as hypergraphs and simplicial complexes. By partitioning the input graph and dynamically sampling node clusters at runtime, Cluster‑TNN reduces peak GPU memory usage by an average of 83.2% across 21 comparisons while preserving connectivity needed for topological structures. This approach allows the first training of multiple higher‑order Topological Neural Networks on large datasets like Reddit and OGBN Products, demonstrating a general strategy for scaling Topological Deep Learning beyond global domain construction.
H3DNAS is a hardware‑aware compression framework that operates directly on ONNX computational graphs, eliminating the need for original source code or gradient access. It introduces a Channel Dependency Graph to classify operators and compute a provable compression ceiling, and employs a two‑stage hierarchical search that prunes architectures via L1‑importance channel selection and applies GhostConv mutations to Pareto‑optimal candidates. Applied to 3D point‑cloud models on the ModelNet40 dataset, H3DNAS reduces parameters by up to 65.5% and achieves significant inference speedups with negligible accuracy loss.
By Anchit Mulye, Rhythm Baghel, Sujay Kumar Ingle, Hardik Jain
arXiv:2611.06191v1 Announce Type: new
Abstract: Dimensionality reduction (DR) techniques are fundamental to the analysis of high-dimensional data, yet their substantial computational cost limits thei...
By Myeongwon Jung, Jaemin Jo