Arrow Research search

Author name cluster

Sandhya Tripathi

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

TMLR Journal 2023 Journal Article

A Modulation Layer to Increase Neural Network Robustness Against Data Quality Issues

  • Mohamed Abdelhack
  • Jiaming Zhang
  • Sandhya Tripathi
  • Bradley A Fritz
  • Daniel Felsky
  • Michael Avidan
  • Yixin Chen
  • Christopher Ryan King

Data missingness and quality are common problems in machine learning, especially for high-stakes applications such as healthcare. Developers often train machine learning models on carefully curated datasets using only high-quality data; however, this reduces the utility of such models in production environments. We propose a novel neural network modification to mitigate the impacts of low-quality and missing data which involves replacing the fixed weights of a fully-connected layer with a function of additional input. This is inspired by neuromodulation in biological neural networks where the cortex can up- and down-regulate inputs based on their reliability and the presence of other data. In testing, with reliability scores as a modulating signal, models with modulating layers were found to be more robust against data quality degradation, including additional missingness. These models are superior to imputation as they save on training time by entirely skipping the imputation process and further allow the introduction of other data quality measures that imputation cannot handle. Our results suggest that explicitly accounting for reduced information quality with a modulating fully connected layer can enable the deployment of artificial intelligence systems in real-time applications.

AAAI Conference 2020 Short Paper

Attribute Noise Robust Binary Classification (Student Abstract)

  • Aditya Petety
  • Sandhya Tripathi
  • N. Hemachandra

We consider the problem of learning linear classifiers when both features and labels are binary. In addition, the features are noisy, i. e. , they could be flipped with an unknown probability. In Sy-De attribute noise model, where all features could be noisy together with same probability, we show that 0-1 loss (l0−1) need not be robust but a popular surrogate, squared loss (lsq) is. In Asy-In attribute noise model, we prove that l0−1 is robust for any distribution over 2 dimensional feature space. However, due to computational intractability of l0−1, we resort to lsq and observe that it need not be Asy-In noise robust. Our empirical results support Sy- De robustness of squared loss for low to moderate noise rates.