This work shows empirically that solver-integrated reasoning, exact combinatorial algorithm, and heuristic search exhibit complementary strengths across different problem structures and scales, and introduces Strategy-Diverse Reinforcement Learning (SDRL), which trains LLMs as adaptive optimization meta-solvers.
Shi-Hao Zhang, Wei-Ting Liu, Si-Yu Shao et al.· 0 citations
ForGE is proposed, a unified framework for adapting frozen models through per-query routing over a joint action space that spans both support form and thinking depth and improves accuracy at 42-45% lower token cost on both main hosts.
Xi Xiao, Yun-Bei Zhang, Chen Liu et al.· 0 citations
Pretrained autoregressive Transformers represent a large sunk investment in compute. Existing conversion methods reuse that investment by changing either the architecture (attention to recurrence) or the objective (next-token prediction to denoising), never both. We convert Qwen3 teachers at 1.7B and 8B into attention-...
Julian Boesch, Andrew Wee, Alexander Stranzl· 1 citation· ⚡1
Loop Dropout is introduced, which couples stochastic masking of adapter applications with inverse-survival rescaling to preserve expected update strength and promote effective adaptation across loops and outperforms existing LoRA variants and adapter regularizers.
Zi-Rui Zhu, Hai-Lun Xu, Xuan-Lei Zhao et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Mixture-of-Depths (MoD) enables conditional computation across Transformer depth by routing only a subset of tokens through selected layers, but its original one-sparse--one-dense alternation tightly couples total capacity to active capacity and limits sparse-depth scaling. We introduce X-MoD, a scalable sparse-depth a...
Bowen Dong, Yilong Fan, Tengyu Pan et al.· 0 citations
This monograph develops a unified account of training and inference in Power Law Decoder Representation language models (PLDR-LLMs) with exact identities, conditional dynamical claims, and finite empirical findings, with proofs, selected formal checks, and compact numerical evidence.
The results show that better local reconstruction need not translate into better final-model fidelity, and that the reversal is specific to approximate completion in these cases.
Yasuto Hoshi, Daisuke Miyashita, Jun Deguchi· 0 citations
Reasoning models often act as if they pursue goals, but their efforts are not always directed toward what users intend, sometimes leading them to pursue unintended outcomes. Previous work has examined how models may internally track their progress toward their goals through a"value axis."We study whether changing such...
A byte crossover is derived, the context length at which the two savings are equal, together with ideal speedup bounds for each branch and for their composition, from model dimensions and keep ratios alone and is derived at https://github.com/js-lee-AI/ByteCross.
Jungseob Lee, Seungyoon Lee, Seongtae Hong et al.· 1 citation
It is found and estimated that different words carry different amounts of information, and less-informative words tend to absorb more contextual information, and finer-grained selectivity enables more precise routing to promote information transmission between matched words.
Hakaze Cho, Hao-Lin Yang, Zhun Sun et al.· 0 citations
Examining task affinities from supervised fine-tuning gradients and solving a constrained mixed-integer program(MIP) to construct partially overlapping specialist groups highlights specialization and capability integration as connected but distinct design problems in chemical reasoning.
Yao-Yao Xu, Xinjian Zhao, Xiao-Zhuang Song et al.· 0 citations
RareTrap provides model developers a principled approach for evaluating language models under a common distribution, and prioritizing alignment effort to improve safety and mitigate risks.
Elsayed Eshra, Ali Al-Lawati, Dongwon Lee et al.· 0 citations
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduSep 24, 2026
A new method, called CW-Net, translates the reasoning process of an autonomous vehicle’s AI system into understandable concepts that explain its behavior.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.