AIBullisharXiv – CS AI · Mar 267/10
🧠Researchers developed SCoOP, a training-free framework that combines multiple Vision-Language Models to improve uncertainty quantification and reduce hallucinations in AI systems. The method achieves 10-13% better hallucination detection performance compared to existing approaches while adding only microsecond-level overhead to processing time.
AINeutralarXiv – CS AI · Mar 177/10
🧠Researchers propose group-conditional federated conformal prediction (GC-FCP), a new protocol that enables trustworthy AI uncertainty quantification across distributed clients while providing coverage guarantees for specific groups. The framework addresses challenges in federated learning for applications in healthcare, finance, and mobile sensing by creating compact weighted summaries that support efficient calibration.
AINeutralarXiv – CS AI · Mar 177/10
🧠This research review examines methodologies for addressing AI systems' challenges with limited training data through uncertainty quantification and synthetic data augmentation. The paper presents formal approaches including Bayesian learning frameworks, information-theoretic bounds, and conformal prediction methods to improve AI performance in data-scarce environments like robotics and healthcare.
AIBullisharXiv – CS AI · Mar 117/10
🧠Researchers have developed Variational Mixture-of-Experts Routing (VMoER), a Bayesian framework that enables uncertainty quantification in large-scale AI models while adding less than 1% computational overhead. The method improves routing stability by 38%, reduces calibration error by 94%, and increases out-of-distribution detection by 12%.
AINeutralarXiv – CS AI · Mar 117/10
🧠A research study reveals that AI-powered search engines like Perplexity, SearchGPT, and Google Gemini produce highly variable citation results for identical queries, making single-run visibility metrics unreliable. The study demonstrates that citation distributions follow power-law patterns with substantial variability, and argues that uncertainty estimates are essential for accurate measurement of domain visibility in generative search.
🏢 OpenAI🏢 Perplexity🧠 Gemini
AINeutralarXiv – CS AI · Mar 97/10
🧠Researchers present a new framework for uncertainty quantification in AI agents, highlighting critical gaps in current research that focuses on single-turn interactions rather than complex multi-step agent deployments. The paper identifies four key technical challenges and proposes foundations for safer AI agent systems in real-world applications.
AIBullisharXiv – CS AI · Mar 57/10
🧠Researchers developed Conflict-aware Evidential Deep Learning (C-EDL), a new uncertainty quantification approach that significantly improves AI model reliability against adversarial attacks and out-of-distribution data. The method achieves up to 90% reduction in adversarial data coverage and 55% reduction in out-of-distribution data coverage without requiring model retraining.
AIBullisharXiv – CS AI · Mar 57/10
🧠Researchers propose Volumetric Directional Diffusion (VDD), a new AI method for medical image segmentation that addresses uncertainty in 3D lesion analysis. VDD anchors generative models to consensus priors to maintain anatomical accuracy while capturing expert disagreements, achieving state-of-the-art uncertainty quantification on multiple medical datasets.
AINeutralarXiv – CS AI · Mar 47/103
🧠Researchers developed new selective classification methods using likelihood ratio tests based on the Neyman-Pearson lemma, allowing AI models to abstain from uncertain predictions. The approach shows superior performance across vision and language tasks, particularly under covariate shift scenarios where test data differs from training data.
AINeutralarXiv – CS AI · Feb 277/105
🧠Researchers establish theoretical connections between Random Network Distillation (RND), deep ensembles, and Bayesian inference for uncertainty quantification in deep learning models. The study proves that RND's uncertainty signals are equivalent to deep ensemble predictive variance and can mirror Bayesian posterior distributions, providing a unified theoretical framework for efficient uncertainty quantification methods.
AINeutralarXiv – CS AI · Feb 277/105
🧠Researchers propose FedWQ-CP, a new approach for uncertainty quantification in federated learning that addresses both data and model heterogeneity challenges. The method enables reliable uncertainty estimation across distributed agents while maintaining efficiency through single-round communication and weighted threshold aggregation.
AIBullisharXiv – CS AI · Jun 256/10
🧠Researchers present xAARA, an AI system that enhances stroke rehabilitation assessment by analyzing multi-view video to provide ARAT scores with calibrated uncertainty and clinical explanations. The system achieved 94.2% task accuracy while reducing predictive uncertainty by 96.1% compared to single clinicians, with four independent clinicians validating its potential for clinical deployment.
AINeutralarXiv – CS AI · Jun 256/10
🧠Researchers present evidence that safe autonomous AI prescribing requires three architectural safeguards: calibrated confidence thresholds, differentiated uncertainty communication, and decision transparency. A clinician survey of 136 U.S. prescribers reveals these features would substantially increase adoption but would effectively reduce AI systems from true autonomous agents to supervised decision-support tools.
AINeutralarXiv – CS AI · Jun 256/10
🧠Researchers present new confidence sequence methods for statistical model checking of Markov decision processes in online settings, achieving 50x sample efficiency improvements over previous approaches. The work addresses the practical problem of obtaining meaningful guarantees when exact transition probabilities are unknown, with applications to cyber-physical and biological systems.
AINeutralarXiv – CS AI · Jun 256/10
🧠Researchers propose uncertainty-aware reinforcement learning methods for chemical language models that account for prediction confidence when optimizing molecular properties. By incorporating predictive uncertainty into the optimization process, the approach improves hit discovery rates from 50% to 75% while maintaining molecular quality scores.
AINeutralarXiv – CS AI · Jun 256/10
🧠UC-Search is a model-agnostic test-time algorithm that combines time-series forecasting with constrained decision-making under uncertainty. The approach uses beam search and Monte Carlo tree search variants to optimize delayed control decisions while respecting feasibility constraints, demonstrating measurable improvements over existing methods like CEM and MPPI across inventory control and financial forecasting benchmarks.
AINeutralarXiv – CS AI · Jun 256/10
🧠Researchers released Argus, a comprehensive benchmark for uncertainty quantification in AI agents that control computers through GUI interactions. The study evaluated 27 uncertainty methods across multiple vision-language models and datasets, finding that uncertainty rankings remain stable within a single model but degrade significantly when switching between different model classes or interfaces.
AINeutralarXiv – CS AI · Jun 256/10
🧠Researchers introduce a conformal prediction method for ordinal classification using the ranked probability score (RPS), a statistical approach that provides uncertainty quantification with guaranteed coverage properties. The technique produces contiguous prediction sets more efficiently than existing methods and shows improved performance across medical, financial, and image datasets.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers introduce a comprehensive framework for detecting hallucinations in long-form language model outputs through fine-grained uncertainty quantification, finding that simpler claim-level consistency methods outperform complex alternatives. The study provides practical guidance for improving factuality in extended LLM generations across STEM and geography domains.
AINeutralarXiv – CS AI · Jun 235/10
🧠Researchers propose enhancing Counting Bloom Filters (CBFs) by leveraging certainty signals from hash collision information to improve machine learning model accuracy. This work demonstrates how traditional data structure design can be refined to provide probabilistic confidence metrics, enabling hybrid ML-filter architectures to make more informed decisions in applications like caching and anomaly detection.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers introduce NSAC, a biologically-inspired continuous-time attention architecture that quantifies uncertainty in representation learning by reformulating attention computation as a stochastic differential equation. The approach combines theoretical stability guarantees with practical applications across forecasting, autonomous vehicles, and industrial systems, advancing uncertainty quantification in neural networks.
AINeutralarXiv – CS AI · Jun 235/10
🧠Researchers introduce UBP2, a model-based reinforcement learning method that improves sample efficiency in preference-based learning by actively directing exploration through uncertainty quantification across reward, dynamics, and value functions. The approach achieves sublinear regret guarantees and demonstrates substantially higher sample efficiency than existing methods on benchmark tasks.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers propose a comprehensive uncertainty quantification (UQ) framework for large language models, breaking down sources of error into input-level, parameter-level, token-level, and decoding-process components. Testing 21 UQ methods across Qwen3, Llama 3.2, and DeepSeek-V3 reveals that consensus-based approaches consistently outperform alternatives, while larger models exhibit lower uncertainty estimates according to an empirical scaling law.
🧠 Llama
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers propose Latent Confidence Alignment Error (LCAE), a new framework for evaluating how well large language models assess their own reliability by accounting for item difficulty and model ability. Testing on 20 medical-domain models shows the approach improves self-assessment quality without degrading performance, revealing a correlation between model reliability and computational inference costs.
AINeutralarXiv – CS AI · Jun 235/10
🧠Researchers introduce Neural Conjugate Aggregation Model (NCAM), a Bayesian framework for combining multiple biased sensor measurements without ground-truth labels. The method decomposes uncertainty sources and provides calibrated prediction intervals, with applications to sensor networks and scientific monitoring systems.
