paper-with-me

Papers

SmoothHess: ReLU Network Feature Interactions via Stein's Lemma

2023-09-21 · NeurIPS 2023 11

Several recent methods for interpretability model feature interactions by looking at the Hessian of a neural network. This poses a challenge for ReLU networks, which are piecewise-linear and thus have a zero Hessian almost everywhere. We propose SmoothHess, a method of estimating second-order interactions through Stein's Lemma. In particular, we estimate the Hessian of the network convolved with a Gaussian through an efficient sampling algorithm, requiring only network gradient calls. SmoothHess is applied post-hoc, requires no modifications to the ReLU network architecture, and the extent of smoothing can be controlled explicitly. We provide a non-asymptotic bound on the sample complexity of our estimation procedure. We validate the superior ability of SmoothHess to capture interactions on benchmark datasets and a real-world medical spirometry dataset.

📄 PDF Abstract BibTeX

Code (1)

maxtorop/smoothhess 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Stein's Lemma for the Reparameterization Trick with Exponential Family Mixtures

2019-10-29 · Wu Lin, Mohammad Emtiyaz Khan, Mark Schmidt

Stein's method (Stein, 1973; 1981) is a powerful tool for statistical applications and has significantly impacted machine learning. Stein's lemma plays an essential role in Stein's method. Previous applications of Stein'…

LEMMA

Generating Rectifiable Measures through Neural Networks

2024-12-06 · Erwin Riegler, Alex Bühler, Yang Pan, Helmut Bölcskei

We derive universal approximation results for the class of (countably) $m$-rectifiable measures. Specifically, we prove that $m$-rectifiable measures can be approximated as push-forwards of the one-dimensional Lebesgue m…

LEMMA

DeepBern-Nets: Taming the Complexity of Certifying Neural Networks using Bernstein Polynomial Activations and Precise Bound Propagation

2023-05-22 · Haitham Khedr, Yasser Shoukry

Formal certification of Neural Networks (NNs) is crucial for ensuring their safety, fairness, and robustness. Unfortunately, on the one hand, sound and complete certification algorithms of ReLU-based NNs do not scale to …

Adversarial RobustnessFairness

Towards Solving the Gilbert-Pollak Conjecture via Large Language Models

2026-01-29 · Yisi Ke, Tianyu Huang, Yankai Shu, Di He 외 arxiv

The Gilbert-Pollak Conjecture \citep{gilbert1968steiner}, also known as the Steiner Ratio Conjecture, states that for any finite point set in the Euclidean plane, the Steiner minimum tree has length at least $\sqrt{3}/2 …

A Wasserstein perspective of Vanilla GANs

2024-03-22 · Lea Kunkel, Mathias Trabs

The empirical success of Generative Adversarial Networks (GANs) caused an increasing interest in theoretical research. The statistical literature is mainly focused on Wasserstein GANs and generalizations thereof, which e…

Dimensionality Reduction