We study online sparse linear regression (OSLR) where any algorithm is restricted to accessing only $b$ out of $d$ attributes per instance for prediction and $b_0\geq 0$ additional attributes after prediction, which was proved to be NP-hard. Previous work focused on designing computationally efficient algorithms under...
Xiao-Feng Cao, Jun-Fan Li, Lang-Zhang Liang et al.· 0 citations
Results show that LLM-agent organization can emerge and adapt through repeated execution of a learned local law, and Swarm-Consistent Distillation (SCD), combining anonymous-orbit consistency with rollout-grounded prediction of the next local coordination field, with no added inference-time components.
Ming-Xi Zou, Wei-Jie Zhu, Zhuo Wang et al.· 0 citations
MemHarm is introduced, which predeclares a finite class of sparse, grounded semantic edits, evaluates candidates through the normal agent memory interface using offline paired-loss feedback, and certifies resolved selections within that class of sparse, grounded semantic edits.
Ming-Xi Zou, Lang-Zhang Liang, Zhuo Wang et al.· arXiv.org· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.