Challenge: Experimental evaluations demonstrate that our RNA FM consistently outperforms existing RNA .
Approach: They propose to use filtered high-fidelity structure annotations to enhance the modeling ability of FMs in single nucleotide resolution tasks.
Outcome: The proposed model outperforms existing RNA FMs on four genomic benchmarks and achieves top-tier results on DNA genomic benchmark.

Similar Papers

Toward Building General Foundation Models for Language, Vision, and Vision-Language Understanding Tasks (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing foundation models can only perform the best in one type of understanding tasks.
Approach: They propose a method for training a general foundation model, X-FM, using text, image, and image-text data.
Outcome: The proposed method outperforms existing foundation models on language, vision, and vision-language understanding tasks.
mPLUG-DocOwl 1.5: Unified Structure Learning for OCR-free Document Understanding (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing Multimodal Large Language Models lack general structure understanding abilities for text-rich document images.
Approach: They propose to use unified structure learning to boost the performance of MLLMs by encoding structure information into text-rich images.
Outcome: The proposed model achieves state-of-the-art on 10 visual document understanding benchmarks.
Unleashing the True Potential of Sequence-to-Sequence Models for Sequence Tagging and Structure Parsing (2023.tacl-1)

Copied to clipboard

Challenge: Sequence-to-Sequence (S2S) models have been successful on text generation tasks . however, learning complex structures with S2S models remains challenging .
Approach: They propose to use constrained decoding to model part-of-speech tagging, named entity recognition, constituency, and dependency parsing tasks with 3 lexically diverse linearization schemas and corresponding constrained coding methods.
Outcome: The proposed methods outperform the state-of-the-art on four core tasks.
Complicate Then Simplify: A Novel Way to Explore Pre-trained Models for Text Classification (2022.coling-1)

Copied to clipboard

Challenge: Existing frameworks for text classification employing pre-trained models are constrained by the difficulty of the task.
Approach: They propose a framework which implements a two-stage training strategy to fully exploit the knowledge in pre-trained models.
Outcome: The proposed framework outperforms state-of-the-art classification models on six text classification corpora.
Structure-Aware Language Model Pretraining Improves Dense Retrieval on Structured Data (2023.findings-acl)

Copied to clipboard

Challenge: Structure Aware Dense Retrieval (SANTA) model encodes user queries and structured data in one universal embedding space for retrieving structured data.
Approach: They propose to use structured data and unstructured data to encode queries and structured data in one universal embedding space for retrieving structured data.
Outcome: The proposed model achieves state-of-the-art on code search and product search and conducts convincing results in the zero-shot setting.
A Survey on Foundation Language Models for Single-cell Biology (2025.acl-long)

Copied to clipboard

Challenge: Existing single-cell foundation language models are based on pre-trained and large language models.
Approach: They review the development of single-cell foundation language models . they discuss data tokenization strategies and pre-training paradigms .
Outcome: The proposed models have shown remarkable performance in a variety of single-cell data analysis tasks.
Latent Structure Models for Natural Language Processing (P19-4)

Copied to clipboard

Challenge: Latent structure models are a powerful tool for compositional data modeling and pipelines.
Approach: This tutorial will cover recent advances in discrete latent structure models . it will discuss their motivation, potential, and limitations .
Outcome: This tutorial will cover recent advances in discrete latent structure models . it will discuss their motivation, potential, and limitations .
SR-LLM: Rethinking the Structured Representation in Large Language Model (2025.acl-long)

Copied to clipboard

Challenge: Structured representations have long been pivotal in computational linguistics, but their role remains ambiguous in the Large Language Models (LLMs) era.
Approach: They propose a framework that integrates structured representations into LLMs from training-free and training-dependent perspectives.
Outcome: The proposed framework integrates structured representations through natural language descriptions in LLM prompts while augmenting the model’s inference capability through fine-tuning on linguistically described structured representation.
Leveraging AMR Graph Structure for Better Sequence-to-Sequence AMR Parsing (2024.lrec-main)

Copied to clipboard

Challenge: Recent studies on AMR parsing often regard this task as a seq2seq translation problem.
Approach: They propose to translate AMR graphs into AMR token sequences in pre-processing and recover AMR from sequences after decoding.
Outcome: The proposed approach outperforms baseline and achieves 85.5 0.1 and 84.2 0.2 Smatch scores on AMR 2.0 and AMR 3.0.
mPMR: A Multilingual Pre-trained Machine Reader at Scale (2023.acl-short)

Copied to clipboard

Challenge: Existing mPLMs only transfer NLU capability from source to target languages . mPMR allows direct inheritance of multilingual NLU capabilities to downstream tasks .
Approach: They propose a method to guide multilingual pre-trained language models to perform natural language understanding in multiple languages.
Outcome: mPMR enables multilingual pre-trained language models to perform natural language understanding (NLU) in multiple languages.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations