CVJun 13, 2022
Geometrically Guided Integrated GradientsMd Mahfuzur Rahman, Noah Lewis, Sergey Plis · gatech
Interpretability methods for deep neural networks mainly focus on the sensitivity of the class score with respect to the original or perturbed input, usually measured using actual or modified gradients. Some methods also use a model-agnostic approach to understanding the rationale behind every prediction. In this paper, we argue and demonstrate that local geometry of the model parameter space relative to the input can also be beneficial for improved post-hoc explanations. To achieve this goal, we introduce an interpretability method called "geometrically-guided integrated gradients" that builds on top of the gradient calculation along a linear path as traditionally used in integrated gradient methods. However, instead of integrating gradient information, our method explores the model's dynamic behavior from multiple scaled versions of the input and captures the best possible attribution for each input. We demonstrate through extensive experiments that the proposed approach outperforms vanilla and integrated gradients in subjective and quantitative assessment. We also propose a "model perturbation" sanity check to complement the traditionally used "model randomization" test.
61.8NIMar 19
ML-Based Real-Time Downlink Performance Prediction in Standalone 5G NR Using SmartphonesMd Mahfuzur Rahman, Jareen Shuva, Nishith Tripathi et al.
We propose a machine learning (ML)-based framework for downlink performance prediction in 5G networks using real-time measurements from commercial off-the-shelf (COTS) user equipment (UE). Our experimental platform integrates the srsRAN 5G New Radio (NR) stack deployed on a Dell desktop serving as the 5G next generation nodeB (gNB), operating at 3.4 GHz. Two Google Pixel 7a smartphones are used to collect physical layer characteristics such as channel quality indicator (CQI), modulation and coding scheme (MCS), bit rate, transmission time interval (TTI), and block error rate (BLER), which are leveraged as predictors in model training. We use commercial-grade traffic generation tools, including Ookla, for stationary and mobility measurements under line-of-sight (LOS) and non-line-of-sight (nLOS) conditions. Test data includes global Ookla servers (e.g., USA, Portugal, Ghana, Egypt, Japan), iperf TCP/UDP data, and video streaming sessions from YouTube. To analyze inter-user interference, we also include scenarios with multiple UEs at the same location. We evaluate the predictive performance of five supervised regression models - linear regression, decision tree regression, random forest regression, extreme gradient boosting (XGBoost), light gradient boosting machine (LightGBM). Our results demonstrate that throughput and BLER can be accurately predicted using COTS hardware and standard ML techniques in diverse real-world 5G scenarios.
7.4NIMar 18
ML and Smartphones Assisted Real-Time Uplink Performance Prediction in 5G Cellular SystemMd Mahfuzur Rahman, Jareen Shuva, Nishith Tripathi et al.
We propose a machine learning (ML) and smartphone-assisted framework for uplink performance prediction in a private, realistic 5G cellular system using real-time measurements in both indoor and outdoor settings. This work presents a comprehensive data-driven evaluation of 5G performance prediction using a controllable software-defined radio test environment. The experimental platform is built on srsRAN 5G NR stack running on a Dell workstation configured as a gNB and 5G core operating at 3.4 GHz. Two commercial Google Pixel 7a devices are instrumented to capture uplink metrics, including channel quality indicator (CQI), modulation and coding scheme (MCS), throughput, transmission time interval (TTI), and block error rate (BLER). Different types of traffic are generated using industry-standard tools such as Ookla and iperf, spanning stationary, pedestrian, and mobility cases under both line-of-sight (LOS) and non-line-of-sight (nLOS) propagation environments. Additional datasets include YouTube video sessions and global server endpoints to introduce variability in path characteristics. The resulting measurements, including multi-UE interference conditions, serve as training data for several supervised regression models. Five learning algorithms-linear regression, decision tree, random forest, XGBoost, and LightGBM-are benchmarked for prediction accuracy. The study shows that reliable forecasting of throughput and BLER is feasible using only COTS smartphones and widely available ML methods, offering a practical pathway for real-world 5G network performance estimation.
LGJul 29, 2020
Whole MILC: generalizing learned dynamics across tasks, datasets, and populationsUsman Mahmood, Md Mahfuzur Rahman, Alex Fedorov et al.
Behavioral changes are the earliest signs of a mental disorder, but arguably, the dynamics of brain function gets affected even earlier. Subsequently, spatio-temporal structure of disorder-specific dynamics is crucial for early diagnosis and understanding the disorder mechanism. A common way of learning discriminatory features relies on training a classifier and evaluating feature importance. Classical classifiers, based on handcrafted features are quite powerful, but suffer the curse of dimensionality when applied to large input dimensions of spatio-temporal data. Deep learning algorithms could handle the problem and a model introspection could highlight discriminatory spatio-temporal regions but need way more samples to train. In this paper we present a novel self supervised training schema which reinforces whole sequence mutual information local to context (whole MILC). We pre-train the whole MILC model on unlabeled and unrelated healthy control data. We test our model on three different disorders (i) Schizophrenia (ii) Autism and (iii) Alzheimers and four different studies. Our algorithm outperforms existing self-supervised pre-training methods and provides competitive classification results to classical machine learning algorithms. Importantly, whole MILC enables attribution of subject diagnosis to specific spatio-temporal regions in the fMRI signal.
IVNov 16, 2019
Transfer Learning of fMRI DynamicsUsman Mahmood, Md Mahfuzur Rahman, Alex Fedorov et al.
As a mental disorder progresses, it may affect brain structure, but brain function expressed in brain dynamics is affected much earlier. Capturing the moment when brain dynamics express the disorder is crucial for early diagnosis. The traditional approach to this problem via training classifiers either proceeds from handcrafted features or requires large datasets to combat the $m>>n$ problem when a high dimensional fMRI volume only has a single label that carries learning signal. Large datasets may not be available for a study of each disorder, or rare disorder types or sub-populations may not warrant for them. In this paper, we demonstrate a self-supervised pre-training method that enables us to pre-train directly on fMRI dynamics of healthy control subjects and transfer the learning to much smaller datasets of schizophrenia. Not only we enable classification of disorder directly based on fMRI dynamics in small data but also significantly speed up the learning when possible. This is encouraging evidence of informative transfer learning across datasets and diagnostic categories.
LGOct 29, 2019
GLIMPS: A Greedy Mixed Integer Approach for Super Robust Matched Subspace DetectionMd Mahfuzur Rahman, Daniel Pimentel-Alarcon
Due to diverse nature of data acquisition and modern applications, many contemporary problems involve high dimensional datum $\x \in \R^\d$ whose entries often lie in a union of subspaces and the goal is to find out which entries of $\x$ match with a particular subspace $\sU$, classically called \emph {matched subspace detection}. Consequently, entries that match with one subspace are considered as inliers w.r.t the subspace while all other entries are considered as outliers. Proportion of outliers relative to each subspace varies based on the degree of coordinates from subspaces. This problem is a combinatorial NP-hard in nature and has been immensely studied in recent years. Existing approaches can solve the problem when outliers are sparse. However, if outliers are abundant or in other words if $\x$ contains coordinates from a fair amount of subspaces, this problem can't be solved with acceptable accuracy or within a reasonable amount of time. This paper proposes a two-stage approach called \emph{Greedy Linear Integer Mixed Programmed Selector} (GLIMPS) for this abundant-outliers setting, which combines a greedy algorithm and mixed integer formulation and can tolerate over 80\% outliers, outperforming the state-of-the-art.