Speculative decoding (SD) accelerates autoregressive inference by leveraging the memory bound nature of decoding, verifying multiple draft tokens in a single forward pass. For mixture-of-experts (MoE) models, prior work predicts a concave speedup-batch size relationship, with gains peaking at intermediate batch sizes d...
Ekagra Ranjan, Komal K. Teru, Bharat Venkitesh et al.· 0 citations
Speculative decoding speeds up large language model (LLM) serving only while the GPU has spare compute, so the best draft length, the number of tokens a small drafter guesses per step, shrinks as the batch grows. vLLM lets operators set the draft length for each batch size with a hand-written table, but nothing measure...
Abhishek Malvankar, Paul C. Castro, N. Mitchell· 0 citations
Training-time multi-agent system (MAS) design seeks to learn reusable orchestration policies, yet prevailing approaches remain largely one-shot: an Orchestrator generates a system but only observes and learns from its terminal outcome. This paradigm discards execution trajectories that expose system-level failures and...
Large language models (LLMs) have rapidly become a default source of help for students in science and engineering courses. In foundational engineering mechanics courses such as statics, students routinely use these tools to check answers, work through partial solutions, and ask for explanations. Effective tutoring in t...
Evangelos Apostolakis, Erfan Hamdi, Sara Jahedazad et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Many log-analysis tasks involve choosing among known options, such as detecting anomalous sessions or identifying attack techniques, and benefit from calibrated probabilities. We present Lev-3B, an open 3B-parameter decision model built on Granite-4.1-3B-Base with a shared pointer readout, and study its training recipe...
Leo Betthauser, Ying-Qing Liu, Uday Shah et al.· 0 citations
Introspection, the ability of a system to access and reason about its internal signals, is crucial for language model (LM) self-consistency and scalable interpretability. Prior work argues that LMs possess introspective capabilities, and that training (SFT) could enhance such behavior. However, most setups leave open t...
Zilu Tang, Jongin Kim, Kerem Sahin et al.· 0 citations
Typed decision models are an emerging class of language models that make decisions instead of generating free-text responses. They answer in a single fast and cheap query and are increasingly used, including in security-sensitive tasks. However, red teaming of these models leaves two gaps: existing adaptive attacks do...
QUANTA is established as a generalizable framework for evidence-driven, safeguarded and closed-loop quantum-materials characterization through transport measurements of the topological Weyl semimetal TaP, as well as investigations of nonlinear responses in magnetic material Co2MnGa.
Eunbi Rha, Abhijatmedhi Chotrattanapituk, Mou-Yang Cheng et al.· 0 citations
Automated jailbreak discovery aims to find prompts that elicit prohibited behaviors from safety-trained language models, helping developers identify vulnerabilities before deployment. One class of approaches uses reinforcement learning to train an investigator model to generate prompts that elicit a specified behavior...
Micha{\l} Burzy\'nski, Noah T. Rossi, Shomit Basu et al.· 0 citations
The first computational method GazeEval is proposed to predict the perceived visual realism of AI-generated videos from eye-tracking data, which achieves 71.3% accuracy in prediction, providing evidence that eye tracking data carries informative signals about how people evaluate a video.
Dan-Qing Shi, Lan Jiang, Jake Lyons et al.· 0 citations
Looped Transformers increase computational capacity through the repeated application of shared blocks, but their recurrent depth makes conventional full-depth decoding expensive. While existing speculative pipelines accelerate generation by processing consecutive token positions at varying depths, they are typically li...
AtomTree is presented, a hierarchical framework for state-aware task planning with LLMs that incrementally builds a tree of subgoals and actions, where the LLM decides at each step, from the current symbolic state, whether to further decompose or to output a grounded low-level action.