paper_title stringlengths 6 162 | affiliation stringlengths 0 285 | research_domain stringclasses 462
values | task_type stringlengths 0 74 | core_problem stringlengths 0 434 | key_innovation stringlengths 0 494 | code_repository stringlengths 0 137 | model_name stringclasses 904
values | architecture_type stringclasses 436
values | model_size_parameters stringclasses 149
values | training_evaluation_dataset stringclasses 833
values | key_results stringlengths 0 710 | method_name stringlengths 0 123 | method_summary stringlengths 0 972 | analysis_target stringclasses 763
values | theoretical_tools stringclasses 496
values | key_findings stringclasses 663
values | prior_work_comparison stringclasses 386
values | limitations stringclasses 696
values | agent_framework_name stringclasses 30
values | environment_or_tools stringclasses 30
values | planning_mechanism stringclasses 35
values | eval_benchmark stringclasses 28
values | authors listlengths 0 41 | baseline_models listlengths 0 74 | paper_type stringclasses 4
values | type_name stringclasses 4
values | extraction_quality float64 0.07 1 | total_chars int64 714 661k | conference stringclasses 4
values | chunks listlengths 0 361 | hierarchy listlengths 0 373 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
LM-CPPF: Paraphrasing-Guided Data Augmentation for Contrastive Prompt-Based Few-Shot Fine-Tuning | School of Electrical and Computer Engineering, College of Engineering, University of Tehran, Tehran, Iran | Natural Language Processing | Few-shot text classification | Pre-trained language models struggle when fine-tuned on small datasets, and effective data augmentation methods for NLP remain challenging. | We propose LM-CPPF, which uses prompt-based few-shot paraphrasing with large language models (GPT-3, OPT-175B) for data augmentation in contrastive prompt-based fine-tuning, outperforming prior augmentation methods. | LM-CPPF with GPT-3 backbone achieves the best performance on all tasks, surpassing LM-BFF by 1.8-7.2 points. The Few-shot Paraphrasing data augmentation method also outperforms back translation and other techniques across tasks. | LM-CPPF | LM-CPPF combines Masked Language Modeling (MLM) loss and Supervised Contrastive (SupCon) loss in a prompt-based fine-tuning framework. For each input, it creates two views: the original prompt with demonstrations and a paraphrase of the target sentence (generated by an LLM) with different demonstrations. The MLM loss i... | [
"Amirhossein Abaskohi",
"Sascha Rothe",
"Yadollah Yaghoobzadeh"
] | [
"LM-BFF",
"LM-BFF+ SupConLoss",
"LM-BFF+ Multi-templates",
"LM-CPPF GPT-3",
"LM-CPPF OPT",
"LM-CPPF GPT-2",
"LM-CPPF FT GPT-2"
] | method_and_pipeline | Method and Pipeline | 0.923 | 37,540 | ACL | [
{
"content": "Amirhossein Abaskohi $^{1}$ , Sascha Rothe $^{2}$ , Yadollah Yaghoobzadeh $^{1,3}$\n$^{1}$ School of Electrical and Computer Engineering\nCollege of Engineering, University of Tehran, Tehran, Iran\n$^{2}$ Google DeepMind, Zürich, Switzerland\n$^{3}$ Tehran Institute for Advanced Studies, Khatam Un... | [
{
"title": "LM-CPPF: Paraphrasing-Guided Data Augmentation for Contrastive Prompt-Based Few-Shot Fine-Tuning",
"path": "abaskohi-etal-2023-lm.pdf/LM-CPPF: Paraphrasing-Guided Data Augmentation for Contrastive Prompt-Based Few-Shot Fine-Tuning",
"level": 1,
"summary": "Amirhossein Abaskohi $^{1}$ , S... | ||||||||||||||
"The Elephant in the Room: Analyzing the Presence of Big Tech in Natural Language Processing Researc(...TRUNCATED) | Institute for Better Health, Canada | Natural Language Processing | Industry Presence Analysis | "The growing but unquantified presence of Big Tech in NLP research raises concerns about scientific (...TRUNCATED) | "Combining manual CV analysis and automated metadata analysis of the ACL anthology to quantify and c(...TRUNCATED) | "Industry presence (especially Big Tech) in NLP research, including trends over time and influence o(...TRUNCATED) | [
"Mohamed Abdalla",
"Jan Philip Wahle",
"Terry Ruas",
"Aurélie Névéol",
"Fanny Ducel",
"Karën Fort"
] | [] | theory_and_analysis | Theory and Analysis | 0.643 | 86,692 | ACL | [{"content":"Mohamed Abdalla $^{\\spadesuit*}$ , Jan Philip Wahle $^{\\spadesuit*}$ Terry Ruas $^{\\(...TRUNCATED) | [{"title":"The Elephant in the Room: Analyzing the Presence of Big Tech in Natural Language Processi(...TRUNCATED) | ||||||||||||||||
How About Kind of Generating Hedges using End-to-End Neural Models? | INRIA | Natural Language Processing | Hedge Generation | "End-to-end large language models are not able to implicitly learn when and how to generate hedges i(...TRUNCATED) | "A reranking approach that selects the best candidate hedge from a pool generated by fine-tuned lang(...TRUNCATED) | "Reranked models R_BlenderBot and R_DialoGPT achieve higher BLEU and F1 scores than their base count(...TRUNCATED) | "The approach first fine-tunes a language model on a peer-tutoring dialogue dataset to generate cand(...TRUNCATED) | [
"Chloé Clavel",
"Justine Cassell"
] | ["BART","BlenderBot","DialoGPT","R_BlenderBot","R_DialoGPT","BART (Reranking)","BlenderBot (Rerankin(...TRUNCATED) | method_and_pipeline | Method and Pipeline | 0.846 | 52,033 | ACL | [{"content":"Alafate Abulimiti $^{1,2}$ , Chloé Clavel $^{3}$ , Justine Cassell $^{1,4}$\n$^{1}$ IN(...TRUNCATED) | [{"title":"How About Kind of Generating Hedges using End-to-End Neural Models?","path":"abulimiti-et(...TRUNCATED) | |||||||||||||||
"What are the Desired Characteristics of Calibration Sets? Identifying Correlates on Long Form Scien(...TRUNCATED) | Columbia University | Natural Language Processing | Calibration for Summarization | "Prior work on calibration for summarization focuses on how to generate and optimize sets, but littl(...TRUNCATED) | "A systematic analysis of calibration set characteristics across three scientific long-form summariz(...TRUNCATED) | https://github.com/griff4692/calibrating-summaries | "The relationship between calibration set characteristics (such as lexical diversity, metric margin,(...TRUNCATED) | "As we cannot control for all confounding variables when examining the correlates of the most effect(...TRUNCATED) | ["Griffin Adams","Yingce Xia","Shufang Xie","Anna Ostropolets","Budhaditya Deb","Yuan-Jyue Chen","Tr(...TRUNCATED) | [] | theory_and_analysis | Theory and Analysis | 0.786 | 91,675 | ACL | [{"content":"Griffin Adams $^{♠,♣*}$ griffin.adams@columbia.edu\nBichlien H Nguyen $^{♦}$ bngu(...TRUNCATED) | [{"title":"What are the Desired Characteristics of Calibration Sets? Identifying Correlates on Long (...TRUNCATED) | ||||||||||||||
Generating EDU Extracts for Plan-Guided Summary Re-Ranking | Natural Language Processing | Plan-guided summary re-ranking | "Standard decoding methods for generating summary candidates produce redundant and low-quality conte(...TRUNCATED) | "A method to generate diverse, high-quality summary candidates by first generating EDU content plans(...TRUNCATED) | https://github.com/griff4692/edu-sum | "PGA achieves ROUGE-2 F1 gains of 0.75 on CNN/DM (23.81 vs 23.06), 1.94 on NYT (38.55 vs 36.61), and(...TRUNCATED) | Plan-Guided Abstraction (PGA) | "The method consists of two stages: (1) training an EDU-level content plan generator that auto-regre(...TRUNCATED) | [
"Griffin Adams",
"Faisal Ladhak",
"Kathleen McKeown",
"Noémie Elhadad"
] | ["Beam Search","Diverse Beam Search","Nucleus Sampling","SimCLS","SummaReRanker","BRIO-Ctr","SummaFu(...TRUNCATED) | method_and_pipeline | Method and Pipeline | 0.923 | 60,592 | ACL | [{"content":"Griffin Adams $^{♠,♣}$ griffin.adams@columbia.edu\nAlexander R. Fabbri $^{◇}$ afa(...TRUNCATED) | [{"title":"Generating EDU Extracts for Plan-Guided Summary Re-Ranking","path":"adams-etal-2023-gener(...TRUNCATED) | ||||||||||||||
The Mechanical Bard: An Interpretable Machine Learning Approach to Shakespearean Sonnet Generation | Duke University, Durham, NC | Natural Language Processing | Shakespearean Sonnet Generation | "Existing automated poetry generation methods either rely on large models that struggle to consisten(...TRUNCATED) | "A novel constrained decoding method that employs part-of-speech templates extracted from Shakespear(...TRUNCATED) | "The proposed sonnet generation model achieves statistically significant higher mean scores (p<0.05)(...TRUNCATED) | "The method fine-tunes GPT-2 on poetry and sonnets. For each line, it samples k random templates, th(...TRUNCATED) | [
"Edwin Agnew",
"Michelle Qiu",
"Lily Zhu",
"Sam Wiseman",
"Cynthia Rudin"
] | [
"PoeTryMe",
"Benhardt et al.",
"Human-written poems"
] | method_and_pipeline | Method and Pipeline | 0.846 | 39,079 | ACL | [{"content":"Edwin Agnew $^{*}$ , Michelle Qiu $^{*}$ , Lily Zhu $^{*}$ , Sam Wiseman, Cynthia Rudin(...TRUNCATED) | [{"title":"The Mechanical Bard: An Interpretable Machine Learning Approach to Shakespearean Sonnet G(...TRUNCATED) | |||||||||||||||
Learning Neuro-Symbolic World Models with Conversational Proprioception | IBM Research | Reinforcement Learning | Neuro-Symbolic World Model Learning | "Existing neuro-symbolic agents for text-based games are model-free and lack explicit world models, (...TRUNCATED) | "A novel neuro-symbolic method for learning logical world models from noisy semantic parsing, enhanc(...TRUNCATED) | "Our full method (Model-based NeSA with proprioception) achieves 100% normalized score on Easy and M(...TRUNCATED) | "The method operates on text-based game environments with natural language observations. It uses a s(...TRUNCATED) | [
"Don Joven Agravante",
"Daiki Kimura",
"Michiaki Tatsubori",
"Asim Munawar",
"Alexander Gray"
] | ["TWC agent (DL-only)[AAAI 2021]","Model-free NeSAbased on [EMNLP 2021]","Model-free NeSA(REINFORCE)(...TRUNCATED) | method_and_pipeline | Method and Pipeline | 0.846 | 29,174 | ACL | [{"content":"Don Joven Agravante and Daiki Kimura and Michiaki Tatsubori and Asim Munawar and Alexan(...TRUNCATED) | [{"title":"Learning Neuro-Symbolic World Models with Conversational Proprioception","path":"agravant(...TRUNCATED) | |||||||||||||||
Multimodal Persona Based Generation of Comic Dialogs | IIT Delhi | Natural Language Processing | Multimodal Dialogue Generation | "Existing dialogue generation models do not account for visual information and are limited to two-pa(...TRUNCATED) | "Proposes MPDIALOG, a multimodal persona-based architecture that interleaves text and visual embeddi(...TRUNCATED) | MPDIALOG | Vision-Language Transformer | Comic Dialog dataset | "MPDIALOG achieves best perplexity of 19.02 (seen) and 25.75 (unseen), and highest MaUde of 0.898 (s(...TRUNCATED) | [
"Harsh Agrawal",
"Manish Gupta"
] | [] | model_architecture | Model Architecture | 0.857 | 54,232 | ACL | [{"content":"Harsh Agrawal\nIIT Delhi\nAditya M. Mishra\nIIT Delhi\nharsh.ag14901@gmail.com mishramo(...TRUNCATED) | [{"title":"Multimodal Persona Based Generation of Comic Dialogs","path":"agrawal-etal-2023-multimoda(...TRUNCATED) | |||||||||||||
"Script Normalization for Unconventional Writing of Under-Resourced Languages in Bilingual Communiti(...TRUNCATED) | Department of Computer Science, George Mason University | Natural Language Processing | Script Normalization | "Unconventional writing of under-resourced languages in bilingual communities leads to noisy data th(...TRUNCATED) | "Using synthetic data with varying noise levels and a transformer-based model to normalize scripts b(...TRUNCATED) | "Our script normalization model outperforms the naive baseline, especially at high noise levels (e.g(...TRUNCATED) | "The method operates on script normalization for under-resourced languages. It creates script mappin(...TRUNCATED) | [
"Sina Ahmadi",
"Antonios Anastasopoulos"
] | [
"naive baseline (no normalization)",
"pre-trained fastText language identification model"
] | method_and_pipeline | Method and Pipeline | 0.846 | 83,608 | ACL | [{"content":"Sina Ahmadi\nAntonios Anastasopoulos\nDepartment of Computer Science\nGeorge Mason Univ(...TRUNCATED) | [{"title":"Script Normalization for Unconventional Writing of Under-Resourced Languages in Bilingual(...TRUNCATED) | |||||||||||||||
MPCHAT: Towards Multimodal Persona-Grounded Conversation | Seoul National University | Multimodal Dialogue Systems | Multimodal Persona-Grounded Dialogue | "Previous research on persona-based dialogue only uses textual personal facts or personalities, lack(...TRUNCATED) | "First multimodal persona-grounded dialogue dataset (MPCHAT) with image-sentence pairs for episodic (...TRUNCATED) | "The approach uses separate text (SBERT or CLIP) and image (ViT or CLIP) encoders to encode persona (...TRUNCATED) | [
"Jaewoo Ahn",
"Yeda Song",
"Sangdoo Yun",
"Gunhee Kim"
] | [] | method_and_pipeline | Method and Pipeline | 0.692 | 93,685 | ACL | [{"content":"Jaewoo Ahn $^{1}$\nYeda Song $^{1}$\nSangdoo Yun $^{2,1}$\nGunhee Kim $^{1}$\n$^{1}$ Se(...TRUNCATED) | [{"title":"MPCHAT: Towards Multimodal Persona-Grounded Conversation","path":"ahn-etal-2023-mpchat.pd(...TRUNCATED) |
End of preview. Expand in Data Studio
Top ML Conference Papers 2023
A dataset of 7,035 papers from ACL 2023, CVPR 2023, ICLR 2023, and NeurIPS 2023, processed with KNOWHERE — a document understanding pipeline that prepares unstructured data for AI agents.
GitHub Repo: https://github.com/Ontos-AI/knowhere
| Conference | Papers | Domain |
|---|---|---|
| ACL 2023 | 1,044 | Natural Language Processing |
| CVPR 2023 | 2,248 | Computer Vision |
| ICLR 2023 | 545 | Machine Learning |
| NeurIPS 2023 | 3,198 | Machine Learning |
Construction
Built with KNOWHERE:
- PDF Parsing — KNOWHERE parses each PDF into structured chunks (
chunks.json): text blocks with section paths. The dataset retains each chunk'scontentandpath. - Hierarchy Extraction — KNOWHERE outputs a
doc_nav.jsonsection tree per paper, with title, path, level, summary, chunk_count, and recursive children. - Agentic Extraction — An LLM pipeline classifies papers into 4 types and extracts fields from KNOWHERE's parsed chunks and section hierarchy.
- Assembly — Extraction fields + KNOWHERE chunks + hierarchy merge into unified records.
Applications
- Literature analysis and survey support — structured extraction fields (method, results, baselines) enable systematic literature review, cross-conference trend tracking, and automated survey generation
- Benchmark for PDF parsing & scientific understanding — evaluate document parsing pipelines and information extraction models on real academic papers with ground-truth hierarchy and typed fields
- Foundation for AI for Science experiments — structured paper representations serve as input for downstream tasks such as paper generation, research idea proposal, and citation-aware knowledge construction
Field Schema
All 24 extraction fields appear in every record. Fields not applicable to a paper's type are empty strings (or empty lists).
Common (all papers)
| Field | Type | Description |
|---|---|---|
paper_title |
string | Verbatim title |
authors |
list[string] | Author names |
affiliation |
string | First author's institution |
research_domain |
string | AI/CS subfield |
task_type |
string | Specific technical task |
core_problem |
string | Unresolved limitation |
key_innovation |
string | Primary contribution |
code_repository |
string | Code URL (if stated) |
model_architecture (1,004 papers)
| Field | Description |
|---|---|
model_name |
Proposed model name |
architecture_type |
Design paradigm (e.g., Transformer) |
model_size_parameters |
Parameter count |
training_evaluation_dataset |
Datasets used |
key_results |
Quantitative results |
method_and_pipeline (5,196 papers)
| Field | Description |
|---|---|
method_name |
Proposed method name |
method_summary |
Core mechanism |
baseline_models |
list[string] — baselines compared |
key_results |
Advantage over baselines |
theory_and_analysis (798 papers)
| Field | Description |
|---|---|
analysis_target |
Object/phenomenon studied |
theoretical_tools |
Proof techniques |
key_findings |
Theorems or conclusions |
prior_work_comparison |
Comparison to prior results |
limitations |
Assumptions or scope |
agent_system (37 papers)
| Field | Description |
|---|---|
agent_framework_name |
Proposed framework name |
environment_or_tools |
Environments/tools used |
planning_mechanism |
Reasoning strategy |
eval_benchmark |
Evaluation benchmarks |
key_results |
Benchmark performance |
Structural & Metadata
| Field | Type | Description |
|---|---|---|
paper_type |
string | Classification key |
type_name |
string | Human-readable type name |
extraction_quality |
float | Non-null field fraction |
total_chars |
int | Paper character count |
conference |
string | Source conference |
chunks |
list[{content, path}] | KNOWHERE text chunks |
hierarchy |
list[{title, path, level, summary, chunk_count}] | KNOWHERE section tree |
Formats
- JSONL — Nested hierarchy tree with recursive
children, human-readable. - Parquet — Columnar format, Zstd compression; hierarchy flattened to depth-first list.
Loading
from datasets import load_dataset
ds = load_dataset("JensCS/top-ml-conference-papers-2023", split="train")
print(ds[0]["paper_title"])
print(ds[0]["conference"], ds[0]["paper_type"])
# Type-specific fields
agent = ds.filter(lambda x: x["paper_type"] == "agent_system")
print(agent[0]["agent_framework_name"])
# KNOWHERE hierarchy
for sec in ds[0]["hierarchy"]:
depth = " " * (sec["level"] - 1)
print(f"{depth}├─ {sec['title']}")
Pipeline
KNOWHERE → Parse → Structure → Build Memory → Agentic extraction → Dataset assembly.
License
CC BY 4.0. Original papers retain their respective copyrights.
- Downloads last month
- 141
