A Cascade Model for Argument Mining in Japanese Political Discussions: the QA Lab-PoliInfo-3 Case Study

• URL: http://arxiv.org/abs/2207.01672v1
• Date: Mon, 4 Jul 2022 18:49:18 GMT
• Title: A Cascade Model for Argument Mining in Japanese Political Discussions: the QA Lab-PoliInfo-3 Case Study
• Abstract summary: The rVRAIN team tackled the Budget Argument Mining (BAM) task, consisting of a combination of classification and information retrieval sub-tasks. For the argument classification (AC), the team achieved its best performing results with a five-class BERT-based cascade model complemented with some handcrafted rules. For the information retrieval (i.e., relation ID detection or RID), our best results were achieved by a combination of a BERT-based binary classifier, and the cosine similarity of pairs consisting of the monetary expression and budget dense embeddings.
• Score: 5.482532589225552
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The rVRAIN team tackled the Budget Argument Mining (BAM) task, consisting of a combination of classification and information retrieval sub-tasks. For the argument classification (AC), the team achieved its best performing results with a five-class BERT-based cascade model complemented with some handcrafted rules. The rules were used to determine if the expression was monetary or not. Then, each monetary expression was classified as a premise or as a conclusion in the first level of the cascade model. Finally, each premise was classified into the three premise classes, and each conclusion into the two conclusion classes. For the information retrieval (i.e., relation ID detection or RID), our best results were achieved by a combination of a BERT-based binary classifier, and the cosine similarity of pairs consisting of the monetary expression and budget dense embeddings.

Related papers

• Bridging Network Psychometrics and Artificial Intelligence: An Ising-Potts Model with LLM-Derived Weights [0.40611352512781873]
  We introduce a Rater Ising-Potts model that uses agreement indicators between ratings and category labels.<n>We evaluate the model on three constructed-response datasets spanning a corpus of K=14,466 short answers on a three-level rubric and two AERA essay prompts of roughly 1,200-1,400 responses on four-point rubrics.
  arXiv  Detail & Related papers  (2026-09-08T14:26:19Z)
• The Sample Complexity of Multiclass and Sparse Contextual Bandits [106.74652380822778]
  We aim to identify an approximately optimal policy from a given class based on bandit feedback.<n>Motivated by bandit multiclass classification with zero-one rewards, we focus on the emph$s$-sparse setting.<n>We show that, with $s$-sparse rewards, the induced model class admits a sharp DEC bound that scales with $s$ and directly yields the optimal rate.
  arXiv  Detail & Related papers  (2026-05-28T09:12:20Z)
• Efficient Elicitation of Collective Disagreements [4.197504510335754]
  We analyze the structure of the disagreement among a population of voters over a set of alternatives.<n>Surveys typically ask either for pairwise comparisons, simple and intuitive for participants, or full rankings over alternatives.
  arXiv  Detail & Related papers  (2026-05-19T08:23:58Z)
• Optimal Classification of Three-Qubit Entanglement with Cascaded Support Vector Machine [0.0]
  We introduce a systematic framework for three-qubit entanglement classification using a cascaded architecture of Support Vector Machine (SVM) classifiers.<n>We construct three distinct witness models ($mathcalM_B$, $mathcalM_W$, and $mathcalM_GHZ$) that sequentially discriminate between entanglement classes.<n>The proposed Cascaded model achieves an overall classification accuracy of $95%$ on a comprehensive dataset of mixed states.
  arXiv  Detail & Related papers  (2026-02-17T12:49:41Z)
• Context Attribution with Multi-Armed Bandit Optimization [11.715006981206844]
  We propose a novel framework that formulates context attribution as a multi-armed bandit (CMAB) problem.<n>We employ Combinatorial Thompson Sampling (CTS) to efficiently explore the exponentially large space of context subsets under a limited query budget.<n>Our method defines a reward function based on normalized token likelihoods, capturing how well a subset of segments supports the original model response.
  arXiv  Detail & Related papers  (2025-06-24T19:47:27Z)
• Splitting criteria for ordinal decision trees: an experimental study [6.575723870852787]
  Ordinal Classification (OC) is a machine learning field that addresses classification tasks where the labels exhibit a natural order. OC takes the ordinal relationship into account, producing more accurate and relevant results. This work conducts an experimental study of tree-based methodologies designed to capture ordinal relationships.
  arXiv  Detail & Related papers  (2024-12-18T10:41:44Z)
• A robust three-way classifier with shadowed granular-balls based on justifiable granularity [53.39844791923145]
  We construct a robust three-way classifier with shadowed GBs for uncertain data. Our model demonstrates in managing uncertain data and effectively mitigates classification risks.
  arXiv  Detail & Related papers  (2024-07-03T08:54:45Z)
• RankingSHAP -- Listwise Feature Attribution Explanations for Ranking Models [48.895510739010355]
  We present three key contributions to address this gap. First, we rigorously define listwise feature attribution for ranking models. Second, we introduce RankingSHAP, extending the popular SHAP framework to accommodate listwise ranking attribution. Third, we propose two novel evaluation paradigms for assessing the faithfulness of attributions in learning-to-rank models.
  arXiv  Detail & Related papers  (2024-03-24T10:45:55Z)
• Answering Unseen Questions With Smaller Language Models Using Rationale Generation and Dense Retrieval [9.136948771060895]
  We evaluate two methods for further improvement in this setting. Both focus on combining rationales generated by a larger Language Model with longer contexts created from a multi-hop dense retrieval system. Our single best Reasoning model materially improves upon strong comparable prior baselines for unseen evaluation datasets.
  arXiv  Detail & Related papers  (2023-08-09T05:06:39Z)
• Prompt Algebra for Task Composition [131.97623832435812]
  We consider Visual Language Models with prompt tuning as our base classifier. We propose constrained prompt tuning to improve performance of the composite classifier. On UTZappos it improves classification accuracy over the best base model by 8.45% on average.
  arXiv  Detail & Related papers  (2023-06-01T03:20:54Z)
• UU-Tax at SemEval-2022 Task 3: Improving the generalizability of language models for taxonomy classification through data augmentation [0.0]
  This paper addresses the SemEval-2022 Task 3 PreTENS: Presupposed Taxonomies evaluating Neural Network Semantics. The goal of the task is to identify if a sentence is deemed acceptable or not, depending on the taxonomic relationship that holds between a noun pair contained in the sentence. We propose an effective way to enhance the robustness and the generalizability of language models for better classification.
  arXiv  Detail & Related papers  (2022-10-07T07:41:28Z)
• Distant finetuning with discourse relations for stance classification [55.131676584455306]
  We propose a new method to extract data with silver labels from raw text to finetune a model for stance classification. We also propose a 3-stage training framework where the noisy level in the data used for finetuning decreases over different stages. Our approach ranks 1st among 26 competing teams in the stance classification track of the NLPCC 2021 shared task Argumentative Text Understanding for AI Debater.
  arXiv  Detail & Related papers  (2022-04-27T04:24:35Z)
• elBERto: Self-supervised Commonsense Learning for Question Answering [131.51059870970616]
  We propose a Self-supervised Bidirectional Representation Learning of Commonsense framework, which is compatible with off-the-shelf QA model architectures. The framework comprises five self-supervised tasks to force the model to fully exploit the additional training signals from contexts containing rich commonsense. elBERto achieves substantial improvements on out-of-paragraph and no-effect questions where simple lexical similarity comparison does not help.
  arXiv  Detail & Related papers  (2022-03-17T16:23:45Z)
• UIUC_BioNLP at SemEval-2021 Task 11: A Cascade of Neural Models for Structuring Scholarly NLP Contributions [1.5942130010323128]
  We propose a cascade of neural models that performs sentence classification, phrase recognition, and triple extraction. A BERT-CRF model was used to recognize and characterize relevant phrases in contribution sentences. Our system was officially ranked second in Phase 1 evaluation and first in both parts of Phase 2 evaluation.
  arXiv  Detail & Related papers  (2021-05-12T05:24:35Z)
• Classifier Combination Approach for Question Classification for Bengali Question Answering System [17.567099458403707]
  The work presented here demonstrates that the combination of multiple models achieve better classification performance than those obtained with existing individual models for the question classification task in Bengali. We have exploited state-of-the-art multiple model combination techniques, i.e., ensemble, stacking and voting, to increase QC accuracy. The approach presented here could be used in other Indo-Aryan or Indic languages to develop a question answering system.
  arXiv  Detail & Related papers  (2020-08-31T13:39:04Z)
• Detecting and Classifying Malevolent Dialogue Responses: Taxonomy, Data and Methodology [68.8836704199096]
  Corpus-based conversational interfaces are able to generate more diverse and natural responses than template-based or retrieval-based agents. With their increased generative capacity of corpusbased conversational agents comes the need to classify and filter out malevolent responses. Previous studies on the topic of recognizing and classifying inappropriate content are mostly focused on a certain category of malevolence.
  arXiv  Detail & Related papers  (2020-08-21T22:43:27Z)
• Pre-training Is (Almost) All You Need: An Application to Commonsense Reasoning [61.32992639292889]
  Fine-tuning of pre-trained transformer models has become the standard approach for solving common NLP tasks. We introduce a new scoring method that casts a plausibility ranking task in a full-text format. We show that our method provides a much more stable training phase across random restarts.
  arXiv  Detail & Related papers  (2020-04-29T10:54:40Z)

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.