arXiv AI

Mechanistically Eliciting Latent Behaviors in Language Models

arXiv:2606. 29604v1 Announce Type: cross Abstract: We aim to discover diverse, generalizable perturbations of LLM internals that can surface hidden behavioral modes.

arXiv AI
Sep 10

A*-Thought-V2: Efficient Latent Reasoning via Geometric Dynamics of LLM

A*-Thought-V2 is a framework that models Chain-of-Thought reasoning as a geometric trajectory in a 3D PCA space, using explicit-implicit latent tokens to compress steps that deviate from the main question-to-solution direction. The method measures alignment angles to decide which steps remain text and which become latent, and introduces stepwise embedding forcing and label forcing to train the architecture. Experiments on Qwen models show up to 2.6% accuracy gains, halved response length, and significant reductions in computation and training time.

By Xiaoang Xu, Siyuan Liu, Shuo Wang, Junlan Feng, Fanyu Meng, Zhu Zhang, Jixun Wang, Xiaorong Wang, Zihan Zhou, Xin Li, Chaojun Xiao, Yiming Zhang, Huijia Wu, Liuyu Xiang, Peipei Li, Zhaofeng He
Hugging Face Trending Papers
Sep 2

Loom: Weaving Diagnostic Strands into Free-Text Consensus via Embedding-Space Reweighting

Loom is a generative consensus framework designed for real‑world root‑cause analysis (RCA) that combines open‑form hypotheses from modular heuristics with a lightweight large language model (LLM). It projects hypotheses into a continuous embedding space and uses an iterative centroid‑based reweighting algorithm to resolve conflicts, producing a single consensus that is then synthesized by one LLM call. On the OpenRCA benchmark, Loom achieves state‑of‑the‑art accuracy on Bank and Market‑2 while being significantly faster and more efficient than existing autonomous agents.

arXiv AI
Sep 3

Loom: Weaving Diagnostic Strands into Free-Text Consensus via Embedding-Space Reweighting

Loom is a generative consensus framework designed for real‑world root‑cause analysis (RCA) that combines open‑form hypotheses from modular heuristics with a lightweight large language model (LLM) synthesis step. It projects hypotheses into a continuous embedding space and uses an iterative centroid‑based reweighting algorithm to resolve conflicts, producing a single consensus that is then synthesized by one LLM call. On the OpenRCA benchmark Loom matches state‑of‑the‑art autonomous agents on some datasets while achieving significantly higher efficiency—about 26× faster and 33× faster with an 8B‑parameter synthesizer. whyItMatters":"Loom demonstrates how embedding‑space reweighting can bridge the gap between statistical rigor and expressive LLMs, enabling efficient, trustworthy RCA in industrial settings."

By Ron Begleiter, Katya Egert Berg, Gilad Saban, Gil Shabat