arXiv AI

Support sufficiency as action-sufficient compression: a single-cycle rate-regret formulation

arXiv:2606. 09858v1 Announce Type: cross Abstract: Robust decision-making requires compression.

arXiv Machine Learning
Aug 14

Decentralized Multi-Player Q-Learning in Episodic Markov Decision Processes with Information Asymmetry

arXiv:2608. 12753v1 Announce Type: new Abstract: We study decentralized multi-player reinforcement learning in episodic tabular Markov decision processes (MDPs) under three forms of information asymmetry: (A) unobserved actions with common rewards, (B) observed actions with independent rewards, and (C) unobserved actions with independent rewards.

By Larissa Xu, King Bi, William Chang
arXiv Machine Learning
4d ago

SCAMP: Sparse-anchor Control is One Small Projection

SCAMP introduces a training‑free, damped Gauss‑Newton method that adjusts only the sparse anchor points in a frozen differentiable decoder, keeping the rest of the state unchanged. By operating solely in the space of the anchors’ Jacobian rows, it solves a system whose size matches the number of anchor constraints rather than the full state, enabling efficient control across diverse text‑to‑motion generators. Applied to seven existing generators, SCAMP achieves anchor errors that match or surpass all released control methods and can close anchors on hosts that originally lacked them.

By Pengcheng Fang, Tengjiao Sun, Xiaoyu Zhan, Yanwen Guo, Hansung Kim, Xiaohao Cai, Dongjie Fu
arXiv AI
Jun 16

Direction-Conditioned Policies via Compositional Subgoal Scoring for Online Goal-Conditioned Reinforcement Learning

arXiv:2606. 16515v1 Announce Type: cross Abstract: Hamilton-Jacobi-Bellman theory implies that the optimal goal-conditioned action depends on the goal only through the gradient of the goal-reaching distance at the current state, yet standard online GCRL still conditions the actor on the raw goal -- a signal that is geometrically uninformative when the goal is far from the data distribution.

By Swaminathan S K, Damiya Gondha, Theyanesh Eswaramoorthy Rajahkrishnan, Aritra Hazra
arXiv Machine Learning
Aug 17

Consistent Model Chasing Is Minimax Optimal: The Exact Value of Scalar Adversarial Adaptive Control under Large Parametric Uncertainty

arXiv:2608. 13651v1 Announce Type: cross Abstract: We solve exactly a fundamental problem of adaptive control against adversarial disturbances: regulate the scalar system $x_{t+1} = ax_t + u_t + w_t$, $x_0=0$, $\|w\|_\infty \le 1$, where the constant pole $a \in [-\Delta, \Delta]$ is unknown in sign and magnitude and $\Delta$ is arbitrarily large.

By Dimitar Ho