ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “Large Language Models”

108 stories

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllVulnerability 388Malware 230Ransomware 197Exploit / PoC 196Policy & legal 183AI safety & security 160Threat actor 143Phishing & fraud 119AI research 111Data breach 103Industry 90Research 60Model release 55AI industry 44
SeverityAllcritical 730high 367medium 459low 257info 330

The AI ‘Ghosts’ Contaminating Academic Publishing

Samsung and University of Warsaw researchers find LLMs repeatedly generate the same fake author names, contaminating academic records with 1,655 ghost-authored DOIs.

A preprint from Samsung and the University of Warsaw, "The Ghost Couple: Correlated LLM Name Priors and Their Haunting of the Web and Academic Publishing," shows that LLMs such as Claude, ChatGPT, and Gemini repeatedly generate the same fictional names like Elena Vasquez, Marcus Chen, and Aris Thorne as experts and co-authors. Researchers identified 1,655 ghost-authored records on CERN-operated Zenodo carrying real DataCite DOIs, fabricated journals, and backdated publication dates. Ghost names also form synthetic research groups on ResearchGate and are indexed without verification by Google Scholar and Semantic Scholar. The researchers suggest correlated name priors could serve as provenance signals for detecting AI-generated content.

404 Media · 20d agoAI research

A Zeroth-Order Paradigm for LLM Preference Alignment

Researchers propose ComPO, a zeroth-order comparison-based preference alignment method with convergence guarantees that mitigates likelihood displacement in LLMs.

ComPO extracts directional information from preference pairs via comparison oracles instead of optimizing a differentiable preference loss, addressing likelihood displacement in direct alignment methods. The paper establishes convergence guarantees for the offline scheme and introduces an online variant with reverse-KL control using unlabeled policy generations. Experiments on Mistral, Llama, Gemma-2, Gemma-3, and Qwen3 models show improvements over existing direct alignment methods, including length-controlled win rates.

arXiv cs.AI / cs.LG / cs.CL · 11h agoAI research

Coupled Calibration and Learning: Mitigating Teacher Bias in LLM Distillation without Target-Domain Reward Feedback

CCL couples teacher calibration with student updates via token-level branching, provably removing teacher bias in LLM distillation.

The paper proposes Coupled Calibration and Learning (CCL), an LLM distillation algorithm that alternates teacher calibration using source-question reward feedback with student training on target questions under covariate shift. Each iteration calibrates the teacher on source feedback, trains the student on target questions, and lets the updated student inform subsequent calibration. The authors prove the student's expected KL divergence to the oracle student converges to zero at a polynomial rate, and show regularized direct matching error can remain bounded away from zero.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research1

EvolveTrade: Experience-Driven Policy Refinement for Self-Evolving LLM Trading Agents

EvolveTrade lets LLM trading agents self-refine their tool-use policy from realized portfolio feedback, improving Sharpe ratios.

EvolveTrade treats a tool-using trading agent's system prompt as a text-parameterized policy that a Policy Agent revises after each update interval using accumulated decision traces and realized portfolio feedback, keeping the backbone LLM fixed. Experiments across multiple market regimes and two LLM backbones show improved Sharpe Ratio and Cumulative Return over fixed-policy baselines in most settings. Behavioral analyses show evolved policies increase code-mediated analysis and activate regime-relevant computations, with case-level attributions linking policy changes to returns.

Hugging Face daily papers · 2d agoAI research

Bellman Policy Optimization

Bellman Policy Optimization, a critic-free RLVR method derived from Policy Mirror Descent, improves LLM mathematical reasoning without intermediate state-value estimation.

The paper introduces Bellman Policy Optimization (BPO), a critic-free reinforcement learning method for LLMs with verifiable rewards, derived from Policy Mirror Descent. BPO uses the Bellman equations to reformulate PMD as a trajectory-level objective for autoregressive generation with terminal rewards, avoiding state-value estimation at intermediate states. The authors prove BPO shares the same unique optimal solution as PMD and validate it on mathematical reasoning benchmarks.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

Verifiable by Construction: Claim-Level Evaluation of Verbatim Citation in Clinical Question Answering

Evaluation of twelve LLMs on 222 clinical questions shows verbatim quotes rarely substantiate claims; claude-opus-5 fully substantiates only 37.1%.

The authors build a standardized harness over four clinical practice guidelines and evaluate twelve LLMs on 222 synthetic clinical questions, measuring citation attachment, verbatim quote production, and claim substantiation. Most models attach verbatim quotes to over 90% of claims from prompting alone, though lightweight models like claude-haiku-4.5 struggle. Quotes frequently fail to substantiate claims: claude-opus-5 quotes 98.0% of claims but fully substantiates only 37.1%, exposing a capability gap for verifiable clinical QA.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

HypoEvolve: Genetic Algorithms Enable Multi-Agent LLMs to Discover Scientific Hypotheses

HypoEvolve uses a generational genetic algorithm coordinating specialized LLM agents to generate scientific hypotheses, outperforming six baselines on cancer drug repurposing.

HypoEvolve is a framework that coordinates specialized LLM agents through a generational genetic algorithm to produce, revise, and retain scientific hypotheses with explicit collaboration roles. It evaluates drug repurposing hypotheses against external evidence from DepMap and Open Targets across 34 cancer types. It achieves the highest scores against six baselines, reaching DepMap selectivity of 0.171 versus 0.115 for the strongest baseline, and gains over single-pass generation generalize to held-out cancer types.

Hugging Face daily papersupdated · 2d agofirst · 3d agoAI research 2 sources

Not All Prompts Are Equal: Exploration-Guided Prompt Scaffolding for Multimodal Reinforcement Post-Training

Exploration-guided prompt scaffolding rewrites training prompts by Exploration Potential Score, boosting multimodal RL post-training accuracy up to 11.5%.

The paper proposes dynamically adapting the training prompt distribution during online RL post-training of multimodal LLMs using the Exploration Potential Score (EPS), a lightweight rollout-based proxy for prompt utility computed from on-policy statistics with no additional overhead. Rather than discarding low-utility prompts, a teacher model generates scaffolded rewrites that preserve task intent while making training more informative. Integrated with GRPO on Geo3K and MMK12, the method achieves up to 9.7% relative in-domain improvement plus 11.5% on MathVision and 11.1% on MMMU-Pro.

Hugging Face daily papers · 3d agoAI research

When Agents Slow Down: Understanding LLM Agents' Test-Time Strategies via Elo-per-token Analysis

Elo-per-token analysis shows LLM agents' marginal gains drop below independent sampling at scale; parallel sessions beat one long session.

The paper proposes Elo-per-token analysis, using a Bradley-Terry model to measure how agent performance scales with token budget on open-ended tasks with continuous scoring. Across four agents and four benchmarks with sessions up to 100M tokens, agents initially convert tokens to Elo faster than independent sampling but eventually slow below the linear-in-log-compute reference. The authors define a scaling inflection point and show that splitting 100M tokens across parallel sessions on FrontierCS Polyomino Packing gains +264 Elo over one long session and +355 over ten short sessions. Human contestants on shared AtCoder Heuristic Contest tasks improve superlinearly, indicating headroom over current agents.

Hugging Face daily papers · 3d agoAI research4· 2 reads

HarnessVLN: Unifying Training-Free Embodied Navigation through an Agent Harness

Researchers introduce HarnessVLN, a zero-shot training-free agent harness that sets new training-free SOTA on vision-language navigation benchmarks including R2R and HM3D.

HarnessVLN is a zero-shot, training-free framework for embodied vision-language navigation that coordinates perception, retrieval, grounding, navigation, recovery, and termination through a unified tool interface. It validates planner proposals against spatial evidence, geometric feasibility, and subgoal consistency, using hierarchical event memory and a persistent Spatiotemporal Graph that stores reusable spatial evidence and failure annotations. It reports success rates of 60.8% on R2R, 53.9% on RxR, 76.0% on HM3D-v2, and 59.3% on HM3D-OVON, surpassing prior training-free state of the art, with real-world humanoid deployment demonstrated.

Hugging Face daily papers · 3d agoAI research

OmniHarness: Harnessing Generalizable Visual Generation via Symbolic Policy Learning

OmniHarness learns symbolic policies for visual generation agents, reaching a 95.0% resolve rate on ComfyBench Creative tasks, 27.5 points above the strongest baseline.

OmniHarness abstracts verified executions into symbolic policies for visual generation task families, which are instantiated, adapted, and composed for new tasks while model parameters remain fixed. Intermediate verification guides refinement and failure recovery during execution, and self-directed inquiry generates practice tasks near capability limits before downstream objectives are specified. Experiments across six benchmarks, three MLLM backbones, and three visual agent frameworks show strong performance; on ComfyBench Creative tasks it achieves a 95.0% resolve rate, exceeding the strongest baseline by 27.5 percentage points. Frozen policy snapshots improve existing visual agent systems through plug-and-play reuse.

Hugging Face daily papers · 4d agoAI research

Expert-Space Exploration in MoE Reinforcement Learning

ESRL explores MoE expert-routing space during RL post-training, improving Qwen3-30B-A3B Pass@1 by 3.2 points over GRPO without extra compute.

The paper shows perturbing expert routing increases rollout diversity similarly to higher decoding temperature, but naive perturbation degrades quality. ESRL anchors high-confidence experts, restricts stochastic routing to a plausible candidate pool, adapts perturbation strength via router entropy, and replays recorded expert paths during policy optimization. It achieves the best results across top-K, top-1, and shared-expert MoE backbones on math, science, and code tasks; on Qwen3-30B-A3B it improves average Pass@1 and Pass@8 over GRPO by 3.2 and 4.5 percentage points.

Hugging Face daily papersupdated · 5d agofirst · 6d agoAI research 2 sources

RetroThinker: Enabling Retrospective Thinking in Speech LLMs

RetroThinker is a post-training framework letting the Moshi speech LLM self-correct reasoning mid-stream, adding 11% GSM8K accuracy at similar latency.

Researchers introduce RetroThinker, a multi-stage post-training framework that equips the Moshi speech LLM to verify and forward-correct chain-of-thought steps during streaming inference. It combines supervised fine-tuning on curated retrospective thinking data with length-based direct preference optimization (DPO). On GSM8K it achieves an 11% absolute accuracy gain over non-retrospective baselines at comparable latency.

arXiv cs.AI / cs.LG / cs.CL · 6d agoAI research1

Benchmark Radar: A Living Database and Search Engine for AI Benchmarks and Evaluation

Benchmark Radar provides a living searchable database of 1,283 AI benchmark records and 12,916 score observations drawn from 37 daily discovery sources.

Benchmark Radar combines daily discovery of benchmark papers, repositories, datasets, and releases from 13 direct connectors and 24 first-party feeds into a searchable catalog with model card mentions and score histories. The catalog contains 1,283 source records drawn from 4 benchmark catalogs plus 12,916 numeric observations on 790 records. The release includes a web dashboard with leaderboard, Pareto frontier of score versus usage, saturation and trend views, daily feeds, a CLI, and reproducible analysis. The paper audits the full catalog and examines benchmark saturation and limits of score comparisons.

Hugging Face daily papers · 7d agoAI research

Negative Self-Distillation: Learning to Reason by Avoiding Flaws

Researchers propose Negative Self-Distillation (NSD), a label-free LLM self-improvement method that diverges from self-generated flawed reasoning rather than imitating privileged solutions.

The authors show On-Policy Self-Distillation can degrade complex reasoning by forcing imitation of artificially confident traces built on privileged information, suppressing uncertainty and self-correction. NSD instead generates a question-specific negative condition — such as acting as a 'careless reasoner' — and pushes the model's distribution away from it without ground-truth labels. A dynamic gating mechanism isolates reasoning-critical tokens so gradient updates fix behavioral flaws without damaging foundational linguistic capabilities. NSD consistently outperforms OPSD and other label-free, self-bootstrapping reinforcement learning baselines.

Hugging Face daily papers · 7d agoAI research1

X-AuT: Progressive Audio-Encoder Compression for Speech LLMs with Cross-Scale Distillation

XPeng AI's X-AuT prunes speech LLM audio encoders, cutting Qwen3-ASR-0.6B error from 5.61% to 5.27% with fewer parameters.

X-AuT is a progressive compression framework for speech LLM audio encoders that selects layer combinations via short behavioral probes and restores pruned models using cross-scale distillation and LoRA finetuning while keeping the language-model backbone frozen. Compressing Qwen3-ASR-0.6B from 18 to 16 audio-encoder layers lowered macro-average error from 5.61% to 5.27% on ten Chinese-English benchmarks. A 14-layer model reached 5.75% error with 20.7% fewer audio-tower parameters, and progressive pruning outperformed direct pruning (5.75% vs 6.73%).

Hugging Face daily papers · 7d agoAI research

COBRA-Skills: Contextual Bandit-Guided Evolution for Agent Skill Optimization

COBRA-Skills uses contextual bandits to guide LLM agent skill evolution, cutting optimization cost 55-58% versus SkillOpt while topping six agent benchmarks.

COBRA-Skills formulates LLM agent skill optimization as budgeted sequential optimization over a dynamically evolving candidate space. It couples contextual-bandit-guided prioritization with evidence-grounded skill evolution, selectively spending execution-based evaluations on promising candidates while refining skills from feedback. Across six heterogeneous agent benchmarks and three target models, it achieves the strongest average performance while reducing optimization cost by 55-58% relative to SkillOpt using only 50 unique optimization examples per benchmark. The method remains robust to agent harness changes and works when the target model generates its own skills.

Hugging Face daily papers · 7d agoAI research

ConvMem: Convolutional Memory for Long-Context Reasoning

Researchers propose ConvMem, a training-free framework treating LLMs as convolutional kernels for parallelizable long-context reasoning beyond fixed context windows.

ConvMem reformulates long-context reasoning as a hierarchical convolution in which the LLM summarizes text segments hierarchically, shortening the reasoning path from a linear chain to a logarithmic tree. It uses configurable strides, skip connections, and multi-kernel convolution to capture evidence, decompose queries, and enable massive parallelization across segments and reasoning threads. On RULER-HotpotQA and RULER-2WikiMultiHopQA it outperforms training-free baselines and avoids the out-of-distribution overfitting seen in RL-trained approaches like MemAgent.

arXiv cs.AI / cs.LG / cs.CL · 7d agoAI research

Forgetting Only What Matters: Layer-Selective Unlearning toward Robust LLMs

Researchers introduce FOM-UL, a layer-selective machine unlearning framework that improves forgetting-utility trade-offs and resists knowledge recovery after quantization.

FOM-UL selects transformer layers for unlearning using a forget-to-retain significance score, concentrating parameter updates on layers highly influential for the forget set while leaving most of the model unchanged. It reduces residual memorization versus GA, NPO, KLD, SURE, ReLearn, and LUNAR-based baselines on TOFU, KnowUnDo, and MUSE-style evaluations while preserving retain-set utility. Under 8-bit and 4-bit post-training quantization and adversarial prompts, it maintains stronger suppression of forgotten content, addressing brittleness of diffuse unlearning updates.

arXiv cs.AI / cs.LG / cs.CL · 7d agoAI research1

Emergency Department Revisit Quality Review Screening: Exploring Human Decision-Making and Artificial Intelligence Support

A retrospective study found GPT-4 over-flagged emergency department revisit cases while an LLM knowledge-graph screener achieved 83-100% positive predictive value.

In an exploratory retrospective study of 99 emergency department diagnosis pairs from a multihospital health system, clinicians and GPT-4 independently judged whether revisit pairs warranted further assessment. GPT-4 responses correlated poorly with clinicians, flagging 94% of pairs for follow-up, 4.4-13.3 times more than clinicians, though prompt engineering was minimal. An algorithm leveraging an LLM-populated knowledge graph (KGA) achieved 83-100% positive predictive value against at least one clinician rater, suggesting LLM-based screening could broaden revisit quality review without substantially increasing reviewer workload.

arXiv cs.AI / cs.LG / cs.CL · 7d agoAI research1

Retrofitting Code Using LLMs to Support Exceptional Behavior

EXCODER combines static/dynamic analysis with LLMs to retrofit exception-handling code, achieving 85.92% pass@1 with Qwen 2.5 Coder 32B on Java benchmarks.

The paper introduces the task of retrofitting existing code with Exception Related Code (throw statements, guarding conditions, try/catch blocks) so that given Exceptional Behavior Tests pass. EXCODER performs context engineering by integrating static and dynamic program analysis output with LLMs; it was evaluated on a benchmark built from 304 methods across 75 GitHub Java projects. Combined with Qwen 2.5 Coder 32B, EXCODER achieves pass@1, 5, and 10 rates of 85.92%, 86.18%, and 86.51%, roughly 13 percentage points over baseline, and manual inspection reveals remaining limitations.

arXiv cs.AI / cs.LG / cs.CL · 7d agoAI research1

LLaDA-UI: Bringing Block-wise Diffusion to Vision-Language GUI Agents

LLaDA-UI, a 16.7B block-wise diffusion vision-language GUI agent, outperforms Qwen2.5-VL-7B and beats Qwen3-VL-8B on four of six GUI benchmarks.

LLaDA-UI is a 16.7B-parameter MoE-based, block-wise diffusion vision-language GUI agent built on the LLaDA2.0-mini-base diffusion language backbone with a native-resolution vision encoder. It uses a two-stage pipeline: general multimodal pre-training followed by GUI-agent supervised fine-tuning on mobile, desktop, web, and grounding data. It substantially outperforms Qwen2.5-VL-7B and surpasses Qwen3-VL-8B on four of six reported GUI benchmarks, establishing block-wise diffusion as a practical paradigm for latency-sensitive multimodal agents.

Hugging Face daily papers · 8d agoAI research

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Researchers introduce Procedural Graphs, self-evolving (procedure, relation, procedure) structures guiding LLM agent tool use and planning.

Procedural Graphs organize procedural knowledge into (procedure, relation, procedure) triplets to guide LLM agent actions, addressing drift such as lost objectives, out-of-order tool calls, and repeated unproductive steps. At each decision step the framework localizes the active node and a guidance model translates the surrounding subgraph into step-level situational guidance. An LLM refiner edits graph topology by contrasting failed with successful trajectories, and across datasets, task types and LLMs the approach outperforms memory-based baselines and matches or surpasses hand-designed graphs.

arXiv cs.AI / cs.LG / cs.CL · 8d agoAI research1

MeClear: Cooperative Game-Theoretic Attribution and Risk-Aware Memory Clearance for Long-Horizon LLM Agents

MeClear uses cooperative Shapley attribution to clear harmful memories from long-horizon LLM agents, boosting task recovery by 25.5 points over baselines.

The paper introduces MeClear, a task-conditioned memory clearance framework for long-horizon LLM agents that identifies and selectively suppresses memories with negative downstream utility without permanently altering the persistent memory bank. It combines Leave-One-Out screening with sampled cooperative Shapley attribution to distribute utility across interacting evidence, resolving redundant conflict masking that single-removal evaluations miss. Across ten long dialogue memory pools it achieves 85.9% target recall and 82.3% overall task recovery, a 25.5 percentage-point improvement over LOO baselines.

arXiv cs.AI / cs.LG / cs.CL · 8d agoAI research

It's Not RoPE that Creates Sinks: The Role of Self-Concentration and Value-Non-Mixing in Attention

Study shows attention sinks and massive activations stem from causal-mask self-concentration and value-non-mixing rather than RoPE, informing quantization work.

The paper analyzes why attention sinks and massive activations emerge at initial sequence positions regardless of which token occupies them. Experiments attribute both phenomena to self-concentration of attention induced by the causal mask and the subsequent value-non-mixing in attention outputs. The findings provide empirical evidence on LLM internal dynamics and may inform low-bit quantization strategies, which massive activations currently complicate.

arXiv cs.AI / cs.LG / cs.CL · 8d agoAI research

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Procedural Graph framework stores procedural knowledge as triplets and self-evolves via LLM refinement, beating memory-based baselines across datasets, tasks, and LLMs.

The Procedural Graph organizes procedural knowledge into (procedure, relation, procedure) triplets; at each decision step the framework localizes the agent's active node and a guidance model translates the surrounding subgraph into step-level guidance that biases the solver's next action. An LLM refiner contrasts failed with successful trajectories and edits the graph's topology and attributes, retaining rejected edits to discourage repetition. Starting from a minimal skeleton, the loop builds graphs that match or surpass hand-designed ones and can repair flawed expert priors, delivering consistent gains over memory-based baselines across multiple datasets, task types, and LLMs.

Hugging Face daily papers · 9d agoAI research1

AgentGrad: Intervention-guided Prompt Optimization for Multi Agent Systems

AgentGrad introduces intervention-guided prompt optimization for LLM multi-agent systems, achieving state-of-the-art results with 2.5x faster optimization.

AgentGrad is a prompt optimization framework for LLM-based multi-agent systems that addresses limitations in textual gradient extraction and aggregation. It uses sequential intervention to identify the agent whose prompt modification resolves a given failure, then applies agent-level supervision and semantic gradient clustering to build generalized gradients. Experiments report state-of-the-art performance across five MAS benchmarks and a 2.5x average reduction in wall-clock optimization time versus the next-fastest baseline.

Hugging Face daily papers · 9d agoAI research

PlannerForge: LLM Agents for Scenario-Based Testing of Motion Planners in Autonomous Driving

PlannerForge unifies scenario-based testing of autonomous driving motion planners in one LLM-agent framework, outperforming prior baselines.

PlannerForge is an LLM-agent framework that covers the full scenario-based testing pipeline for autonomous driving systems, spanning scenario generation, selection, modification, routing, planner testing, plus new enhancement and benchmarking stages. In evaluations with 10 off-the-shelf LLMs, best-per-task scores range from 0.88 to 1.00, and open-source 20-35B backends such as Qwen3.6:35B match commercial APIs on most tasks. End-to-end chaining retains 83% (commercial) and 78% (open) of seed queries, beats Scenario Factory 2.0 on executable generation, and cost-tuning lifts planner success from 50.4% to 70.2% while cutting collisions from 19.0% to 8.4%.

Hugging Face daily papers · 9d agoAI research

StochBench: A Domain-Specific Benchmark for Stochastic Processes in Lean

StochBench introduces 450 graduate-level stochastic-processes problems in Lean 4; an Opus 4.8-based agent proved 34.9% under a 15-minute limit.

StochBench is a Lean 4 benchmark of 450 graduate stochastic-processes problems, each paired with its natural-language source, covering Markov chains, renewal processes, martingales, Brownian motion, stochastic calculus, weak convergence, and Poisson and continuous-time Markov processes. The benchmark addresses field-specific applied mathematics underrepresented in Mathlib, unlike competition-math-dominated suites such as IMO and Putnam collections. An Opus 4.8-based agent achieved a 34.9% proof rate (157/450) under a 15-minute per-problem limit, showing the benchmark remains challenging for advanced provers.

Hugging Face daily papers · 9d agoAI research

Revisiting Complete Reasoning Traces for Post-Training

Researchers show full reasoning traces provide limited benefit in LLM post-training, with heavily truncated or endpoint-only trajectories performing comparably.

A pilot study plus attention-based analyses and controlled token-removal studies show intermediate tokens in reasoning trajectories contribute minimally to final reasoning quality. Partial trajectories remain effective even under heavy truncation, and training on endpoints alone leads to consistent changes in reasoning behavior. The finding also benefits reinforcement-learning and on-policy distillation post-training; code is released at github.com/naver-ai/revisiting-trace.

Hugging Face daily papers · 10d agoAI research

Online Learning with LLM Experts from Limited Feedback

Paper proposes bandit algorithms for adaptively routing prompts to LLM experts, minimizing regret under limited feedback budgets.

The paper formulates adaptive prompt routing to K LLM experts as a contextual bandit problem with d prompt features over T rounds. Proposed algorithms strategically select actions and observe rewards, achieving O(dT/m) regret in the full-information setting and O(dTK/m) in the bandit setting, where m is the feedback budget. Experiments demonstrate efficient learning of high-quality routing strategies across diverse LLMs from limited feedback.

Hugging Face daily papers · 12d agoAI research

Steering Geometry: Validating Human Value Geometry in LLM Steering Space

Researchers show LLM activation steering vectors encode human value geometry predicted by Schwartz's theory, with fidelity improving at scale but degrading after instruction tuning.

The study tests whether latent geometry of activation steering vectors reflects theory-specified structure in human values, using Schwartz's Theory of Basic Human Values and a new 26K-sample benchmark spanning 20 values. Distribution-driven methods (CAA, SphericalSteer, ODESteer) recover predicted value topologies with Spearman correlation up to 0.51 (p < 10^-13), while behavior-centric methods (COLD-Steer, BiPO) steer comparably but show little geometric fidelity. Geometric alignment improves with model scale but drops after instruction tuning. Better geometric alignment also yields more human-consistent cross-value transfer, steering one value lifting compatible values and suppressing opposing ones.

Hugging Face daily papers · 12d agoAI research

Beneath the Surface of Chains-of-Thought: A Mechanistic Interpretation of Reasoning Operations in LLMs

Study shows LLM reasoning operations like planning and deduction are geometrically separable in hidden states, with separability peaking in middle layers.

Researchers investigate whether functional reasoning operations — problem formulation, goal decomposition, deduction — have corresponding geometric structure in LLM hidden representations. They find operations are separable in held-out representations with separability peaking in middle layers, ruling out lexical and positional confounds; token-wise operation alignment becomes more distributed across layers, and identical surface tokens are represented differently depending on their surrounding chunk. Attention-masking interventions show chunk-onset operation-aligned representations depend on preceding reasoning context; code is released on GitHub (naver-ai/beneath-cot).

Hugging Face daily papers · 13d agoAI research1

What Else Needs Fixing? Exploring Cost-Effective Test-Time Compute for Revision Propagation in Artifacts Generated Through Conversation

A new benchmark shows LLMs reach 68.3-93% accuracy propagating local revisions across conversationally generated artifacts, with parallel-sample selection most cost-effective.

The paper introduces a benchmark for revision propagation: when users request a local change, LLMs must identify dependencies and update all affected parts of an artifact generated through conversation, where context lives in the chat history. Nine revision methods, including sequential reflection and parallel sampling variants, were evaluated on gpt-oss-20b/120b, gpt-5.4-mini, and qwen3.5-9b/27b/122b. Baselines scored 68.3-93% accuracy, and selecting among three parallel samples via LLM-based or medoid selection improved accuracy by 2.2-9.7% as the most cost-effective test-time compute strategy. Code and dataset are released.

Hugging Face daily papers · 14d agoAI research

ShallowStream: Index Shallow then Answer Deep for Streaming Video Understanding

ShallowStream builds streaming-video retrieval indexes from shallow MLLM layers, cutting per-frame prefill latency by up to 52.1x.

ShallowStream is a framework for streaming video understanding with multimodal LLMs that uses the model's shallow layers to simultaneously encode frames and maintain an always-on lightweight retrieval index via shallow-layer KV caches, avoiding full-depth prefill for every incoming frame. At query time, shallow-layer attention scores plus a diversity-aware selection strategy retrieve relevant context frames. It reports performance on par with the strongest existing streaming methods while reducing per-frame prefill latency by up to 52.1x and 10-second end-to-end latency by up to 11.9x, with code released on GitHub.

Hugging Face daily papers · 15d agoAI research