EvoTree is proposed, a staged framework that decouples conceptual backbone learning from temporal refinement and is the only method with non-trivial marginal-paper detection on the annotated set, and is the only method with non-trivial marginal-paper detection on the annotated set.
Abstract
Surveys remain the primary way researchers grasp the lineage of methods within an AI subfield, but they scale poorly against the current rate of publication. Existing taxonomy-induction methods are largely leaf-bound and time-agnostic; they tend to force transitional papers into mature leaves and can create topological inversions between ancestors and descendants. We propose EvoTree, a staged framework that decouples conceptual backbone learning from temporal refinement: a graph-aware encoder with distribution-based hierarchical clustering yields a stable taxonomy backbone; temporal fine-tuning then re-attaches marginal papers to internal nodes under monotonic-path constraints; a final LLM pass labels concepts without altering the topology. We release the first annotated benchmark for this task across 11 AI subfields. EvoTree attains the highest NMI and citation-direction accuracy among all baselines and the best concept purity on the annotated benchmark, and is the only method with non-trivial marginal-paper detection on the annotated set.
Scientific papers may relate by problem, method, result, or contribution, but document-level retrievers collapse these into a single similarity score without saying why they are related. Citation- and similarity-based retrieval alone also confines search to the neighbourhood of what is already known, whereas generative...
Italo Luis da Silva, Hanqi Yan, Yujing Wang et al.· 0 citations
TaxCE is presented, a fully automated framework that constructs multi-level hierarchical taxonomies from raw text through progressive condensation of corpus content into actionable segments, deduplicated semantic units, and granular topics with definitions, which are then organized bottom-up into a hierarchy with corpu...
Sandeep Sricharan Mukku, Albert Nanda, Rohit Pyati· 0 citations
Text that accumulates over time does not only drift: topics are born, they die, they fragment into competing sub-narratives (splits), and they fuse into broader frames (merges). Our companion system paper, BERTilda, detects these events with transparent similarity and flow rules and validates them against human annotat...
The proposed LineageRAG is a graph-based Retrieval-Augmented Generation method, which constructs one evidence for each query-derived evidence demand and completes it with a verbatim source span when the selected evidence supports that demand.
Lin-Yao Zheng, Xu-Hang Shi, Zhi-Fang Mao et al.· 0 citations
A comprehensive evaluation of 17 state-of-the-art methods across Temporal Graph Neural Networks (TGNNs) and Large Language Model (LLM)-based paradigms reveals a clear capability divide between the two paradigms: TGNN-based methods excel at structural prediction but fail at semantic tracking, whereas LLM-based predictor...
A chronologically compiling 56 published papers from one research program yields a source-traceable author research portrait centered on tensor-network methods, with branches into quantum many-body research, tensor-network machine learning, and quantum-AI-oriented directions.
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduSep 24, 2026