Reinforcement Learning with Verifiable Rewards (RLVR) derives its learning signal from binary rewards via on-policy exploration and becomes a powerful paradigm for improving the reasoning of large language models. Yet it faces a learning cliff on problems beyond model's current ability: when every rollout fails, the sa...
Ze-Hao Wang, Han-Zhu Chen, Run-Quan Gui et al.· 1 citation
Pretrained video generation models encode rich priors about physical interactions, but leveraging them for robot control typically requires either resource-intensive video generation at test time or action heads trained from scratch that do not fully utilize the pretrained backbone. We introduce Tokenizing Actions as V...
Jeremy A. Collins, Seungjae Lee, Rachanon Wachakorn et al.· 0 citations
Rubric-based reinforcement learning uses fine-grained grader feedback to train large language models on open-ended tasks, but grader randomness can alter GRPO updates in ways that score discrepancies alone cannot characterize. Because GRPO jointly normalizes rewards within each response group and combines the resulting...
Jia-Le Huang, Zi-Xu Li, Zhi-Wei Chen et al.· 0 citations
On the theoretic analyses on transforms, they mainly focus on the computability analysis, such the Turing-completeness of unbounded precision transformers, the advantage of parallelizability of unbounded precision transformers and the limitations of bounded precision transformers. This paper give transformers an algebr...
Yong Wang, Zhiyan Wang, Hexiao Kang· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Test-time training (TTT) enables a deployed language model to internalize incoming context on-the-fly into a small set of fast-weight parameters, rather than merely treating it as transient context for attention. In-Place TTT recently made this idea practical for large language models by repurposing the down-projection...
Yue Wu, Yang Zhang, Wei-Nan Gan et al.· 0 citations
Generative recommendation (GR) predicts the next item through its semantic ID (SID). Existing methods commonly fit SID vocabularies to pretrained language model (PLM) representations of item descriptions, incurring additional training costs and making vocabulary coverage dependent on the fitting domains. We observe tha...
Ziluowen Luo, Ruochen Liu, Jun Yin et al.· 0 citations
Gradient-based data attribution has become an important tool for high-quality data selection in the instruction fine-tuning of large language models (LLMs), as it estimates the contribution of training examples through their influence on model optimization. However, we find that existing global gradient attribution met...
Computationally expensive simulations and real-world observations often provide data at a lower temporal resolution than downstream tasks require. Averaging observations at fixed grid points can introduce errors, and motion estimates alone do not determine how the physical field values change. In this work, we study wh...
Pu Ren, Michael W. Mahoney, N. Benjamin Erichson· 0 citations
Personalized spoken agents must identify speakers before accessing user-specific memory, yet memory benchmarks typically assume correctly attributed histories. We argue that voiceprints are observations of identity, not identities themselves, and formulate online speaker-memory construction to maintain persistent user...
Yucong Zhang, Cancan Li, Bo Xiao et al.· 0 citations
Contextual dueling bandits learn from pairwise comparisons, the same feedback used to fine-tune language models from human preferences. Standard algorithms explore aggressively and can show users two poor options. We study conservative contextual dueling bandits, which require that, at every round, the cumulative score...
Rohan Deb, Mohammad Ghavamzadeh, Arindam Banerjee· 0 citations
HeteGCD is proposed, a new statistics-aware dual-prototype learning perspective for generalized category discovery on heterophilous graphs that combines feature-based similarity with distribution-based consistency to support category discovery.
Xuan-Zhi Xi, Tong-Ze Zhang, Zhi-Li Qin et al.· 0 citations
Flow-based policies for language-conditioned multi-task manipulation commonly share a single $\textit{Gaussian}$ source prior and a common linear transport path across tasks. However, reliably executing multiple tasks with distinct motion requirements remains challenging for a shared policy. We introduce $\textbf{TOPS}...
Tuo An, Chuhao Zhou, Jiahua Dong et al.· 0 citations