Diwas Pandit
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Diwas Pandit has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Dipesh Pandit
Texas State University, San Marcos, TX 78666, USA, USA
1 shared publication - Monzurul Islam
Texas State University
1 shared publication - Shriyank Somvanshi
Ingram School of Engineering, Texas State University, San Marcos, TX
1 shared publication - Subasish Das
Ingram School of Engineering, Texas State University, San Marcos, USA
1 shared publication - Syed Aaqib Javed
Texas State University
1 shared publication
Latest Publications
- Open Access
- 4 November 2026
- Published by MDPI AG in Preprints.org
From Eigenfaces to Fine-Grained Attention: The Evolution of Face Recognition and the Identical-Twin Frontier
Automatic face recognition (FR) has progressed from hand-engineered subspace projections in the early 1990s to deep neural embeddings that now exceed human accuracy on standard verification benchmarks. Yet a single, biologically extreme test case exposes the limits of this progress: pairs of identical (monozygotic) twins, whose facial appearance is genetically near-indistinguishable. This survey traces five decades of FR method families—subspace and geometric methods, local texture descriptors, deep metric embeddings, margin-based angular losses, and the current era of transformers, quality-adaptive margins, and synthetic data—and then reframes that history through the lens of twin discrimination. We argue that identical twins constitute a natural stress test that isolates the ceiling of two-dimensional, appearance-based recognition: modern systems that report over 99.8% accuracy on mainstream benchmarks drop to roughly 88–92% on identical-twin verification. We organize the literature into a taxonomy along a twin-discrimination axis (appearance-only vs. multimodal/3D vs. mark-based and fine-grained methods), catalogue the specialized twin datasets that anchor this research (ND-TWINS-2009-2010, the Twins Days 3D challenge, and related multibiometric collections), and compile reported accuracies with their protocol caveats. We close with the open problems that the twin frontier makes unavoidable: fine-grained discriminative learning, multimodal and mark-based fusion, demographic fairness, presentation-attack and morphing robustness, and the regulatory pressures of the deployed 2026 landscape.
- 4 November 2026
- Published by MDPI AG in Preprints.org
Open AccessFrom Eigenfaces to Fine-Grained Attention: The Evolution of Face Recognition and the Identical-Twin Frontier
Automatic face recognition (FR) has progressed from hand-engineered subspace projections in the early 1990s to deep neural embeddings that now exceed human accuracy on standard verification benchmarks. Yet a single, biologically extreme test case exposes the limits of this progress: pairs of identical (monozygotic) twins, whose facial appearance is genetically near-indistinguishable. This survey traces five decades of FR method families—subspace and geometric methods, local texture descriptors, deep metric embeddings, margin-based angular losses, and the current era of transformers, quality-adaptive margins, and synthetic data—and then reframes that history through the lens of twin discrimination. We argue that identical twins constitute a natural stress test that isolates the ceiling of two-dimensional, appearance-based recognition: modern systems that report over 99.8% accuracy on mainstream benchmarks drop to roughly 88–92% on identical-twin verification. We organize the literature into a taxonomy along a twin-discrimination axis (appearance-only vs. multimodal/3D vs. mark-based and fine-grained methods), catalogue the specialized twin datasets that anchor this research (ND-TWINS-2009-2010, the Twins Days 3D challenge, and related multibiometric collections), and compile reported accuracies with their protocol caveats. We close with the open problems that the twin frontier makes unavoidable: fine-grained discriminative learning, multimodal and mark-based fusion, demographic fairness, presentation-attack and morphing robustness, and the regulatory pressures of the deployed 2026 landscape.
- Top Cited PapersOpen Access
- 10 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (2) , 1-35
A Survey on Kolmogorov-Arnold Network
This review study explores the theoretical foundations, evolution, applications, and future potential of Kolmogorov–Arnold Networks (KAN), a neural network model inspired by the Kolmogorov–Arnold representation theorem. KANs set themselves apart from traditional neural networks by employing learnable, spline-parameterized functions rather than fixed activation functions, allowing for flexible and interpretable representations of high-dimensional functions. The review explores Kan’s architectural strengths, including adaptive edge-based activation functions that enhance parameter efficiency and scalability across varied applications such as time series forecasting, computational biomedicine, and graph learning. Key advancements including Temporal-KAN (T-KAN), FastKAN, and Partial Differential Equation (PDE) KAN illustrate KAN’s growing applicability in dynamic environments, significantly improving interpretability, computational efficiency, and adaptability for complex function approximation tasks. Moreover, the article discusses KANs integration with other architectures, such as convolutional, recurrent, and transformer-based models, showcasing its versatility in complementing established neural networks for tasks that require hybrid approaches. Despite its strengths, KAN faces computational challenges in high-dimensional and noisy data settings, sparking continued research into optimization strategies, regularization techniques, and hybrid models. This article highlights KANs expanding role in modern neural architectures and outlines future directions to enhance its computational efficiency, interpretability, and scalability in data-intensive applications.
- 10 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (2) , 1-35
Top Cited PapersOpen AccessA Survey on Kolmogorov-Arnold Network
This review study explores the theoretical foundations, evolution, applications, and future potential of Kolmogorov–Arnold Networks (KAN), a neural network model inspired by the Kolmogorov–Arnold representation theorem. KANs set themselves apart from traditional neural networks by employing learnable, spline-parameterized functions rather than fixed activation functions, allowing for flexible and interpretable representations of high-dimensional functions. The review explores Kan’s architectural strengths, including adaptive edge-based activation functions that enhance parameter efficiency and scalability across varied applications such as time series forecasting, computational biomedicine, and graph learning. Key advancements including Temporal-KAN (T-KAN), FastKAN, and Partial Differential Equation (PDE) KAN illustrate KAN’s growing applicability in dynamic environments, significantly improving interpretability, computational efficiency, and adaptability for complex function approximation tasks. Moreover, the article discusses KANs integration with other architectures, such as convolutional, recurrent, and transformer-based models, showcasing its versatility in complementing established neural networks for tasks that require hybrid approaches. Despite its strengths, KAN faces computational challenges in high-dimensional and noisy data settings, sparking continued research into optimization strategies, regularization techniques, and hybrid models. This article highlights KANs expanding role in modern neural architectures and outlines future directions to enhance its computational efficiency, interpretability, and scalability in data-intensive applications.