Analyze Like a Venture Capitalist: Information-Gain and Knowledge Enhanced Graph Reasoning for Startup Success Prediction (2026.findings-acl)
Copied to clipboard
| Challenge: | Most venture capital investments fail, while a few deliver outsized returns. |
| Approach: | They propose a framework that synthesizes relational evidence across sources . they propose combining information-gain-driven retriever and knowledge base to ground reasoning . |
| Outcome: | The proposed framework achieves +5.9% F1 and +22.1% Precision@5 over state-of-the-art baselines. |
Similar Papers
Noisy Positive-Unlabeled Learning with Self-Training for Speculative Knowledge Graph Reasoning (2023.findings-acl)
Copied to clipboard
Ruijie Wang, Baoyu Li, Yichen Lu, Dachun Sun, Jinning Li, Yuchen Yan, Shengzhong Liu, Hanghang Tong, Tarek Abdelzaher
| Challenge: | State-of-the-art methods fail in speculative reasoning task on knowledge graphs . state-of the-art approaches assume correctness of fact is determined by its presence in KG . |
| Approach: | They propose a speculative reasoning task on real-world knowledge graphs . they propose nPUGraph that estimates correctness of both collected and uncollected facts . |
| Outcome: | The proposed framework improves the robustness of a label posterior-aware graph encoder against false positive links and identifies missing facts to provide high-quality grounds of reasoning. |
MARS: Unleashing the Power of Speculative Decoding via Margin-Aware Verification (2026.findings-acl)
Copied to clipboard
Jingwei Song, Xinyu Wang, Hanbin Wang, Xiaoxuan Lei, Tianyu Shi, Shixin Han, Eric Yang, Xiao-Wen Chang, Lynn Ai
| Challenge: | Autoregressive large language models suffer from high inference latency due to memorybandwidth constraints. |
| Approach: | They propose a method that decouples generation and verification by decoupling tokens and a lightweight draft model. |
| Outcome: | The proposed method delivers consistent and significant speedups over state-of-the-art baselines while preserving generation quality across diverse benchmarks. |
Zero-shot Graph Reasoning via Retrieval Augmented Framework with LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods that require extensive finetuning or depend on predefined algorithms are limited by training. |
| Approach: | a new retrieval-augmented framework is proposed that harnesses retrieval and large language models to address graph reasoning tasks. |
| Outcome: | The proposed method achieves 100% accuracy on most graph reasoning tasks while maintaining consistent token costs regardless of graph sizes. |
GraphCheck: Breaking Long-Term Text Barriers with Extracted Knowledge Graph-Powered Fact-Checking (2025.acl-long)
Copied to clipboard
Yingjian Chen, Haoran Liu, Yinhong Liu, Jinxiang Xie, Rui Yang, Han Yuan, Yanran Fu, Peng Yuan Zhou, Qingyu Chen, James Caverlee, Irene Li
| Challenge: | Existing fact-checking methods that use large language models often generate subtle factual errors. |
| Approach: | They propose a fact-checking framework that uses extracted knowledge graphs to enhance text representation. |
| Outcome: | GraphCheck outperforms existing specialized fact-checkers on seven benchmarks spanning general and medical domains . Graph Neural Networks process extracted knowledge graphs as a soft prompt, enabling efficient fact- checking in a single inference call. |
Domaino1s: Guiding LLM Reasoning for Explainable Answers in High-Stakes Domains (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing Large Language Models (LLMs) generate brief answers without reasoning processes and explanations. |
| Approach: | They propose supervised fine-tuning and tree search to enhance LLMs’ reasoning capabilities on domain tasks. |
| Outcome: | The proposed model improves on stock investment recommendation and legal reasoning QA tasks. |
Figure It Out: Improve the Frontier of Reasoning with Executable Visual States (2026.acl-long)
Copied to clipboard
| Challenge: | Recent reasoning models fail to capture structural constraints in complex settings. |
| Approach: | They propose a visual-based reasoning system that integrates executable visual construction into multi-turn reasoning via end-to-end reinforcement learning. |
| Outcome: | The proposed model outperforms strong text-only chain-of-thought models on seven mathematical benchmarks and improves by 13.12% on AIME 2025 and 11.00% on BeyondAIME. |
Beyond Scaling: Predicting Patent Approval with Domain-specific Fine-grained Claim Dependency Graph (2024.acl-long)
Copied to clipboard
| Challenge: | Scaling up language models has demonstrated predictable improvement and unprecedented abilities in many language tasks. |
| Approach: | They propose a fine-grained cLAim depeNdency graph that captures the dependencies within the patent data and extends the embedding-based state-of-the-art (SOTA) they then explore prompt-based methods to harness proprietary LLMs' potential, but find the best results close to random guessing, underlining the ineffectiveness of model scaling-up. |
| Outcome: | The proposed graph methods outperform the standard model scaling methods in the patent approval prediction task and show that they are cost-effective. |
LATENTLOGIC: Learning Logic Rules in Latent Space over Knowledge Graphs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for learning logic rules for knowledge graph reasoning face limitations such as searching in vast search space and inefficient optimization. |
| Approach: | They propose a framework to efficiently mine logic rules by controllable generation in the latent space by a pre-trained VAE and a discriminator. |
| Outcome: | The proposed framework efficiently mines logic rules by controllable generation in the latent space. |
GRIL: Knowledge Graph Retrieval-Integrated Learning with Large Language Models (2025.findings-emnlp)
Copied to clipboard
Jialin Chen, Houyu Zhang, Seongjun Yun, Alejandro Mottini, Rex Ying, Xiang Song, Vassilis N. Ioannidis, Zheng Li, Qingjun Cui
| Challenge: | Existing graph RAGs decouple retrieval and reasoning processes, preventing adaptability . existing graph Raggings depend heavily on ground-truth entities, which are often unavailable in open-domain settings. |
| Approach: | They propose a graph retriever that is trained end-to-end with large-scale graphs . structure and semantic features are encoded via soft tokens and the verbalized graph . |
| Outcome: | The proposed approach improves the performance of large-scale graph retrieval models by grounding it with external knowledge. |
Inductive Knowledge Graph Completion with GNNs and Rules: An Analysis (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for inductive knowledge graph completion are underperforming . implausible entities are not ranked and only the most informative path is taken into account . |
| Approach: | They propose to use a rule-based approach to find plausible triples missing from a given KG. |
| Outcome: | The proposed models outperform state-of-the-art methods on inductive knowledge graph completion. |