arXiv AI

Topological Void Analysis A Mathematical Framework for Systematic Technical Innovation Discovery in Knowledge Spaces

arXiv:2607. 00005v1 Announce Type: cross Abstract: Identifying where to innovate in a dense technical domain - such as operating systems or hardware/software co-design - is fundamentally a search problem in a high-dimensional knowledge space.

arXiv Computation and Language
Aug 28

BLANC: Discovering Patent White Space via Changes in Normalized Pointwise Mutual Information Between Multi-View Clusters

BLANC (Blank Landscape Analysis through NPMI Conditioning) is a three‑phase pipeline that uses multi‑view neural topic modeling across application/use, novelty, and inventive step, computes Normalized Pointwise Mutual Information (NPMI) to measure cross‑dimensional cluster association, and introduces a conditional detection step that flags combinations whose NPMI drops when the corpus is filtered by a keyword. The drop is quantified by a new metric, ΔNPMI, which identifies combinations that are established globally but unexplored locally. BLANC was evaluated on two USPTO corpora—machine learning/AI and glass compositions—by artificially depleting known technology combinations; it recovered 34.1% and 27.3% of the depleted pairs, respectively, while random removals rarely recovered the target, and it successfully identified a fluorine surface‑treatment × warpage‑suppression candidate in a proprietary float‑glass case.

By Shuichi Miyazawa, Kensuke Fujii
arXiv Computation and Language
Oct 1

Doc2LoRA Provides Decodable Representations of Scientific Ideas

Doc2LoRA introduces a method to represent scientific papers as LoRA adapters generated by a hypernetwork, enabling each point in the resulting vector space—whether a real paper or a mixture—to be interpreted by a large language model (LLM). The approach allows both search and generation: it achieves competitive search performance with models like SPECTER2 and EmbeddingGemma, while also enabling the LLM to label subfields and generate abstracts that smoothly transition between papers. The invertible transform ensures every point maps back to an LLM, making the embeddings usable for both querying and creative idea generation.

By Chand Sahil Mansuri, Joel Zachariah, Sadamori Kojaku
arXiv Machine Learning
Jun 2

Prototype Selection Using Topological Data Analysis

arXiv:2511. 04873v2 Announce Type: replace-cross Abstract: Prototype selection methods compress a training set, but the existing taxonomy of condensation, edition, hybrid, competence-based, optimization-based, and clustering-based families does not include methods that operate on the multi-scale topological structure of the data.

By Jordan Eckert, Elvan Ceyhan, Henry Schenck
arXiv AI
Aug 24

Toward Auto-Research: Mining Falsifiable Research Ideas from Paper Knowledge Graphs with Categorical Structure

The paper proposes a method for automated research‑idea generation that preserves the typed structure of scientific papers by modeling each paper as a small category with typed research entities as objects and asserted relations as morphisms. It introduces a three‑layer algorithm—categorical signature clustering, a functor‑preservation gate, and a six‑axis LLM plausibility judge—to identify cross‑domain analogies that maintain relation chains. Experiments on tens of thousands of papers show the categorical gate filters candidates at a 17:1 ratio while keeping a falsifier rate above 83%, and it logs rejected candidates with detailed rationale.

By Yuchen Wang, Zhongzhi Luan
arXiv Machine Learning
Oct 22

The Alien Space of Science: Sampling Coherent but Cognitively Unavailable Research Directions

arXiv:2603.01092v3 Announce Type: replace-cross Abstract: Scientific discovery is constrained not only by what is true, but by what is cognitively available to researchers. Many directions are cohere...

By Alejandro H. Artiles, Martin Weiss, Levin Brinkmann, Iyad Rahwan, Bernhard Sch\"olkopf, Christopher Pal, Hugo Larochelle, Anirudh Goyal, Nasim Rahaman
arXiv AI
Sep 3

When Evidence Shapes Collaboration: Knowledge-Conditioned Topology Generation for Multi-Agent Systems

The paper introduces K‑GAT, a neuro‑symbolic framework that generates multi‑agent collaboration topologies conditioned on external evidence, treating the design as a knowledge‑conditioned structure learning problem. Unlike prior methods that rely mainly on large language model parameters, K‑GAT integrates external evidence directly into autoregressive graph generation, reducing redundant interactions and improving verification in knowledge‑intensive tasks. Experiments on benchmarks such as the expert‑level GPQA dataset show K‑GAT achieving a +15.7% accuracy gain over the LLM‑Debate baseline while using fewer computational tokens.

By Yangxiao Jiang, Jiarun Fan, Mingcong Xu, Yanxi Guo, Jiwen Feng, Shanqing Xu, Mengchen Qian, Wei Chen, Xiaojin Zhang