Latent Recurrent Thoughts substantially outperforms prior frozen-decoder continuous-space reasoning methods under an identical decoder, prompt, data, and training budget, and outperforms non-thinking-mode chain-of-thought prompting on the same backbone at a small fraction of its inference compute.
BASIN is introduced, a training-free, structure-aware selection method that groups reasoning states into basins and penalizes repeated visits to the same strategy, thereby reallocating search across genuinely distinct reasoning paths under a fixed compute budget.
The hypothesis that native SLMs must be the most sustainable edge choice is not supported universally; optimized quantized LLMs can win overall, while SLMs remain competitive through lower resource demand.
This work proposes Drift-Aware Sparse Routing (DRS), a nonstationary sparse contextual routing with multiple knapsack constraints and an optional shadow-audit stream that evaluates a small fraction of prompts on several models.
Cheung-Hao Lee, Patrick Wong· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Controlled fine-tuning, distillation, and agentic consistency-checking support the same conclusions, and the SciTrue team's participation in both subtasks of the NTCIR-19 SciClaimEval task is described.
Qiming Bao, N. Tan, Si-Yuan Wang et al.· 1 citation
3R-Bench (Refusal, Repetition, and Revision), a benchmark of 150 real-world cybersecurity requests augmented with two adversarial conversational settings, is introduced and eight LLMs are evaluated, finding that prior assistant behavior strongly changes responses to an unchanged request.
Rui Yang, Yang Hong, Yi-Chao Xu et al.· 0 citations
PARSER is a new residual sparsification method that shifts the compression objective from minimizing isolated matrix errors to preserving the expert output error, and achieves this by introducing output importance, which measures the actual contribution to the expert output error.
Seung-Woo Jung, Dohyeok Kwon, Seung-Min Cha et al.· 0 citations
The Evidence-Grounded Typed Knowledge Graph (EGT-KG), a retrieval framework to improve information retrieval with local SLMs is proposed, showing that EGT-KG outperforms the vanilla RAG method in most settings, with the best improvement from llama3:8b.
Mu-Ran Yu, Jie-Chao Gao, Yuan-Dong Pan et al.· 0 citations
GLANCE is presented, the first one-pass block drafter that is lossless on an unmodified VLM target, and it breaks the cycle at both ends of a self-defeating cycle.
Jungseob Lee, Seongtae Hong, D. Lee et al.· 0 citations
Requiring no training or auxiliary computation, stride-k subsampling exploits Whisper's preprocessing redundancy, indicating that its audio-token interface carries more capacity than downstream tasks require.
SIR is presented, a black box IPI attack that composes stealthy injections from a small library of reusable principles stated in plain language and wraps composition in an iterative feedback loop that diagnoses the victim's failed trajectories and distills the bypasses into new, named strategies that are reapplied acro...
Chen Xiong, Zhi-Yuan He, Pin-Yu Chen et al.· 0 citations
CoVeil is proposed, a defense mechanism which dynamically optimizes transmitted signals to suppress leakage during decoding time while preserving the collaborative quality, and consistently improves the privacy-utility trade-off over existing baselines by reducing data leakage.
Ke-Jia Zhang, Tianyuan Zou, Zi-Xuan Gu et al.· 0 citations
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.
Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.