CatNet: SHAP特徴重要度とガウシアンミラーを用いたLSTMにおける偽発見率の制御
原題: CatNet: Controlling the False Discovery Rate in LSTM with SHAP Feature Importance and Gaussian Mirrors
分析結果
- カテゴリ
- 教育
- 重要度
- 53
- トレンドスコア
- 12
- 要約
- CatNetは、LSTMにおける偽発見率(FDR)を効果的に制御し、重要な特徴を選択するアルゴリズムです。この手法は、SHAP特徴重要度の導関数を利用しており、モデルの解釈性を高めつつ、重要な特徴を特定することが可能です。
- キーワード
arXiv:2411.16666v4 Announce Type: replace-cross Abstract: We introduce CatNet, an algorithm that effectively controls False Discovery Rate (FDR) and selects significant features in LSTM. CatNet employs the derivative of SHAP values to quantify the feature importance, and constructs a vector-formed mirror statistic for FDR control with the Gaussian Mirror algorithm. To avoid instability due to nonlinear or temporal correlations among features, we also propose a new kernel-based independence measure. CatNet performs robustly on different model settings with both simulated and real-world data, which reduces overfitting and improves interpretability of the model. Our framework that introduces SHAP for feature importance in FDR control algorithms and improves Gaussian Mirror can be naturally extended to other time-series or sequential deep learning models. arXiv:2411.16666v4 Announce Type: replace-cross Abstract: We introduce CatNet, an algorithm that effectively controls False Discovery Rate (FDR) and selects significant features in LSTM. CatNet employs the derivative of SHAP values to quantify the feature importance, and constructs a vector-formed mirror statistic for FDR control with the Gaussian Mirror algorithm. To avoid instability due to nonlinear or temporal correlations among features, we also propose a new kernel-based independence measure. CatNet performs robustly on different model settings with both simulated and real-world data, which reduces overfitting and improves interpretability of the model. Our framework that introduces SHAP for feature importance in FDR control algorithms and improves Gaussian Mirror can be naturally extended to other time-series or sequential deep learning models.