AI Intelligence · Research

AI Research Radar

Curated research papers from top AI labs and conferences with accessible summaries.

12
Papers Tracked
0
Total Citations
12
New This Week
ResearcharXivNEW

MemoryWAM: Efficient World Action Modeling with Persistent Memory

Robust robotic manipulation in the real world requires not only an understanding of the current observation, but also memory and dynamics modeling. World action models (WAMs) possess these capabilities by jointly modeling visual foresight and actions conditioned on both current and historical observations, making them a promising paradigm for robotic manipulation. However, existing WAMs face a fun

AIResearch
Sizhe Yang, Juncheng Mu et al.
Yang
Jun 18, 2026
arXiv:2606.20562v1
ResearcharXivNEW

TimeProVe: Propose, then Verify for Efficient Long Video Temporal Reasoning in Activities of Daily Living

Long Video Question Answering (LVQA) requires identifying sparse, query-relevant evidence within hours-long untrimmed videos. Existing approaches either process videos densely with large vision-language models (VLMs), incurring prohibitive computational cost, or rely on sparse caption-based reasoning, which often misses temporally localized and motion-centric evidence. We introduce TimeProVe, a co

AIResearch
Arkaprava Sinha, Dominick Reilly et al.
Sinha
Jun 18, 2026
arXiv:2606.20561v1
ResearcharXivNEW

From Efficiency to Leakage -- Privacy Backdoor in Federated Language Model Fine-Tuning

Federated learning (FL) enables multiple parties to collaboratively fine-tune language models for domain-specific tasks without sharing raw data. Since full model fine-tuning is often prohibitively expensive for FL clients, parameter-efficient fine-tuning (PEFT) has become the de facto approach in practice, freezing the base model and training only a small set of adapters. In this paper, we show t

AIResearch
Shanghao Shi, Chaoyu Zhang et al.
Shi
Jun 18, 2026
arXiv:2606.20553v1
ResearcharXivNEW

Predictability as a Fine-Grained Measure for Privacy

Differential privacy (DP) ensures rigorous individual-level privacy guarantees against even the most knowledgeable attackers, but its worst-case nature can impose a costly privacy-accuracy tradeoff. We introduce privacy via predictability, a fine-grained framework that explicitly incorporates the attacker's core knowledge, a compromised portion of the dataset generated by a stochastic process, and

AIResearch
Linda Lu, Karthik Sridharan
Lu
Jun 18, 2026
arXiv:2606.20546v1
ResearcharXivNEW

SSD: Spatially Speculative Decoding Accelerates Autoregressive Image Generation

Autoregressive models excel in visual generation by treating images as 1D sequences of discrete tokens, mirroring language modeling. However, this flattening discards the intrinsic 2D spatial locality of visual signals, creating severe computational bottlenecks during inference. We introduce Spatially Speculative Decoding (SSD), a framework that aligns the predictive objective with the natural geo

AIResearch
Shilong Xiang, Zirui Zhang et al.
Xiang
Jun 18, 2026
arXiv:2606.20543v1
ResearcharXivNEW

Multi-Task Bayesian In-Context Learning

Bayesian predictive inference provides a principled framework for uncertainty quantification, data efficiency, and robust generalization. However, exact inference is often intractable, and scalable approximations may remain computationally expensive or require restrictive modeling assumptions that degrade predictive performance. Prior-Data Fitted and in-context models have recently emerged as an a

AIResearch
Qingyang Zhu, Eric Karl Oermann et al.
Zhu
Jun 18, 2026
arXiv:2606.20538v1
ResearcharXivNEW

LedgerAgent: Structured State for Policy-Adherent Tool-Calling Agents

Policy-adherent tool-calling agents in customer-service domains must maintain task states across turns while calling tools and obeying domain policies. Task states consist of relevant facts, identifiers, constraints, and conditions observed through user interaction and tool calls. In standard agents, task states are not represented separately. Observations, tool returns, and policy instructions ar

AIResearch
Md Nayem Uddin, Amir Saeidi et al.
Uddin
Jun 18, 2026
arXiv:2606.20529v1
ResearcharXivNEW

DeepSWIP: Quotient-WMC Counterfactuals for Neural Probabilistic Logic Programs

Neurosymbolic systems such as DeepProbLog combine neural perception with probabilistic logic, but standard inference is associational. Counterfactual reasoning additionally requires a causal semantics for interventions and evidence. We introduce DeepSWIP, a single-world counterfactual semantics for DeepProbLog programs. Using neural materialization, we reduce fixed-context neural predicates to ord

AIResearch
Saimun Habib, Vaishak Belle et al.
Habib
Jun 18, 2026
arXiv:2606.20526v1
ResearcharXivNEW

FlowEdit: Associative Memory for Lifelong Pronunciation Adaptation in Flow-Matching TTS

Flow-matching text-to-speech systems achieve remarkable zero-shot quality but remain static after deployment: pronunciation errors on out-of-vocabulary proper nouns persist unless the model is retrained. We introduce FlowEdit, a life-long adaptation framework for frozen flow-matching TTS that learns pronunciation corrections as latent conditioning edits rather than weight updates. When corrective

AIResearch
Harshit Singh, Ayush Pratap Singh et al.
Singh
Jun 18, 2026
arXiv:2606.20518v1
ResearcharXivNEW

S-Agent: Spatial Tool-Use Elicits Reasoning for Spatial Intelligence

Real-world spatial intelligence requires reasoning over a continuous and evolving 3D world, yet existing VLMs and tool-augmented agents largely remain tied to static, stateless inference from isolated visual observations. We introduce \textbf{\textsc{S-Agent}}, a spatial tool-use agentic paradigm for understanding and reasoning over continuous multi-view images and videos. By formulating spatial r

AIResearch
Yalun Dai, Hao Li et al.
Dai
Jun 18, 2026
arXiv:2606.20515v1
ResearcharXivNEW

Approximating optimal decoding of quantum LDPC codes with narrow frontiers

We introduce the Frontier decoder, a pruned dynamic-programming decoder for sparse quantum decoding problems. Frontier processes error variables in a chosen order, merges prefixes with the same residual syndrome and logical label, and approximates logical-coset posterior masses by retaining only a narrow scored frontier. Without pruning, the recursion is exact ordered inference with exponential co

AIResearch
Anthony Leverrier, Rüdiger Urbanke
Leverrier
Jun 18, 2026
arXiv:2606.20513v1
ResearcharXivNEW

Efficient and Sound Probabilistic Verification for AI Agents

Securing AI agents that operate in complex digital environments has become a critical need, and runtime monitoring approaches that formulate and enforce policies expressed in a formal language like Datalog offer a promising solution. However, existing approaches are restricted to deterministic policies. In many practical applications of AI agents, there is a need to enforce security policies in th

AIResearch
Alaia Solko-Breslin, Pramod Kaushik Mudrakarta et al.
Solko-Breslin
Jun 18, 2026
arXiv:2606.20510v1