A Graph Signal Processing Approach for Sample Influence Analysis

A Graph Signal Processing Approach for Sample Influence Analysis
Most influential samples in the ImageNet data (for AlexNet)

This was a project I had worked on as part of a team (at LLNL) that consisted of researchers from the Data Analysis group. The motivation/goals for this work was as follows:

  • With the growing complexity of deep neural networks, unraveling black-box models is more critical than ever
  • Example-based explanation is a popular strategy to succinctly describe the model’s observed behavior
  • Influence analysis refers to a broad class of sample selection methods – Strongly tied to the metric used to define the desired notion of influence
  • Goals:
    • Create a generic framework for different influence metric choices
    • Support model-agnostic and model-aware sample selection
    • Deal with graph-structured and manifold data
    • Perform fast optimization

Our approach, which is based on techniques from Graph Signal Processing, decouples the influence metric from the actual sample selection technique, and hence can be used with any type of task-specific influence. We demonstrate how this approach can be used to identify samples for prototype selection, semi-supervised classification, characterizing the decision surface, recovering corrupted labels efficiently, and also for computing image saliency maps.

I had presented a poster summarizing our methodology and findings at the SoCal Machine Learning Symposium 2017. The poster can be viewed/downloaded below:

This browser does not support embedded PDFs. Please download it here: Download report </embed>


Here is the link to the arXiv paper that we had written (submitted to ICML 2018).