Search: “hypothesis-discovery”

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

Discovery Foundation Models: Toward Open-Ended Discovery Intelligence

Proposes Discovery Foundation Models that participate in creating new problems and knowledge, instantiated in Zetema and the GALILEO therapeutic-discovery system.

The paper formulates Discovery Foundation Models (DFMs) as general-purpose systems for open-ended discovery, supporting seven coupled capabilities from problem discovery through evidence-grounded revision and continual improvement. It instantiates the framework with Zetema, combining explicit research-state dynamics, verification gating, external grounding, and cross-task Discovery Skill evolution. GALILEO, a real therapeutic-discovery system, closes the loop between Dry-Lab reasoning, robotic and hands-on Wet-Lab experimentation, and iterative hypothesis revision. The authors also define process-centered evaluation so discovery behavior can be trained and measured beyond final answers.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:56 UTC · 2d agoAI research 2 sources

38

ScienceBuddy: Recursive-in-Recursive Self-Improvement for Interactive Scientific Agents

ScienceBuddy couples harness evolution with model reinforcement learning so scientific agents continually self-improve from researcher feedback in an interactive workspace.

The authors release ScienceBuddy, an interactive scientific research workspace that transforms researcher requests, feedback, and execution evidence into tasks and evaluation rubrics for continual learning. Its recursive-in-recursive self-improvement paradigm couples harness evolution (inner recursion, model fixed) with model reinforcement learning under the improved harness (outer recursion). Case studies span four scientific task families, and the system is released to the scientific community as a research product.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:55 UTC · 1d agoAI research 2 sources

35

CausalArena: Benchmarking Causal Discovery in the Foundation Model Era

Researchers introduce CausalArena, a unified benchmark revealing that causal discovery rankings shift substantially across structural causal model families and protocols.

The paper presents CausalArena, a unified and evolvable benchmark for causal discovery combining synthetic structural causal models, semantically grounded operational SCMs, formula-grounded scientific SCMs, and public real-world datasets. Experiments across classical, neural, and pretrained causal discovery foundation models show large ranking shifts between benchmark regimes. The authors identify pretraining-evaluation overlap and benchmark diversity as central evaluation challenges.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:53 UTC · 6d agoAI research

30

Scores Alone Do Not Prove Discovery: The Discovery Certification Protocol for Auditing AI Research Agents

Researchers introduce the Discovery Certification Protocol, an auditable test framework that verifies whether AI research agents' claimed discoveries are genuine.

The Discovery Certification Protocol (DCP) converts AI research agents' discovery claims into executable recovery and feedback tests organized as gated audits. Controlled audits in SQLite optimization and virtual catalyst control produced zero recoveries in 96 episodes, with an upper bound of 0.0468. A deterministic, LLM-free verifier reproduces audit decisions from frozen evidence, giving AI research a common evidence language for outcomes, alternative routes, and feedback effects.

Hugging Face daily papers·Sep 6, 20:00 UTC · 10d agoAI research

30

Thought without systematicity? Evaluating reasoning models on rule induction tasks

Study finds reasoning models often fail on structurally equivalent variants of tasks they solve, suggesting their reasoning lacks systematicity.

The paper extends rule induction tasks from cognitive science using task isomorphisms such as recombination and substitution to test systematicity in reasoning models. Despite solving tasks correctly, models frequently fail on structurally equivalent variants of the same task. The authors conclude many model behaviors lack systematicity, making it difficult to establish cognitive abilities beyond the specific evaluation contexts.

Hugging Face daily papers·Sep 11, 20:00 UTC · 5d agoAI research

35

From Concept to Context Engine: How Wiz Built AI-Powered Data Discovery

Wiz details the multi-agent pipeline and feedback loops that evolved its bucket scanner into AI-powered data discovery.

Wiz published an engineering write-up on building its AI-powered data discovery capability, tracing the evolution from a bucket scanner to a context engine. The post explains the multi-agent pipeline and feedback loops behind the system. The article is a vendor engineering deep-dive with no disclosed vulnerabilities, incidents, or exploitation activity.

Wiz Blog·Aug 27, 15:52 UTC · 20d agoTools1

22

Diffusion Models and Concept Formation

Paper argues diffusion models implicitly form Cobweb-like concept hierarchies, with a basic level emerging at intermediate noise levels.

The authors draw a formal correspondence between diffusion models and Cobweb, a classic incremental concept-hierarchy learner, noting both are hierarchical Bayesian density models with Gaussian prototypes. Modes of the diffusion model's noisy marginals form a hierarchy whose basic level sits at intermediate noise, where class identity commits. The correspondence is tested on MNIST and Fashion-MNIST via mode-finding. Diffusion is reframed as a cognitive model of concept formation.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:43 UTC · 5d agoAI research

15

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

HypoEvolve couples a generational genetic algorithm with specialized LLM agents to generate drug-repurposing hypotheses, beating six baselines on DepMap selectivity (0.171 vs 0.115).

HypoEvolve coordinates specialized LLM agents through a generational genetic algorithm in which scientific judgments and new proposals reshape a hypothesis population. Evaluation centers on drug repurposing, linking mechanistic explanations to target-level biological claims assessed via external measures adapted from DepMap and Open Targets. Across 34 cancer types, HypoEvolve scores highest against six baselines on both measures, with DepMap selectivity of 0.171 versus 0.115 for the strongest baseline, and gains generalize to held-out cancer types.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:44 UTC · 2d agoAI research1

28

Molecular Déjà Vu: Digit-Level Retrieval of Published Values in Frontier Language Models

Audit of 22 frontier models finds widespread verbatim retrieval of published molecular property values, with higher reasoning increasing recall of memorized numbers.

An arXiv audit tests 22 frontier LLMs across 12 molecular regression benchmarks for verbatim retrieval of published values. More than 50% of the LLMs show verbatim retrieval on five datasets, and identical experiments are flagged 89% more often at a high reasoning level than at the lowest one. Suppressing retrieval moves model prediction errors closer together in relative terms, suggesting predictive capability is not determined solely by memorized values.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:32 UTC · 12d agoAI research1

42

SAEScientist-Bench: Can AI Agents Conduct Autonomous SAE Interpretability Research?

SAEScientist-Bench evaluates whether AI agents can autonomously conduct SAE interpretability research in Gemma-2-9B-IT, finding frontier agents trail expert baselines.

SAEScientist-Bench tests if AI agents can act as scientists using SAE tools for autonomous mechanistic discovery, requiring them to design contrastive probes and navigate a Gemma Scope dictionary of 131K+ features in Gemma-2-9B-IT. Across 10 agent configurations and 20 tasks, frontier agents showed genuine discovery capability but remained well behind expert reference features, lagging most in causal steering. Agents frequently misinterpreted experimental measurements even when designing effective contrasts.

Hugging Face daily papers·Sep 7, 20:00 UTC · 9d agoAI research

55

Can Edge-Deployable Vision-Language Models Identify Species?

Evaluation of 2-8B VLMs (Qwen3-VL, Gemma3) against BioCLIP on camera-trap species ID shows all models degrade sharply on field imagery.

The study tests whether edge-deployable 2-8B vision-language models carry genuine taxonomic knowledge, comparing Qwen3-VL 2B/4B/8B and Gemma3 4B against the 300M specialist BioCLIP on a 96-species task across clean iNaturalist photos and six LILA.science camera-trap collections. All models degrade 9.6-26.6 percentage points on field imagery, and BioCLIP outperforms every VLM by 33.2-59.2 points on an expanded 200-image sample, suggesting specialized data rather than scale drives the gap. Under open-set prompting, 5.9-9.6% of responses are syntactically valid but taxonomically nonexistent species names, with fabrication rankings replicating across evaluation sets.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:57 UTC · 6d agoAI research1

30

Convergent Emergence of In-Context Learning Across Modalities

Controlled experiments show few-shot in-context learning emerges across six modalities including language, genomes, images, and proteins, partially supporting a convergence hypothesis.

The paper tests the Convergent Emergence Hypothesis: that few-shot in-context learning, when it emerges, shares a common cross-modality difficulty profile. A controlled framework instantiated the same task suite across six modalities: language, genome, integer sequences, time series, images, and proteins. Paired-mapping ICL emerged in all six modalities, surpassed controlled baselines, and showed correlated per-task effects in five of them, providing partial support for the hypothesis.

Hugging Face daily papers·Sep 11, 20:00 UTC · 5d agoAI research

30

NCP-ArchPreview Technical Report: Moving towards Latent Space Language Models through Next Concept Prediction

An 8.9B-parameter latent-space language model using next-concept prediction matches OLMo-3-7B pretraining loss with only 51.3% of the training tokens.

NCP-ArchPreview augments next-token prediction with Next Concept Prediction over a product-quantized concept vocabulary built from hidden states, trained jointly end-to-end. The 8.9B model was trained on 5.73T tokens from the Dolma-3 dataset, the largest latent-space language model demonstration to date. It consumes 51.3% of the tokens to reach OLMo-3-7B's final pretraining loss and outperforms it by 2.45 points on the downstream macro-average, including a 5.99-point GSM8K gain. The learned latent space also enables lightweight domain adaptation via a 17M-parameter VQ module and improves speculative drafting accepted length by 4.17%.

Hugging Face daily papers·Sep 8, 20:00 UTC · 8d agoAI research1

52

AI models' written reasoning steps correspond to distinct internal patterns, a new study finds

KAIST and Naver AI Lab researchers show LLM reasoning steps like extraction and computation map to distinct activation patterns, strongest in middle layers.

Researchers at KAIST and Naver AI Lab defined eight recurring reasoning operations, including extraction, decomposition, formula recall, deduction, and computation, and showed they correspond to separable activation patterns in Qwen2.5-7B, Qwen3-8B, and Gemma4-31B on math tasks, with GPT-5 labeling solution segments. The separation peaks in middle layers, holds even when a computation step produces a wrong answer, and goes beyond surface-level token choice. Findings replicated on Llama-3-8B, and classifiers trained on Qwen3-8B transferred to GPQA-Diamond and MATH-500. The authors note that using internal states for error detection or mid-generation steering remains future work.

The Decoder·Sep 12, 13:39 UTC · 4d agoAI research2

42

Characterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarch

New work characterizes language generation in the limit via finite witnesses, proves a full separation-width hierarchy, and formalizes all results in Lean.

The paper fully characterizes when language generation in the limit is possible for arbitrary families over a countable universe: each target must admit a finite positive witness such that targets activated by any finite sample share an infinite common intersection. It defines positive separation width and proves every level of the resulting hierarchy occurs, with countable families admitting singleton witnesses and unions of families with infinite common cores requiring unbounded finite witnesses. The characterization, a universal normalization, and a diagonal capture lemma are machine-checked in the Lean proof assistant, with the development maintained on GitHub.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 17:54 UTC · 7d agoAI research1

18

Mythos Vulnerability Firehose Hits a Human Bottleneck

Analysis of Project Glasswing findings shows only a fraction of discovered vulnerabilities have reached disclosure and even fewer are fixed.

Dark Reading reports that an analysis of Project Glasswing findings shows only a fraction of the vulnerabilities discovered by the program have reached disclosure, and an even smaller number have been fixed. The article examines how the volume of findings from the discovery program is bottlenecked by limited human triage and remediation capacity. The piece highlights growing tension between high-volume vulnerability discovery and the industry's ability to process, disclose and patch reports.

Dark Reading·Sep 9, 21:19 UTC · 7d agoResearch

40

ReCite: Agentic Reasoning for Faithful Citation

ReCite is an agentic citation framework using claim-level reasoning and verification, outperforming large generative models in strict citation accuracy.

ReCite is a decoupled agentic framework that orchestrates location perception, intent-aware query planning, and reflective verification for citation recommendation. Trained on synthesized reasoning trajectories, the agent verifies claim-evidence consistency and triggers self-correction loops when retrieved candidates lack logical support. Experiments show the lightweight framework outperforms state-of-the-art massive generative models in strict citation accuracy, addressing misattribution where cited papers are real but logically unsupportive.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:59 UTC · 8d agoAI research

25

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·Sep 7, 20:00 UTC · 9d agoAI research1

36

LongAgent: History-Guided Agentic Search for Longitudinal Outcome Prediction

LongAgent autonomously searches variable sets and temporal windows to predict longitudinal medical outcomes, beating the strongest non-agent baseline on synthetic data.

The paper proposes LongAgent, an agent-based method that searches over combinations of variable sets, temporal windows and aggregation functions for outcome prediction on heterogeneous medical longitudinal data. It uses a history memory of previous searches and numerical evidence to guide exploration. On synthetic data it achieves mean RMSE 1.7376, improving over the best non-agent baseline by 0.0151 (95% CI [0.0045, 0.0260]; p=0.0273), and performs comparably to the best baseline on a real clinical dataset.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 16:51 UTC · 2d agoAI research

16

Canonical Color as a Lens into Concept Decodability in Vision Encoders and VLMs

Probing study shows vision encoders make canonical color linearly decodable from grayscale images and tie it to object identity.

Researchers use canonical color as a controlled testbed for measuring conceptual (not just visible) information in vision encoder representations. A dataset of objects with canonical colors was built, and probes on both color and grayscale images show canonical color remains decodable even when color is removed from the input, linked to predicted object identity. Extending to full VLMs, they find post-training has a surprisingly large effect on color decodability in the vision encoder.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:50 UTC · 8d agoAI research1

27

SAEScientist-Bench: Can AI Agents Conduct Autonomous SAE Interpretability Research?

SAEScientist-Bench tests whether AI agents can autonomously run SAE interpretability research on Gemma-2-9B-IT; frontier agents trail expert baselines.

The benchmark requires agents to design contrastive probes and navigate the Gemma Scope dictionary of over 131K features in Gemma-2-9B-IT to discover optimal interpretable features, scored against expert-curated references on Neuronpedia via activation rank, concept selectivity, and causal steering. Across 10 agent configurations and 20 tasks, frontier agents demonstrate genuine discovery capability and approach expert levels at separating target concepts from controls, but lag substantially in causal steering and frequently misinterpret experimental measurements. The authors frame this as establishing experimental model understanding as a measurable capability for closed-loop autonomous AI R&D and post-hoc monitoring for recursive self-improvement.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:45 UTC · 8d agoAI research1

40

Root-Cause Attribution Is a Search Problem: Continual Search for Long-Horizon Agent Failures

Continual Search framework iteratively prompts LLM judges to keep searching agent execution logs, boosting long-horizon failure root-cause attribution accuracy.

The paper frames automated root-cause attribution (RCA) for long-horizon AI agent failures as a search problem, since relevant evidence is sparse and distributed across massive execution traces. The authors propose Continual Search, an iterative framework that nudges an LLM judge across successive turns to keep hunting unresolved diagnostic evidence instead of settling on an early plausible diagnosis. They introduce MegaRCA-Mix, a benchmark of 50 human-annotated failure trials on long-horizon, execution-heavy tasks. On MegaRCA-Mix, Continual Search improves GPT-5.5's F1 from 0.349 to 0.498 (over 40% gain), and lower-tier models can surpass higher-tier counterparts when search is effective.

Hugging Face daily papers·Sep 10, 20:00 UTC · 6d agoAI research1

42

Dream-RSI: Recursive Self-Improvement through Evolving Worlds

Dream-RSI refines exploration policies by dreaming in replay simulators built from discovery history, cutting discovery costs across coding tasks.

Dream-RSI is a framework for scalable recursive self-improvement in autonomous coding agents, where a lightweight orchestration layer makes exploration explicit and programmable while leaving the underlying agent unchanged. Its core insight is that accumulated discovery history can serve as a replay simulator over the realized search space, providing immediate, low-cost off-policy feedback to evaluate and refine exploration policies without expensive online evaluations. Across algorithm engineering, mathematical optimization, and GPU kernel engineering, Dream-RSI achieves competitive or improved discovery quality at substantially reduced cost.

Hugging Face daily papers·Sep 13, 20:00 UTC · 3d agoAI research

32

Domain-Specific Hallucination Detection in Large Language Models

A multi-signal pipeline detects LLM hallucinations, reaching F1 0.915 on HaluEval and cutting Qwen2.5-0.5B hallucination rates from 85.5% to 37.7% via DPO.

The paper presents a hallucination detection pipeline combining fine-tuned DeBERTa-v3 classification, Monte Carlo Dropout uncertainty, and temperature-scaled calibration. It achieves F1 0.915 and AUROC 0.977 on general-domain HaluEval tasks, with MC Dropout inference raising accuracy to 93.2%. Applying DPO to a Qwen2.5-0.5B generator reduces its hallucination rate from 85.5% to 37.7%, while cross-domain evaluation shows poor general-domain transfer to SciFact (F1 0.52) and PubMedBERT fine-tuning as the strongest adaptation (F1 0.63).

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:45 UTC · 6d agoAI research1

32

Observational Indistinguishability and Integrity Blind Regions in Hybrid Quantum-Classical Workflows

Framework formalizes integrity blind regions in hybrid quantum-classical workflows, validated across 3,600 label interventions with conformal detection rules.

The paper presents a claim-relative evidence and reference framework for integrity of hybrid quantum-classical workflows, distinguishing structural blind regions caused by observational indistinguishability from finite-batch statistical misses. Experiments over 3,600 label interventions show exact label-path invariance for feature and prediction views. The geometry-aligned construction detects 343 of 2,700 conclusion-changing interventions using the conformal rule and 1,183 of 2,700 with the uncorrected union, with executed conformal clean false-action rates of 0.048-0.059.

arXiv cs.CR·Sep 15, 13:16 UTC · 1d agoResearch

12

Biology-in-the-loop: Amortized Adaptive Hit Discovery in CRISPR Screens

Researchers release AssayBench-Loop, a 1,389-screen CRISPR benchmark, and AssayLoop, a framework that learns adaptive hit discovery policies.

The paper introduces AssayBench-Loop, a large-scale benchmark of 1,389 CRISPR screens across five phenotype categories for adaptive hit discovery under budget constraints. It also introduces AssayLoop, which combines AssayFormer, a transformer-based amortized acquisition policy trained across historical screens, with LLM-derived biological priors via an adaptive handoff. On temporally held-out screens, AssayLoop achieves 5.67-fold enrichment over random selection and recovers 27.7% of hits after assaying roughly 5% of the candidate library, outperforming existing adaptive-design methods and standalone LLMs.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:45 UTC · 6d agoAI research1

30

Decomposition Buys Integrity, Not Yield

Study of 600 production deep-research traces finds agent-tree decomposition loses findings at rate N^(1-δ); flat architectures maximize yield.

The paper models multi-agent decomposition as a tree where an agent holding b items retains each with probability r(b); with r(b)=1/b every tree delivers exactly one finding regardless of shape. Analysis of 600 production deep-research traces estimates delta=0.34 retention decay, and 1,012 annotated traces show one brief in sixteen goes off-target per tier, giving an alignment penalty of 0.536. Depth still cuts root context exposure from N to N^(1/k) and is cheaper at scale, with a hazard model over 743,819 production tool calls showing delegation is an opening move rather than a response to filling context.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:04 UTC · 1d agoAI research

30

ZGCM-1: A Fully Open and Extremely Efficient Foundation Model for Math and Agentic Search

ZGCM-1 is a fully open 7B foundation model with 256K context that stays competitive with frontier models on math reasoning and agentic search.

ZGCM-1 is a fully open 7B dense foundation model trained from scratch using an efficiency-focused recipe: interleaved gated sliding-window and full attention, a stable FP8 Muon optimizer, and MDP-based mid-training with context scaling across 16K, 64K, and 256K. On mathematical reasoning and agentic search suites it remains competitive with much larger frontier models such as Qwen3-235B-A22B and GLM-5.1. The recipe yields a ~4.2x improvement in 16K pre-training time-to-loss, and all weights, checkpoints, training code, data recipes, and W&B logs are open-sourced.

Hugging Face daily papers·Sep 10, 20:00 UTC · 6d agoModel release

50