Probabilistic Lipschitzness and Stable Rank in Explainability Models

Probabilistic Lipschitzness and stable rank are crucial for evaluating the robustness of explainability models in machine learning.