Archives AI News

Reinforcement Learning with Function Approximation for Non-Markov Processes

arXiv:2601.00151v1 Announce Type: new Abstract: We study reinforcement learning methods with linear function approximation under non-Markov state and cost processes. We first consider the policy evaluation method and show that the algorithm converges under suitable ergodicity conditions on the underlying…

Information-Theoretic Quality Metric of Low-Dimensional Embeddings

arXiv:2512.23981v2 Announce Type: replace Abstract: In this work we study the quality of low-dimensional embeddings from an explicitly information-theoretic perspective. We begin by noting that classical evaluation metrics such as stress, rank-based neighborhood criteria, or Local Procrustes quantify distortions in…

Exploration in the Limit

arXiv:2601.00084v1 Announce Type: new Abstract: In fixed-confidence best arm identification (BAI), the objective is to quickly identify the optimal option while controlling the probability of error below a desired threshold. Despite the plethora of BAI algorithms, existing methods typically fall…

The Trojan in the Vocabulary: Stealthy Sabotage of LLM Composition

arXiv:2601.00065v1 Announce Type: new Abstract: The open-weight LLM ecosystem is increasingly defined by model composition techniques (such as weight merging, speculative decoding, and vocabulary expansion) that remix capabilities from diverse sources. A critical prerequisite for applying these methods across different…

The Curse of Depth in Large Language Models

arXiv:2502.05795v3 Announce Type: replace Abstract: In this paper, we introduce the Curse of Depth, a concept that highlights, explains, and addresses the recent observation in modern Large Language Models (LLMs) where nearly half of the layers are less effective than…