Archives AI News

Spectral Guidance for Flexible and Efficient Control of Diffusion Models

arXiv:2605.28900v1 Announce Type: new Abstract: We introduce Spectral Guidance, a framework for controlling diffusion models by leveraging the intrinsic geometry of the generative process. As data is progressively corrupted by noise, only a small number of features remain informative for…

Envy-Free Allocation of Indivisible Goods via Noisy Queries

arXiv:2602.06361v2 Announce Type: replace-cross Abstract: We introduce a problem of fairly allocating indivisible goods (items) in which the agents’ valuations cannot be observed directly, but instead can only be accessed via noisy queries. In the two-agent setting with Gaussian noise…

Online Learning-to-Defer with Varying Experts

arXiv:2605.12340v3 Announce Type: replace-cross Abstract: Learning-to-Defer (L2D) methods route each query either to a predictive model or to external experts. While existing work studies this problem in batch settings, real-world deployments require handling streaming data, changing expert availability, and shifting…

Sample-Efficient Diffusion-based Reinforcement Learning with Critic Guidance

arXiv:2605.30056v1 Announce Type: cross Abstract: Recent advances in reinforcement learning (RL) have achieved great successes by leveraging the multimodality and exploration capability of diffusion policies. Among these approaches, one representative branch focuses on the sampling-based policy optimization. This design enables…

When LLM Reward Design Fails: Diagnostic-Driven Refinement for Sparse Structured RL

arXiv:2605.28918v1 Announce Type: new Abstract: For sparse, structured reinforcement-learning tasks with semantic reward-function interfaces, LLM-generated reward shaping is better framed as debugging than one-shot generation. We study PPO-trained agents using MiniGrid as core evaluation and MuJoCo as boundary stress test.…

Wasserstein Contraction of Coordinate Ascent Variational Inference

arXiv:2605.30253v1 Announce Type: cross Abstract: We study the contraction in Wasserstein distance of the coordinate ascent variational inference algorithm. This is shown to hold under a transport-information inequality at the fixed points and a functional smoothness condition. The results are…