Search AI news

Finite-Time Convergence and Regret Guarantees for Neural Reinforcement Learning in POMDPs

arXiv:2611.07069v1 Announce Type: new Abstract: Reinforcement learning (RL) in Partially Observable Markov Decision Processes (POMDPs) is computationally challenging due to the curse of long-range dependence on history. Fortunately, recent studies have shown that a range of POMDPs that satisfy the filter stability assumption can be well approximated by a superstate Markov Decision Process (MDP) based on a truncated history in a finite-memory window, with a value gap that decays with the window length. However, existing finite-time convergence analyses on such superstate MDP surrogates are either limited to over-simplified linear function approximation or rely on an i.i.d. sampling oracle that is violated by POMDP trajectories, both of which severely limit the applicability of these theoretical results in practice. This motivates us to bridge the gap by investigating RL in POMDPs with nonlinear neural value function approximation. Our main contributions are threefold: i) We first establish a new finite-state MDP point-wise approximation error bound, which lays the foundation for our RL algorithm design and analysis in POMDPs; ii) By applying Temporal-Difference (TD) learning to POMDP-generated superstate transitions and targeting the Bellman fixed point of the superstate MDP, we prove a finite-time critic error bound with nonlinear neural value function approximation; and iii) By combining the neural critic function approximation error bound with the policy mirror descent framework, we obtain a finite-time sublinear regret against the optimal POMDP value. To the best of our knowledge, such a finite-time sublinear regret based on neural function approximation is the first in the literature for finite-memory POMDPs. Our numerical experiments also verify our theoretical results.

Intuition with Evidence: Adaptive Dual Memory for Multimodal Agents

arXiv:2610.33019v1 Announce Type: new Abstract: As multimodal agents engage in sustained interactions, long-term memory serves two distinct but complementary functions: fine-grained evidence recall and internalized interpretation for global understanding. Although episodic and latent memory address these demands through explicit historical records and internalized experience, neither paradigm alone can accommodate the diverse memory affinities across tasks, owing to limitations in episodic evidence coverage and integration, and in latent factual grounding. To bridge this divide, we propose a dual-memory framework, unifying a model-native latent memory as an intuitive prior with a multi-indexed episodic memory for exact evidence reconstruction via retrieval-conditioned joint alignment. At i

Import AI 478: Math for alignment; ProgramBench; and Mirendil shows what RSI means

What is “night” to a machine?

The study proposes Delta N-grams: a forward-only, continuous-writing method for native N-gram tables in language models.

On October 24, 2026, arXiv published the paper arXiv:2610.31125v1, introducing Delta N-grams—a novel mechanism that does not modify the pre-trained N-gram table T⁰, but instead writes sparse incremental patches Δ via forward propagation, enabling efficient and reversible continual memory updates.

Why it matters：This work addresses the issue of large perturbations to a model’s base parameters in continual learning by proposing a memory-enhanced pathway that is lightweight in structure (4.1M parameters), computationally efficient (purely forward pass), and fully invertible (resetting Δ restores the original model). Its superior document-specificity and robustness against interference have been validated on models such as Qwen3.8-Flash-Next, making it a cutting-edge contribution to trustworthy AI systems research.

The study proposes a new evaluation method and model to address annotation disagreements in identifying unstated arguments (enthymemes) within politically contentious discourse.

This paper, based on tweet data related to vaccination and immigration—each tweet independently annotated by five raters—finds that existing fine-tuned models consistently achieve an F1 score of around 0.67 on the enthymeme detection task. To address this, the authors propose abandoning the single-label evaluation paradigm in favor of a new metric that captures the distribution of annotators’ opinions, and they design a model capable of directly predicting this distribution, thereby better capturing human judgmental divergence without compromising the F1 score.

Why it matters：The paper squarely confronts the long-neglected reality in NLP that “annotator disagreement is an essential characteristic”—particularly in politically sensitive contexts, where identifying enthymemes relies heavily on subjective reasoning. Its methodological shift—from point prediction to distributional prediction—and its empirical demonstration of the limitations of discourse‑structural analysis carry clear implications for the design of content‑moderation systems: models trained on majority‑vote criteria may systematically overlook implicit arguments that require deep contextual inference.

How Fyxer built an AI executive assistant people trust

Fyxer uses OpenAI models, fine-tuning, memory, and real user feedback to organize inboxes and draft emails in each user’s voice.

Qwen1.5-32B: Fitting the Capstone of the Qwen1.5 Language Model Series

GITHUB HUGGING FACE MODELSCOPE DEMO DISCORD Introduction The open-source community has long sought a model that strikes an ideal balance between performance, efficiency, and memory footprint. Despite the emergence of cutting-edge models like Qwen1.5-72B and DBRX, the models have faced persistent challenges such as large memory consumption, slow inference speed, and substantial finetuning costs. A growing consensus within the field now points to a model with approximately 30 billion parameters as the optimal “sweet spot” for achieving both strong performance and manageable resource requirements.