Pith. sign in

REVIEW 4 major objections 6 minor 38 references

Safe and Efficient Social Navigation through Explainable Safety Regions Based on Topological Features

T0 review · 4 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Persistent-entropy statistics create explainable safety regions that beat behavior-parameter baselines for collision and deadlock avoidance in social robot navigation.

desk verdict First TDA-based safety regions for social navigation with a clean, simple threshold story, but all reported numbers are in-sample, so the accuracy gains and epsilon guarantee are not yet established. read the letter →

arxiv 2503.16441 v2 pith:SOEWNQMK submitted 2025-02-14 cs.RO cs.AImath.GN

Victor Toscano-Duran , Sara Narteni , Alberto Carlevaro , Jérôme Guzzi Rocio Gonzalez-Diaz , Maurizio Mongelli This is my paper · ORCID
classification cs.ROcs.AImath.GN
keywords topologicaldataanalysispersistententropysafetyregionssocialnavigationexplainableAIconformalpredictionmulti-robotsystemsdeadlockavoidance
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to show that the topological structure of a robot fleet's motion, summarized by the persistent entropy of its point clouds over time (a Shannon-entropy measure of how spread out the fleet's connected components are), can define safety regions that separate collision-free and deadlock-free simulations from unsafe ones more accurately than the behavior parameters traditionally used. The authors claim that four statistics of the persistent entropy time series—mean, median, standard deviation, and interquartile range—carry enough discriminative information to build explainable safety regions with a controlled classification error. If true, this would give robot navigation a transparent, parameter-light way to certify that a simulated maneuver is safe and efficient, without needing to inspect detailed spatial trajectories.

What carries the argument

The central object is the persistent entropy time series of a simulation: at each time step, the robot positions form a point cloud whose Vietoris-Rips filtration yields 0-dimensional persistence bars, and the Shannon entropy of the normalized bar lengths gives a single scalar. The paper compresses each simulation to four statistics of this time series—mean, median, standard deviation, and interquartile range—and feeds that four-dimensional vector to an adjustable support vector machine. Order statistics methods (probabilistic scaling and conformal prediction) then convert the SVM's adjustable boundary into safety regions $S_\varepsilon$ with a maximum misclassification error of $\varepsilon$, and rule extraction turns those regions into simple, human-readable conditions on mean and median entropy.

What would settle it

Find two simulation configurations with identical mean, median, standard deviation, and interquartile range of 0-dimensional persistent entropy but opposite collision or deadlock outcomes; a sizable set of such confusable pairs would break the feature space's discriminative power. A second check is to recompute the safety regions with 1-dimensional persistence features added and show that the 0-dimensional-only regions misclassify scenarios where loop-like congestion matters.

Watch

Extended reading notes

Core claim

The central claim is that topological features, specifically the mean, median, standard deviation, and interquartile range of the 0-dimensional persistent entropy computed from robot position point clouds, yield safety regions $S_\varepsilon$ that separate collision-free and deadlock-free simulations with higher accuracy and simpler local rules than safety regions built from behavior parameters such as the safety margin, time-to-collision, and relaxation time. The paper demonstrates this for collision avoidance, where the topological-feature classifier reaches higher accuracy and true positive rate with fewer and simpler local rules than the behavior-parameter baseline, and for deadlock avoidance, where the same four features produce an accurate classifier and a two-rule explanation. Combining the two, the paper derives a single interval rule on mean and median entropy that characterizes compliant simulations free of both collisions and deadlocks.

Load-bearing premise

The four statistics of the 0-dimensional persistent entropy time series carry all the information needed to distinguish collision-free and deadlock-free simulations from unsafe ones.

Editorial extensions

If this is right

  • A safety region in topological feature space can certify a simulation as collision-free with error at most $\varepsilon$, and the same construction certifies deadlock-free behavior.
  • The compliant space—simulations free of both collisions and deadlocks—collapses to a bounded interval on mean and median persistent entropy (roughly 2.68 to 2.75), giving a single explainable rule.
  • Topological features outperform behavior parameters on collision classification accuracy, F1, and true positive rate while reducing the number of local rules from five to two.
  • The method is computationally light: computing the persistent entropy time series for a 2000-step, 20-robot simulation takes about 0.2 seconds, suggesting real-time feasibility.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same four-statistic compression could be tested on other multi-agent scenarios, such as intersections with obstacles or heterogeneous robot speeds, where 1-dimensional persistence (loops) may become informative; the paper's explicit focus on 0-dimensional features suggests a natural stress test.
  • Because the rules are learned a posteriori from complete simulations, the paper stops short of setting simulation parameters a priori; an inference is that the entropy statistics could be treated as a control target during simulation to steer the fleet into the safe interval.
  • The near-threshold region where mean and median entropy sit between the collision threshold and deadlock threshold suggests that the compliant interval acts like a 'goldilocks' zone: too little dispersion correlates with collisions, too much with deadlocks.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The manuscript proposes a topology-driven methodology for defining explainable safety regions in multi-robot social navigation. Persistent entropy time series are computed from 0-dimensional Vietoris-Rips persistence barcodes for each simulated run; four statistics (mean, median, standard deviation, IQR) form the feature vector used to train an adjustable SVM. Probabilistic scaling and conformal prediction are used to construct safety regions with a claimed maximum classification error epsilon, and local Anchor rules are extracted for interpretability. The experiments compare topological features with behavior-parameter features for collision avoidance, extend the approach to deadlock avoidance, and combine both into a compliant simulation space.

Significance. If the central comparison is validated with proper statistical evaluation, the paper would offer a genuinely interpretable and computationally efficient way to summarize multi-robot interaction structure for safety classification. The idea of using persistent entropy time-series statistics as features is intuitive and the reported rules (e.g., meanEntropy and medianEntropy thresholds) are attractively simple. Strengths include the clear pipeline, the reproducible code on GitHub, the comparison against an existing behavior-parameter baseline, and the explicit use of order-statistics-based safety regions. The main weakness is that the current evaluation is in-sample, which leaves the quantitative claims unsupported until a held-out calibration/test protocol is added.

major comments (4)
  1. [5.1, 5.3 (Tables 2-4)] The paper reports no train/calibration/test split anywhere in Section 5. The SVM in Section 5.3 is trained on the full Tnav dataset, the probabilistic-scaling and conformal thresholds rho_epsilon are calibrated on the same data, and the accuracy, F1, TPR, FPR, TNR, and error metrics in Tables 2-4 are evaluated on that same data. The advertised guarantee P(y=-1 | x in S_epsilon) <= epsilon is valid only when calibration data are exchangeable with future data, so using the training data as its own calibration set invalidates the bound. The abstract's 'maximum classification error of epsilon' is therefore not demonstrated, and no error bars or confidence intervals are reported for any table metric. This is the central load-bearing issue: the claimed superiority of topological safety regions over behavior-parameter regions needs a held-out test set with a separate calibration split (or nested cross-validation) before it can be accepted.
  2. [5.3, Table 2] The SkopeRules comparison in Table 2 compares 9 behavior-parameter rules with 20 topological-feature rules. Because the metrics are computed on the training data and no model-complexity penalty or held-out evaluation is reported, the higher accuracy (84.6% vs. 78.6%) and F1 (84.6% vs. 75.1%) may partly reflect in-sample overfitting rather than a genuine discriminative advantage of the topological representation. The paper should report cross-validated or held-out metrics and, ideally, a complexity-controlled comparison (e.g., the same number of rules or a rule-pruning step).
  3. [5.3, Table 4] The anchor-rule evaluation in Table 4 is performed on the same dataset from which the anchors are extracted, so the reported ground-truth errors (e.g., 9% for topological/PS versus 29% for behavior/PS) are in-sample values and do not estimate generalization error. The table also reports both 'Method labels' and 'Ground Truth' columns, but the text refers to 'Coverage Error' without defining whether this is coverage, error, or both; this needs clarification and a held-out evaluation before the interpretability advantage can be assessed.
  4. [6 and Abstract] The conclusion explicitly states that the rules are obtained a posteriori, after the complete simulation is available, and that setting simulation parameters a priori is left to future work. This directly contradicts the abstract's language that the compliant simulation space 'guarantees safe and efficient navigation' for future runs. The limitation should be stated in the abstract and the word 'guarantees' should be reserved for the conditions under which the probabilistic bound actually holds.
minor comments (6)
  1. [3.4] The four target waypoints are listed as (-s/2,0), (s/2,0), (0,-s/2), and (0,-s/2); one of the y-coordinates should evidently be +s/2.
  2. [5.1] The text says the persistent entropy calculation takes 'less than 10 ms' and 'approximately 0.003 seconds' per point cloud; 0.003 seconds equals 3 ms, so the two statements are internally inconsistent.
  3. [5.3, Table 4] The column label 'Coverage Error' is confusing because coverage and error are separate metrics; it should be 'Error' or the two metrics should be reported in separate columns.
  4. [6] The phrase 'very simpler' should be 'simpler'.
  5. [3.1.2] The sentence 'A simplicial complex K is a geometric realization of an abstract simplicial complex K' uses the symbol K for two different objects and is confusing; use different letters for the abstract complex and its geometric realization.
  6. [Figure 4] The pipeline diagram is informative but the text labels are small and hard to read in the current resolution; enlarging the figure or splitting it into two panels would improve clarity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: topological features and safety labels are independently defined, and the safety-region construction rests on cited statistical methods rather than on the paper's own conclusions.

full rationale

The paper's derivation chain is not circular. The input features (mean/median/std/IQR of the 0-dimensional persistent entropy time series) are computed from robot position point clouds via Vietoris-Rips filtrations, independently of the output labels, which are defined directly from Navground collision/deadlock counts (Section 4, step 2, and Section 5.1). The SVM, order-statistic, and conformal thresholds are fitted to these features; the reported accuracies are empirical in-sample comparisons, not quantities that equal the fitted parameters by construction. The order-statistic/conformal construction is imported from the authors' prior work [16,35] and from Vovk [34], but these citations supply the calibration machinery; they do not assume the paper's conclusion that topological features outperform behavior parameters. The comparison against behavior parameters [17] is an external baseline, not an input to the topological model. The paper itself concedes that the rules are obtained a posteriori (Section 6), which limits the method's prospective use but is not a circularity. The main methodological weakness—absence of an explicit train/calibration/test split—could make the reported performance optimistic, but that is a validation issue, not a self-referential derivation.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The paper introduces no new physical or mathematical entities. The free parameters are the manually chosen SVM hyperparameters and one deliberately widened sampling range for deadlock generation. The load-bearing axioms are the sufficiency of 0-dimensional entropy statistics and the exchangeability assumption underlying the probabilistic guarantees, neither of which is independently validated.

free parameters (4)
  • SVM Gaussian kernel bandwidth sigma = 0.5
    Manually selected in Section 5.3 to ensure a fair comparison; not tuned to optimize performance, but the choice affects all reported accuracies.
  • SVM regularization parameter C = 0.3
    Manually selected in Section 5.3; controls the margin-error trade-off and influences the safety region boundaries.
  • SVM class weighting = 0.5
    Manually selected in Section 5.3; adjusts the relative importance of the positive (safe) and negative (unsafe) classes.
  • Safety margin sampling range for deadlock and compliant data = [0.0, 0.5] m
    Chosen in Section 5.1 because the [0.0, 0.1] m range used for collision data produces too few deadlock simulations; this changes the class balance and the operational distribution over which safety guarantees are made.
assumptions (4)
  • domain assumption 0-dimensional Vietoris-Rips persistent entropy captures the safety-relevant spatial structure of robot formations.
    Section 4 step 2(b) computes only 0-dimensional persistent homology; higher-dimensional loops and voids are ignored.
  • standard math Order statistics and conformal prediction guarantees require exchangeable calibration data.
    Sections 3.2.2 and 3.2.3 reference [16, 35]; the paper does not describe how calibration data are separated from training and test data, so the precondition for the guarantees is not verified.
  • domain assumption Navground simulations with the HL behavior are representative of social navigation in real environments.
    Sections 3.4 and 5.1 describe the simulation environment; all safety regions and rules inherit the simulator's fidelity limits.
  • standard math Rule extraction via Anchors on borderline +1 instances approximates the safety region boundaries.
    Section 3.3.2 defines anchor precision and coverage; Section 5.3 evaluates the extracted anchors on the same simulation dataset without an independent validation set.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Safe and Efficient Social Navigation through Explainable Safety Regions Based on Topological Features." pith.science (2026). https://pith.science/paper/SOEWNQMK

@misc{pith2026250316441,
  author       = {Pith},
  title        = {Pith review of: Safe and Efficient Social Navigation through Explainable Safety Regions Based on Topological Features},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SOEWNQMK}},
  note         = {Machine review of arXiv:2503.16441}
}
abstract

The recent adoption of artificial intelligence in robotics has driven the development of algorithms that enable autonomous systems to adapt to complex social environments. In particular, safe and efficient social navigation is a key challenge, requiring AI not only to avoid collisions and deadlocks but also to interact intuitively and predictably with its surroundings. Methods based on probabilistic models and the generation of conformal safety regions have shown promising results in defining safety regions with a controlled margin of error, primarily relying on classification approaches and explicit rules to describe collision-free navigation conditions. This work extends the existing perspective by investigating how topological features can contribute to the creation of explainable safety regions in social navigation scenarios, enabling the classification and characterization of different simulation behaviors. Rather than relying on behaviors parameters to generate safety regions, we leverage topological features through topological data analysis. We first utilize global rule-based classification to provide interpretable characterizations of different simulation behaviors, distinguishing between safe and unsafe scenarios based on topological properties. Next, we define safety regions, $S_\varepsilon$, representing zones in the topological feature space where collisions are avoided with a maximum classification error of $\varepsilon$. These regions are constructed using adjustable SVM classifiers and order statistics, ensuring a robust and scalable decision boundary. Our approach initially separates simulations with and without collisions, outperforming methods that not incorporate topological features. We further refine safety regions to ensure deadlock-free simulations and integrate both aspects to define a compliant simulation space that guarantees safe and efficient navigation.

Figures

Figures reproduced from arXiv: 2503.16441 by the authors.

Figure 1
Figure 1. A filtration for t = 0, 1, 2, 3, 4, 5, 6, 7 (from left to right). Persistent homology describes how the homology of K changes along a filtration {K(t) | t ∈ R}. A k-dimensional Betti interval, with endpoints [tstart, tend), corresponds to a k-dimensional hole that appears at filtration time tstart and remains until time tend. To visualize the persistence of topological features, persistence diagrams are commonly use… view at source ↗
Figure 2
Figure 2. Persistence diagram and persistence barcode example. [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. In the crossings scenario, simulated robots navigate between predefined waypoints (colored cylinders) along the x-axis and y-axis, creating intersecting flows at the center. Simulations Point-cloud Vietoris-Rips filtration Persistent barcode Persistent entropy time-serie Dataset (X, y) X: topological features y: binary safety level Decision rules Safety regions for each time-step of each run for each run, compute pe… view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: Illustrative example of methodology pipeline. [PITH_FULL_IMAGE:figures/full_fig_p009_4.png]
Figure 5
Figure 5. Figure 5: Illustrative example of computing the persistent entropy of a robot point cloud. [PITH_FULL_IMAGE:figures/full_fig_p010_5.png]
Figure 6
Figure 6. Figure 6: Persistent entropy time series example of a simulation. [PITH_FULL_IMAGE:figures/full_fig_p011_6.png]
Figure 7
Figure 7. Figure 7: Point clouds of two different time steps with the corresponding persistent entropy on top. [PITH_FULL_IMAGE:figures/full_fig_p011_7.png]
Figure 8
Figure 8. Figure 8: Pairwise class distributions of the features in [PITH_FULL_IMAGE:figures/full_fig_p013_8.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

38 extracted references · 30 canonical work pages

  1. [1]

    Leilani Katie Publication, 2024

    Vemuri Sudarsan Rao, Mr A Satish, and Mr BBLV Prasad.Artificial intelligence: Principles and applications. Leilani Katie Publication, 2024

    work page 2024

  2. [2]

    Artificial intelligence, robotics, advanced technologies and human resource management: a systematic review

    Demetris Vrontis, Michael Christofi, Vijay Pereira, Shlomo Tarba, Anna Makrides, and Eleni Trichina. Artificial intelligence, robotics, advanced technologies and human resource management: a systematic review. Artificial intelligence and international HRM, pages 172–201, 2023

    work page 2023

  3. [3]

    Autonomous vehicle safety: An interdisciplinary challenge

    Philip Koopman and Michael Wagner. Autonomous vehicle safety: An interdisciplinary challenge. IEEE Intelligent Transportation Systems Magazine, 9(1):90–96, 2017. 6https://github.com/Cimagroup/Topological-Features-and-Explainable-Safety-Regions Safe and Efficient Social Navigation through Explainable Safety Regions Based on Topological Features

    work page 2017

  4. [4]

    Explainable artificial intelligence (xai) 2.0: A manifesto of open challenges and interdisciplinary research directions

    Luca Longo, Mario Brcic, Federico Cabitza, Jaesik Choi, Roberto Confalonieri, Javier Del Ser, Riccardo Guidotti, Yoichi Hayashi, Francisco Herrera, Andreas Holzinger, et al. Explainable artificial intelligence (xai) 2.0: A manifesto of open challenges and interdisciplinary research directions. Information Fusion, 106:102301, 2024

    work page 2024

  5. [5]

    Vision-based topological mapping and localization methods: A survey

    Emilio Garcia-Fidalgo and Alberto Ortiz. Vision-based topological mapping and localization methods: A survey. Robotics and Autonomous Systems, 64:1–20, 2015

    work page 2015

  6. [6]

    A framework for topological based map building: A solution to autonomous robot navigation in smart cities

    Naveed Islam, Khalid Haseeb, Ahmad Almogren, Ikram Ud Din, Mohsen Guizani, and Ayman Altameem. A framework for topological based map building: A solution to autonomous robot navigation in smart cities. Future Generation Computer Systems, 111:644–653, 2020

    work page 2020

  7. [7]

    A new topological entropy-based approach for measuring similarities among piecewise linear functions

    Matteo Rucco, Rocio Gonzalez-Diaz, Maria-Jose Jimenez, Nieves Atienza, Cristina Cristalli, Enrico Concettoni, Andrea Ferrante, and Emanuela Merelli. A new topological entropy-based approach for measuring similarities among piecewise linear functions. Signal Processing, 134:130–138, 2017

    work page 2017

  8. [8]

    Introduction to AI robotics

    Robin R Murphy. Introduction to AI robotics. MIT press, 2019

    work page 2019

Show all 38 references
  1. [9]

    Pierson and Michael S

    Harry A. Pierson and Michael S. Gashler. Deep learning in robotics: a review of recent research. Advanced Robotics, 31:821 – 835, 2017

    2017

  2. [10]

    Deep learning for robotics

    R Mouha. Deep learning for robotics. Journal of Data Analysis and Information Processing, 9:63 – 76, 2021

    2021

  3. [11]

    Explainable ai (xai): Core ideas, techniques, and solutions

    Rudresh Dwivedi, Devam Dave, Het Naik, Smiti Singhal, Rana Omer, Pankesh Patel, Bin Qian, Zhenyu Wen, Tejal Shah, Graham Morgan, et al. Explainable ai (xai): Core ideas, techniques, and solutions. ACM Computing Surveys, 55(9):1–33, 2023

    2023

  4. [12]

    Explainable ai (xai): A systematic meta-survey of current challenges and future opportunities

    Waddah Saeed and Christian Omlin. Explainable ai (xai): A systematic meta-survey of current challenges and future opportunities. Knowledge-Based Systems, 263:110273, 2023

    2023

  5. [13]

    Trustworthy artificial intelligence: a review

    Davinder Kaur, Suleyman Uslu, Kaley J Rittichier, and Arjan Durresi. Trustworthy artificial intelligence: a review. ACM computing surveys (CSUR), 55(2):1–38, 2022

    2022

  6. [14]

    Explainable agents and robots: Results from a systematic literature review

    Sule Anjomshoae, Amro Najjar, Davide Calvaresi, and Kary Främling. Explainable agents and robots: Results from a systematic literature review. In 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), Montreal, Canada, May 13–17, 2019, pages 10...

    2019

  7. [15]

    Explainable artificial intelligence for autonomous driving: A comprehensive overview and field guide for future research directions

    Shahin Atakishiyev, Mohammad Salameh, Hengshuai Yao, and Randy Goebel. Explainable artificial intelligence for autonomous driving: A comprehensive overview and field guide for future research directions. IEEE Access, 2024

    2024

  8. [16]

    Probabilistic safety regions via finite families of scalable classifiers

    Alberto Carlevaro, Teodoro Alamo, Fabrizio Dabbene, and Maurizio Mongelli. Probabilistic safety regions via finite families of scalable classifiers. arXiv preprint arXiv:2309.04627, 2023

    2023 arXiv

  9. [17]

    Ensuring safe social navigation via ex- plainable probabilistic and conformal safety regions

    Sara Narteni, Alberto Carlevaro, Jérôme Guzzi, and Maurizio Mongelli. Ensuring safe social navigation via ex- plainable probabilistic and conformal safety regions. In Luca Longo, Sebastian Lapuschkin, and Christin Seifert, editors, Explainable Artificial Intelligence, pages 39...

    2024

  10. [18]

    Algebraic topology

    Allen Hatcher. Algebraic topology. Cambridge University Press, 2005

    2005

  11. [19]

    Topological methods for data modelling

    Gunnar Carlsson. Topological methods for data modelling. Nature Reviews Physics, 2(12):697–708, 2020

    2020

  12. [20]

    Computational topology: an introduction

    Herbert Edelsbrunner and John L Harer. Computational topology: an introduction . American Mathematical Society, 2022

    2022

  13. [21]

    de la Paz López and J

    F. de la Paz López and J. R. álvarez Sánchez. Topological maps for robot’s navigation: A conceptual approach. In José Mira and Alberto Prieto, editors, Bio-Inspired Applications of Connectionism, pages 459–467, Berlin, Heidelberg, 2001. Springer Berlin Heidelberg

    2001

  14. [22]

    tramotda: A trajectory monitoring system using topological data analysis

    Miriam Esteve and Antonio Falcó. tramotda: A trajectory monitoring system using topological data analysis. SoftwareX, 28:101953, 2024

    2024

  15. [23]

    Toponav: Topological navigation for efficient exploration in sparse reward environments

    Jumman Hossain, Abu Zaher Md Faridee, Nirmalya Roy, Jade Freeman, Timothy Gregory, and Theron Trout. Toponav: Topological navigation for efficient exploration in sparse reward environments. pages 693–700, 10 2024

    2024

  16. [24]

    An entropy- based persistence barcode

    Harish Chintakunta, Thanos Gentimis, Rocio Gonzalez-Diaz, Maria-Jose Jimenez, and Hamid Krim. An entropy- based persistence barcode. Pattern Recognition, 48(2):391–401, 2015

    2015

  17. [25]

    Characterisation of the idiotypic immune network through persistent entropy

    Matteo Rucco, Filippo Castiglione, Emanuela Merelli, and Marco Pettini. Characterisation of the idiotypic immune network through persistent entropy. In Proceedings of ECCS 2014: European conference on complex systems, pages 117–128. Springer, 2016. Safe and Efficient Social Na...

    2014

  18. [26]

    Persistent entropy for separating topological features from noise in vietoris-rips complexes

    Nieves Atienza, Rocio Gonzalez-Diaz, and Matteo Rucco. Persistent entropy for separating topological features from noise in vietoris-rips complexes. Journal of Intelligent Information Systems, 52:637–655, 2019

    2019

  19. [27]

    On the stability of persistent entropy and new summary functions for topological data analysis

    Nieves Atienza, Rocio González-Diaz, and Manuel Soriano-Trigueros. On the stability of persistent entropy and new summary functions for topological data analysis. Pattern Recognit., 107:107509, 2020

    2020

  20. [28]

    Extracting insights from the shape of complex data using topology

    Pek Y Lum, Gurjeet Singh, Alan Lehman, Tigran Ishkanov, Mikael Vejdemo-Johansson, Muthu Alagappan, John Carlsson, and Gunnar Carlsson. Extracting insights from the shape of complex data using topology. Scientific reports, 3(1):1236, 2013

    2013

  21. [29]

    Interpreting black-box models: a review on explainable artificial intelligence

    Vikas Hassija, Vinay Chamola, Atmesh Mahapatra, Abhinandan Singal, Divyansh Goel, Kaizhu Huang, Simone Scardapane, Indro Spinelli, Mufti Mahmud, and Amir Hussain. Interpreting black-box models: a review on explainable artificial intelligence. Cognitive Computation, 16(1):45–74, 2024

    2024

  22. [30]

    Simplicial complexes of graphs, volume 1928

    Jakob Jonsson. Simplicial complexes of graphs, volume 1928. Springer, 2008

    1928

  23. [31]

    Elements of algebraic topology

    James R Munkres. Elements of algebraic topology. CRC press, 2018

    2018

  24. [32]

    Barcodes: the persistent topology of data

    Robert Ghrist. Barcodes: the persistent topology of data. Bulletin of the American Mathematical Society , 45(1):61–75, 2008

    2008

  25. [33]

    Stability of persistence diagrams

    David Cohen-Steiner, Herbert Edelsbrunner, and John Harer. Stability of persistence diagrams. Discret. Comput. Geom., 37(1), 2007

    2007

  26. [34]

    Cross-conformal predictors

    Vladimir V ovk. Cross-conformal predictors. Annals of Mathematics and Artificial Intelligence, 74:9–28, 2015

    2015

  27. [35]

    Conformal predictions for probabilistically robust scalable machine learning classification

    Alberto Carlevaro, Teodoro Alamo, Fabrizio Dabbene, and Maurizio Mongelli. Conformal predictions for probabilistically robust scalable machine learning classification. Machine Learning, 113(9):6645–6661, 2024

    2024

  28. [36]

    Interpretable Machine Learning

    Christoph Molnar. Interpretable Machine Learning. 2 edition, 2022

    2022

  29. [37]

    A novel integration of data-driven rule generation and computational argumentation for enhanced explainable ai

    Lucas Rizzo, Damiano Verda, Serena Berretta, and Luca Longo. A novel integration of data-driven rule generation and computational argumentation for enhanced explainable ai. Machine Learning and Knowledge Extraction, 6(3):2049–2073, 2024

    2024

  30. [38]

    Gambardella, Guy Theraulaz, and Gianni A

    Jérôme Guzzi, Alessandro Giusti, Luca M. Gambardella, Guy Theraulaz, and Gianni A. Di Caro. Human-friendly robot navigation in dynamic environments. In 2013 IEEE International Conference on Robotics and Automation, pages 423–430, 2013

    2013

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.