What changed in AI — Page 55

ResearchOfficialarXiv Computer Vision

MoD-VLLM: Modularized Dynamic-Granularity Video LLM for Multi-Event Long Video Understanding

A new framework called MoD-VLLM is proposed for multi-event long video understanding. The approach iteratively localizes question-relevant video segments using a grounding module and a reflection module with dynamic granularity encoding. It employs a reinforcement learning strategy to jointly optimize grounding policies and visual representations. MoD-VLLM demonstrates significant improvements over state-of-the-art baselines on several benchmarks, including the newly introduced MEventBench.

Why it matters: This work introduces a modular and self-reflective approach that addresses the challenge of understanding multiple events in long videos, a key limitation of current Video LLMs.

ResearchOfficialarXiv Computer Vision

Dataset-Origin Signatures and Shortcut Learning in Screening Mammography AI: A Cross-Dataset Case Study

A new study demonstrates that adding biopsy-confirmed, abnormal-enriched cases from external datasets to screening mammography AI training can significantly reduce model performance, with AUC-ROC dropping from 0.737 to as low as 0.620. The performance decline is linked to persistent dataset-specific characteristics that dominate learned representations, even after consistent preprocessing. The research underscores that naive pooling of heterogeneous mammography datasets introduces domain shifts that can outweigh the benefits of increased positive cases.

Why it matters: This work highlights that hidden dataset biases can undermine AI reliability in medical imaging, emphasizing the need for domain-aware strategies when combining data from different sources.

Policy & SafetyOfficialarXiv Computers and Society

LLM Fact-Checkers Influence Trust in Political News Across Ideological Lines

A preprint study with 705 participants found that large language model (LLM) fact-checkers can significantly shift user trust in both true and false political headlines, even when the chatbot's perceived political leaning differs from the user's. Political congruency between user and chatbot only affected trust for true headlines that were politically distant, while it did not impact the reduction of trust in false headlines. The study also found that LLM fact-checkers can alter trust in news when they are incorrect or inconclusive.

Why it matters: This research highlights both the promise and risks of deploying LLM-based fact-checkers at scale, as they can correct misinformation but may also inadvertently undermine trust in accurate information.

ResearchOfficialarXiv Computers and Society

EduGuard: A Safe RAG-Based LLM Tutor for Programming Education

EduGuard is a retrieval-augmented generation (RAG) tutoring framework designed for introductory programming education, integrating query understanding, instructor-approved retrieval, pedagogical strategy selection, rubric-aware generation, claim-level verification, and overreliance control. On the BILearn-CS benchmark, EduGuard achieved 90.1% correctness, 89.4% grounding, and 90.8% rubric alignment, with low rates of hallucination (4.9%) and direct-answer leakage (9.8%). In a small pilot study, it improved post-test accuracy from 68.4% to 81.2% and reduced overreliance compared to a GPT-4o-mini Tutor baseline. These results were obtained using a combination of Meta-Llama-3.1-8B-Instruct and DeBERTa-v3-large-MNLI models.

Why it matters: EduGuard demonstrates that safe and effective GenAI tutoring in programming requires explicit pedagogical controls, evidence verification, and deployment safeguards beyond standard retrieval or prompting methods.

ResearchOfficialarXiv Computer Vision

Training-Free Frame Selection for Long Videos Using Attention-Based MLLM Selectors

Researchers introduce DAFS, a training-free method for selecting frames in long videos by leveraging cross-modal attention from multimodal large language models (MLLMs). DAFS identifies query-relevant frames without requiring autoregressive generation or additional training, and formulates frame selection as a discrete optimization problem. The approach improves performance over uniform sampling by up to 6.4 points on Video-MME under a 32-frame budget and generalizes across different model backbones and tasks.

Why it matters: This work offers a practical advance for efficient, query-aware frame selection in long-video understanding, potentially broadening the applicability of MLLMs to real-world video analysis tasks.

ResearchOfficialarXiv Computer Vision

DiTango: Cost-Effective Parallel Diffusion Generation with Selective Attention State Reuse

Researchers introduce DiTango, a parallel framework for Diffusion Transformers that selectively reuses attention states to reduce communication overhead in multi-node environments. DiTango achieves up to 1.9x end-to-end and 3.2x attention speedup, with near-linear scaling, while maintaining generation quality comparable to state-of-the-art methods. The framework uses an anchor-guided state selection planner and a runtime for efficient state-centric operations.

Why it matters: DiTango addresses a key scalability bottleneck in diffusion model inference, enabling faster and more cost-effective high-resolution content generation in distributed settings.

ResearchOfficialarXiv Computer Vision

SlotMem: Character-Addressable Internal Memory for Narrative Long Video Generation

Researchers introduce SlotMem, a character-addressable internal memory framework designed for multi-character narrative long video generation. SlotMem employs a Character-Semantic Probe and Memory Encoder to compress visual tokens into role-specific slot memories, enabling more precise tracking of character identities. Experimental results on multiple benchmarks demonstrate that SlotMem improves long-range character consistency compared to existing methods, while maintaining similar video quality.

Why it matters: Maintaining consistent character identities across scene transitions is a major challenge in narrative video generation, and SlotMem offers a novel solution that advances this capability.

ResearchOfficialarXiv Computation and Language

LLMs Encode Syntactic Structure Beyond Universal Dependencies, Consistent with Minimalist Phase Theory

A new preprint demonstrates that large language models (LLMs) encode syntactic distinctions not captured by Universal Dependencies (UD) tree distances. Using English wh-movement stimuli, researchers found that probe distances between embedded subjects and verbs reverse sign depending on clause finiteness—a pattern unexplained by UD but consistent with Minimalist phase theory. The findings were robust across 13 models from four families and were validated through causal interventions.

Why it matters: This suggests that LLMs internalize deeper grammatical structures than those represented by standard linguistic annotations, aligning with advanced theoretical linguistics.

ResearchOfficialarXiv Computation and Language

Robust Explanations for User Trust in Enterprise NLP Systems

A new preprint introduces a unified black-box robustness evaluation framework for token-level explanations in enterprise NLP systems. The study systematically compares encoder and decoder models, finding that decoder LLMs yield significantly more stable explanations (73% lower flip rates on average) and that explanation stability increases with model scale (44% improvement from 7B to 70B parameters). The work also presents a practical cost-robustness tradeoff curve to inform model selection before deployment in compliance-sensitive environments.

Why it matters: This framework addresses a key challenge in validating explanation robustness for black-box NLP systems, supporting user trust and regulatory compliance in enterprise applications.

ResearchOfficialarXiv Computation and Language

Frontier Language Models Struggle to Copy: 2D Text Representation Enables Dramatic Improvements

A new preprint demonstrates that even state-of-the-art large language models (LLMs) struggle to exactly copy input strings within their context windows, a task much simpler than many they routinely solve. The authors attribute this limitation to the inductive biases of standard positional encodings in Transformer architectures. They introduce 2D-RoPE, a method that organizes text into a 2D grid with separate row and column IDs, enabling shallow Transformers to achieve perfect copying at input lengths hundreds of times longer than those seen during training. Experiments, including pretraining models up to 1.4B parameters, confirm the advantage of this approach over standard methods.

Why it matters: This work reveals a fundamental limitation in current Transformer-based LLMs and proposes a simple architectural change that could improve their reliability on basic tasks like copying.

Policy & SafetyOfficialarXiv Computation and Language

Study Finds LLM Watermarks Fail Forensic Readiness for Court Evidence

A new preprint evaluates three leading LLM watermarking methods—KGW, Unigram, and SynthID-Text—against legal admissibility standards, including the Daubert criteria and NIST forensic guidelines. The study finds that meaning-preserving paraphrasing removes watermarks in 100% of KGW and Unigram cases and 98.3% of SynthID cases, with high false-negative rates even before attack. None of the methods tested meet the evidentiary standards required for court use, raising serious concerns about their reliability for legal or regulatory purposes.

Why it matters: The findings challenge the foundational assumption behind emerging regulations that AI-generated content can be reliably identified for legal evidence using current watermarking techniques.

Policy & SafetyOfficialarXiv Cryptography and Security

Jailbreak Foundry: Automated Translation of Jailbreak Papers into Runnable Attacks for Reproducible Benchmarking

Researchers have developed Jailbreak Foundry (JBF), a system that automates the translation of jailbreak research papers into executable attack modules for standardized evaluation. JBF uses a multi-agent workflow and shared infrastructure to reproduce 30 jailbreak attacks with high fidelity, achieving a mean attack success rate deviation of just +0.26 percentage points compared to original reports. The system also reduces attack-specific implementation code by more than half and enables consistent benchmarking across multiple language models using a unified evaluation protocol.

Why it matters: JBF provides a scalable and automated solution for reproducible and comparable benchmarking in LLM jailbreak research, addressing a key challenge in evaluating and tracking evolving security threats.

ResearchOfficialarXiv Computation and Language

Rate-Utility Frontiers for Language Encodings: Comparing Tokens, Bytes, and Pixels Under Controlled Linguistic Content

A new preprint systematically compares tokens, bytes, and pixels as language model encodings, controlling for both linguistic content and downstream model capacity. Using parallel sentences in 13 languages, the study traces rate-utility frontiers and finds that no single encoding is optimal across all tasks or capacity regimes. Pixels best preserve surface form, bytes excel at cross-lingual alignment, and tokens are most effective for topic prediction.

Why it matters: This work provides a principled framework for selecting language encodings based on specific tasks, language diversity, and computational constraints, challenging the default reliance on subword tokens.

Policy & SafetyOfficialarXiv Computation and Language

Hidden in Thought: Transferable Chain-of-Thought Artifacts Induce Harmful Behavior

Researchers show that harmful chain-of-thought (CoT) traces from compromised language models can transfer unsafe behavior to other models and be distilled into reusable jailbreak attacks. Transferred traces increase harmful-response rates above 80% on the most vulnerable open-source models, and distilled patterns outperform direct transplantation on strongly aligned models like GPT-4.1 by up to 10 times. Reasoning-enabled models are more than twice as vulnerable, and output safeguards often fail to detect harmful generations.

Why it matters: This work demonstrates that harmful reasoning can transfer between models at both the trace and pattern levels, highlighting the need for defenses that evaluate reasoning context as well as final outputs.

ResearchOfficialarXiv Cryptography and Security

Triple-Hoisted Baby-Step Giant-Step Linear Transformation over CKKS Homomorphic Encryption and Hardware Accelerator

Researchers have introduced a triple-hoisted baby-step giant-step algorithm that further decomposes the baby step to significantly reduce the number of ciphertext rotations required for linear transformations in CKKS homomorphic encryption. They also propose a memory-optimized data path and an FPGA-based hardware accelerator, which together reduce off-chip memory access by 2.9x and computational latency by 5.8x compared to previous designs.

Why it matters: This work represents a notable advance in making privacy-preserving neural network inference more efficient by addressing key computational and memory bottlenecks in homomorphic encryption.

ResearchOfficialarXiv Cryptography and Security

Poison to Detect: Early Client-Side Detection of Targeted Overfitting in Federated Learning

Researchers introduce three client-side detection techniques—label flipping, backdoor trigger injection, and model fingerprinting—to identify targeted overfitting attacks orchestrated by a dishonest aggregator in federated learning. Their methods can detect such attacks within 1-2 training rounds, achieving F1 scores up to 0.7, and allow clients to disengage early. Experiments indicate that detection effectiveness varies with cohort composition and method parameters.

Why it matters: This work offers practical early-warning tools for clients in federated learning, potentially improving the security and trustworthiness of these systems against orchestrator-driven attacks.

ResearchOfficialarXiv Computation and Language

Controlled Study Shows How Pretraining Influences RL Gains in LLM Reasoning Tasks

A new preprint uses chess as a controlled environment to systematically investigate how pretraining choices affect reinforcement learning (RL) outcomes for reasoning in large language models (LLMs). The study finds that post-RL performance is strongly predicted by pretraining loss, and that RL amplifies correct moves on easy puzzles while surfacing new correct moves on harder ones. These patterns also appear in math-domain text tasks, suggesting generalizable principles for the pretraining-to-RL pipeline.

Why it matters: This work offers a quantitative framework for understanding how pretraining impacts the effectiveness of RL in improving LLM reasoning, informing future model development strategies.

ResearchOfficialarXiv Cryptography and Security

VeriX-Anon: Multi-Layered Framework for Verifiable Outsourced Data Anonymization

VeriX-Anon is a multi-layered verification framework for outsourced target-driven k-anonymization, combining deterministic, probabilistic, and explainable AI-based mechanisms. In evaluations across seven datasets and four cloud profiles, it detected 25 to 27 out of 28 adversarial deviations with no false alarms, and client-side verification completed in under one second for datasets with one million rows. The framework addresses a gap in verifying that privacy-sensitive data transformations are faithfully executed by cloud providers.

Why it matters: VeriX-Anon offers a practical, mathematically grounded method for data owners to verify the integrity of outsourced privacy-preserving data transformations, addressing a key trust issue in cloud-based data processing.

ResearchOfficialarXiv Cryptography and Security

memorywire: A Vendor-Neutral Wire Format for Agent Memory Operations

Researchers introduce memorywire, a JSON-Schema 2020-12 wire format supporting five core memory operations (remember, recall, forget, merge, expire) across four memory types (semantic, episodic, procedural, emotional) for agent-memory frameworks. The open-source reference implementation includes five backend adapters and demonstrates strong performance on a microbenchmark, achieving recall@5=1.000 and low median latencies for ingest and recall. The protocol also features an optional human-in-the-loop governance channel and is designed for compatibility with the Model Context Protocol.

Why it matters: memorywire provides a standardized, vendor-neutral protocol for agent memory operations, facilitating interoperability, migration, and governance across diverse memory frameworks.

ResearchOfficialarXiv Cryptography and Security

ADS-C: Antidistillation Defense for Classifiers with Zero Utility Cost

A new preprint introduces ADS-C, an antidistillation defense for classification models that provably preserves top-1 accuracy while significantly degrading the performance of student models trained via knowledge distillation. ADS-C adapts gradient-directed perturbation techniques from large language models to classifiers, using a closed-form, per-input margin budget to ensure the teacher model's predictions remain unchanged. The method achieves up to 29.6 percentage point degradation in student accuracy on standard benchmarks, with no loss in teacher accuracy.

Why it matters: ADS-C provides a practical and provable defense against model stealing attacks via knowledge distillation, enabling secure deployment of classifiers without sacrificing their accuracy.