Comparing Edge-based and Node-based Methods on a Citation Prediction Task (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Citation Prediction is the task of estimating whether paper a cites paper b. |
| Approach: | They propose a new Citation Prediction task that evaluates both a node-based model and an edge-based one to quantify these trends. |
| Outcome: | The proposed model improves with larger training sets and degrades with longer forecast horizons. |
Similar Papers
Rethinking Complex Neural Network Architectures for Document Classification (N19-1)
Copied to clipboard
| Challenge: | Neural network models for many NLP tasks have grown increasingly complex in recent years . authors of recent papers question the necessity of such architectures and find them quite effective . |
| Approach: | They propose to use regularization techniques borrowed from language modeling to improve model accuracy . they find that a simple biLSTM architecture with appropriate regularization yields competitive results . |
| Outcome: | a simple biLSTM model outperforms the state-of-the-art on four benchmark datasets . authors say that improvements are not real, but are attributed to mundane reasons . |
Realistic Citation Count Prediction Task for Newly Published Papers (2023.findings-eacl)
Copied to clipboard
| Challenge: | Existing studies on citation count prediction assume that future citation counts of academic papers have not had enough time pass since publication. |
| Approach: | They propose to use citation counts of newly published papers as a realistic citation count prediction task and to use them to leverage the citations of papers shortly after publication. |
| Outcome: | The proposed methods significantly improve the performance of citation count prediction for newly published papers in a realistic setting. |
Is Peer-Reviewing Worth the Effort? (2025.coling-main)
Copied to clipboard
| Challenge: | Using early returns and venue, we can predict which papers will be highly cited in the future. |
| Approach: | They ask whether early returns are predictive of papers' citations . |
| Outcome: | The authors show early returns are more predictive than venue . early returns also predicts which papers will be highly cited in the future . |
The Dots Have Their Values: Exploiting the Node-Edge Connections in Graph-based Neural Models for Document-level Relation Extraction (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for document-level relation extraction do not capture the representations of the nodes in the graphs. |
| Approach: | They propose to explicitly compute the representations for the nodes in the graph-based edge-oriented model for Document-level Relation Extraction (DRE) . they propose to introduce two novel representation regularization mechanisms to improve the representation vectors for DRE. |
| Outcome: | The proposed model achieves state-of-the-art performance on two benchmark datasets. |
An Efficient Retrieval-Based Method for Tabular Prediction with LLM (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods for tabular prediction rely on extensive pre-training or fine-tuning of LLMs . a retrieval-based approach eliminates the need for training any modules or performing data augmentation . |
| Approach: | They propose a retrieval-based approach that utilizes the powerful capabilities of large language models in representation, comprehension, and inference. |
| Outcome: | The proposed method exhibits strong predictive performance on tabular prediction task, affirming its practicality and effectiveness. |
Beyond Model Performance: Can Link Prediction Enrich French Lexical Graphs? (2024.lrec-main)
Copied to clipboard
| Challenge: | lexical resources are essential for the development of NLP systems, but with advances in language models and deep learning, they are increasingly being replaced by web-derived text. |
| Approach: | They propose a resource-centric study of link prediction approaches over French lexical-semantic graphs. |
| Outcome: | The proposed method is more accurate and reliable than previous methods. |
Even the Simplest Baseline Needs Careful Re-investigation: A Case Study on XML-CNN (2022.naacl-main)
Copied to clipboard
| Challenge: | XML-CNN has been a popular research topic in NLP due to its superior performance . however, the increasing complexity brings difficulties to ensure the true architectural progress . |
| Approach: | They propose to re-examine an influential multi-label text classification method . they propose suitable baselines for multi-level text classification tasks . |
| Outcome: | The proposed method performs better than the original model, the authors show . they show that the re-implementation reveals contradictory results to the original work . |
CITE: Benchmarking Heterogeneous Text-Attributed Graph Models (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models and text-aware graph learning have increased interest in reasoning over text-attributed graphs. |
| Approach: | They propose a large-scale heterogeneous text-attributed graph benchmark for catalytic materials that contains over 438K nodes and 1.2M edges . they establish standardized evaluation protocols for node classification and link prediction and conduct ablation studies to assess the impact of graph heterogenity and textual attributes. |
| Outcome: | The proposed benchmarks are compared to existing methods and provide a baseline for the evaluation of four classes of learning paradigms. |
Dynamic Head Selection for Neural Lexicalized Constituency Parsing (2025.acl-long)
Copied to clipboard
| Challenge: | Lexicalized parsing has traditionally been neglected in favor of unlexicalized, span-based methods. |
| Approach: | They propose a latent lexicalization framework that dynamically infers lexicals from data without relying on predefined head-finding rules. |
| Outcome: | The proposed model learns lexical dependencies directly from data, offering greater adaptability across languages and datasets. |
Instance-Based Neural Dependency Parsing (2021.tacl-1)
Copied to clipboard
Hiroki Ouchi, Jun Suzuki, Sosuke Kobayashi, Sho Yokoi, Tatsuki Kuribayashi, Masashi Yoshikawa, Kentaro Inui
| Challenge: | Existing models that use instance-based inference for dependency parsing are difficult to understand for humans. |
| Approach: | They develop neural models that adopt an interpretable inference process for dependency parsing. |
| Outcome: | The proposed models achieve competitive accuracy with standard neural models and have plausibility of instance-based explanations. |