The core problem the researchers, led by Shalini Saravanan and colleagues, set out to address is the notorious unreliability of softmax confidence. Most classifiers convert their internal scores into probabilities through a softmax function, but these numbers reflect the relative magnitude of scores rather than genuine predictive certainty. The result is a well-documented pathology: softmax outputs are poorly calibrated and routinely assign high confidence to incorrect predictions or to inputs drawn from entirely outside the training distribution. Existing fixes, including Bayesian neural networks, deep ensembles, and temperature scaling, either demand substantial extra computation or require specialised training procedures that cannot be bolted onto a model already in service.

The team’s answer, which they call the class-conditioned neutrosophic representation, or CCNR, works entirely after the fact. Deep networks transform images into embeddings, high-dimensional vectors in which samples of the same class cluster together while different classes occupy distinct regions. CCNR exploits this geometry: for each embedding, it computes distances to the nearest and second-nearest class centroids and converts those distances into a triplet of values drawn from neutrosophic set theory. Truth measures the evidence supporting the predicted class, falsity measures the strongest competing evidence, and indeterminacy captures the ambiguity between them. Unlike probabilities, these three components need not sum to one, allowing the representation to express conflicting evidence explicitly rather than collapsing it into a single scalar.

The construction has elegant mathematical properties that the authors prove formally. Indeterminacy peaks exactly at the decision boundary, where a sample lies equidistant between two class centroids, and falls monotonically as the classification margin grows. The mapping is continuous and bounded, and it is provably not equivalent to softmax confidence. Two distance formulations are explored: a Euclidean version that assumes isotropic class structure, and a Mahalanobis version that incorporates the covariance of the feature space. The resulting triplet is simply appended to the original 512-dimensional ResNet-18 embedding, producing a 515-dimensional vector that feeds standard classifiers such as Random Forests, Logistic Regression, or Support Vector Machines, with six named variants covering the combinations.

Evaluation was deliberately demanding. The framework was tested under a leave-one-class-out protocol across four datasets spanning CIFAR-10 and three real-world plant disease collections, with one class withheld from training and used exclusively to test whether the model could detect genuinely novel inputs. All results were averaged over ten independent trials with fixed seeds and assessed with Holm-corrected Wilcoxon signed-rank tests. The most dramatic finding came from the Eggplant Leaf Disease dataset, where the fine-tuned ResNet-18 baseline, despite achieving 99 percent classification accuracy, collapsed to an out-of-distribution detection score of 0.366, well below random chance. The same softmax model that was nearly perfect on familiar data assigned high confidence to images of a disease it had never encountered.

Perhaps the study’s most consequential insight concerns not what the augmentation adds but what conventional readouts discard. Under the Mahalanobis formulation, the truth component is a monotone transform of the distance to the nearest centroid, meaning classical Mahalanobis out-of-distribution scoring is recovered exactly by reading that single coordinate directly. When the researchers replaced the standard uncertainty signal, one minus the maximum class probability, with the truth component, the below-chance detection scores of the linear variants on Eggplant jumped from roughly 0.46 to 0.96 in every single trial. The geometric information had been present all along; the classifier’s posterior simply threw it away. This failure, the authors stress, is a property of the readout rather than the representation, and it can be corrected without any retraining.

The team also displayed unusual scientific candour by subjecting their own method to a six-arm ladder of random-dimension controls, in which the three added columns were replaced with everything from plain Gaussian noise to the real components permuted within class. Pooled across datasets and classifiers, the augmentation was not distinguishable from matched random dimensions; only one configuration, CCNR-SVM-E on the most separable dataset, exceeded every control after correction, and by a margin of just 0.002. The authors report this boundary in place of the aggregate gains it does not support, a level of methodological honesty that is rare in the uncertainty estimation literature and that they argue should become standard practice.

Against the main computational alternative, a snapshot ensemble that saves multiple checkpoints during training, CCNR held its own on uncertainty quality, with nine of twelve comparisons statistically indistinguishable, at roughly a third of the training time, storage, and inference latency. Where a fine-tuned backbone already exists, the augmentation adds only seconds of classifier training and a few megabytes of storage. Yet the study is equally clear about limitations. Detection of corruption-based covariate shift, such as blur, brightness changes, or JPEG compression, was markedly weaker than detection of novel classes, and each feature space proved effectively blind to at least one common corruption while accuracy silently fell by 9 to 13 points. Strikingly, the choice of which class was withheld moved detection scores by 0.135 to 0.269, far more than any difference between methods.

For practitioners, the message is nuanced but actionable. The neutrosophic components carry genuine class information, classifying above chance on every dataset when used alone, with the strongest signal precisely where class clusters are geometrically clearest. A high indeterminacy score offers a natural trigger for human review, aligning with how expert agronomists already treat ambiguous symptoms. But the authors recommend pairing the method with explicit image-quality checks in uncontrolled field conditions, selecting the uncertainty readout to match the operational objective, and reporting protocol-sensitivity analyses routinely. In a field often criticised for overclaiming, this work stands out both for what it demonstrates, that feature-space geometry holds uncertainty information our standard readouts waste, and for showing exactly where its own promise ends.

Subject of Research: Uncertainty-aware classification of deep feature embeddings using class-conditioned neutrosophic representations

Article Title: Uncertainty-aware deep feature classification using class-conditioned neutrosophic representation

Article References: Saravanan, S., Kumar, K., Obbineni, J. M., & Kandasamy, I. (2026). Uncertainty-aware deep feature classification using class-conditioned neutrosophic representation. Machine Learning with Applications, 26, Article 101037. https://doi.org/10.1016/j.mlwa.2026.101037

Image Credits: AI Generated

DOI: Not provided

Keywords: deep learning, uncertainty estimation, neutrosophic sets, out-of-distribution detection, plant disease detection, ResNet-18, feature embeddings, softmax calibration, Mahalanobis distance, machine learning, precision agriculture, interpretable AI