NLP-CIC @ PRELEARN: Mastering prerequisites relations, from handcrafted features to embeddings

• URL: http://arxiv.org/abs/2011.03760v1
• Date: Sat, 7 Nov 2020 12:13:09 GMT
• Title: NLP-CIC @ PRELEARN: Mastering prerequisites relations, from handcrafted features to embeddings
• Authors: Jason Angel, Segun Taofeek Aroyehun, Alexander Gelbukh
• Abstract summary: We present our systems and findings for the prerequisite relation learning task (PRELEARN) at EVALITA 2020. The task aims to classify whether a pair of concepts hold a prerequisite relation or not. Our submissions ranked first place in both scenarios with average F1 score of 0.887 and 0.690 respectively across domains on the test sets.
• Score: 68.97335984455059
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present our systems and findings for the prerequisite relation learning task (PRELEARN) at EVALITA 2020. The task aims to classify whether a pair of concepts hold a prerequisite relation or not. We model the problem using handcrafted features and embedding representations for in-domain and cross-domain scenarios. Our submissions ranked first place in both scenarios with average F1 score of 0.887 and 0.690 respectively across domains on the test sets. We made our code is freely available.

Related papers

• Dual Consolidation for Pre-Trained Model-Based Domain-Incremental Learning [64.1745161657794]
  Domain-Incremental Learning (DIL) involves the progressive adaptation of a model to new concepts across different domains. Recent advances in pre-trained models provide a solid foundation for DIL. However, learning new concepts often results in the catastrophic forgetting of pre-trained knowledge. We propose DUal ConsolidaTion (Duct) to unify and consolidate historical knowledge.
  arXiv  Detail & Related papers  (2024-10-01T17:58:06Z)
• FamiCom: Further Demystifying Prompts for Language Models with Task-Agnostic Performance Estimation [73.454943870226]
  Language models have shown impressive in-context-learning capabilities. We propose a measure called FamiCom, providing a more comprehensive measure for task-agnostic performance estimation.
  arXiv  Detail & Related papers  (2024-06-17T06:14:55Z)
• Relational Proxies: Emergent Relationships as Fine-Grained Discriminators [52.17542855760418]
  We propose a novel approach that leverages information between the global and local part of an object for encoding its label. We design Proxies based on our theoretical findings and evaluate it on seven challenging fine-grained benchmark datasets. We also experimentally validate our theory and obtain consistent results across multiple benchmarks.
  arXiv  Detail & Related papers  (2022-10-05T11:08:04Z)
• Unifying Language Learning Paradigms [96.35981503087567]
  We present a unified framework for pre-training models that are universally effective across datasets and setups. We show how different pre-training objectives can be cast as one another and how interpolating between different objectives can be effective. Our model also achieve strong results at in-context learning, outperforming 175B GPT-3 on zero-shot SuperGLUE and tripling the performance of T5-XXL on one-shot summarization.
  arXiv  Detail & Related papers  (2022-05-10T19:32:20Z)
• Team Enigma at ArgMining-EMNLP 2021: Leveraging Pre-trained Language Models for Key Point Matching [0.0]
  We present the system description for our submission towards the Key Point Analysis Shared Task at ArgMining 2021. We leveraged existing state of the art pre-trained language models along with incorporating additional data and features extracted from the inputs (topics, key points, and arguments) to improve performance. We were able to achieve mAP strict and mAP relaxed score of 0.872 and 0.966 respectively in the evaluation phase, securing 5th place on the leaderboard.
  arXiv  Detail & Related papers  (2021-10-24T07:10:39Z)
• Yseop at FinSim-3 Shared Task 2021: Specializing Financial Domain Learning with Phrase Representations [0.0]
  We present our approaches for the FinSim-3 Shared Task 2021: Learning Semantic Similarities for the Financial Domain. The aim of this task is to correctly classify a list of given terms from the financial domain into the most relevant hypernym. Our system ranks 2nd overall on both metrics, scoring 0.917 on Average Accuracy and 1.141 on Mean Rank.
  arXiv  Detail & Related papers  (2021-08-21T10:53:12Z)
• A Frustratingly Easy Approach for Entity and Relation Extraction [25.797992240847833]
  We present a simple pipelined approach for entity and relation extraction. We establish the new state-of-the-art on standard benchmarks (ACE04, ACE05 and SciERC) Our approach essentially builds on two independent encoders and merely uses the entity model to construct the input for the relation model.
  arXiv  Detail & Related papers  (2020-10-24T07:14:01Z)
• R-VGAE: Relational-variational Graph Autoencoder for Unsupervised Prerequisite Chain Learning [83.13634692459486]
  We propose a model called Graph AutoEncoder (VGA-E) to predict concept relations within a graph consisting of concept resource nodes. Results show that our unsupervised approach outperforms graph-based semi-supervised methods and other baseline methods by up to 9.77% and 10.47% in terms of prerequisite relation prediction accuracy and F1 score. Our method is notably the first graph-based model that attempts to make use of deep learning representations for the task of unsupervised prerequisite learning.
  arXiv  Detail & Related papers  (2020-04-22T14:48:03Z)
• Gestalt: a Stacking Ensemble for SQuAD2.0 [0.0]
  We propose a deep-learning system that finds, or indicates the lack of, a correct answer to a question in a context paragraph. Our goal is to learn an ensemble of heterogeneous SQuAD2.0 models that outperforms the best model in the ensemble per se.
  arXiv  Detail & Related papers  (2020-04-02T08:09:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.