The research, conducted by Hrushikesh Sanap, an independent researcher based in Chhatrapati Sambhajinagar, India, evaluates four architecturally diverse deep networks alongside two ensemble strategies across four datasets drawn from the MedMNIST v2 benchmark collection. The individual models span the modern computer vision landscape: ConvNeXt-Base, a convolutional network redesigned with contemporary training recipes; Vision Transformer Base, an attention-based architecture that treats image patches as sequences; EfficientNetV2-M, a compact and efficient convolutional family; and InceptionResNetV2, an older but still competitive hybrid of inception modules and residual connections. All four were fine-tuned from ImageNet pre-trained weights at a resolution of 224 by 224 pixels, a deliberately realistic setting for clinical pipelines where computational budgets matter.

The four tasks were chosen to cover a spread of modalities, class counts and imbalance regimes. BloodMNIST requires eight-class classification of blood cell microscopy images and is close to saturation in the literature. BreastMNIST is a binary malignancy detection problem on breast ultrasound, and notably the smallest dataset in the study. DermaMNIST involves seven-class dermatoscopic lesion classification with pronounced class imbalance, and OrganAMNIST asks models to identify one of eleven abdominal organs on computed tomography slices. Every trained configuration exceeded the previously reported benchmark accuracy on all four datasets, with margins ranging from a fraction of a percentage point on the near-saturated blood cell task to roughly fifteen percentage points on the dermatoscopy data.

Two ensemble strategies were then layered on top. Soft Voting simply averages the predicted probabilities of the member networks, a technique with roots stretching back to foundational work on neural network ensembles in 1990. Rigorous Stacking, by contrast, trains a meta-learner on the outputs of the base models, following the stacked generalization framework introduced by David Wolpert in 1992. The ensembles matched or exceeded the strongest individual model in almost every case, with a single exception: Rigorous Stacking on the small BreastMNIST set, where the meta-learner presumably lacked enough data to learn reliable combination weights.

The central and most striking finding is that accuracy and calibration are dissociated. Calibration, measured here through reliability diagrams and the expected calibration error, asks whether a model’s stated confidence matches its empirical hit rate: of all the cases a model labels with 80 percent confidence, roughly 80 percent should actually be correct. Across the experiments, the most accurate configuration was rarely the best calibrated. Soft Voting attained the lower expected calibration error on all four datasets and the higher accuracy on three of them, while the accuracy advantage of Rigorous Stacking was confined to the most imbalanced dataset, DermaMNIST, and even there it came at the cost of weaker, less usable probabilities. Overconfidence, a well-documented pathology of modern neural networks, proved pervasive among the individual models and was reduced, but not eliminated, by ensembling.

Predictive uncertainty was quantified through the Shannon entropy of each prediction’s probability distribution, comparing the entropy distributions of correct against incorrect answers. Throughout the experiments, incorrect predictions sat at higher entropy than correct ones, which is the essential precondition for confidence-based triage, the practice of routing uncertain cases to human experts while letting confident, correct predictions pass through automatically. But the study adds a crucial caveat: a strong aggregate calibration score can still mask a collapsed, non-informative per-prediction uncertainty distribution. In other words, a model can look well calibrated on average while being nearly useless at telling clinicians which individual cases deserve scrutiny. Soft Voting held the most consistent separation between the entropy distributions of correct and incorrect predictions, reinforcing its case as the dependable default.

Interpretability analyses using gradient-weighted class activation mapping for the convolutional models and attention-based methods for the transformer complemented the quantitative results, and the residual errors clustered at clinically recognized decision boundaries. In dermatoscopy, the melanoma-to-nevus distinction remained the dominant failure mode, and even the largest accuracy gain left roughly a quarter of melanomas assigned to the benign nevus category. In breast ultrasound, the dangerous errors were malignant false negatives, the cases where a cancer is waved through as benign. In abdominal CT, the models struggled with kidney laterality, a reminder that spatial reasoning failures can persist even when overall organ identification accuracy looks impressive.

The practical implications are pointed. The study argues that post-hoc calibration should be treated as a prerequisite for safe deployment rather than an optional refinement, and that ensemble methods for medical imaging should be evaluated on calibration and uncertainty structure as much as on discrimination accuracy. For hospitals and regulators weighing which systems to trust, this reframes the leaderboard: a marginally less accurate but better calibrated ensemble that knows when it does not know may save more lives than a sharper classifier that is confidently wrong at the worst moments. The finding that simple probability averaging outperformed a learned stacking layer on calibration, while costing almost nothing in accuracy, is a rare case of the cheaper and simpler option also being the safer one.

The author is careful to delineate the limits of the evidence. All results derive from single-source benchmark data at 224 by 224 resolution, from a single training run under one fixed random seed, so run-to-run variance and dataset shift remain untested. Higher-resolution inputs and prospective external validation on real clinical data are flagged as the necessary next steps toward deployment. The datasets themselves are publicly available through the MedMNIST v2 collection, and the model prediction outputs, ensemble implementation and evaluation code have been released in an open GitHub repository, allowing independent verification of the per-class, entropy and reliability values underlying the analysis. For a field racing to put diagnostic AI in front of patients, the message is uncomfortable but timely: before asking how often a model is right, ask whether it knows the difference between knowing and guessing.

Subject of Research: Calibration and uncertainty quantification in multi-architecture deep learning ensembles for medical image classification on MedMNIST benchmarks

Article Title: Beyond accuracy: calibration and uncertainty in multi-architecture ensembles for MedMNIST classification

Article References: Sanap, H. (2026). Beyond accuracy: calibration and uncertainty in multi-architecture ensembles for MedMNIST classification. Neural Computing and Applications, 38(19), Article 776. https://doi.org/10.1007/s00521-026-12521-1

Image Credits: AI Generated

DOI: 10.1007/s00521-026-12521-1

Keywords: medical image classification, ensemble learning, model calibration, uncertainty quantification, MedMNIST, expected calibration error, vision transformers, ConvNeXt, soft voting, stacked generalization, predictive entropy, clinical decision support

The alternative in question is the Forward-Forward (FF) algorithm, introduced by Geoffrey Hinton, one of the founding figures of deep learning. Where back-propagation performs one forward pass to generate predictions and one backward pass to distribute blame, FF performs two forward passes. The first runs on positive, real data drawn from the training set; the second runs on negative data, which may be generated by the network itself. Each pass produces a measure of goodness at every layer, and layers are trained to assign high goodness to positive data and low goodness to negative data. Because no gradients need to flow backwards, activations do not need to be cached for a reverse sweep, and the memory footprint of training shrinks dramatically.

That memory efficiency is precisely what makes FF interesting for a particular and growing class of problems: training neural networks on low-resource hardware. Edge devices, embedded controllers and medical monitoring systems often cannot afford the memory overhead of back-propagation, which scales with the number of stored activations. FF’s two-pass structure, by contrast, opens the door to on-device learning without the same storage demands. The catch, as the Tanta University team documents across six diverse datasets, is that FF in its basic form lags behind back-propagation in predictive accuracy. The algorithm trades memory for performance, and until now that trade has been steep enough to keep it largely a research curiosity rather than a practical training method.

The new study attacks that gap not by redesigning the algorithm itself but by treating its configuration as an optimization problem in its own right. Neural network training is governed by a constellation of hyper-parameters, settings such as learning rates, layer configurations and goodness thresholds that are fixed before training begins and that can make the difference between a model that converges gracefully and one that stalls. In conventional practice these values are chosen by hand, guided by intuition and trial and error. The researchers instead deployed automated hyper-parameter optimization, using metaheuristic search algorithms, computational procedures inspired by natural processes that explore large configuration spaces far more systematically than manual tuning ever could.

The scope of the evaluation is notable. The team first assessed FF’s baseline performance across six diverse datasets to establish how the algorithm behaves in general. They then narrowed to four datasets for the optimization phase, applying two well-established metaheuristic algorithms alongside four state-of-the-art ones, a total of six search strategies competing to find the hyper-parameter settings that would squeeze the most performance out of FF. This comparative design matters, because the choice of optimizer for hyper-parameter search is itself a hyper-parameter of sorts, and the study’s structure allows the relative strength of different search strategies to be assessed on the same footing.

The results are striking. On Pneumonia-MedMnist, a medical imaging benchmark, validation accuracy rose from 93 percent to 97 percent after optimization. On Fashion-MNIST, a standard clothing-image classification set, accuracy climbed from 87 percent to 91 percent. The most dramatic gains appeared on the organ-segmentation datasets from the MedMnist collection: OrganC-MedMnist jumped from 82 percent to 94 percent, a twelve-point improvement, and OrganA-MedMnist rose from 88 percent to 95 percent. Crucially, these gains came while maintaining or even reducing training time, meaning the optimization did not simply buy accuracy by burning more compute. The study also reports that metaheuristic optimization accelerated convergence, allowing the networks to reach good solutions faster than they otherwise would.

Those numbers deserve unpacking, because they speak to a broader tension in machine learning research. The gap between memory efficiency and accuracy has long been framed as a fundamental trade-off: algorithms that avoid back-propagation’s memory bill pay for it in performance. What this study demonstrates is that at least part of that gap is not fundamental at all, but an artifact of under-tuned configuration. FF’s hyper-parameter space is evidently sensitive enough that default or manually chosen settings leave substantial performance on the table. When a systematic search is applied, much of that lost performance is recovered, in one case recovering nearly the entire distance to the sort of accuracy figures typically associated with conventionally trained networks on these benchmarks.

The technical explanation for why hyper-parameters matter so much to FF lies in its layered goodness objective. Because each layer is trained locally to discriminate positive from negative data, the overall behavior of the network emerges from the interaction of many local objectives rather than from a single global loss gradient. Small changes in threshold settings or layer-wise learning dynamics can therefore ripple through the network in ways that are hard to anticipate manually. Metaheuristic algorithms, which iteratively propose, evaluate and refine candidate solutions using mechanisms borrowed from processes such as evolution or swarm behavior, are well suited to navigating such rugged configuration landscapes, where the relationship between settings and outcomes is nonlinear and riddled with local optima.

The implications extend beyond a single algorithm. Interest in back-propagation-free training has grown as the field confronts the energy and memory costs of ever-larger models, and as researchers look to the brain, which clearly learns without any known reverse-phase error propagation, for inspiration. Hinton’s Forward-Forward proposal was framed partly in these terms, as a step toward learning procedures that might be more biologically plausible and more hardware-friendly. The Egyptian team’s contribution is to show that the practical viability of such procedures depends heavily on the surrounding optimization machinery, and that investing in automated tuning can transform a promising but underperforming idea into a competitive one.

For practitioners working at the edge, the message is concrete. Medical imaging tasks of the kind tested here, including pneumonia detection and organ identification, are exactly the workloads targeted at resource-constrained clinical hardware, and the demonstrated accuracy levels after optimization, reaching 94 to 97 percent validation accuracy on several benchmarks, suggest that memory-efficient training is approaching the point where it can be taken seriously for such applications. The study, published open access on 30 September 2026, received open access funding from Egypt’s Science, Technology and Innovation Funding Authority in cooperation with the Egyptian Knowledge Bank. Whether Forward-Forward can scale to the large architectures that dominate contemporary artificial intelligence remains an open question, but this work establishes that the algorithm’s accuracy deficit is neither fixed nor mysterious, and that the tools for closing it were already sitting in the metaheuristic toolbox.

Subject of Research: Optimizing the Forward-Forward neural network training algorithm with metaheuristic hyper-parameter search

Article Title: Towards optimized forward–forward training for neural networks

Article References: Elnady, Y. A., Sarhan, A. M., & Eita, M. A. (2026). Towards optimized forward–forward training for neural networks. Artificial Intelligence Review, 59(11), Article 232. https://doi.org/10.1007/s10462-026-11668-6

Image Credits: AI Generated

DOI: 10.1007/s10462-026-11668-6

Keywords: Forward-Forward algorithm, back-propagation, neural networks, metaheuristics, hyper-parameter optimization, Geoffrey Hinton, memory efficiency, machine learning, MedMnist, Fashion-MNIST, Tanta University, Artificial Intelligence Review