Lacuna: A Research Map for Machine Learning
- URL: http://arxiv.org/abs/2606.26246v1
- Date: Wed, 24 Jun 2026 18:00:12 GMT
- Title: Lacuna: A Research Map for Machine Learning
- Abstract summary: Lacuna is a research map for machine learning that uses LLMs to turn papers and scholarly metadata into markdown summaries.<n>Across LitSearch, Multi-XScience-CS/ML, and ScholarQA-CS-ML, Lacuna outperforms OpenScholar with the strongest gains on LitSearch retrieval.<n>We also evaluate Lacuna Deep Research, a multi-stage report agent over the map, on 25 ReportBench-ML survey tasks.
- Score: 49.4551062599854
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Lacuna is a research map for machine learning that uses LLMs to turn papers and scholarly metadata into markdown summaries, concept elements, research directions, and research proposals. Each item keeps links to the primary source records and papers that support it. We release the map with web, markdown, and MCP interfaces. Across LitSearch, Multi-XScience-CS/ML, and ScholarQA-CS-ML, Lacuna outperforms OpenScholar with the strongest gains on LitSearch retrieval (Recall@10 0.538 vs. 0.424 for OpenScholar v3). We also evaluate Lacuna Deep Research, a multi-stage report agent over the map, on 25 ReportBench-ML survey tasks: Lacuna Deep Research reaches 0.052 citation F1, 0.339 citation precision, 99 expert-reference hits, and 7.82/10 RACE report quality, while GPT-Researcher reaches 0.039 F1, 0.290 precision, 72 hits, and 5.24/10 RACE.
Related papers
- Your Retriever Already Knows: Distribution-Shape QPP for RAG Retrieval Sufficiency [0.0]
Motivated by a Czech nuclear-regulator deployment, we compare three Query Performance Prediction (QPP) paradigms for retrieval sufficiency in RAG.<n>Our 24 non-lexical features reach a weighted-average AUROC of 0.856 at 2 ms per query, ahead of a classic-QPP literature pool.<n>Adding the LLM judgment as one feature (hybrid) matches S1 on ViDoRe (0.863) but gains a statistically significant edge on SJB.
arXiv Detail & Related papers (2026-09-10T14:52:16Z) - Delta-Based Neural Architecture Search: LLM Fine-Tuning via Code Diffs [48.83701310501069]
Large language models (LLMs) show strong potential for neural architecture generation.<n>Existing approaches produce complete model implementations from scratch.<n>We propose Delta-Code Generation, where fine-tuned LLMs generate compact unified diffs.
arXiv Detail & Related papers (2026-05-06T13:32:05Z) - TiAb Review Plugin: A Browser-Based Tool for AI-Assisted Title and Abstract Screening [0.0]
TiAb Review is an open-source Chrome browser extension.<n>It offers three screening modes: manual review, large language model (LLM) batch screening, and machine learning (ML) active learning.
arXiv Detail & Related papers (2026-04-08T03:05:14Z) - The Science Data Lake: A Unified Open Infrastructure Integrating 293 Million Papers Across Eight Scholarly Sources with Embedding-Based Ontology Alignment [0.0]
We present the Science Data Lake, a locally-deployable infrastructure built on DuckDB and Parquet files.<n>The resource comprises approximately 960GB of Parquet files spanning 293 million uniquely identifiable papers.<n>The resource is open source, deployable remotely via HuggingFace, and includes structured documentation suitable for large language model (LLM) based research agents.
arXiv Detail & Related papers (2026-03-03T15:58:18Z) - SAGE: Benchmarking and Improving Retrieval for Deep Research Agents [60.53966065867568]
We introduce SAGE, a benchmark for scientific literature retrieval comprising 1,200 queries across four scientific domains, with a 200,000 paper retrieval corpus.<n>We evaluate six deep research agents and find that all systems struggle with reasoning-intensive retrieval.<n> BM25 significantly outperforms LLM-based retrievers by approximately 30%, as existing agents generate keyword-oriented sub-queries.
arXiv Detail & Related papers (2026-02-05T18:25:24Z) - LLM-Guided Probabilistic Fusion for Label-Efficient Document Layout Analysis [6.908972852063454]
Document layout understanding remains data-intensive despite advances in semi-supervised learning.<n>We present a framework that enhances semi-supervised detection by fusing visual predictions with structural priors.<n>Our method demonstrates consistent gains across model scales.
arXiv Detail & Related papers (2025-11-12T02:25:58Z) - Let's Use ChatGPT To Write Our Paper! Benchmarking LLMs To Write the Introduction of a Research Paper [64.50822834679101]
SciIG is a task that evaluates LLMs' ability to produce coherent introductions from titles, abstracts, and related works.<n>We assess five state-of-the-art models, including open-source (DeepSeek-v3, Gemma-3-12B, LLaMA 4-Maverick, MistralAI Small 3.1) and closed-source GPT-4o systems.<n>Results demonstrate LLaMA-4 Maverick's superior performance on most metrics, particularly in semantic similarity and faithfulness.
arXiv Detail & Related papers (2025-08-19T21:11:11Z) - LitSearch: A Retrieval Benchmark for Scientific Literature Search [48.593157851171526]
We introduce LitSearch, a retrieval benchmark comprising 597 realistic literature search queries about recent ML and NLP papers.
All LitSearch questions were manually examined or edited by experts to ensure high quality.
We find a significant performance gap between BM25 and state-of-the-art dense retrievers, with a 24.8% absolute difference in recall@5.
arXiv Detail & Related papers (2024-07-10T18:00:03Z) - LOCR: Location-Guided Transformer for Optical Character Recognition [55.195165959662795]
We propose LOCR, a model that integrates location guiding into the transformer architecture during autoregression.
We train the model on a dataset comprising over 77M text-location pairs from 125K academic document pages, including bounding boxes for words, tables and mathematical symbols.
It outperforms all existing methods in our test set constructed from arXiv, as measured by edit distance, BLEU, METEOR and F-measure.
arXiv Detail & Related papers (2024-03-04T15:34:12Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.