Principal Sensitivity Analysis

by   Sotetsu Koyamada, et al.
Kyoto University

We present a novel algorithm (Principal Sensitivity Analysis; PSA) to analyze the knowledge of the classifier obtained from supervised machine learning techniques. In particular, we define principal sensitivity map (PSM) as the direction on the input space to which the trained classifier is most sensitive, and use analogously defined k-th PSM to define a basis for the input space. We train neural networks with artificial data and real data, and apply the algorithm to the obtained supervised classifiers. We then visualize the PSMs to demonstrate the PSA's ability to decompose the knowledge acquired by the trained classifiers.


Resampling Sensitivity of High-Dimensional PCA

The study of stability and sensitivity of statistical methods or algorit...

A nonlinear aggregation type classifier

We introduce a nonlinear aggregation type classifier for functional data...

Visualization of High-dimensional Scalar Functions Using Principal Parameterizations

Insightful visualization of multidimensional scalar fields, in particula...

On Principal Curve-Based Classifiers and Similarity-Based Selective Sampling in Time-Series

Considering the concept of time-dilation, there exist some major issues ...

Image classifiers can not be made robust to small perturbations

The sensitivity of image classifiers to small perturbations in the input...

Sensitivity of principal components to changes in the presence of non-stationarity

Non-stationarity affects the sensitivity of change detection in correlat...

NPSA: Nonorthogonal Principal Skewness Analysis

Principal skewness analysis (PSA) has been introduced for feature extrac...

Code Repositories

Please sign up or login with your details

Forgot password? Click here to reset