Archives AI News

Strategic Candidacy in Generative AI Arenas

arXiv:2603.26891v1 Announce Type: new Abstract: AI arenas, which rank generative models from pairwise preferences of users, are a popular method for measuring the relative performance of models in the course of their organic use. Because rankings are computed from noisy…

Scaling Attention via Feature Sparsity

arXiv:2603.22300v2 Announce Type: replace Abstract: Scaling Transformers to ultra-long contexts is bottlenecked by the $O(n^2 d)$ cost of self-attention. Existing methods reduce this cost along the sequence axis through local windows, kernel approximations, or token-level sparsity, but these approaches consistently…

Tunable Domain Adaptation Using Unfolding

arXiv:2603.26931v1 Announce Type: new Abstract: Machine learning models often struggle to generalize across domains with varying data distributions, such as differing noise levels, leading to degraded performance. Traditional strategies like personalized training, which trains separate models per domain, and joint…

High dimensional theory of two-phase optimizers

arXiv:2603.26954v1 Announce Type: new Abstract: The trend towards larger training setups has brought a renewed interest in partially asynchronous two-phase optimizers which optimize locally and then synchronize across workers. Additionally, recent work suggests that the one-worker version of one of…

Denoising the Future: Top-p Distributions for Moving Through Time

arXiv:2506.07578v4 Announce Type: replace-cross Abstract: Inference in dynamic probabilistic models is a complex task involving expensive operations. In particular, for Hidden Markov Models, the whole state space has to be enumerated for advancing in time. Even states with negligible probabilities…

AI and Consciousness

arXiv:2510.09858v4 Announce Type: replace Abstract: This is a skeptical overview of the literature on AI consciousness. We will soon create AI systems that are conscious according to some influential, mainstream theories of consciousness but are not conscious according to other…

Empirical Likelihood for Nonsmooth Functionals

arXiv:2603.27743v1 Announce Type: cross Abstract: Empirical likelihood is an attractive inferential framework that respects natural parameter boundaries, but existing approaches typically require smoothness of the functional and miscalibrate substantially when these assumptions are violated. For the optimal-value functional central to…

On the Hardness of Reinforcement Learning with Transition Look-Ahead

arXiv:2510.19372v2 Announce Type: replace-cross Abstract: We study reinforcement learning (RL) with transition look-ahead, where the agent may observe which states would be visited upon playing any sequence of $ell$ actions before deciding its course of action. While such predictive information…