Modern transformers pair impressive capabilities with substantial memory and compute demands. Low-rank weight factorization reduces both while keeping the matrices dense, and thus efficient on standard hardware. Existing methods, however, choose the subspace to remove from each weight matrix with local closed-form crit...
Massimo Bini, Anders Christensen, S. Alaniz et al.· 0 citations
Recovering complete physical fields from sparse observations is challenging because the measurements may not uniquely determine the underlying state. Diffusion-based PDE solvers address this problem through iterative sampling whereas neural operators provide deterministic one-pass predictions. We propose SCOPE (Sparse-...
Rui-Chen Xu, Si-Yao Wang, Fang Wan et al.· 0 citations
The results show that group identity shapes how LLMs aggregate information across agents, independently of its correctness, and identify a manipulation surface for multi-agent AI systems.
Horsepower-JEPA organizes each graph into an ordered bank of coarse-to-fine partition resolutions and performs context-target latent prediction separately at each resolution using an online encoder, an exponential-moving-average target encoder, and a latent predictor.
Rui-Chen Xu, Jing-Xiang Qu, Wen-Han Gao et al.· 0 citations
This work introduces XTC (Exclude Top Choices), a lightweight head-aware decoding operator that targets this regime of open-ended generation in which several continuations are plausible but too much probability mass remains concentrated on the most generic choice.
Philippe Weidmann, Allen G. Roush, Judah Goldfeder et al.· 0 citations
Don't Repeat Yourself (DRY), a sampling-time logit adjustment that penalizes a candidate token only when generating it would extend the current suffix into an exact continuation of a span seen earlier in the context, is proposed.
Philippe Weidmann, Allen G. Roush, Judah Goldfeder et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.