SearcharxivSearch

arXiv subjects

Tejashree Subramanya

Publications and source records attributed to Tejashree Subramanya.

2 recordsLinked to original sources

Robust Lightweight Deep Learning Models for Oral Cancer Screening

Oral cancer is a leading cause of mortality in low-to-middle-income countries, where a shortage of specialists delays diagnosis. While point-of-care screening via smartphones offers a scalable solution, developing robust AI for resource-constrained settings poses significant challenges, including class imbalance in training data, variable data quality, and computational constraints on edge devices. In this paper, we present the optimisation of lightweight deep learning models for smartphone-based oral cancer screening. Using a diverse, multi-centre retrospective dataset of approximately 30,000 images acquired over a decade, we systematically evaluate state-of-the-art convolutional, transformer, and hybrid architectures. Through rigorous pipeline ablation, we demonstrate that directly optimising hybrid architectures for the edge strictly outperforms computationally heavy paradigms, such as large models or knowledge distillation. Furthermore, interpretability analysis and simulated noise-stress tests revealed that the system anchors on clinical features and remains robust to unstructured sensor noise, despite vulnerabilities to impulse bit errors. In the held-out test set, our optimised MobileViTv2 models achieved an average sensitivity of 83.2 $\pm$ 1.5% and an average specificity of 86.0 $\pm$ 0.8%, with the best model exhibiting 87.4% sensitivity, 86.5% specificity, and a critical negative predictive value of 97.2% with reference to specialist labels. These results confirm that with targeted architectural selection and streamlined optimisation, interpretable and robust lightweight AI models exhibit high potential for edge deployment to enable automated triage in primary care settings.

cs.AI

The Triangle Friendship Paradox

We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges at a vertex, the average friendship-bias of the number of triangles at a vertex is not always non-negative. We identify classes of finite deterministic graphs for which the bias is non-negative, and provide examples of finite deterministic graphs for which it is not. For certain classes of sparse and dense random graphs, we compute the scaling of the bias in the limit as the number of vertices tends to infinity.

math.PR