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-06-29 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-06-29

TruEye: Fine-Grained Detection of AI-Generated Human Subjects in Images

TruEye is a novel model for fine-grained detection and localization of AI-generated or manipulated humans and scenes, distinguishing among five compositional categories of synthetic content. It runs over 100x faster than LLM-based competitors and outperforms state-of-the-art detectors on multiple datasets.

arXiv Computer VisionModels / ResearchIn-site articleTruEye: Fine-Grained Detection of AI-Generated Human Subjects in Images
ReWorld: Learning Better Representations for World Action Models

ReWorld is the first representation learning framework specifically designed for autonomous-driving world action models. It directly optimizes intermediate representations along three dimensions: future-predictive supervision on the generation module, cross-modal alignment and hard-negative supervision on the planning module. Experiments on nuScenes and NAVSIM show significant improvements in video generation quality and closed-loop planning performance, along with faster convergence.

arXiv Computer VisionPolicy / ResearchIn-site articleReWorld: Learning Better Representations for World Action Models
Aloe-Vision: Robust Vision-Language Models for Healthcare

Aloe-Vision introduces a family of open-source medical vision-language models trained on a large-scale quality-filtered dataset, achieving balanced performance and exposing vulnerabilities to adversarial inputs.

arXiv Computer VisionModels / Research / PolicyIn-site articleAloe-Vision: Robust Vision-Language Models for Healthcare
DMV-Bench: Diagnosing Long-Horizon Multimodal Agents' Visual Memory with Incidental Cue Injection

DMV-Bench is the first interactive benchmark for multimodal-agent visual memory, built on a home-furnishing e-commerce catalog of 1,000 product variants. Each product image carries a unique incidental cue; agents must recall cued products after long shopping sessions. The proposed DualMem architecture, maintaining parallel visual and verbal codes, outperforms baselines on Gemini 2.5 Flash and Qwen2.5-VL-7B.

arXiv Computer VisionModels / Agents / ResearchIn-site articleDMV-Bench: Diagnosing Long-Horizon Multimodal Agents' Visual Memory with Incidental Cue Injection
SelectAnyTree: A Promptable Instance Segmentation Model for 3D Forest LiDAR Point Clouds

SelectAnyTree is a promptable instance segmentation model that segments individual trees from 3D forest LiDAR point clouds with few clicks. It features a click-to-query prompt encoder and a Canopy Height Model-guided first prompt, with a state-space query decoder for efficient long-range context. Evaluated on seven diverse forest regions and a held-out dataset, it achieves 78.2 IoU from a single click, outperforming baselines by 24.8 points.

arXiv Computer VisionResearchIn-site articleSelectAnyTree: A Promptable Instance Segmentation Model for 3D Forest LiDAR Point Clouds
Fine-tuning a multimodal large language model for clinician-grade autism behavioral scoring from short home videos

Researchers fine-tuned Gemini 2.5 Pro on 400 clinician-rated home videos using low-rank adaptation, achieving significant improvements in inter-rater reliability and ASD diagnosis accuracy, matching or exceeding clinician performance. The approach enables scalable behavioral feature extraction for autism assessment.

arXiv Computer VisionModels / ResearchIn-site articleFine-tuning a multimodal large language model for clinician-grade autism behavioral scoring from short home videos
SemCityLoc: Aerial 6DoF Localization Using Semantic 3D City Models

SemCityLoc is a novel aerial localization method that reframes pose estimation as structured surface registration between foundation-model visual priors and standardized LoD 3D city models. It eliminates reliance on precise GNSS or radiometric 3D reconstructions by aligning semantic surfaces and monocular depth with lightweight building models. The benchmark SemCityLockeD, combining centimeter-accurate UAV poses with LoD1-LoD3 models, is introduced. Experiments show up to 36% recall improvement and mean positional error reduction from 9.89m to 2.62m in urban canyons.

arXiv Computer VisionResearch / StartupsIn-site articleSemCityLoc: Aerial 6DoF Localization Using Semantic 3D City Models
Not All Relations Rotate Alike: Transformation-Aware Decoupling for Viewpoint-Robust 3D Scene Graph Generation

A new framework called Transformation-Aware Decoupling (TAD) improves viewpoint robustness in 3D scene graph generation by decoupling relation reasoning into viewpoint-sensitive and viewpoint-invariant components.

arXiv Computer VisionAgents / ResearchIn-site articleNot All Relations Rotate Alike: Transformation-Aware Decoupling for Viewpoint-Robust 3D Scene Graph Generation
Narrative-UFET: Narrative Generation for Ultra-Fine Entity Typing

Ultra-fine entity typing (UFET) assigns highly specific types to entity mentions, but struggles with long-tail types due to reliance on sentence-level context. We present Narrative-UFET, which pairs each mention with an automatically generated narrative to provide cross-sentence context. Experiments show consistent improvements on long-tail types, especially when the entity's type changes across the narrative. Synthetic narratives outperform natural contexts, suggesting controlled discourse construction can surface implicit signals.

arXiv Computational LinguisticsResearchIn-site articleNarrative-UFET: Narrative Generation for Ultra-Fine Entity Typing
Ko-WideSearch: A Korean Breadth-Search Benchmark for Exhaustive Set Enumeration by Web Agents

Ko-WideSearch is a Korean breadth-search benchmark built via an automated synthesize-and-verify pipeline, comprising 228 tables over 190 entities across 16 categories and three difficulty tiers. Evaluations on 20 web agents show consistent failure: agents recover sets but not rows (Item-F1 92.8 vs Row-F1 53.7), accuracy drops with difficulty, and open-ended free-text cells are the main bottleneck.

arXiv Computational LinguisticsAgents / Research / StartupsIn-site articleKo-WideSearch: A Korean Breadth-Search Benchmark for Exhaustive Set Enumeration by Web Agents
EntMTP: Accelerating LLM Inference with Entropy Guided Multi Token Prediction

EntMTP is a training-free scheduler that dynamically switches tree-based attention topologies based on local generation entropy, enabling deep speculation in low-entropy regions and conservative speculation in high-entropy regions. It maximizes throughput without sacrificing quality, achieving 1.15x speedup over Hydra and peak 1.36x over Medusa on various benchmarks.

arXiv Computational LinguisticsModels / ResearchIn-site articleEntMTP: Accelerating LLM Inference with Entropy Guided Multi Token Prediction
The Context-Ready Transformer

A new recurrent neural network architecture that pre-contextualizes tokens using a transformer block and correction network, achieving significant speedups over standard transformers while maintaining or improving performance.

arXiv Computational LinguisticsModels / ResearchIn-site articleThe Context-Ready Transformer
Supersede: Diagnosing and Training the Memory-Update Gap in LLM Agents

Large language model (LLM) agents struggle to update facts in long-term interactions. Replacing full context with bounded memory drops accuracy from 92% to 77% even on frontier models. The gap scales with conversation length, not memory size. The authors introduce Supersede, a reinforcement learning environment that trains agents to prioritize current facts over superseded ones. Fine-tuning Qwen2.5-3B in this environment nearly doubles held-out accuracy (9.0% to 16.7%).

arXiv Computational LinguisticsModels / AgentsIn-site articleSupersede: Diagnosing and Training the Memory-Update Gap in LLM Agents
Developmental approach reveals the statistical learning of Neural Language Models: Transformers generalize from the most abstract statistical patterns

This study uses a developmental approach to investigate the statistical learning and mental representation of neural language models (NLM). A series of Generative Transformer models are trained on a synthetic grammar, and model states are saved at multiple stages. By analyzing changes in internal representations, the authors find that NLMs acquire the most abstract global statistical knowledge at the beginning of learning, and later acquire local statistical dependencies. This learning path contains many over-generalizations from the start, which are gradually constrained later. Based on this observation, a new framework is proposed to explain the statistical learning and language cognition of NLMs.

arXiv Computational LinguisticsModels / Research / StartupsIn-site articleDevelopmental approach reveals the statistical learning of Neural Language Models: Transformers generalize from the most abstract statistical patterns
Causal Connections: Leveraging Multilingual Fine-Tuning for Financial QA@FinCausal 2026

Team HSA_CORAL presents their submission to the FinCausal 2026 shared task, comparing three model families for cause-effect extraction from financial narratives via QA in English and Spanish. Supervised fine-tuning yielded the best results, with GPT-4.1 Mini achieving top scores on the English subtask and third on Spanish, highlighting the value of multilingual fine-tuning.

arXiv Computational LinguisticsModels / ResearchIn-site articleCausal Connections: Leveraging Multilingual Fine-Tuning for Financial QA@FinCausal 2026
A Survey of Automated Presentation Coaching: Systems, Methods, and Open Challenges

This survey systematically reviews automated presentation coaching systems covering pronunciation, fluency, prosody, multimodal, and Q&A tools. It introduces a five-dimensional task taxonomy (segmental pronunciation, lexical stress, suprasegmental prosody, pacing, content faithfulness) and maps surveyed systems to reveal coverage gaps. Core methods include TTS-based exemplar generation and diagnostic assessment. Open challenges include scarcity of annotated corpora, accent-fair feedback, and low-latency real-time diagnostics.

arXiv Computational LinguisticsModels / ResearchIn-site articleA Survey of Automated Presentation Coaching: Systems, Methods, and Open Challenges
Position: The Term "Machine Unlearning" Is Overused in LLMs

This position paper argues that the term "machine unlearning" is overused in LLM research and should be reserved for dataset-defined deletion. Many tasks currently labeled as unlearning pursue different objectives and require separate terminology and evaluation methods. The authors call for stricter terminology aligned with explicit guarantees and reference models.

arXiv Computational LinguisticsModels / Research / PolicyIn-site articlePosition: The Term "Machine Unlearning" Is Overused in LLMs
Formalizing Latent Thoughts: Four Axioms of Thought Representation in LLMs

Researchers introduce an axiomatic evaluation framework for latent thought representations in LLMs, defining four axioms (Causality, Minimality, Separability, Stability) with quantitative metrics independent of downstream accuracy. Auditing 23 reasoning tasks, they find no candidate satisfies all axioms, representations cannot distinguish questions within the same task, and encode little beyond input embeddings. The failure persists across model families, indicating a structural gap.

arXiv Computational LinguisticsModels / Research / StartupsIn-site articleFormalizing Latent Thoughts: Four Axioms of Thought Representation in LLMs
Productionized Fairness Measurement Under Privacy Constraints

This paper presents Privacy-Preserving Probabilistic Race/Ethnicity Estimation (PPRE) to enable fairness measurements with respect to race/ethnicity for U.S. LinkedIn members while preserving privacy. It combines the Bayesian Improved Surname Geocoding estimator with a sparse golden survey set of self-reported demographics, and applies secure two-party computation, differential privacy, and additive homomorphic encryption.

arXiv Machine LearningResearch / StartupsIn-site articleProductionized Fairness Measurement Under Privacy Constraints
Boundary condition fidelity for bottom-hole pressure and CO2 plume prediction in geological carbon storage

This study evaluates ten reduced-domain boundary treatments for predicting bottom-hole pressure (BHP) and CO2 plume migration in geological carbon storage. Conserving corner pore volume is critical; uniform treatments cause large errors, while corner corrections significantly improve accuracy. The gradual modifier with transmissibility correction performs best, achieving BHP NRMSE below 3.7% and plume IoU above 0.97 in both homogeneous and heterogeneous reservoirs.

arXiv Machine LearningResearchIn-site articleBoundary condition fidelity for bottom-hole pressure and CO2 plume prediction in geological carbon storage
The Curse of Multiple Mediators: Hidden Interaction Effects in Activation Patching

A new study shows that activation patching, a key tool in mechanistic interpretability, conflates the natural indirect effect (NIE) with interaction effects (INT), which measure how a component's causal influence depends on other components. This can lead to misattribution of importance and instability in faithfulness scores. The authors demonstrate failures in GPT-2's IOI circuit, prove INT is inevitable but useful as a diagnostic, and show it scales with activation distance and decomposes into pairwise and higher-order interactions.

arXiv Machine LearningModels / ResearchIn-site articleThe Curse of Multiple Mediators: Hidden Interaction Effects in Activation Patching
Operator Learning for Cubic Nonlinear Schrödinger Equation on Periodic Domains

Researchers propose a geometry-conditioned Fourier neural operator (FNO) for the cubic nonlinear Schrödinger equation on two-dimensional flat tori with varying aspect ratios. The operator takes the real and imaginary parts of the solution along with the aspect ratio parameter ω² as input and learns the one-step solution operator. Experiments show it captures distinct dynamics on rational and irrational tori and reproduces Sobolev norm behavior. Ablation studies indicate that including ω² improves long-term predictive accuracy.

arXiv Machine LearningResearchIn-site articleOperator Learning for Cubic Nonlinear Schrödinger Equation on Periodic Domains
Prism Transformer: Progressive Head Schedules for Hierarchical Attention Processing

A new Transformer architecture called Prism Transformer replaces uniform head allocation with a progressive head schedule, increasing head count per layer to create a local-to-global representational hierarchy. It achieves consistent improvements on multiple zero-shot benchmarks without extra parameters or compute.

arXiv Machine LearningModels / ResearchIn-site articlePrism Transformer: Progressive Head Schedules for Hierarchical Attention Processing
Learning in Markovian bandits with non-observable states and constrained decision epochs

This paper studies regret minimization in Markovian bandits with non-observable states and constrained decision epochs. It introduces self-degrading Markovian bandits, proves that without prior knowledge, algorithms that switch arms rarely suffer super-logarithmic regret, and designs UCB-NOM which achieves nearly logarithmic regret, or O(log T) with prior knowledge.

arXiv Machine LearningResearchIn-site articleLearning in Markovian bandits with non-observable states and constrained decision epochs
PairSAE: Mechanistic Interpretability from Pair Representations in Protein Co-Folding

PairSAE summarizes pairwise tensors via N-mode SVD into token-wise interaction roles, then uses a sparse autoencoder to learn shared token-level features that decode into both sequence and pair representations, enabling interpretability of protein co-folding models. Evaluated on Boltz-2 activations, features align with UniProt annotations and predict affinity.

arXiv Machine LearningResearchIn-site articlePairSAE: Mechanistic Interpretability from Pair Representations in Protein Co-Folding
Unified Zero-Shot Time Series Forecasting: A Darts Foundation

Darts, a popular open-source time series library, introduces a unified interface for foundation models, enabling zero-shot forecasting, fine-tuning, and backtesting with minimal code changes.

arXiv Machine LearningModels / Research / StartupsIn-site articleUnified Zero-Shot Time Series Forecasting: A Darts Foundation
RANSAC Scoring Done Right

This paper presents a new RANSAC scoring method that analytically marginalizes the inlier scale, eliminating the need for a user-supplied scale parameter. The method outperforms state-of-the-art on a benchmark of nearly 70,000 image pairs, staying robust under threshold miscalibration and achieving near-optimal accuracy with as few as two validation pairs.

arXiv Machine LearningResearchIn-site articleRANSAC Scoring Done Right
OverFlowLight: Real-Time Gridlock Prevention and Traffic Signal Optimization for Urban Intersections

OverFlowLight is a real-time framework that detects and prevents vehicle queue overflow at intersections using multi-modal sensing, and employs a hybrid control (rule-based + reinforcement learning) to dynamically generate clearing phases. Deployed at 43 intersections in three cities, it reduces overflow incidents by 60.4% and increases network throughput by 18.2%.

arXiv Machine LearningAgents / PolicyIn-site articleOverFlowLight: Real-Time Gridlock Prevention and Traffic Signal Optimization for Urban Intersections
Grounded Iterative Language Planning: How Parameterized World Models Reduce Hallucination Propagation in LLM Agents

This paper compares agent-based and parameterized world models for LLM agents, proposing GILP, which combines a small parameterized backbone with LLM reasoning to reduce hallucinated state rates from 0.176 to 0.035 and increase success rates from 0.668 to 0.838 with only ~22% extra LLM calls.

arXiv AIModels / Agents / ResearchIn-site articleGrounded Iterative Language Planning: How Parameterized World Models Reduce Hallucination Propagation in LLM Agents
Understanding Rollout Error in Graph World Models

This paper studies long-horizon rollout error in Graph World Models (GWMs). The authors formulate a unified fixed-edge and dynamic-edge GWM framework and develop graph-valued rollout bounds to separate topology-induced from model-induced amplification. They propose Error-Aware GWM combining spectral regularization, rollout consistency, and critical-node weighting. Experiments show rollout error and planning regret grow with horizon, dynamic-edge training is needed when structure evolves, and Error-Aware GWM prevents long-horizon divergence while preserving prediction accuracy.

arXiv AIResearch / AgentsIn-site articleUnderstanding Rollout Error in Graph World Models