Skip to content
AI News HubLIVE

Live AI News Intelligence

Live monitoring

The most important shift in AI today

105 sources in the directory · Latest publication in this list: 2026-05-08 04:00 UTC.

Live monitoring

Live updates

Trusted sources, attribution, rights, and in-site reading distilled into a signal-first AI brief.

Live updates

Reset

2026-05-08

Tamaththul3D: High-Fidelity 3D Saudi Sign Language Avatars from Monocular Video

Tamaththul3D is a specialized reconstruction pipeline for Arabic Sign Language (ArSL) that generates high-fidelity 3D avatars from monocular video. The authors introduce the first high-quality 3D parametric annotations for the Ishara-500 Saudi Sign Language dataset, providing precise SMPL-X parameters for 500 culturally authentic SSL signs. Their pipeline integrates SMPLer-X, WiLoR, and MediaPipe, achieving up to 32% improvement in hand accuracy over previous methods via kinematic-chain-based wrist alignment, hybrid swing-twist decomposition, and 2D-supervised joint optimization. This establishes the first comprehensive framework for high-fidelity ArSL avatar reconstruction, enabling new accessibility technologies and cultural preservation for the Arab Deaf community.

arXiv Computer VisionResearchIn-site articleTamaththul3D: High-Fidelity 3D Saudi Sign Language Avatars from Monocular Video
egenioussBench: A New Dataset for Geospatial Visual Localisation

egenioussBench is a visual localisation benchmark built on city-scale airborne 3D mesh and CityGML LoD2 models, providing centimetre-accurate smartphone images with map-independent ground truth, designed to scale beyond SfM-based approaches.

arXiv Computer VisionResearchIn-site articleegenioussBench: A New Dataset for Geospatial Visual Localisation
Open-SAT: LLM-Guided Query Embedding Refinement for Open-Vocabulary Object Retrieval in Satellite Imagery

Open-SAT is a training-free query embedding refinement algorithm that operates at inference time, leveraging Large Language Models (LLMs) to improve alignment between user queries and satellite image content. It achieves up to 16.04% F1 improvement on three public benchmarks without additional training or supervision.

arXiv Computer VisionModels / ResearchIn-site articleOpen-SAT: LLM-Guided Query Embedding Refinement for Open-Vocabulary Object Retrieval in Satellite Imagery
ViTok-v2: Scaling Native Resolution Auto-Encoders to 5 Billion Parameters

ViTok-v2 is a novel Vision Transformer autoencoder that addresses key limitations of existing ViT tokenizers through native resolution support via NaFlex and a DINOv3 perceptual loss for stable scaling. Trained on approximately 2 billion images and scaled to 5 billion parameters, it is the largest image autoencoder to date. ViTok-v2 matches or exceeds state-of-the-art reconstruction at 256p and outperforms all baselines at 512p and above. In joint scaling with flow matching generators, ViTok-v2 advances the Pareto frontier of the reconstruction-generation trade-off.

arXiv Computer VisionModels / ResearchIn-site articleViTok-v2: Scaling Native Resolution Auto-Encoders to 5 Billion Parameters
Query2Uncertainty: Robust Uncertainty Quantification and Calibration for 3D Object Detection under Distribution Shift

A density-aware calibration method using latent query features from DETR-style detectors to jointly recalibrate classification and regression uncertainties under distribution shift, consistently outperforming standard post-hoc methods on both camera and LiDAR detectors.

arXiv Computer VisionResearchIn-site articleQuery2Uncertainty: Robust Uncertainty Quantification and Calibration for 3D Object Detection under Distribution Shift
Seeing What Shouldn't Be There: Counterfactual GANs for Medical Image Attribution

A counterfactual explanation method based on GANs with cyclical-consistent loss is proposed for class-oriented feature attribution in medical images. Evaluated on synthetic, tuberculosis, and BraTS datasets, it overcomes limitations of discriminative models. The study also introduces a method to generate plausible counterfactual instances and evaluate their quality.

arXiv Computer VisionResearchIn-site articleSeeing What Shouldn't Be There: Counterfactual GANs for Medical Image Attribution
Layout-Aware Representation Learning for Open-Set ID Fraud Discovery

Researchers propose a layout-aware representation learning method for open-set ID fraud detection. Trained only on US IDs, it achieves 99.83% layout classification accuracy on Canadian IDs and discovers 276 adaptive fraud cases, including 222 missed by existing detectors. The method supports campaign-scale fraud discovery under distribution shift.

arXiv Computer VisionResearchIn-site articleLayout-Aware Representation Learning for Open-Set ID Fraud Discovery
One Turn Too Late: Response-Aware Defense Against Hidden Malicious Intent in Multi-Turn Dialogue

Large language models face threats from hidden malicious intent in multi-turn dialogues, where attackers distribute harmful objectives across benign-looking turns. The proposed TurnGate monitor detects the earliest turn where delivering a response would enable harmful action, and the MTID dataset supports training and evaluation. TurnGate outperforms baselines in detection while maintaining low over-refusal rates and generalizes across domains and models.

arXiv Computational LinguisticsModels / ResearchIn-site articleOne Turn Too Late: Response-Aware Defense Against Hidden Malicious Intent in Multi-Turn Dialogue
When2Speak: A Dataset for Temporal Participation and Turn-Taking in Multi-Party Conversations for Large Language Models

Large Language Models (LLMs) excel at generating contextually appropriate responses but remain poorly calibrated for multi-party conversations, where deciding when to speak is as critical as what to say. This paper introduces When2Speak, a grounded synthetic dataset of over 215,000 examples from 16,000 conversations with 2-6 speakers, and a four-stage pipeline to train intervention timing. Supervised fine-tuning (SFT) improves Macro F1 by 60% on average for 4B+ models but remains over-conservative with a Missed Intervention Rate (MIR) of 0.50. Reinforcement learning with asymmetric reward shaping reduces MIR to 0.186-0.218 and increases recall from 0.479 to 0.78-0.81, showing that temporal participation is a trainable dimension of conversational AI.

arXiv Computational LinguisticsModels / ResearchIn-site articleWhen2Speak: A Dataset for Temporal Participation and Turn-Taking in Multi-Party Conversations for Large Language Models
The Cost of Context: Mitigating Textual Bias in Multimodal Retrieval-Augmented Generation

Researchers identify and formalize 'recorruption' in multimodal RAG, where adding accurate context causes models to ignore correct predictions. They propose BAIR, a parameter-free framework that restores visual attention and applies positional penalties.

arXiv Computational LinguisticsModels / ResearchIn-site articleThe Cost of Context: Mitigating Textual Bias in Multimodal Retrieval-Augmented Generation
A Few Good Clauses: Comparing LLMs vs Domain-Trained Small Language Models on Structured Contract Extraction

A study compares domain-trained small language model Olava Extract against frontier LLMs for structured contract extraction. Olava achieves macro F1 0.812, micro F1 0.842, with 78-97% cost reduction and fewer hallucinations, challenging the need for large models.

arXiv Computational LinguisticsModels / AgentsIn-site articleA Few Good Clauses: Comparing LLMs vs Domain-Trained Small Language Models on Structured Contract Extraction
Chainwash: Multi-Step Rewriting Attacks on Diffusion Language Model Watermarks

A new study shows that repeatedly rewriting text generated by diffusion language models (up to five times) can effectively bypass watermark detection, reducing detection rates from 87.9% to 4.86%. The study tested four open-weight language models and five rewriting styles, finding that even a single rewrite reduces detection to 14%-41%, and multiple rewrites are even more effective.

arXiv Computational LinguisticsModels / ResearchIn-site articleChainwash: Multi-Step Rewriting Attacks on Diffusion Language Model Watermarks
ReaComp: Compiling LLM Reasoning into Symbolic Solvers for Efficient Program Synthesis

ReaComp compiles a small set of LLM reasoning traces into reusable symbolic program synthesizers using coding agents. These solvers require no LLM calls at test time, achieving 91.3% on PBEBench-Lite and 84.7% on PBEBench-Hard, outperforming LLMs with test-time scaling by 16.3 points with zero inference cost. They also complement LLM search, improving PBEBench-Hard accuracy from 68.4% to 85.8% while reducing token usage by 78%, and transfer zero-shot to historical linguistics tasks with 80.1% accuracy.

arXiv Computational LinguisticsModels / AgentsIn-site articleReaComp: Compiling LLM Reasoning into Symbolic Solvers for Efficient Program Synthesis
SLAM: Structural Linguistic Activation Marking for Language Models

SLAM is a novel white-box watermarking scheme that uses sparse autoencoders to identify directions in the residual stream encoding linguistic structure, and causally steers those directions during generation to embed a watermark without compromising text quality. On Gemma-2 2B and 9B, it achieves 100% detection accuracy with only 1-2 reward point quality cost, far below existing methods.

arXiv Computational LinguisticsModels / ResearchIn-site articleSLAM: Structural Linguistic Activation Marking for Language Models
Generating Query-Focused Summarization Datasets from Query-Free Summarization Datasets

This paper proposes an evidence-based model to automatically generate query keywords from query-free datasets for Query-Focused Summarization (QFS). Experiments show that summaries generated using evidence-based queries achieve competitive ROUGE scores compared to those from original queries.

arXiv Computational LinguisticsResearchIn-site articleGenerating Query-Focused Summarization Datasets from Query-Free Summarization Datasets
Counterargument for Critical Thinking as Judged by AI and Humans

An intervention study investigates the use of counterarguments in writing for critical thinking, comparing human and AI assessments. With 36 students and 6 rubrics, results show self-written counterarguments contain logic, and frontier LLMs can effectively assess student work with high alignment to human judgments.

arXiv Computational LinguisticsModels / ResearchIn-site articleCounterargument for Critical Thinking as Judged by AI and Humans
AdaGATE: Adaptive Gap-Aware Token-Efficient Evidence Assembly for Multi-Hop Retrieval-Augmented Generation

AdaGATE is a training-free evidence controller for multi-hop RAG that frames evidence selection as a token-constrained repair problem. It combines entity-centric gap tracking, targeted micro-query generation, and a utility-based selection mechanism balancing gap coverage, corroboration, novelty, redundancy, and relevance. On HotpotQA, it achieves best evidence F1 of 62.3% on clean data and 71.2% under redundancy injection, using 2.6x fewer tokens than Adaptive-k.

arXiv Computational LinguisticsResearch / StartupsIn-site articleAdaGATE: Adaptive Gap-Aware Token-Efficient Evidence Assembly for Multi-Hop Retrieval-Augmented Generation
Structural Instability of Feature Composition

Sparse Autoencoders (SAEs) effectively disentangle feature superposition in transformers, but compositional steering suffers from geometric instability. This paper introduces a high-dimensional cone manifold framework, derives an asymptotic collapse threshold, and shows that ReLU rectification causes a ratchet-like interference accumulation. Experiments on CLEVR validate the predictions.

arXiv Machine LearningModels / ResearchIn-site articleStructural Instability of Feature Composition
Adaptive Computation Depth via Learned Token Routing in Transformers

Standard transformers apply equal layers to all tokens. Token-Selective Attention (TSA) introduces a learned per-token gate that skips layers for easy tokens, saving up to 23% of operations with minimal quality loss and no architectural changes.

arXiv Machine LearningModels / ResearchIn-site articleAdaptive Computation Depth via Learned Token Routing in Transformers
MidSteer: Optimal Affine Framework for Steering Generative Models

This paper introduces MidSteer, a general affine framework for concept steering in generative models. The authors formalize the theory of concept steering, link the standard approach to LEACE, propose LEACE-Switch, and then introduce MidSteer. Experiments show favorable performance across vision diffusion models and LLMs.

arXiv Machine LearningModels / ResearchIn-site articleMidSteer: Optimal Affine Framework for Steering Generative Models
Sparse Prefix Caching for Hybrid and Recurrent LLM Serving

A new paper introduces sparse prefix caching that leverages recurrent layers' ability to resume from a single state, optimizing LLM inference by storing exact recurrent states at sparse checkpoints. An O(NM) dynamic program determines optimal checkpoint placement, improving latency over standard heuristics on real-world tasks.

arXiv Machine LearningModels / ResearchIn-site articleSparse Prefix Caching for Hybrid and Recurrent LLM Serving
Horizon-Constrained Rashomon Sets for Chaotic Forecasting

This paper introduces horizon-constrained Rashomon sets, establishing the first rigorous connection between chaos theory and predictive multiplicity. It proves that the effective Rashomon set contracts exponentially with forecast horizon, and develops decision-aligned model selection algorithms that improve decision quality by 18-34% in chaotic systems.

arXiv Machine LearningResearchIn-site articleHorizon-Constrained Rashomon Sets for Chaotic Forecasting
Physics-Informed Neural Networks with Learnable Loss Balancing and Transfer Learning

A self-supervised PINN framework with a learnable blending neuron to adaptively balance physics and data losses, plus transfer learning. Validated on liquid-metal heat sink heat transfer with only 87 CFD points, achieving <8% error, outperforming baselines.

arXiv Machine LearningResearchIn-site articlePhysics-Informed Neural Networks with Learnable Loss Balancing and Transfer Learning
SAT: Sequential Agent Tuning for Coordinator Free Plug and Play Multi-LLM Training with Monotonic Improvement Guarantees

SAT introduces a coordinator-free training paradigm for multi-LLM teams, providing monotonic improvement and plug-and-play guarantees. Experiments show a team of three 4B agents surpasses Qwen3-32B by 3.9% on AIME benchmarks, and swapping in two 8B agents boosts performance by 10.4%.

arXiv Machine LearningModels / AgentsIn-site articleSAT: Sequential Agent Tuning for Coordinator Free Plug and Play Multi-LLM Training with Monotonic Improvement Guarantees
Nationwide EHR-Based Chronic Rhinosinusitis Prediction Using Demographic-Stratified Models

Researchers leveraged nationwide longitudinal EHR data from the All of Us Research Program to predict chronic rhinosinusitis (CRS) diagnosis using two years of pre-diagnostic history. A hybrid feature-selection pipeline compressed ~110,000 candidate codes into 100 interpretable features. Demographic-stratified models were trained across six adult sex and life-stage subgroups with subgroup-specific hyperparameter tuning, achieving an overall AUC of 0.8461—an improvement of 0.0168 over the best baseline. The study demonstrates that routinely collected EHR data can support population-representative CRS risk stratification and inform earlier triage and referral prioritization in primary care.

arXiv Machine LearningResearchIn-site articleNationwide EHR-Based Chronic Rhinosinusitis Prediction Using Demographic-Stratified Models
Are Flat Minima an Illusion?

This paper challenges the notion that flat minima cause better generalization in neural networks. It proposes 'weakness' as a reparameterization-invariant measure that predicts generalization, showing through experiments that flatness and simplicity are less reliable indicators.

arXiv Machine LearningResearch / RoboticsIn-site articleAre Flat Minima an Illusion?
From History to State: Constant-Context Skill Learning for LLM Agents

This paper proposes constant-context skill learning, a framework that moves reusable procedures into lightweight modules, reducing prompt tokens by 2-7x while achieving strong performance on multiple benchmarks.

arXiv AIModels / AgentsIn-site articleFrom History to State: Constant-Context Skill Learning for LLM Agents
LaTA: A Drop-in, FERPA-Compliant Local-LLM Autograder for Upper-Division STEM Coursework

LaTA is an open-source autograder that runs entirely on local hardware, using a LaTeX-native workflow and a four-stage pipeline (ingest, segment, grade, report) with a locally hosted open-weight chain-of-thought LLM (gpt-oss:120b) to grade student assignments. Deployed at Oregon State University for ME 373 with ~200 students, it achieved $0 marginal cost per assignment, a grading error rate of ~0.02-0.04%, and improved exam scores by 11% (midterm) and 8% (final) compared to traditional grading, along with significant gains in student confidence.

arXiv AIModels / AgentsIn-site articleLaTA: A Drop-in, FERPA-Compliant Local-LLM Autograder for Upper-Division STEM Coursework
Agentic Retrieval-Augmented Generation for Financial Document Question Answering

This paper introduces FinAgent-RAG, an agentic RAG framework for financial document QA, which uses iterative retrieval-reasoning loops with self-verification. It incorporates a contrastive financial retriever, program-of-thought reasoning, and an adaptive strategy router, achieving state-of-the-art results on three benchmarks while reducing API costs by 41.3%.

arXiv AIAgentsIn-site articleAgentic Retrieval-Augmented Generation for Financial Document Question Answering