<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">jcc</journal-id>
      <journal-title-group>
        <journal-title>Journal of Computer and Communications</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2327-5227</issn>
      <issn pub-type="ppub">2327-5219</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/jcc.2026.143004</article-id>
      <article-id pub-id-type="publisher-id">jcc-150116</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>NAT-MTT: Noise-Aware Multi-Task Transformers for Cross-Domain Aspect-Based Sentiment Analysis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Iwidat</surname>
            <given-names>Hani</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Sale</surname>
            <given-names>Mohammad</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Khaled</surname>
            <given-names>Imran</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Ajarmah</surname>
            <given-names>Basem</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Abu-Ulbeh</surname>
            <given-names>Waheeb</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Department of Data Science, AL-Istiqlal University, Jericho, Palestine </aff>
      <aff id="aff2"><label>2</label> Department of Cybersecurity, AL-Istiqlal University, Jericho, Palestine </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors state no conflict of interest.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>03</day>
        <month>03</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>03</month>
        <year>2026</year>
      </pub-date>
      <volume>14</volume>
      <issue>03</issue>
      <fpage>48</fpage>
      <lpage>70</lpage>
      <history>
        <date date-type="received">
          <day>19</day>
          <month>02</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>10</day>
          <month>03</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>13</day>
          <month>03</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/jcc.2026.143004">https://doi.org/10.4236/jcc.2026.143004</self-uri>
      <abstract>
        <p>This paper proposes a noise-aware multi-task transformer framework that jointly performs aspect extraction (AE) and aspect sentiment classification (ASC) using a shared BERT/RoBERTa encoder with dual task-specific heads. Robustness is promoted through a systematic noise-aware training (NAT) strategy that injects controlled synthetic perturbations (spelling errors, word dropout, synonym replacement, slang) according to a curriculum schedule, mixing clean and noisy instances in each batch. Experiments on SemEval-2014 (Restaurants, Laptops) and large-scale Amazon (Electronics, Apparel) and Yelp (Food) reviews demonstrate consistent gains over strong single-task, multi-task, and cross-domain baselines in in-domain, cross-domain, and multi-domain settings. On the SemEval Rest 14 dataset, the proposed model achieves improvements of +2.6 F1 (AE) and +2.9% accuracy (ASC) on the Rest14 benchmark over the strongest baseline. with maximum gains of +3.1 F1 (AE) and +3.3% (ASC) over the strongest cross-domain baseline (BGCA), reduces noise-induced performance degradation by up to 42% (NAT contribution vs. identical model without NAT), and improves cross-domain transfer with minimal additional parameters and a 22% training-time overhead. Ablation and error analyses show that multi-task learning and NAT are both critical to robustness, particularly under high noise and domain shift. These findings indicate that jointly learning multiple ABSA subtasks with noise-aware augmentation is an effective and efficient route to deployable, real-world ABSA systems.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Aspect-Based Sentiment Analysis</kwd>
        <kwd>Multi-Task Learning</kwd>
        <kwd>Transformer Models</kwd>
        <kwd>Cross-Domain Robustness</kwd>
        <kwd>Noise-Resistant NLP</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Web users can express their opinions on a broad range of topics in several ways on the online platforms. For instance, they may discuss a legal decision or write a review or describe medical treatment or share political opinions. These opinions can be expressed through diverse media of communication, including social networks and discussions in forums. Such exchanges are a significant [<xref ref-type="bibr" rid="B1">1</xref>]. Due to the enormous amount of available information, extracting knowledge from these different sources has become a complicated task when performed manually. Therefore, the utilization of Artificial Intelligence (AI) OM techniques has become a practical solution [<xref ref-type="bibr" rid="B2">2</xref>]. OM or SA seeks to extract the polarity of texts (e.g., positive, negative, or neutral) in an automated manner. It can be done at different levels: aspect, sentence, or document [<xref ref-type="bibr" rid="B3">3</xref>]. </p>
      <p>Aspect-Based Sentiment Analysis (ABSA) focuses on identifying fine-grained opinion structures by extracting aspect terms and determining sentiment polarity. providing more informative insights than document- or sentence-level sentiment analysis. This task has attracted increasing attention in recent years [<xref ref-type="bibr" rid="B4">4</xref>]. As user-generated reviews increase across domains such as restaurants and movies, ABSA has become central to opinion mining in ecommerce and social media. Recent advances in pretrained transformer models (Ex:, BERT and RoBERTa) have significantly improved sentiment tasks by providing powerful contextual representations and transfer learning capabilities However, practical ABSA systems must operate across domains and under noisy conditions—where labels may be imperfect, texts contain informal language, typos, or sarcasm, and domain-specific expressions differ substantially—making robust cross-domain generalization a central challenge [<xref ref-type="bibr" rid="B5">5</xref>].</p>
      <p>Cross-domain ABSA aims to transfer fine-grained sentiment knowledge from a labeled source domain to a sparsely labeled or unlabeled target domain, thereby reducing annotation cost while maintaining aspect-level accuracy [<xref ref-type="bibr" rid="B1">1</xref>]. Domain adversarial training, topic guidance, and knowledge-enhanced representations are common strategies to mitigate distribution shifts between domains. BERT-based aspect-level models combined with domain-adversarial networks learn domain-invariant sentence and aspect representations, improving cross-domain performance on Amazon product reviews [<xref ref-type="bibr" rid="B6">6</xref>]. Generative and retrieve-and-edit frameworks further alleviate domain gaps by augmenting unlabeled target data or generating pseudo-labeled target-like sentences for end-to-end ABSA [<xref ref-type="bibr" rid="B7">7</xref>]. The methods train on clean benchmark datasets which provide dependable supervision but they become ineffective when handling two specific challenges that include noisy labels and unique domain requirements which exist in actual operational environments. <bold>Table 1</bold> shows examples of ABSC applications which span different fields and the table demonstrates that the sentiment term “delicious” and the term “rude” appear in the restaurant industry but they do not exist in the electronics sector. Different domains use different words to show their respective emotional states. The word “long” functions as a negative word in food services while it serves as a positive word in the electronics industry. The study shows that different domains use different emotional vocabulary which creates multiple meanings for the same words. Multi-task learning (MTL) has emerged as an effective paradigm to jointly model multiple ABSA subtasks (such as aspect term extraction, aspect category detection, and aspect sentiment classification) by leveraging shared representations and mutual constraints between tasks [<xref ref-type="bibr" rid="B8">8</xref>]. Neural MTL frameworks based on BERT variants show that learning extraction and sentiment tasks within a unified model reduces error propagation compared with pipeline approaches and yields higher F1 scores on benchmarks like SemEval and Arabic hotel reviews. Transformer-based MTL for related affective tasks, such as emotion classification and intensity prediction, also demonstrates that jointly optimizing related objectives x can outperform single-task baselines. However, most existing MTL models are developed for single-domain scenarios and do not explicitly tackle the combined problem of cross-domain adaptation and robustness to noisy data.</p>
      <p>Transformers have become the main technology used in sentiment analysis, but different robustness features of the system show different results. The study of 22 datasets demonstrates that T5 achieves the highest performance, while XLNet shows superior results in detecting irony and understanding product-related sentiment, and RoBERTa and ELECTRA perform best in particular tests, but BERT and DistilBERT fail to handle advanced sentiment detection tasks because they prioritize efficiency. The researchers developed transformer-based architectures for fine-grained ABSA through the integration of cross-modal attention, syntactic augmentation, and knowledge graphs, which enable the system to extract complex aspect-opinion-polarity relationships. The present transformer-based ABSA systems continue to pursue two objectives, which include achieving maximum performance in their respective domains and maintaining correct feature distribution; however, they do not use explicit noise-aware training methods, uncertainty modeling techniques, or label noise protection strategies, especially when dealing with cross-domain and multi-task situations.</p>
      <p>Most existing ABSA studies in related work exhibit complementary but incomplete coverage of the requirements for real-world, robust ABSA systems across noisy, heterogeneous domains. Unified and instruction-tuned frameworks such as the unified generative model and Unified ABSA focus on covering many ABSA subtasks within a single architecture, but they primarily target clean, in-domain benchmarks and do not explicitly model noise or evaluate robustness under noisy conditions. Cross-domain models like CC-ASTN and other domain-adversarial approaches are effective at transferring aspect-level sentiment knowledge between source and target domains, yet they assume relatively clean text and leave the impact of linguistic noise largely unexplored. Studies focused on developing robust systems through non-counterfactual methods and basic data augmentation techniques show improved performance against specific disruptions but they handle sentiment evaluation as a separate task and they fail to unify aspect extraction with aspect-based sentiment evaluation through their multiple domain assessment approach. The combination of hybrid GCN-transformer models and intent-aware transformers TASCI leads to better benchmark dataset performance, yet these architectures need to develop methods for multi-domain noise-aware training which show the connection between system robustness and accuracy and performance costs. The industry lacks a unified solution which provides joint AE/ASC modeling across different domains while handling user-generated text through noisy text protection and maintaining operational effectiveness for real-world applications. We introduce NAT-MTT as an ABSA framework which uses a noise-aware multi-task transformer system to provide complete power across multiple applications while focusing on robust system performance and cross-domain usage.</p>
      <p>Our model uses a shared BERT/RoBERTa encoder with two task-specific heads to jointly perform aspect extraction (via BIO tagging) and aspect-level sentiment classification (via span-level attention), thereby eliminating pipeline-based error propagation and leveraging shared representations between AE and ASC. On top of this unified architecture, we introduce a systematic noise-aware training strategy that generates synthetic noisy variants of training sentences. By using spelling perturbations, word dropout, synonym replacement, and slang injection. Then involving mixes clean and noisy samples in each batch to encourage noise-invariant yet semantics-preserving representations. We evaluate the framework in multi-domain and cross-domain settings over benchmark datasets (SemEval) [<xref ref-type="bibr" rid="B9">9</xref>] and large-scale real-world reviews (Amazon, Yelp) [<xref ref-type="bibr" rid="B10">10</xref>][<xref ref-type="bibr" rid="B11">11</xref>], and we quantify robustness by measuring performance degradation under controlled noise levels. thus, directly addressing the gaps in prior work regarding noisy input and domain shift. Finally, we conducting a detailed ablation and efficiency analyses (parameters, training time, inference speed), demonstrating that the proposed approach offers substantial gains in robustness and cross-domain performance.</p>
      <p><bold>Table 1.</bold>Illustrative samples of ABSC across diverse domains.</p>
      <table-wrap id="tbl1">
        <label>Table 1</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>Domain</bold>
              </td>
              <td>
                <bold>Sentence</bold>
              </td>
              <td>
                <bold>Aspect Terms</bold>
              </td>
              <td>
                <bold>Polarity</bold>
              </td>
            </tr>
            <tr>
              <td rowspan="2">Restaurant</td>
              <td rowspan="2">The (price) is affordable, although the (waiter) is rude.</td>
              <td>price</td>
              <td>POS.</td>
            </tr>
            <tr>
              <td>waiter</td>
              <td>NEG.</td>
            </tr>
            <tr>
              <td rowspan="2">Laptop</td>
              <td rowspan="2">Its (performance) is ideal, I wish I could say the same about the (price).</td>
              <td>performance</td>
              <td>POS.</td>
            </tr>
            <tr>
              <td>price</td>
              <td>NEG.</td>
            </tr>
            <tr>
              <td rowspan="2">Electronics</td>
              <td rowspan="2">The (battery life) is quite long, but the (camera quality) is poor.</td>
              <td>battery life</td>
              <td>POS.</td>
            </tr>
            <tr>
              <td>camera quality</td>
              <td>NEG.</td>
            </tr>
            <tr>
              <td rowspan="2">Apparel</td>
              <td rowspan="2">The (fabric) is soft and comfortable, but the (sizing) runs small.</td>
              <td>fabric</td>
              <td>POS</td>
            </tr>
            <tr>
              <td>sizing</td>
              <td>NEG.</td>
            </tr>
            <tr>
              <td rowspan="2">Food Services</td>
              <td rowspan="2">The (ambiance) was cozy, but the (wait time) was too long.</td>
              <td>ambiance</td>
              <td>POS</td>
            </tr>
            <tr>
              <td>wait time</td>
              <td>NEG.</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>In this work, we propose Noise-Aware Multi-Task Transformers for Robust Cross-Domain Aspect-Based Sentiment Analysis, aiming to bridge these gaps. </p>
      <p>Contributions. The main contributions of this study are summarized as follows:</p>
      <p>We propose a unified multi-task transformer framework that jointly learns end-to-end ABSA subtasks across source and target domains, reducing error propagation and improving data efficiency. A systematic noise-aware training strategy based on controlled synthetic noise injection (spelling errors, word dropout, synonym replacement, slang) that enhances robustness to real-world linguistic variations.Providing a comprehensive cross-domain evaluation across multiple domains (electronics, apparel, food services) using both benchmark (SemEval) and real-world (Amazon, Yelp) datasets under clean and noisy conditions.Detailed analysis of robustness-efficiency trade-offs, including parameter counts, providing practical insights for deployment.</p>
      <p>This leads to the following research questions: </p>
      <p>(RQ1): To what extent can a multi-task transformer improve cross-domain ABSA performance compared with single-task or pipeline models?(RQ2): How much do noise-aware training techniques contribute to robustness under noisy conditions in cross-domain ABSA?(RQ3): Does combining multitask learning with noise-aware mechanisms yield more stable predictions across diverse domains and under noisy conditions?(RQ4): What is the computational cost of the proposed framework?</p>
      <p>The remainder of this paper is organized as follows: In Sect. Related work, we discuss the relevant literature and prior work in the domain. Section 2 explore into the methodology of the proposed framework, encompassing the techniques and models we employed, Sect. Experiments showcases the experimental results, and the evaluation is presented in Sect. Model analysis we perform an ablation study. Finally, Sect. Conclusion concludes the paper, summarizing our contributions and suggesting potential directions for future research.</p>
    </sec>
    <sec id="sec2">
      <title>2. Related Work</title>
      <p>Aspect-Based Sentiment Analysis ABSA has evolved from isolated tasks (e.g., only aspect extraction or only sentiment polarity) to compound tasks that jointly predict multiple sentiment elements such as aspect terms, opinion terms, and aspect–sentiment triplets [<xref ref-type="bibr" rid="B2">2</xref>]. Compound ABSA tasks include aspect term extraction (ATE), unified ABSA (UABSA), aspect-opinion pair extraction (AOPE), and aspect sentiment triplet extraction (ASTE), all of which require capturing structured relations among aspects, opinions, and sentiments [<xref ref-type="bibr" rid="B2">2</xref>][<xref ref-type="bibr" rid="B8">8</xref>][<xref ref-type="bibr" rid="B12">12</xref>]. Transformer-based architectures augmented with cross-modal and aspect-aware mechanisms have been proposed to handle such complexity. For example, a cross-modal multi-task transformer (CMMT) for multimodal ABSA jointly learns aspect- and sentiment-aware intra-modal representations and uses text-guided cross-modal interaction, outperforming previous multimodal baselines on Twitter datasets for both aspect extraction and sentiment classification [<xref ref-type="bibr" rid="B13">13</xref>]. Similarly, SABKG integrates BERT with part-of-speech information and an aspect-sentiment knowledge graph, using graph neural networks to encode “aspect word-sentiment polarity-sentiment word” triplets and achieving state-of-the-art performance on three ABSA datasets [<xref ref-type="bibr" rid="B14">14</xref>]. These models show that structural and task-specific biases help ABSA, but they largely target single-domain, relatively clean benchmarks.</p>
      <p><bold>Multi-Task Learning:</bold>Multi-task learning (MTL) has been widely applied to leverage synergies between ABSA subtasks. MTL-AraBERT simultaneously performs aspect term extraction and aspect category detection in Arabic hotel reviews using a shared AraBERT backbone with task-specific heads, achieving strong F1 scores for both tasks [<xref ref-type="bibr" rid="B15">15</xref>]. A BERT-based multi-task framework for IMDb reviews jointly models sentiment classification and aspect-based analysis by sharing BERT embeddings and LSTM layers, using a softmax classifier for overall sentiment and a CRF layer for aspect extraction; this joint learning setup outperforms corresponding single-task baselines on both sentiment prediction and aspect detection [<xref ref-type="bibr" rid="B16">16</xref>]. SABKG can similarly be viewed as a multi-task system that learns several ABSA subtasks simultaneously by leveraging a shared, knowledge-augmented representation space [<xref ref-type="bibr" rid="B14">14</xref>]. Beyond ABSA, multi-task transformer models have shown effectiveness in affective computing: Labeed and Liang present a comparative analysis of multi-task transformers for emotion classification and intensity prediction on social media data, and report that multi-task learning consistently outperforms single-task variants across both objectives [<xref ref-type="bibr" rid="B17">17</xref>]. Similarly, unified BERT-based multi-task models for sentiment and ABSA demonstrate that shared contextual encoders can support multiple sentiment-related tasks and achieve competitive or superior performance compared with specialized single-task baselines [<xref ref-type="bibr" rid="B18">18</xref>]. Nevertheless, these multi-task approaches generally assume clean supervision and operate in single-domain or mixed but non-adapted settings, offering limited insight into cross-domain robustness under noisy user-generated text [<xref ref-type="bibr" rid="B17">17</xref>]. Recently, large language models (LLMs) have been used for fewshot ABSA, but their computational cost and latency limit deployment [<xref ref-type="bibr" rid="B12">12</xref>].</p>
      <p><bold>Cross-Domain ABSA and Domain Adaptation:</bold>Cross-domain ABSA seeks to transfer aspect-level sentiment knowledge from source to target domains with minimal or no target labels [<xref ref-type="bibr" rid="B7">7</xref>][<xref ref-type="bibr" rid="B19">19</xref>]. A BERT-based aspect-level sentiment analysis algorithm combines BERT with convolutional layers and a domain-adversarial neural network to learn domain-invariant representations, achieving higher accuracy and F1 than classical algorithms on cross-domain Amazon product reviews [<xref ref-type="bibr" rid="B3">3</xref>]. CSCPLDAT incorporates hybrid prompt learning with domain adversarial training for cross-domain aspect-based sentiment classification, designing prompts with transferable and task-specific components and achieving an average microF1 of 71.45% across four benchmarks, outperforming previous state-of-the-art methods especially under label scarcity and skewed sentiment distributions [<xref ref-type="bibr" rid="B7">7</xref>]. The bidirectional generative cross-domain ABSA framework BGCA trains models in both text-to-label and label-to-text directions, using generated sentences for data augmentation, and achieves new state-of-the-art results on four cross-domain tasks (ATE, UABSA, AOPE, ASTE) without using labeled target-domain data [<xref ref-type="bibr" rid="B20">20</xref>]. Retrieve-and-edit domain adaptation further improves transfer by retrieving similar prototypes in unlabeled target data and editing source words, yielding an absolute F1 improvement of about 3.95% in cross-domain end-to-end ABSA [<xref ref-type="bibr" rid="B7">7</xref>]. Large language model-augmented and syntax-aware methods extend these ideas. A syntax-aware domain adaptation framework combines LLMs with structural syntactic knowledge via a domain-topic predictor, adversarial training, and automatic soft prompts to enhance domain-specific semantic transfer, claiming systematic exploitation of syntactic and cross-domain characteristics for fine-grained sentiment classification [<xref ref-type="bibr" rid="B21">21</xref>]. However, these methods mainly optimize feature alignment and domain invariance; they rely on pseudo-labels or unlabeled data without explicit mechanisms to detect or down weight noisy annotations, and they typically optimize a single primary ABSA task rather than a full multi-task suite.</p>
      <p><bold>Transformer-Based Systems Handle Noise</bold>: This study investigates how transformer-based systems maintain system stability in their sentiment analysis process. The training method uses domain adversarial training and denoising autoencoders to decrease distributional mismatch but it does not provide a direct solution for handling label noise and uncertainty. The research examined various augmentation methods to identify which ones provide better performance for natural language processing tasks. Wei and Zou [<xref ref-type="bibr" rid="B22">22</xref>] presented Easy Data Augmentation (EDA) as a method which uses synonym replacement and random insertion and swap and deletion to produce consistent enhancements for text classification tasks. Xie<italic>et al.</italic> [<xref ref-type="bibr" rid="B23">23</xref>] introduced Unsupervised Data Augmentation (UDA) as a method which uses consistency training to process noise perturbations while Zhuang <italic>et al.</italic> [<xref ref-type="bibr" rid="B24">24</xref>] showed that using synthetic misspellings during training improves NER system reliability. The study found that transformers such as T5 and XLNet showed better ability to handle different sentiment and irony datasets while BERT and DistilBERT showed less stable performance. The system uses three techniques to reduce noise and redundancy through mutual information maximization and adaptive contrastive learning and dual attention which creates representations that resist noise and maintain accuracy with lower processing demands. The research area needs new dedicated noise-aware objectives for ABSA and cross-domain ABSA research which should be tested with multi-task transformers.</p>
      <p><bold>Summary and Research Gap:</bold>Overall, the literature provides strong components but leaves a clear gap. First, multi-task transformers for ABSA demonstrate gains over pipeline and single-task models but are mostly evaluated in single-domain, clean-label settings and rarely consider domain shift or noisy supervision [<xref ref-type="bibr" rid="B14">14</xref>]-[<xref ref-type="bibr" rid="B16">16</xref>]. Second, cross-domain ABSA methods—including adversarial, prompt-based, knowledge-enhanced, generative, and retrieve-and-edit frameworks—achieve state-of-the-art performance under unsupervised or semi-supervised transfer, but most of them mainly focus on feature/domain alignment or data augmentation rather than systematic noise modeling, and typically optimize a single ABSA task [<xref ref-type="bibr" rid="B3">3</xref>][<xref ref-type="bibr" rid="B7">7</xref>][<xref ref-type="bibr" rid="B19">19</xref>] Third, while robustness techniques from multimodal and generic sentiment analysis suggest that invariant and contrastive representations can mitigate noise brittle [<xref ref-type="bibr" rid="B25">25</xref>][<xref ref-type="bibr" rid="B26">26</xref>] these ideas have not been fully integrated into cross-domain, multi-task ABSA settings.</p>
      <p>Thus, there is a research gap at the intersection of 1) multi-task transformers for end-to-end ABSA, 2) cross-domain adaptation, and 3) explicit noise-aware learning. Existing models typically address at most one or two of these aspects. The proposed Noise-Aware Multi-Task Transformer is designed to fill this gap by jointly learning multiple ABSA subtasks across domains while incorporating domain adaptation and noise-aware mechanisms to achieve robust cross-domain performance under realistic noisy conditions.</p>
      <p><bold>Table 2(a)</bold> provides a comparative overview of representative models, summarizing their coverage across key dimensions: evaluated tasks, unified multi-task learning, cross-domain evaluation, explicit noise robustness, and efficiency analysis. <bold>Table 2(b)</bold> then outlines how our proposed framework directly addresses the gaps identified in prior work.</p>
      <p><bold>Table 2</bold><bold>.</bold> (a) A comparative overview of related studies which summarizes key properties of related work and highlights how the proposed model positions itself across multiple dimensions. (b) How our model addresses identified gaps.</p>
      <table-wrap id="tbl2">
        <label>Table 2</label>
        <table>
          <tbody>
            <tr>
              <td colspan="6">
                <bold>(a)</bold>
              </td>
            </tr>
            <tr>
              <td>
                <bold>Model (Ref.)</bold>
              </td>
              <td>
                <bold>Evaluated</bold>
                <bold>Task</bold>
              </td>
              <td>
                <bold>Unified</bold>
                <bold>Multi-Task</bold>
              </td>
              <td>
                <bold>Cross-Domain Eval.</bold>
              </td>
              <td>
                <bold>Explicit Noise Robustness</bold>
              </td>
              <td>
                <bold>Efficiency Analysis</bold>
              </td>
            </tr>
            <tr>
              <td>
                LEGO-ABSA [
                <xref ref-type="bibr" rid="B27">27</xref>
                ]
              </td>
              <td>ASC/AE</td>
              <td>✓</td>
              <td>Limited</td>
              <td>✗</td>
              <td>Partial</td>
            </tr>
            <tr>
              <td>
                UNIFIEDABSA [
                <xref ref-type="bibr" rid="B28">28</xref>
                ]
              </td>
              <td>ASC/AE</td>
              <td>✓</td>
              <td>Limited</td>
              <td>✗</td>
              <td>✓</td>
            </tr>
            <tr>
              <td>
                SyMux [
                <xref ref-type="bibr" rid="B29">29</xref>
                ]
              </td>
              <td>ASC/AE</td>
              <td>✓</td>
              <td>Limited</td>
              <td>✗</td>
              <td>Partial</td>
            </tr>
            <tr>
              <td>
                BERT-Based Cross-Domain [
                <xref ref-type="bibr" rid="B3">3</xref>
                ]
              </td>
              <td>AE/ASC</td>
              <td>Partial</td>
              <td>✓</td>
              <td>✗</td>
              <td>Partial</td>
            </tr>
            <tr>
              <td>
                CC-ASTN [
                <xref ref-type="bibr" rid="B6">6</xref>
                ]
              </td>
              <td>ASC/AE</td>
              <td>Partial</td>
              <td>✓</td>
              <td>✗</td>
              <td>✗</td>
            </tr>
            <tr>
              <td>
                Robust ABSA w/ Non-counterfactual Aug. [
                <xref ref-type="bibr" rid="B30">30</xref>
                ]
              </td>
              <td>ASC</td>
              <td>✗</td>
              <td>✓</td>
              <td>✓</td>
              <td>✗</td>
            </tr>
            <tr>
              <td>
                BGCA [
                <xref ref-type="bibr" rid="B20">20</xref>
                ]
              </td>
              <td>ASC/AE</td>
              <td>Partial</td>
              <td>✓</td>
              <td>✗</td>
              <td>Limited</td>
            </tr>
            <tr>
              <td>
                SentiSys [
                <xref ref-type="bibr" rid="B1">1</xref>
                ]
              </td>
              <td>ASC</td>
              <td>✗</td>
              <td>✓</td>
              <td>✓</td>
              <td>Partial</td>
            </tr>
            <tr>
              <td>
                EDA/UDA [
                <xref ref-type="bibr" rid="B23">23</xref>
                ]
              </td>
              <td>ASC</td>
              <td>✗</td>
              <td>✗</td>
              <td>✗</td>
              <td>✓</td>
            </tr>
            <tr>
              <td>
                <bold>Ours model</bold>
              </td>
              <td>ASC /AE</td>
              <td>✓</td>
              <td>✓</td>
              <td>✓</td>
              <td>✓</td>
            </tr>
            <tr>
              <td colspan="6">
                <bold>(b)</bold>
              </td>
            </tr>
            <tr>
              <td colspan="2">
                <bold>Gap in Prior Work</bold>
              </td>
              <td colspan="4">
                <bold>Our Solution</bold>
              </td>
            </tr>
            <tr>
              <td colspan="2">Unified AE/ASC rare in cross-domain settings</td>
              <td colspan="4">Shared encoder with dual task-specific heads</td>
            </tr>
            <tr>
              <td colspan="2">Noise robustness treated in isolation, not with multi-task learning</td>
              <td colspan="4">Systematic noise-aware training (NAT) with invariance objective</td>
            </tr>
            <tr>
              <td colspan="2">Cross-domain methods assume clean text</td>
              <td colspan="4">Noise augmentation improves domain-invariant representations</td>
            </tr>
            <tr>
              <td colspan="2">Efficiency-robustness trade-off rarely analyzed</td>
              <td colspan="4">Full reporting of params, training time, inference speed</td>
            </tr>
            <tr>
              <td colspan="2">Evaluation on clean benchmarks only</td>
              <td colspan="4">Multi-domain testing under controlled noise (low/high)</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>✓ = fully addressed; partially/limited = partially/limited addressed; ✗ = not addressed/not applicable.</p>
    </sec>
    <sec id="sec3">
      <title>3. Methodology</title>
      <p>This section presents the proposed methodology implemented for this work. We begin our discussion with problem definition and representation, then we discuss Noise-Aware follow by model architecture which is described in Section 3.3. Training Strategy, cross-domain training, as detailed in Section 3.5. Finally, we describe the Implementation Details of the proposed model on the prepared dataset. The proposed framework is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p>
      <sec id="sec3dot1">
        <title>3.1. Problem Definition and Representation</title>
        <p>We formalize robust cross-domain aspect-based sentiment analysis as a multi-task learning problem under domain shift and linguistic noise. Consider a corpus of <inline-formula><mml:math><mml:mi> N </mml:mi></mml:math></inline-formula> sentences <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> X </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , where each sentence <inline-formula><mml:math><mml:mrow><mml:mi> x </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a token sequence. Sentences originate from domains <inline-formula><mml:math><mml:mrow><mml:mi> d </mml:mi><mml:mo> ∈ </mml:mo><mml:mi> D </mml:mi></mml:mrow></mml:math></inline-formula> , with <inline-formula><mml:math><mml:mrow><mml:mi> D </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> D </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> D </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> D </mml:mi><mml:mi> m </mml:mi></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> representing distinct product or service categories (electronics, apparel, restaurants, laptops).</p>
        <p><bold>Aspect Term Extraction (AE):</bold> For each sentence <inline-formula><mml:math><mml:mi> x </mml:mi></mml:math></inline-formula> , we identify contiguous spans <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mi> s </mml:mi><mml:mo> , </mml:mo><mml:mi> e </mml:mi></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula><inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> ≤ </mml:mo><mml:mi> s </mml:mi><mml:mo> ≤ </mml:mo><mml:mi> e </mml:mi><mml:mo> ≤ </mml:mo><mml:mi> n </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> corresponding to aspect terms. Following sequence labeling conventions, each token <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> receives a label <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mrow><mml:mtext> ae </mml:mtext></mml:mrow></mml:msubsup><mml:mo> ∈ </mml:mo><mml:msub><mml:mi> Y </mml:mi><mml:mrow><mml:mtext> AE </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mtext> B-ASP </mml:mtext><mml:mo> , </mml:mo><mml:mtext> I-ASP </mml:mtext><mml:mo> , </mml:mo><mml:mtext> O </mml:mtext></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , where B-ASP marks aspect boundaries, I-ASP indicates continuation, and O denotes non-aspect tokens. The output is a set of aspect spans <inline-formula><mml:math><mml:mrow><mml:mi> A </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> a </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> a </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> a </mml:mi><mml:mi> k </mml:mi></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> a </mml:mi><mml:mi> j </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> s </mml:mi><mml:mi> j </mml:mi></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> e </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula><bold>.</bold></p>
        <p><bold>Aspect Sentiment Classification (ASC):</bold> For each extracted span <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> a </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , we predict sentiment polarity <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mrow><mml:mtext> asc </mml:mtext></mml:mrow></mml:msubsup><mml:mo> ∈ </mml:mo><mml:msub><mml:mi> Y </mml:mi><mml:mrow><mml:mtext> ASC </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mtext> POS </mml:mtext><mml:mo> , </mml:mo><mml:mtext> NEG </mml:mtext><mml:mo> , </mml:mo><mml:mtext> NEU </mml:mtext></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> expressing opinion toward that aspect. Formally, domain shift denotes divergence between source distribution <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> P </mml:mi><mml:mi> s </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> x </mml:mi><mml:mo> , </mml:mo><mml:mi> y </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and target distribution <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> P </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> x </mml:mi><mml:mo> , </mml:mo><mml:mi> y </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , with <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> P </mml:mi><mml:mi> s </mml:mi></mml:msub><mml:mo> ≠ </mml:mo><mml:msub><mml:mi> P </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> . In cross-domain settings, we assume labeled source data <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> D </mml:mi><mml:mi> s </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> , </mml:mo><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mrow><mml:mtext> ae </mml:mtext></mml:mrow></mml:msubsup><mml:mo> , </mml:mo><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mrow><mml:mtext> asc </mml:mtext></mml:mrow></mml:msubsup></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and unlabeled or sparsely labeled target data. Our objective is domain-invariant representations <inline-formula><mml:math><mml:mrow><mml:mi> h </mml:mi><mml:mo> = </mml:mo><mml:mi> f </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> x </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> such that <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> P </mml:mi><mml:mi> s </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> h </mml:mi><mml:mo> | </mml:mo><mml:mi> y </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≈ </mml:mo><mml:msub><mml:mi> P </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> h </mml:mi><mml:mo> | </mml:mo><mml:mi> y </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> while maintaining discriminative power for both tasks.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Noise-Aware Data Augmentation</title>
        <p>Based on empirical analysis of Amazon and Yelp, we identify four types relevant to ABSA robustness: orthographic errors. Given an input sentence <inline-formula><mml:math><mml:mrow><mml:mi> x </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , we generate noisy variants <inline-formula><mml:math><mml:mover accent="true"><mml:mi> x </mml:mi><mml:mo> ˜ </mml:mo></mml:mover></mml:math></inline-formula> through four perturbation operations with probabilities <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> spell </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> drop </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> syn </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> slang </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> respectively:</p>
        <p><italic>Spelling Noise:</italic> Character-level perturbations including insertions, deletions, substitutions, and transpositions. The error probability follows:</p>
        <disp-formula id="FD1">
          <label>(1)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>P</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mtext>error</mml:mtext>
                  <mml:mo>|</mml:mo>
                  <mml:mi>w</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>∝</mml:mo>
              <mml:mi>e</mml:mi>
              <mml:mi>x</mml:mi>
              <mml:mi>p</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mi>λ</mml:mi>
                  <mml:mo>⋅</mml:mo>
                  <mml:mtext>edit_distance</mml:mtext>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mi>w</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>e</mml:mi>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi> e </mml:mi><mml:mo> ∈ </mml:mo><mml:mi> E </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> w </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a possible error for word <inline-formula><mml:math><mml:mi> w </mml:mi></mml:math></inline-formula> , and <inline-formula><mml:math><mml:mi> λ </mml:mi></mml:math></inline-formula> controls error likelihood. </p>
        <p><italic>Word Dropout</italic><bold>:</bold> Random masking of non-aspect words:</p>
        <disp-formula id="FD2">
          <label>(2)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mover accent="true">
                  <mml:mi>x</mml:mi>
                  <mml:mo>˜</mml:mo>
                </mml:mover>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mrow>
                  <mml:mtable columnalign="left">
                    <mml:mtr columnalign="left">
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mtext>with</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mtext>probability</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mn>1</mml:mn>
                          <mml:mo>−</mml:mo>
                          <mml:msub>
                            <mml:mi>p</mml:mi>
                            <mml:mrow>
                              <mml:mtext>drop</mml:mtext>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr columnalign="left">
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>[</mml:mo>
                            <mml:mrow>
                              <mml:mtext>MASK</mml:mtext>
                            </mml:mrow>
                            <mml:mo>]</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mtext>with</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mtext>probability</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:msub>
                            <mml:mi>p</mml:mi>
                            <mml:mrow>
                              <mml:mtext>drop</mml:mtext>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                  </mml:mtable>
                </mml:mrow>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><italic>Synonym Replacement</italic><bold>:</bold> Context-aware substitution using WordNet synonyms: We use GloVe 840B-300d embeddings to compute cosine similarity between the original word and each synonym in WordNet. The synonym with the highest similarity is selected.</p>
        <disp-formula id="FD3">
          <label>(3)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:msup>
                  <mml:mi>x</mml:mi>
                  <mml:mo>′</mml:mo>
                </mml:msup>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:munder>
                <mml:mrow>
                  <mml:mtext>argmax</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mi>s</mml:mi>
                  <mml:mo>∈</mml:mo>
                  <mml:mi>S</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:munder>
              <mml:mtext>cosine</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mtext>embed</mml:mtext>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>,</mml:mo>
                  <mml:mtext>embed</mml:mtext>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>s</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi> S </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the synonym set for word <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> .</p>
        <p><italic>Slang Injection</italic>: Replacement with informal equivalents from dictionary <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> D </mml:mi><mml:mrow><mml:mtext> slang </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> : We compiled a slang dictionary of 2500 entries from Urban Dictionary [<xref ref-type="bibr" rid="B31">31</xref>], mapping informal terms to their formal equivalents (e.g., “g2g” → “got to go”).</p>
        <disp-formula id="FD4">
          <label>(4)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:msup>
                  <mml:mi>x</mml:mi>
                  <mml:mo>″</mml:mo>
                </mml:msup>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>D</mml:mi>
                <mml:mrow>
                  <mml:mtext>slang</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>if</mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>∈</mml:mo>
              <mml:mtext>keys</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>D</mml:mi>
                    <mml:mrow>
                      <mml:mtext>slang</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>To guarantee that ground-truth labels remain valid during the NAT process, all perturbation operations (including spelling errors, word dropout, synonym replacement, and slang injection) are applied exclusively to non-aspect tokens. Aspect terms and their exact character spans remain untouched to prevent label corruption. Following perturbation, the sentence is re-tokenized using the BERT/RoBERTa tokenizer, and the original BIO tags are automatically remapped to the new subword sequence using standard offset-based alignment. This ensures that AE and ASC labels stay perfectly aligned with the noisy input.</p>
        <p><italic>The training batch composition</italic> is controlled by noise ratio <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> : <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> set to 0.5.</p>
        <disp-formula id="FD5">
          <label>(5)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>N</mml:mi>
                <mml:mrow>
                  <mml:mtext>noisy</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>β</mml:mi>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>N</mml:mi>
                <mml:mrow>
                  <mml:mtext>total</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>,</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:msub>
                <mml:mi>N</mml:mi>
                <mml:mrow>
                  <mml:mtext>clean</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>−</mml:mo>
                  <mml:mi>β</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>N</mml:mi>
                <mml:mrow>
                  <mml:mtext>total</mml:mtext>
                </mml:mrow>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><italic>Curriculum Schedule</italic>: The noise probability follows a curriculum schedule:</p>
        <disp-formula id="FD6">
          <label>(6)</label>
          <mml:math>
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>p</mml:mi>
                <mml:mrow>
                  <mml:mtext>noise</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msubsup>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>p</mml:mi>
                <mml:mrow>
                  <mml:mtext>max</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>⋅</mml:mo>
              <mml:mtext>min</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>,</mml:mo>
                  <mml:mfrac>
                    <mml:mi>t</mml:mi>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>T</mml:mi>
                        <mml:mrow>
                          <mml:mtext>ramp</mml:mtext>
                        </mml:mrow>
                      </mml:msub>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <italic>t</italic> is the current training step, <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mtext> ramp </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 5000 </mml:mn></mml:mrow></mml:math></inline-formula> is the ramp-up period, and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> N </mml:mi><mml:mrow><mml:mtext> max </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.3 </mml:mn></mml:mrow></mml:math></inline-formula> is the maximum noise probability. Each individual perturbation probability (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> P </mml:mi><mml:mrow><mml:mtext> spell </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> P </mml:mi><mml:mrow><mml:mtext> drop </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> P </mml:mi><mml:mrow><mml:mtext> syn </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> P </mml:mi><mml:mrow><mml:mtext> slang </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> ) follows this same schedule.</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Model Architecture</title>
        <p>We design a unified multi-task transformer (<xref ref-type="fig" rid="fig1">Figure 1</xref>) with three components: a shared encoder producing contextualized token representations; an aspect extraction head for sequence labeling; and an aspect sentiment classification head with span-level attention. Joint learning avoids pipeline error propagation and enables task reinforcement.</p>
        <p><bold>Shared Transformer Encoder</bold>: Both clean and augmented noisy sentences <inline-formula><mml:math><mml:mrow><mml:mi> x </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> are encoded using a pre-trained transformer (BERT or RoBERTa):</p>
        <disp-formula id="FD7">
          <label>(7)</label>
          <mml:math>
            <mml:mrow>
              <mml:mstyle mathvariant="bold" mathsize="normal">
                <mml:mi>H</mml:mi>
              </mml:mstyle>
              <mml:mo>=</mml:mo>
              <mml:mtext>TransformerEncoder</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>x</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>h</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>h</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:mo>⋯</mml:mo>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>h</mml:mi>
                    <mml:mi>n</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>}</mml:mo>
              </mml:mrow>
              <mml:mo>,</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>∈</mml:mo>
              <mml:msup>
                <mml:mi>ℝ</mml:mi>
                <mml:mi>d</mml:mi>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/1733473-rId108.jpeg?20260313105507" />
        </fig>
        <p><bold>Figure 1</bold><bold>.</bold> Model architecture of the proposed noise-aware multi-task transformer framework for cross-domain ABSA. The model processes input sentences through a shared transformer encoder, then uses two task-specific heads for joint aspect extraction (BIO tagging) and sentiment classification. The noise generator creates realistic perturbations during training to enhance robustness.</p>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi> d </mml:mi><mml:mo> = </mml:mo><mml:mn> 768 </mml:mn></mml:mrow></mml:math></inline-formula> for base models. This shared representation serves as a common feature space for all downstream tasks.</p>
        <p><bold>Aspect Extraction Head:</bold>where Aspect extraction is formulated as a sequence labeling task using BIO tags. For each token representation <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> :</p>
        <disp-formula id="FD8">
          <label>(8)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>P</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>y</mml:mi>
                    <mml:mi>i</mml:mi>
                    <mml:mrow>
                      <mml:mtext>AE</mml:mtext>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:mo>|</mml:mo>
                  <mml:msub>
                    <mml:mi>h</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mtext>Softmax</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>W</mml:mi>
                    </mml:mstyle>
                    <mml:mrow>
                      <mml:mtext>AE</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:msub>
                    <mml:mi>h</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mrow>
                      <mml:mtext>AE</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> W </mml:mi><mml:mrow><mml:mtext> AE </mml:mtext></mml:mrow></mml:msub><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mn> 3 </mml:mn><mml:mo> × </mml:mo><mml:mi> d </mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula><italic>,</italic>and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mtext> B-ASP </mml:mtext><mml:mo> , </mml:mo><mml:mtext> I-ASP </mml:mtext><mml:mo> , </mml:mo><mml:mtext> O </mml:mtext></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula><italic>.</italic></p>
        <p>The extraction loss is token-level cross-entropy:</p>
        <disp-formula id="FD9">
          <label>(9)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mtext>AE</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>n</mml:mi>
              </mml:mfrac>
              <mml:mstyle displaystyle="true">
                <mml:msubsup>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mi>n</mml:mi>
                </mml:msubsup>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                  <mml:mi>P</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msubsup>
                        <mml:mi>y</mml:mi>
                        <mml:mi>i</mml:mi>
                        <mml:mtext>*</mml:mtext>
                      </mml:msubsup>
                      <mml:mo>|</mml:mo>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>h</mml:mi>
                        </mml:mstyle>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mo> * </mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> is the ground truth tag.</p>
        <p><bold>Aspect Sentiment Classification Head:</bold>For each aspect span, we compute an aspect-aware representation via attention pooling. During training the ASC head receives gold aspect spans (teacher forcing); at inference and for all reported results the AE head’s predicted spans are used, yielding a fully end-to-end joint evaluation that matches the protocol. First, compute attention weights:</p>
        <disp-formula id="FD10">
          <label>(10)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>α</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mi>exp</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mi>q</mml:mi>
                        <mml:mtext>T</mml:mtext>
                      </mml:msup>
                      <mml:msub>
                        <mml:mi>h</mml:mi>
                        <mml:mi>j</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mstyle mathsize="140%" displaystyle="true">
                      <mml:mo>∑</mml:mo>
                    </mml:mstyle>
                    <mml:mrow>
                      <mml:mi>k</mml:mi>
                      <mml:mo>=</mml:mo>
                      <mml:mi>s</mml:mi>
                    </mml:mrow>
                    <mml:mi>e</mml:mi>
                  </mml:msubsup>
                  <mml:mi>exp</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mi>q</mml:mi>
                        <mml:mtext>T</mml:mtext>
                      </mml:msup>
                      <mml:msub>
                        <mml:mi>h</mml:mi>
                        <mml:mi>k</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>,</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mi>j</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mi>s</mml:mi>
              <mml:mo>,</mml:mo>
              <mml:mo>⋯</mml:mo>
              <mml:mo>,</mml:mo>
              <mml:mi>e</mml:mi>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi> q </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mi> d </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is a learnable initialized randomly and updated during training. Then aggregate representations:</p>
        <disp-formula id="FD11">
          <label>(11)</label>
          <mml:math>
            <mml:mrow>
              <mml:mstyle mathvariant="bold" mathsize="normal">
                <mml:mi>a</mml:mi>
              </mml:mstyle>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:msubsup>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>j</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mi>s</mml:mi>
                  </mml:mrow>
                  <mml:mi>e</mml:mi>
                </mml:msubsup>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>α</mml:mi>
                    <mml:mi>j</mml:mi>
                  </mml:msub>
                  <mml:msub>
                    <mml:mi>h</mml:mi>
                    <mml:mi>j</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>for sentiment classification:</p>
        <disp-formula id="FD12">
          <label>(12)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>P</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>s</mml:mi>
                  <mml:mo>|</mml:mo>
                  <mml:mi>a</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mtext>Softmax</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>W</mml:mi>
                    <mml:mrow>
                      <mml:mtext>ASC</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mi>a</mml:mi>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mrow>
                      <mml:mtext>ASC</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi> s </mml:mi><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mtext> Positive </mml:mtext><mml:mo> , </mml:mo><mml:mtext> Negative </mml:mtext><mml:mo> , </mml:mo><mml:mtext> Neutral </mml:mtext></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . The ASC loss is:</p>
        <disp-formula id="FD13">
          <label>(13)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mtext>ASC</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mi>log</mml:mi>
              <mml:mi>P</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mi>s</mml:mi>
                    <mml:mo>*</mml:mo>
                  </mml:msup>
                  <mml:mo>|</mml:mo>
                  <mml:mi>a</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> s </mml:mi><mml:mtext> * </mml:mtext></mml:msup></mml:mrow></mml:math></inline-formula> is the ground truth sentiment.</p>
        <p><bold>Multi-Task Objective:</bold>The combined loss function is:</p>
        <disp-formula id="FD14">
          <label>(14)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mtext>total</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>λ</mml:mi>
                <mml:mrow>
                  <mml:mtext>AE</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mtext>AE</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>λ</mml:mi>
                <mml:mrow>
                  <mml:mtext>ASC</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mtext>ASC</mml:mtext>
                </mml:mrow>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>To promote noise-invariant representations we further introduce a sentence-level invariance loss <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> L </mml:mi><mml:mrow><mml:mtext> inv_sent </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> . For every clean-noisy pair <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> x </mml:mi><mml:mo> , </mml:mo><mml:mover accent="true"><mml:mi> x </mml:mi><mml:mo> ˜ </mml:mo></mml:mover></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> in a training batch we compute the KL-divergence between the model’s output distributions for both tasks (token probabilities for AE are averaged; ASC uses the pooled representation.</p>
        <p>To explicitly enforce noise invariance, we add a span-level <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> L </mml:mi><mml:mrow><mml:mtext> inv_span </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> . consistency loss between clean and noisy inputs. For each gold aspect span s, we compute pooled representations <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> v </mml:mi><mml:mi> s </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi> v </mml:mi><mml:mo> ˜ </mml:mo></mml:mover><mml:mi> s </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> from the clean and noisy sentences, respectively, and define:</p>
        <disp-formula id="FD15">
          <label>(15)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mtext>noise</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>|</mml:mo>
                    <mml:mi>S</mml:mi>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mfrac>
              <mml:mstyle displaystyle="true">
                <mml:msub>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>s</mml:mi>
                    <mml:mo>∈</mml:mo>
                    <mml:mi>S</mml:mi>
                  </mml:mrow>
                </mml:msub>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>‖</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>v</mml:mi>
                            <mml:mi>s</mml:mi>
                          </mml:msub>
                          <mml:mo>−</mml:mo>
                          <mml:msub>
                            <mml:mover accent="true">
                              <mml:mi>v</mml:mi>
                              <mml:mo>˜</mml:mo>
                            </mml:mover>
                            <mml:mi>s</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>‖</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                    <mml:mn>2</mml:mn>
                  </mml:msubsup>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The final training objective is:</p>
        <disp-formula id="FD16">
          <label>(16)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>ℒ</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>λ</mml:mi>
                <mml:mrow>
                  <mml:mtext>AE</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mtext>AE</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>λ</mml:mi>
                <mml:mrow>
                  <mml:mtext>ASC</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mtext>ASC</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>λ</mml:mi>
                <mml:mrow>
                  <mml:mtext>noise</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mtext>noise</mml:mtext>
                </mml:mrow>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> λ </mml:mi><mml:mrow><mml:mtext> noise </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is a hyperparameter that controls the strength of the noise-invariance constraint. <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> λ </mml:mi><mml:mrow><mml:mtext> AE </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> λ </mml:mi><mml:mrow><mml:mtext> ASC </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are task weights optimized via grid search. After searching over {0.2, 0.5, 1.0, 2.0} for each weight, we selected <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> λ </mml:mi><mml:mrow><mml:mtext> AE </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> = 1.0, <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> λ </mml:mi><mml:mrow><mml:mtext> ASC </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> = 1.0 on Rest14 validation. In all experiments, noise invariance is applied at the span level with <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> λ </mml:mi><mml:mrow><mml:mtext> noise </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow></mml:math></inline-formula> .</p>
      </sec>
      <sec id="sec3dot4">
        <title>3.4. Training Strategy</title>
        <p>We employ a mixed training regimen where each batch contains both clean and noisy samples following the curriculum schedule in Equation 6. All models are fine-tuned from pre-trained bert-base-uncased and roberta-base checkpoints.</p>
      </sec>
      <sec id="sec3dot5">
        <title>3.5. Cross-Domain Training Configuration</title>
        <p>We evaluate three configurations:</p>
        <p><bold>1)</bold><bold>In-Domain</bold>: <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mrow><mml:mtext> train </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mrow><mml:mtext> test </mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> (same domain);</p>
        <p><bold>2)</bold><bold>Cross-Domain</bold>: <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mrow><mml:mtext> train </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> S </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mrow><mml:mtext> test </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> T </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (different domains);</p>
        <p><bold>3)</bold><bold>Multi-Domain</bold>: <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mrow><mml:mtext> train </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mstyle displaystyle="true"><mml:msubsup><mml:mo> ∪ </mml:mo><mml:mrow><mml:mi> i </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mi> k </mml:mi></mml:msubsup><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mrow><mml:mtext> test </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> (trained on all, tested on each).</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Experiments and Results</title>
      <p>The study presents a detailed examination of a Noise-Aware Multi-Task Transformers for Cross-Domain when applied to three different benchmark datasets within the domain of ABSA.</p>
      <sec id="sec4dot1">
        <title>4.1. Dataset and Experiment Setup</title>
        <p>To test our model’s performance, we used benchmark datasets: (Res14 and LAP14) from SemEval-2014 Task 4 [<xref ref-type="bibr" rid="B9">9</xref>], and real-world dataset: (electronics and Apparel) from Amazon, and Food from Yelp. All carry three sentiment polarities: positive, neutral, and negative, <bold>Table 3</bold> presents detailed statistics for each dataset, including sentence counts, aspect counts, average length, and sentiment distribution. LAP14 has the highest share of long sentences (over 35 tokens) at 18%, which could hurt results compared to Res 14. Still, it better shows how the model handles tough, extended text. Meanwhile, Res14 contain mostly short sentences (under 20 tokens), making up 56.68%. </p>
        <p><italic><bold>Implementation details</bold></italic></p>
        <p>Models trained for up to 1500 steps. After 1000 steps, we selected the best checkpoint every 100 steps using micro-F1 on the dev set. We implement using PyTorch 2.0 and Hugging Face Transformers. Hyperparameters: learning rate 2 × 10<sup>−</sup><sup>5</sup>, batch size 16, AdamW optimizer with <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> β </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0.9 </mml:mn><mml:mo> , </mml:mo><mml:mn> 0.999 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , weight decay 0.01. Training runs for 20 epochs with early stopping (patience = 5), <italic>λ</italic><sub>noise</sub> = 0.1 (Noise invariance weight) and Dropout = 0.1 (Encoder + heads). All experiments use NVIDIA A100 GPUs. Experiments ran in PyCharm with Python 3.6.</p>
        <p>For preprocessing task, all sentences are tokenized using the tokenizer corresponding to each pre-trained encoder (BERT-base, RoBERTa-base). Keeping cased input for BERT; RoBERTa uses its default tokenization. Sentences longer than 128 tokens are truncated; shorter ones are padded. Aspect annotations are converted to BIO tags programmatically. </p>
        <p><italic><bold>Baselines</bold></italic></p>
        <p>We compare our approach to various baseline models listed in <bold>Table 2(a)</bold>. Most baselines target only particular ABSA subtasks, with some offering complete coverage across all components.</p>
        <p>Single-Task: MTL-AraBERT [<xref ref-type="bibr" rid="B15">15</xref>], Robust ABSA w/Non-counterfactual Aug. [<xref ref-type="bibr" rid="B30">30</xref>], SentiSys [<xref ref-type="bibr" rid="B1">1</xref>], EDA/UDA [<xref ref-type="bibr" rid="B23">23</xref>]Multi-Task: LEGO-ABSA [<xref ref-type="bibr" rid="B27">27</xref>] (fine-tuned on source domain), CC-ASTN [<xref ref-type="bibr" rid="B6">6</xref>], BERT-Based Cross-Domain [<xref ref-type="bibr" rid="B3">3</xref>], SentiSys [<xref ref-type="bibr" rid="B1">1</xref>].Cross-Domain: BGCA [<xref ref-type="bibr" rid="B20">20</xref>] (fine-tuned on source domain for fair comparison) UNIFIEDABSA [<xref ref-type="bibr" rid="B28">28</xref>] SyMux [<xref ref-type="bibr" rid="B29">29</xref>].</p>
        <p><italic><bold>Noise Simulation</bold></italic></p>
        <p>We simulate textual noise at two intensity levels (low and high) by introducing spelling errors, word deletions, synonym substitutions, and slang variations with different probabilities. The low-noise setting produces minor and mostly readable distortions, while the high-noise setting introduces stronger corruption that significantly alters word forms and sentence structure. following established noise simulation protocols [<xref ref-type="bibr" rid="B22">22</xref>][<xref ref-type="bibr" rid="B23">23</xref>] two intensity levels were created as:</p>
        <p>Low Noise: <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> spell </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.05 </mml:mn><mml:mo> , </mml:mo><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> drop </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.05 </mml:mn><mml:mo> , </mml:mo><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> syn </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.1 </mml:mn><mml:mo> , </mml:mo><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> slang </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.05 </mml:mn></mml:mrow></mml:math></inline-formula> ;High Noise: <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> spell </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.15 </mml:mn><mml:mo> , </mml:mo><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> drop </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.2 </mml:mn><mml:mo> , </mml:mo><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> syn </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.3 </mml:mn><mml:mo> , </mml:mo><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mtext> slang </mml:mtext></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.15 </mml:mn></mml:mrow></mml:math></inline-formula> .</p>
        <p><bold>Table 3</bold><bold>.</bold>Dataset statistics.</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td rowspan="2">Datasets</td>
                <td rowspan="2">Domain</td>
                <td rowspan="2"># Sentences</td>
                <td rowspan="2"># Aspects</td>
                <td rowspan="2">Avg Len</td>
                <td colspan="3">Train</td>
                <td colspan="3">Test</td>
              </tr>
              <tr>
                <td>Pos</td>
                <td>Neg</td>
                <td>Neu</td>
                <td>Pos</td>
                <td>Neg</td>
                <td>Neu</td>
              </tr>
              <tr>
                <td rowspan="2">SemEval14</td>
                <td>Restaurant</td>
                <td>3841</td>
                <td>4693</td>
                <td>19.8</td>
                <td>2164</td>
                <td>805</td>
                <td>633</td>
                <td>728</td>
                <td>196</td>
                <td>167</td>
              </tr>
              <tr>
                <td>Laptop</td>
                <td>3845</td>
                <td>3021</td>
                <td>21.3</td>
                <td>987</td>
                <td>458</td>
                <td>454</td>
                <td>341</td>
                <td>128</td>
                <td>169</td>
              </tr>
              <tr>
                <td rowspan="2">Amazon</td>
                <td>Electronics</td>
                <td>8247</td>
                <td>11845</td>
                <td>26.8</td>
                <td>4830</td>
                <td>1150</td>
                <td>2870</td>
                <td>2267</td>
                <td>1208</td>
                <td>567</td>
              </tr>
              <tr>
                <td>Apparel</td>
                <td>7892</td>
                <td>10234</td>
                <td>24.3</td>
                <td>4510</td>
                <td>1020</td>
                <td>1862</td>
                <td>1128</td>
                <td>255</td>
                <td>465</td>
              </tr>
              <tr>
                <td>Yelp</td>
                <td>Food</td>
                <td>9450</td>
                <td>14876</td>
                <td>23.1</td>
                <td>5980</td>
                <td>1230</td>
                <td>2390</td>
                <td>1495</td>
                <td>307</td>
                <td>560</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 4</bold> illustrates examples of original sentences and their corresponding noisy variants at both intensity levels.</p>
        <p><bold>Table 4</bold><bold>.</bold>Example sentence pairs (original → noisy variant).</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Original</bold>
                </td>
                <td>
                  <bold>Low Noise</bold>
                </td>
                <td>
                  <bold>High Noise</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>The battery life is amazing.</bold>
                </td>
                <td>The battery life is amazing.</td>
                <td>Th battry lf is amazing.</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><italic><bold>Evaluation Metrics</bold></italic></p>
        <p>To evaluate our experiments, we conducted Precision (P), Recall (R), F1-score for Aspect Extraction: Sentiment Classification: Accuracy, Macro-F1, for Efficiency: Training time (hours), Inference speed (sentences/second), Parameters (millions), and for Robustness: </p>
        <disp-formula id="FD17">
          <mml:math>
            <mml:mrow>
              <mml:mtext>Performance degradation</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msub>
                    <mml:mrow>
                      <mml:mtext>Perf</mml:mtext>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mtext>clean</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mrow>
                      <mml:mtext>Perf</mml:mtext>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mtext>noisy</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mrow>
                      <mml:mtext>Perf</mml:mtext>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mtext>clean</mml:mtext>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>×</mml:mo>
              <mml:mn>100</mml:mn>
              <mml:mtext>%</mml:mtext>
            </mml:mrow>
          </mml:math>
        </disp-formula>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Results</title>
        <p>4.2.1. Overall Performance Comparison (RQ1)</p>
        <p>The overall performance results from benchmark SemEval datasets are displayed in <bold>Table 5</bold>. Our proposed framework achieves highly competitive results across both domains and tasks. The RoBERTa variant shows the best performance with 87.9 F1 for AE and 85.6% accuracy for ASC on Rest14, representing improvements of +2.6 F1 and +2.9% over the best baseline (BGCA). Our unified multi-task approach proves effective through its continuous better performance in both Restaurants and Laptops domains. The performance gap between single-task models and our unified framework demonstrates the advantages of dual learning and common representation use.</p>
        <p><bold>Table 5</bold><bold>.</bold> Overall performance on SemEval benchmark datasets (F1-score for aspect extraction, accuracy for aspect sentiment classification). All results are mean ± std over 5 runs.</p>
        <table-wrap id="tbl5">
          <label>Table 5</label>
          <table>
            <tbody>
              <tr>
                <td rowspan="2">
                  <bold>Model</bold>
                </td>
                <td colspan="2">
                  <bold>Rest14</bold>
                </td>
                <td colspan="2">
                  <bold>Lap14</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>AE (F1)</bold>
                </td>
                <td>
                  <bold>ASC (Acc)</bold>
                </td>
                <td>
                  <bold>AE (F1)</bold>
                </td>
                <td>
                  <bold>ASC (Acc)</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>BERT-AE/SC</bold>
                </td>
                <td>82.3 ± 0.8/84.1 ± 0.7</td>
                <td>78.9 ± 0.9/79.5 ± 0.8</td>
                <td>80.1 ± 0.9/81.7 ± 0.8</td>
                <td>76.4 ± 1.0/77.1 ± 0.9</td>
              </tr>
              <tr>
                <td>
                  <bold>RoBERTa</bold>
                  <bold>-AE/SC</bold>
                </td>
                <td>83.7 ± 0.7/85.2 ± 0.6</td>
                <td>80.1 ± 0.8/80.9 ± 0.7</td>
                <td>81.5 ± 0.8/82.9 ± 0.7</td>
                <td>77.8 ± 0.9/78.6 ± 0.8</td>
              </tr>
              <tr>
                <td>
                  <bold>MTL-BERT</bold>
                </td>
                <td>84.6 ± 0.6</td>
                <td>81.5 ± 0.7</td>
                <td>82.8 ± 0.7</td>
                <td>78.9 ± 0.8</td>
              </tr>
              <tr>
                <td>
                  <bold>LEGO-ABSA*</bold>
                </td>
                <td>85.1 ± 0.6</td>
                <td>82.3 ± 0.7</td>
                <td>83.4 ± 0.7</td>
                <td>79.6 ± 0.8</td>
              </tr>
              <tr>
                <td>
                  <bold>CC-ASTN</bold>
                </td>
                <td>84.9 ± 0.6</td>
                <td>82.1 ± 0.7</td>
                <td>83.1 ± 0.7</td>
                <td>79.3 ± 0.8</td>
              </tr>
              <tr>
                <td>
                  <bold>BGCA*</bold>
                </td>
                <td>85.3 ± 0.6</td>
                <td>82.7 ± 0.7</td>
                <td>83.6 ± 0.7</td>
                <td>79.9 ± 0.8</td>
              </tr>
              <tr>
                <td>
                  <bold>Ours (BERT)</bold>
                </td>
                <td>
                  <bold>86.7</bold>
                  <bold>±</bold>
                  <bold>0.5</bold>
                </td>
                <td>
                  <bold>84.2</bold>
                  <bold>±</bold>
                  <bold>0.6</bold>
                </td>
                <td>
                  <bold>85.1</bold>
                  <bold>±</bold>
                  <bold>0.6</bold>
                </td>
                <td>
                  <bold>81.3</bold>
                  <bold>±</bold>
                  <bold>0.7</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>Ours (</bold>
                  <bold>RoBERTa</bold>
                  <bold>)</bold>
                </td>
                <td>
                  <bold>87.9</bold>
                  <bold>±</bold>
                  <bold>0.5*</bold>
                </td>
                <td>
                  <bold>85.6</bold>
                  <bold>±</bold>
                  <bold>0.6</bold>
                </td>
                <td>
                  <bold>86.3</bold>
                  <bold>±</bold>
                  <bold>0.6</bold>
                </td>
                <td>
                  <bold>82.8</bold>
                  <bold>±</bold>
                  <bold>0.7</bold>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><italic>*</italic>Fine-tuned on source domain for fair comparison.</p>
        <p>4.2.2. Noise Robustness Analysis (RQ2)</p>
        <p><bold>Table 6</bold> shows how well the system handles linguistic noise in the Amazon Electronics dataset. The noise-aware training (NAT) strategy of our study allows us to maintain performance in the presence of noisy environments. The model with NAT demonstrates only −9.4%/−11.7% performance loss during high noise situations which stands in contrast to the single-task BERT system that exhibits −22.4%/−26.1% performance decline, resulting in a 42% improvement of our model’s resistance to performance loss. The results demonstrate that: 1) All models degrade with increasing noise, but multi-task architectures show inherent robustness; 2) Our framework without NAT already outperforms baselines; 3) With NAT, degradation is minimized, proving the effectiveness of systematic noise injection during training. Concretely, NAT reduces the high-noise AE degradation from 16.1% (w/o NAT) to 9.4% (with NAT), a relative improvement of 42%. The corresponding ASC reduction is 39%.</p>
        <p>4.2.3. Cross-Domain Generalization (RQ3)</p>
        <p><bold>Table 7</bold> shows cross-domain generalization from Electronics to Apparel. The study presents performance results for Electronics as well as for cross-domain measurements which were conducted on Apparel. The system achieved its highest cross-domain results through 76.9 F1 score and 79.7% accuracy results which showed a minor performance decrease of 11 and 5.9 points when compared to BERT’s complete drop of 12.7 and 8.3 points. The research demonstrates advanced domain-independent knowledge representation systems. The study demonstrates that noise-aware training increases system robustness while also boosting abilities to transfer knowledge across different domains because it teaches models to disregard unimportant language differences which helps them identify fundamental meaning connections that remain consistent across different domains.</p>
        <p><bold>Table 6</bold><bold>.</bold>Performance degradation under different noise levels on Amazon Electronics dataset. Values show relative drop in F1 (AE)/Accuracy (ASC). Lower values indicate better robustness.</p>
        <table-wrap id="tbl6">
          <label>Table 6</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Model</bold>
                </td>
                <td>
                  <bold>Low Noise AE</bold>
                  <bold>/</bold>
                  <bold>ASC Degradation</bold>
                </td>
                <td>
                  <bold>High Noise AE</bold>
                  <bold>/</bold>
                  <bold>ASC Degradation</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>BERT-AE/SC</bold>
                </td>
                <td>−8.7%/−10.3%</td>
                <td>−22.4%/−26.1%</td>
              </tr>
              <tr>
                <td>
                  <bold>RoBERTa</bold>
                  <bold>-AE/SC</bold>
                </td>
                <td>−7.9%/−9.1%</td>
                <td>−20.7%/−24.3%</td>
              </tr>
              <tr>
                <td>
                  <bold>MTL-BERT</bold>
                </td>
                <td>−6.3%/−7.8%</td>
                <td>−18.9%/−22.7%</td>
              </tr>
              <tr>
                <td>
                  <bold>LEGO-ABSA</bold>
                </td>
                <td>−5.8%/−6.9%</td>
                <td>−17.4%/−20.5%</td>
              </tr>
              <tr>
                <td>
                  <bold>Ours (w/o NAT)</bold>
                </td>
                <td>−5.1%/−6.2%</td>
                <td>−16.1%/−19.2%</td>
              </tr>
              <tr>
                <td>
                  <bold>Ours (with NAT)</bold>
                </td>
                <td>
                  −
                  <bold>2.3%</bold>
                  <bold>/</bold>
                  −
                  <bold>3.1%</bold>
                </td>
                <td>
                  −
                  <bold>9.4%</bold>
                  <bold>/</bold>
                  −
                  <bold>11.7%</bold>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 7</bold><bold>.</bold> Cross-domain performance (Electronics → Apparel). In-domain performance on electronics shown for reference.</p>
        <table-wrap id="tbl7">
          <label>Table 7</label>
          <table>
            <tbody>
              <tr>
                <td rowspan="2">
                  <bold>Model</bold>
                </td>
                <td colspan="2">
                  <bold>In-domain (Elec)</bold>
                </td>
                <td colspan="2">
                  <bold>Cross (Apparel)</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>AE F1</bold>
                </td>
                <td>
                  <bold>ASC Acc</bold>
                </td>
                <td>
                  <bold>AE F1</bold>
                </td>
                <td>
                  <bold>ASC Acc</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>BERT</bold>
                </td>
                <td>82.3</td>
                <td>79.5</td>
                <td>68.4</td>
                <td>71.2</td>
              </tr>
              <tr>
                <td>
                  <bold>MTL-BERT</bold>
                </td>
                <td>84.6</td>
                <td>81.5</td>
                <td>70.1</td>
                <td>73.5</td>
              </tr>
              <tr>
                <td>
                  <bold>CC-ASTN</bold>
                </td>
                <td>84.9</td>
                <td>82.1</td>
                <td>72.3</td>
                <td>75.1</td>
              </tr>
              <tr>
                <td>
                  <bold>BGCA</bold>
                </td>
                <td>85.3</td>
                <td>82.7</td>
                <td>73.8</td>
                <td>76.4</td>
              </tr>
              <tr>
                <td>
                  <bold>Ours</bold>
                </td>
                <td>
                  <bold>87.9</bold>
                </td>
                <td>
                  <bold>85.6</bold>
                </td>
                <td>
                  <bold>76.9</bold>
                </td>
                <td>
                  <bold>79.7</bold>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 8</bold> shows how multi-domain training provides advantages. The mixed data training across all three domains led to improved results which reached F1 score increases between 0.7 and 1.6 for AE and 1.6 to 2.4 percent for ASC. The research indicates that learners who study various fields will acquire better skills to develop general knowledge systems which will decrease their tendency to become attached to particular field knowledge. The multi-task learning framework delivered better results than the single-task method across all research domains we tested. The Ours (Multi-Task) model demonstrated superior F1 performance in Aspect Extraction and achieved higher accuracy results in Sentiment Classification when compared to the single-task model. The model achieved its most effective results in the Apparel and Electronics domains because it utilized common features to enhance its performance. The research results demonstrate statistical significance which proves that simultaneous training on multiple domains results in improved model performance for accurate sentiment detection.</p>
        <p>4.2.4. Efficiency Analysis (RQ4)</p>
        <p><bold>Table 9</bold> presents the efficiency-accuracy trade-off. The framework we created requires 2M extra parameters which represent a 1.8% increase over MTL-BERT. Compared to MTL-BERT, the proposed model achieves F1 improvements of 3.3 points and accuracy improvements of 4.1 percent. The training time increase of 22 percent proves acceptable because it leads to major performance enhancements. The system achieves a practical inference speed of 340 sentences per second which supports real-time usage. Our method outperforms LEGO-ABSA especially in terms of cost-effectiveness and precision. The efficiency comparison shows that our proposed model achieves the highest performance in both Aspect Extraction (F1: 87.9) and Aspect Sentiment Classification (Accuracy: 85.6). The system requires more resources than the base BERT model yet it operates efficiently with acceptable speed during training and execution. The ablation study further highlights the importance of each component in our full model. The system performance declines together with cross-domain capability after we eliminate multi-task learning and noise-aware training and attention pooling. The system operates with decreased resistance against noise in audio signals because these elements do not exist especially when multi-task and NAT elements get deleted. The proposed architecture requires all components to achieve both high accuracy and system durability.</p>
        <p><bold>Table 8</bold><bold>.</bold> Multi-domain training results. Training on mixed data from all domains improves performance even on individual domains. All results are statistically significant (p &lt; 0.05).</p>
        <table-wrap id="tbl8">
          <label>Table 8</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Test Domain</bold>
                </td>
                <td>
                  <bold>Ours (multi-task)</bold>
                </td>
                <td>
                  <bold>Ours (Single-Task)</bold>
                </td>
                <td>
                  <bold>Improvement</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>Electronics</bold>
                </td>
                <td>85.8/83.1</td>
                <td>85.1/81.3</td>
                <td>+0.7/+1.8</td>
              </tr>
              <tr>
                <td>
                  <bold>Apparel</bold>
                </td>
                <td>84.3/81.9</td>
                <td>82.7/79.5</td>
                <td>+1.6/+2.4</td>
              </tr>
              <tr>
                <td>
                  <bold>Restaurants</bold>
                </td>
                <td>86.2/83.7</td>
                <td>84.9/82.1</td>
                <td>+1.3/+1.6</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 9</bold><bold>.</bold> Efficiency comparison on amazon electronics dataset (batch size = 16).</p>
        <table-wrap id="tbl9">
          <label>Table 9</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Model</bold>
                </td>
                <td>
                  <bold>Params (M)</bold>
                </td>
                <td>
                  <bold>Train Time (</bold>
                  <bold>hrs</bold>
                  <bold>)</bold>
                </td>
                <td>
                  <bold>Inf. Speed (sent/s)</bold>
                </td>
                <td>
                  <bold>AE F1</bold>
                </td>
                <td>
                  <bold>ASC Acc</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>BERT</bold>
                </td>
                <td>110</td>
                <td>4.2</td>
                <td>320</td>
                <td>82.3</td>
                <td>79.5</td>
              </tr>
              <tr>
                <td>
                  <bold>MTL-BERT</bold>
                </td>
                <td>110</td>
                <td>3.1</td>
                <td>350</td>
                <td>84.6</td>
                <td>81.5</td>
              </tr>
              <tr>
                <td>
                  <bold>Ours</bold>
                </td>
                <td>
                  <bold>112</bold>
                </td>
                <td>
                  <bold>3.8</bold>
                </td>
                <td>
                  <bold>340</bold>
                </td>
                <td>
                  <bold>87.9</bold>
                </td>
                <td>
                  <bold>85.6</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>LEGO-ABSA</bold>
                </td>
                <td>125</td>
                <td>5.2</td>
                <td>290</td>
                <td>85.1</td>
                <td>82.3</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Discussion</title>
      <sec id="sec5dot1">
        <title>5.1. Synthesis of Findings</title>
        <p>Our model delivers consistent gains: +2.6 F1 (AE)/+2.9% ACC (ASC) over the strongest baseline on SemEval Rest14 for BGCA (<bold>Table 5</bold>) and up to +3.1 F1 (AE) and +3.3% (ASC) over the strongest cross-domain baseline (BGCA) in <bold>Table 7</bold>. Across datasets and settings, the improvements consistently range between 2.6 - 3.1 F1 and 2.7% - 3.3% accuracy. The shared representation enables mutual reinforcement between tasks while reducing error propagation. The research showed that noise-aware training methods provide better training results because NAT reduces the high-noise AE degradation from 16.1% (Ours w/o NAT) to 9.4% (Ours with NAT), a relative improvement of 42% (and 39% for ASC; <bold>Table 6</bold>). Targeted augmentation techniques enable systematic learning of real-world linguistic variation robustness according to the research findings. The combination of multi-task learning and noise-aware mechanisms will produce better prediction stability according to results from RQ3. Our framework demonstrates effective cross-domain generalization because it only experiences minor performance reduction which indicates that noise-invariant representation learning enables models to detect fundamental patterns that exist across different domains. The proposed framework requires 2M parameters and 22% training time overhead according to RQ4 which demonstrates that systems can achieve robustness through low computational needs while maintaining efficient inference speed.</p>
      </sec>
      <sec id="sec5dot2">
        <title>5.2. Implications</title>
        <p>The results of our approach lead to several theoretical implications. First, noise augmentation functions as a strong regularizer. It helps the model learn noise-invariant representations that transfer more effectively across domains. This is consistent with prior work in NLP showing that increasing data, rather than model size, often improves robustness. Second, multi-task learning improves robustness in ways that go beyond simple accuracy gains, because it pushes the model to learn representations that support multiple related objectives at the same time. Third, the observed link between noise robustness and domain generalization indicates that both are supported by learning deeper and more abstract representations that are less sensitive to surface-level variations in the input.</p>
      </sec>
      <sec id="sec5dot3">
        <title>5.3. Model Analysis</title>
        <p><bold>Table 10</bold> shows the ablation study by demonstrating the contribution of each component. Removing multi-task learning causes the largest performance drop (−2.7 F1, −2.9% accuracy). Disabling NAT significantly reduces both noise robustness (degradation increases from −9.4% to −16.1%) and cross-domain performance. Removing attention pooling causes moderate drops. All components contribute meaningfully, with multi-task learning being most critical for accuracy and NAT for robustness.</p>
        <p>We manually analyze 100 error cases from the Restaurants test set and compare error type distribution between BERT and our model. <bold>Table 11</bold> shows the comparative of error analysis. This error analysis compares the performance of our proposed model against the baseline BERT model on the Restaurants test set, categorizing the types of errors encountered. The results demonstrate that our model achieves a consistent reduction in errors across all identified categories. The most significant improvement is observed in handling severe noise cases, where the error rate is reduced by 40% compared to BERT. There is also a substantial 34% reduction in aspect boundary errors, indicating the model’s superior ability to precisely delimit aspect terms. Furthermore, the model shows a marked improvement in understanding domain-specific language, with a 33% reduction in errors. While improvements in handling complex negation and implicit aspects are less pronounced, with reductions of 28% and 22% respectively, the overall trend indicates the proposed model’s robustness in addressing various challenging linguistic phenomena in sentiment analysis.</p>
        <p><bold>Table 10</bold><bold>.</bold> Ablation study on Amazon Electronics dataset, each row removes one component from the full model. Noise degradation is measured on the high-noise test set. Cross-domain performance is on Apparel.</p>
        <table-wrap id="tbl10">
          <label>Table 10</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Configuration</bold>
                </td>
                <td>
                  <bold>AE F1</bold>
                </td>
                <td>
                  <bold>ASC Acc</bold>
                </td>
                <td>
                  <bold>Noise Degrad.</bold>
                </td>
                <td>
                  <bold>Cross-Domain</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>Full Model</bold>
                </td>
                <td>87.9 ± 0.5</td>
                <td>85.6 ± 0.6</td>
                <td>−9.4%</td>
                <td>76.9</td>
              </tr>
              <tr>
                <td>
                  <bold>- Multi-Task</bold>
                </td>
                <td>85.2 ± 0.7</td>
                <td>82.7 ± 0.7</td>
                <td>−16.1%</td>
                <td>70.1</td>
              </tr>
              <tr>
                <td>
                  <bold>-</bold>
                  <bold>NAT</bold>
                </td>
                <td>86.3 ± 0.6</td>
                <td>83.9 ± 0.6</td>
                <td>−16.1%</td>
                <td>72.4</td>
              </tr>
              <tr>
                <td>
                  <bold>- Attention Pooling</bold>
                </td>
                <td>87.1 ± 0.5</td>
                <td>84.8 ± 0.6</td>
                <td>−11.2%</td>
                <td>74.6</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 11</bold><bold>.</bold>Error type distribution comparison between BERT and our model on Restaurants test set.</p>
        <table-wrap id="tbl11">
          <label>Table 11</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Error Type</bold>
                </td>
                <td>
                  <bold>BERT</bold>
                </td>
                <td>
                  <bold>Ours</bold>
                </td>
                <td>
                  <bold>Reduction</bold>
                </td>
              </tr>
              <tr>
                <td>Aspect boundary errors</td>
                <td>32%</td>
                <td>21%</td>
                <td>34%</td>
              </tr>
              <tr>
                <td>Complex negation</td>
                <td>25%</td>
                <td>18%</td>
                <td>28%</td>
              </tr>
              <tr>
                <td>Implicit aspects</td>
                <td>18%</td>
                <td>14%</td>
                <td>22%</td>
              </tr>
              <tr>
                <td>Domain-specific language</td>
                <td>15%</td>
                <td>10%</td>
                <td>33%</td>
              </tr>
              <tr>
                <td>Severe noise cases</td>
                <td>10%</td>
                <td>6%</td>
                <td>40%</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>The residual errors provide clear insights into remaining challenges and the complementary roles of our components. Complex negation scope (e.g., -not bad but overpriced) still accounts for 18% of errors; NAT reduces this by exposing varied phrasings during training, while MTL helps the shared encoder learn consistent aspect-sentiment alignments. Boundary fragmentation in multi-word aspects (e.g., battery life) is largely mitigated by the span-level attention pooling, which focuses representation on the whole extracted span. Domain-specific lexical shifts (e.g., long = positive for batteries) drop 33% thanks to synonym and slang augmentation that forces the model to rely on contextual rather than surface cues. These patterns confirm that MTL supplies the joint reasoning backbone, NAT supplies surface robustness, and attention pooling supplies precise span aggregation.</p>
      </sec>
      <sec id="sec5dot4">
        <title>5.4. Limitations and Future Work</title>
        <p>Despite the encouraging results, several limitations should be acknowledged. The created noise models demonstrate effective performance for English usage yet their application to other languages and cultural settings proves to be ineffective. Future work should explore methods for generating noise which adapt to different languages and cultural backgrounds. The current approach detects local token-based noise but it cannot detect sarcasm and irony and cultural references which affect how people understand sentiments. The training process takes 22 percent more time which works for our situation but becomes unmanageable when dealing with extremely large data sets and model structures. Researchers should investigate better methods for augmenting data which include using adversarial attacks and creating noise through dynamic methods. The experiments do not cover very long texts (over 512 tokens) that exceed typical transformer input limits. Researchers have not yet determined how to assess system performance for handling extensive documents. The field of ABSA now requires multimodal input; therefore, systems must develop ability to resist noise from textual sources and visual content and other sensory input which produces distinct forms of interference. The scientific community has not yet discovered how noise augmentation methods lead to improved ability to generalize across different domains. The representation analysis process enables researchers to understand how different aspects of robustness and generalization develop together.</p>
      </sec>
    </sec>
    <sec id="sec6">
      <title>6. Conclusion</title>
      <p>The research conducted an extensive study which developed reliable systems for Aspect-Based Sentiment Analysis (ABSA) that can effectively handle the difficulties faced in actual operational situations. We developed a unified multi-task transformer framework which enabled simultaneous aspect extraction and sentiment classification through one unified system. Our approach achieved superior results over strong baseline models through experiments conducted across three domains which used both benchmark and real-world datasets. We created a training approach which enhances system strength through artificial noise generation that enables researchers to train with specific noise conditions. The research demonstrated that domain generalization and noise robustness function as different yet complementary skills which NAT-trained models handle better through noisy text and cross-domain capabilities. The efficiency study proved that our system achieves performance improvements which require only 22% extra training time and 3% additional time for inference when compared to multi-task baseline systems which lack NAT. The system provides an operational advantage because the system achieves positive results at production environments. Our robust approach enables organizations to extract valuable user insights because online platforms produce increasingly diverse and noisy text data. We consider this research to be essential for developing more fair and easily accessible NLP systems. Future work will extend noise-aware training to multilingual and multimodal ABSA, explore more efficient augmentation strategies, and investigate the theoretical connections between noise robustness and domain generalization more deeply.</p>
    </sec>
    <sec id="sec7">
      <title>Data Availability</title>
      <p>The data that support the findings of this study are available from the corresponding author, [S], upon reasonable request.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Li, C., Tang, H., Zhang, J., Guo, X., Cheng, D. and Morimoto, Y. (2024) Advancing Aspect-Based Sentiment Analysis through Deep Learning Models. In: <italic>Lecture Notes in Computer Science</italic>, Springer, 228-242. https://doi.org/10.1007/978-981-96-0847-8_16 <pub-id pub-id-type="doi">10.1007/978-981-96-0847-8_16</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-981-96-0847-8_16">https://doi.org/10.1007/978-981-96-0847-8_16</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Li, C.</string-name>
              <string-name>Tang, H.</string-name>
              <string-name>Zhang, J.</string-name>
              <string-name>Guo, X.</string-name>
              <string-name>Cheng, D.</string-name>
              <string-name>Morimoto, Y.</string-name>
              <string-name>Science, S</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Advancing Aspect-Based Sentiment Analysis through Deep Learning Models</article-title>
            <source>In: Lecture Notes in Computer Science</source>
            <volume>228</volume>
            <pub-id pub-id-type="doi">10.1007/978-981-96-0847-8_16</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhang, W., Li, X., Deng, Y., Bing, L. and Lam, W. (2023) A Survey on Aspect-Based Sentiment Analysis: Tasks, Methods, and Challenges. <italic>IEEE Transactions on Knowl</italic><italic>edge and Data Engineering</italic>, 35, 11019-11038. https://doi.org/10.1109/tkde.2022.3230975 <pub-id pub-id-type="doi">10.1109/tkde.2022.3230975</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tkde.2022.3230975">https://doi.org/10.1109/tkde.2022.3230975</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhang, W.</string-name>
              <string-name>Li, X.</string-name>
              <string-name>Deng, Y.</string-name>
              <string-name>Bing, L.</string-name>
              <string-name>Lam, W.</string-name>
              <string-name>Tasks, M</string-name>
            </person-group>
            <year>2023</year>
            <article-title>A Survey on Aspect-Based Sentiment Analysis: Tasks, Methods, and Challenges</article-title>
            <source>IEEE Transactions on Knowledge and Data Engineering</source>
            <volume>35</volume>
            <pub-id pub-id-type="doi">10.1109/tkde.2022.3230975</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Liu, N. and Zhao, J. (2022) A Bert-Based Aspect-Level Sentiment Analysis Algorithm for Cross-Domain Text. <italic>Computational Intelligence and Neuroscience</italic>, 2022, 1-11. https://doi.org/10.1155/2022/8726621 <pub-id pub-id-type="doi">10.1155/2022/8726621</pub-id><pub-id pub-id-type="pmid">35795761</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1155/2022/8726621">https://doi.org/10.1155/2022/8726621</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Liu, N.</string-name>
              <string-name>Zhao, J.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>A Bert-Based Aspect-Level Sentiment Analysis Algorithm for Cross-Domain Text</article-title>
            <source>Computational Intelligence and Neuroscience</source>
            <volume>2022</volume>
            <pub-id pub-id-type="doi">10.1155/2022/8726621</pub-id>
            <pub-id pub-id-type="pmid">35795761</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Nazir, A., Rao, Y., Wu, L. and Sun, L. (2022) Issues and Challenges of Aspect-Based Sentiment Analysis: A Comprehensive Survey. <italic>IEEE Transactions on Affective Computing</italic>, 13, 845-863. https://doi.org/10.1109/taffc.2020.2970399 <pub-id pub-id-type="doi">10.1109/taffc.2020.2970399</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/taffc.2020.2970399">https://doi.org/10.1109/taffc.2020.2970399</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Nazir, A.</string-name>
              <string-name>Rao, Y.</string-name>
              <string-name>Wu, L.</string-name>
              <string-name>Sun, L.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Issues and Challenges of Aspect-Based Sentiment Analysis: A Comprehensive Survey</article-title>
            <source>IEEE Transactions on Affective Computing</source>
            <volume>13</volume>
            <pub-id pub-id-type="doi">10.1109/taffc.2020.2970399</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Schouten, K. and Frasincar, F. (2016) Survey on Aspect-Level Sentiment Analysis. <italic>IEEE Transactions on Knowledge and Data Engineering</italic>, 28, 813-830. https://doi.org/10.1109/tkde.2015.2485209 <pub-id pub-id-type="doi">10.1109/tkde.2015.2485209</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tkde.2015.2485209">https://doi.org/10.1109/tkde.2015.2485209</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Schouten, K.</string-name>
              <string-name>Frasincar, F.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Survey on Aspect-Level Sentiment Analysis</article-title>
            <source>IEEE Transactions on Knowledge and Data Engineering</source>
            <volume>28</volume>
            <pub-id pub-id-type="doi">10.1109/tkde.2015.2485209</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Dubey, G., Chadha, A., Jyoti, A., Raj, G., Kaur, K. and Dubey, A.K. (2025) Contextualized Cross-Domain Aspect Sentiment Transformer: A Fine-Grained Aspect-Centric Approach for Enhanced Context-Aware Sentiment Analysis. <italic>Computational Intelligence</italic>, 41, e70081. https://doi.org/10.1111/coin.70081 <pub-id pub-id-type="doi">10.1111/coin.70081</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1111/coin.70081">https://doi.org/10.1111/coin.70081</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Dubey, G.</string-name>
              <string-name>Chadha, A.</string-name>
              <string-name>Jyoti, A.</string-name>
              <string-name>Raj, G.</string-name>
              <string-name>Kaur, K.</string-name>
              <string-name>Dubey, A.K.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Contextualized Cross-Domain Aspect Sentiment Transformer: A Fine-Grained Aspect-Centric Approach for Enhanced Context-Aware Sentiment Analysis</article-title>
            <source>Computational Intelligence</source>
            <volume>41</volume>
            <pub-id pub-id-type="doi">10.1111/coin.70081</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Yu, J., Zhao, Q. and Xia, R. (2023) Cross-Domain Data Augmentation with Domain-Adaptive Language Modeling for Aspect-Based Sentiment Analysis. <italic>Proceedings of the</italic> 61 <italic>st Annual Meeting of the Association for Computational Linguistics</italic> ( <italic>Volume</italic> 1: <italic>Long Papers</italic>), Toronto, July 2023, 1456-1470. https://doi.org/10.18653/v1/2023.acl-long.81 <pub-id pub-id-type="doi">10.18653/v1/2023.acl-long.81</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.18653/v1/2023.acl-long.81">https://doi.org/10.18653/v1/2023.acl-long.81</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Yu, J.</string-name>
              <string-name>Zhao, Q.</string-name>
              <string-name>Xia, R.</string-name>
              <string-name>Toronto, J</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Cross-Domain Data Augmentation with Domain-Adaptive Language Modeling for Aspect-Based Sentiment Analysis</article-title>
            <source>Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>
            <volume>1456</volume>
            <pub-id pub-id-type="doi">10.18653/v1/2023.acl-long.81</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Chen, C., Teng, Z., Wang, Z. and Zhang, Y. (2022) Discrete Opinion Tree Induction for Aspect-Based Sentiment Analysis. <italic>Proceedings of the</italic> 60 <italic>th Annual Meeting of the Association for Computational Linguistics</italic> ( <italic>Volume</italic> 1: <italic>Long Papers</italic>), Dublin, May 2022, 2051-2064. https://doi.org/10.18653/v1/2022.acl-long.145 <pub-id pub-id-type="doi">10.18653/v1/2022.acl-long.145</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.18653/v1/2022.acl-long.145">https://doi.org/10.18653/v1/2022.acl-long.145</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Chen, C.</string-name>
              <string-name>Teng, Z.</string-name>
              <string-name>Wang, Z.</string-name>
              <string-name>Zhang, Y.</string-name>
              <string-name>Dublin, M</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Discrete Opinion Tree Induction for Aspect-Based Sentiment Analysis</article-title>
            <source>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>
            <volume>2051</volume>
            <pub-id pub-id-type="doi">10.18653/v1/2022.acl-long.145</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Pontiki, M., Galanis, D., Pavlopoulos, J., <italic>et al</italic>. (2014) SemEval 2014 Task 4: Aspect Based Sentiment Analysis. <italic>Proceedings of the 8th International Workshop on Semantic Evaluation</italic> ( <italic>SemEval</italic> 2014) <italic>at</italic>( <italic>COLING</italic>2014), Dublin, August 2014, 27-35. http://www.aclweb.org/anthology/S14-2004</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Pontiki, M.</string-name>
              <string-name>Galanis, D.</string-name>
              <string-name>Pavlopoulos, J.</string-name>
              <string-name>Dublin, A</string-name>
            </person-group>
            <year>2014</year>
            <article-title>SemEval 2014 Task 4: Aspect Based Sentiment Analysis</article-title>
            <source>Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014) at (COLING 2014)</source>
            <volume>27</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">McAuley, J., Targett, C., Shi, Q. and van den Hengel, A. (2015). Image-Based Recommendations on Styles and Substitutes. <italic>Proceedings of the</italic>38 <italic>th International ACM SIGIR Conference on Research and Development in Information Retrieval</italic>, Santiago, 9-13 August 2015, 43-52. https://doi.org/10.1145/2766462.2767755 <pub-id pub-id-type="doi">10.1145/2766462.2767755</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/2766462.2767755">https://doi.org/10.1145/2766462.2767755</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>McAuley, J.</string-name>
              <string-name>Targett, C.</string-name>
              <string-name>Shi, Q.</string-name>
              <string-name>Hengel, A.</string-name>
              <string-name>Retrieval, S</string-name>
            </person-group>
            <year>2015</year>
            <pub-id pub-id-type="doi">10.1145/2766462.2767755</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <mixed-citation publication-type="web">Yelp. Yelp Open Dataset. https://business.yelp.com/data/resources/open-dataset/</mixed-citation>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Wu, C., Ma, B., Zhang, Z., Deng, N., He, Y. and Xue, Y. (2025) Evaluating Zero-Shot Multilingual Aspect-Based Sentiment Analysis with Large Language Models. <italic>International Journal of Machine Learning and Cybernetics</italic>, 16, 8079-8101. https://doi.org/10.1007/s13042-025-02711-z <pub-id pub-id-type="doi">10.1007/s13042-025-02711-z</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s13042-025-02711-z">https://doi.org/10.1007/s13042-025-02711-z</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Wu, C.</string-name>
              <string-name>Ma, B.</string-name>
              <string-name>Zhang, Z.</string-name>
              <string-name>Deng, N.</string-name>
              <string-name>He, Y.</string-name>
              <string-name>Xue, Y.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Evaluating Zero-Shot Multilingual Aspect-Based Sentiment Analysis with Large Language Models</article-title>
            <source>International Journal of Machine Learning and Cybernetics</source>
            <volume>16</volume>
            <pub-id pub-id-type="doi">10.1007/s13042-025-02711-z</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Yang, L., Na, J. and Yu, J. (2022) Cross-Modal Multitask Transformer for End-To-End Multimodal Aspect-Based Sentiment Analysis. <italic>Information Processing &amp; Man</italic><italic>agement</italic>, 59, Article 103038. https://doi.org/10.1016/j.ipm.2022.103038 <pub-id pub-id-type="doi">10.1016/j.ipm.2022.103038</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ipm.2022.103038">https://doi.org/10.1016/j.ipm.2022.103038</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Yang, L.</string-name>
              <string-name>Na, J.</string-name>
              <string-name>Yu, J.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Cross-Modal Multitask Transformer for End-To-End Multimodal Aspect-Based Sentiment Analysis</article-title>
            <source>Information Processing &amp; Management</source>
            <volume>59</volume>
            <elocation-id>103038</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.ipm.2022.103038</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">He, Z., Wang, H. and Zhang, X. (2023) Multi-Task Learning Model Based on BERT and Knowledge Graph for Aspect-Based Sentiment Analysis. <italic>Electronics</italic>, 12, Article 737. https://doi.org/10.3390/electronics12030737 <pub-id pub-id-type="doi">10.3390/electronics12030737</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/electronics12030737">https://doi.org/10.3390/electronics12030737</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>He, Z.</string-name>
              <string-name>Wang, H.</string-name>
              <string-name>Zhang, X.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Multi-Task Learning Model Based on BERT and Knowledge Graph for Aspect-Based Sentiment Analysis</article-title>
            <source>Electronics</source>
            <volume>12</volume>
            <elocation-id>737</elocation-id>
            <pub-id pub-id-type="doi">10.3390/electronics12030737</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Fadel, A., Saleh, M., Salama, R. and Abulnaja, O. (2024) MTL-AraBERT: An Enhanced Multi-Task Learning Model for Arabic Aspect-Based Sentiment Analysis. <italic>Computers</italic>, 13, 98. https://doi.org/10.3390/computers13040098 <pub-id pub-id-type="doi">10.3390/computers13040098</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/computers13040098">https://doi.org/10.3390/computers13040098</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Fadel, A.</string-name>
              <string-name>Saleh, M.</string-name>
              <string-name>Salama, R.</string-name>
              <string-name>Abulnaja, O.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>MTL-AraBERT: An Enhanced Multi-Task Learning Model for Arabic Aspect-Based Sentiment Analysis</article-title>
            <source>Computers</source>
            <volume>13</volume>
            <pub-id pub-id-type="doi">10.3390/computers13040098</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Alshuwaier, F., Areshey, A. and Poon, J. (2022) Applications and Enhancement of Document-Based Sentiment Analysis in Deep Learning Methods: Systematic Literature Review. <italic>Intelligent Systems with Applications</italic>, 15, Article 200090. https://doi.org/10.1016/j.iswa.2022.200090 <pub-id pub-id-type="doi">10.1016/j.iswa.2022.200090</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.iswa.2022.200090">https://doi.org/10.1016/j.iswa.2022.200090</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Alshuwaier, F.</string-name>
              <string-name>Areshey, A.</string-name>
              <string-name>Poon, J.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Applications and Enhancement of Document-Based Sentiment Analysis in Deep Learning Methods: Systematic Literature Review</article-title>
            <source>Intelligent Systems with Applications</source>
            <volume>15</volume>
            <elocation-id>200090</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.iswa.2022.200090</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Labeed, Q. and Liang, X. (2024) Multi-Task Learning Transformers: Comparative Analysis for Emotion Classification and Intensity Prediction in Social Media. 2024 14 <italic>th International Conference on Pattern Recognition Systems</italic> ( <italic>ICPRS</italic>), London, 15-18 July 2024, 1-7. https://doi.org/10.1109/icprs62101.2024.10677817 <pub-id pub-id-type="doi">10.1109/icprs62101.2024.10677817</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/icprs62101.2024.10677817">https://doi.org/10.1109/icprs62101.2024.10677817</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Labeed, Q.</string-name>
              <string-name>Liang, X.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Multi-Task Learning Transformers: Comparative Analysis for Emotion Classification and Intensity Prediction in Social Media</article-title>
            <source>2024 14th International Conference on Pattern Recognition Systems (ICPRS)</source>
            <volume>15</volume>
            <pub-id pub-id-type="doi">10.1109/icprs62101.2024.10677817</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Aziz, K., Ji, D., Chakrabarti, P., Chakrabarti, T., Iqbal, M.S. and Abbasi, R. (2024) Unifying Aspect-Based Sentiment Analysis BERT and Multi-Layered Graph Convolutional Networks for Comprehensive Sentiment Dissection. <italic>Scientific Reports</italic>, 14, Article No. 14646. https://doi.org/10.1038/s41598-024-61886-7 <pub-id pub-id-type="doi">10.1038/s41598-024-61886-7</pub-id><pub-id pub-id-type="pmid">38918461</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41598-024-61886-7">https://doi.org/10.1038/s41598-024-61886-7</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Aziz, K.</string-name>
              <string-name>Ji, D.</string-name>
              <string-name>Chakrabarti, P.</string-name>
              <string-name>Chakrabarti, T.</string-name>
              <string-name>Iqbal, M.S.</string-name>
              <string-name>Abbasi, R.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Unifying Aspect-Based Sentiment Analysis BERT and Multi-Layered Graph Convolutional Networks for Comprehensive Sentiment Dissection</article-title>
            <source>Scientific Reports</source>
            <volume>14</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1038/s41598-024-61886-7</pub-id>
            <pub-id pub-id-type="pmid">38918461</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Zhou, Y., Zhu, F., Song, P., Han, J., Guo, T. and Hu, S. (2021) An Adaptive Hybrid Framework for Cross-Domain Aspect-Based Sentiment Analysis. <italic>Proceedings of the AAAI Conference on Artificial Intelligence</italic>, 35, 14630-14637. https://doi.org/10.1609/aaai.v35i16.17719 <pub-id pub-id-type="doi">10.1609/aaai.v35i16.17719</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1609/aaai.v35i16.17719">https://doi.org/10.1609/aaai.v35i16.17719</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Zhou, Y.</string-name>
              <string-name>Zhu, F.</string-name>
              <string-name>Song, P.</string-name>
              <string-name>Han, J.</string-name>
              <string-name>Guo, T.</string-name>
              <string-name>Hu, S.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>An Adaptive Hybrid Framework for Cross-Domain Aspect-Based Sentiment Analysis</article-title>
            <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
            <volume>35</volume>
            <pub-id pub-id-type="doi">10.1609/aaai.v35i16.17719</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Deng, Y., Zhang, W., Pan, S.J. and Bing, L. (2023) Bidirectional Generative Framework for Cross-Domain Aspect-Based Sentiment Analysis. <italic>Proceedings of the</italic> 61 <italic>st Annual Meeting of the Association for Computational Linguistics</italic> ( <italic>Volume</italic> 1: <italic>Long Papers</italic>), Toronto, July 2023, 12272-12285. https://doi.org/10.18653/v1/2023.acl-long.686 <pub-id pub-id-type="doi">10.18653/v1/2023.acl-long.686</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.18653/v1/2023.acl-long.686">https://doi.org/10.18653/v1/2023.acl-long.686</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Deng, Y.</string-name>
              <string-name>Zhang, W.</string-name>
              <string-name>Pan, S.J.</string-name>
              <string-name>Bing, L.</string-name>
              <string-name>Toronto, J</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Bidirectional Generative Framework for Cross-Domain Aspect-Based Sentiment Analysis</article-title>
            <source>Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>
            <pub-id pub-id-type="doi">10.18653/v1/2023.acl-long.686</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zou, H. and Wang, Y. (2025) Large Language Model Augmented Syntax-Aware Domain Adaptation Method for Aspect-Based Sentiment Analysis. <italic>Neurocomputing</italic>, 625, Article 129472. https://doi.org/10.1016/j.neucom.2025.129472 <pub-id pub-id-type="doi">10.1016/j.neucom.2025.129472</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.neucom.2025.129472">https://doi.org/10.1016/j.neucom.2025.129472</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zou, H.</string-name>
              <string-name>Wang, Y.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Large Language Model Augmented Syntax-Aware Domain Adaptation Method for Aspect-Based Sentiment Analysis</article-title>
            <source>Neurocomputing</source>
            <volume>625</volume>
            <elocation-id>129472</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.neucom.2025.129472</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Wei, J. and Zou, K. (2019) EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks. <italic>Proceedings of the</italic> 2019 <italic>Conference on Empirical Methods in Natural Language Processing and the</italic>9 <italic>th International Joint Conference on Natural Language Processing</italic>( <italic>EMNLP</italic>- <italic>IJCNLP</italic>), Hong Kong, November 2019, 6382-6388. https://doi.org/10.18653/v1/d19-1670 <pub-id pub-id-type="doi">10.18653/v1/d19-1670</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.18653/v1/d19-1670">https://doi.org/10.18653/v1/d19-1670</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Wei, J.</string-name>
              <string-name>Zou, K.</string-name>
              <string-name>Kong, N</string-name>
            </person-group>
            <year>2019</year>
            <article-title>EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks</article-title>
            <source>Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
            <volume>6382</volume>
            <pub-id pub-id-type="doi">10.18653/v1/d19-1670</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Xie, Q., Dai, Z., Hovy, E., Luong, M.T. and Le, Q.V. (2020) Unsupervised Data Augmentation for Consistency Training. <italic>Proceedings of the</italic> 34 <italic>th International Conference on Neural Information Processing Systems</italic>, Vancouver 6-12 December 2020, 6256-6268.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Xie, Q.</string-name>
              <string-name>Dai, Z.</string-name>
              <string-name>Hovy, E.</string-name>
              <string-name>Luong, M.T.</string-name>
              <string-name>Le, Q.V.</string-name>
              <string-name>Systems, V</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Unsupervised Data Augmentation for Consistency Training</article-title>
            <source>Proceedings of the 34th International Conference on Neural Information Processing Systems</source>
            <volume>6256</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Zhuang, S., Shou, L., Pei, J., Gong, M., Ren, H., Zuccon, G., <italic>et al</italic>. (2023) Typos-Aware Bottlenecked Pre-Training for Robust Dense Retrieval. <italic>Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region</italic>, Beijing, 26-28 November 2023, 212-222. https://doi.org/10.1145/3624918.3625324 <pub-id pub-id-type="doi">10.1145/3624918.3625324</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3624918.3625324">https://doi.org/10.1145/3624918.3625324</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Zhuang, S.</string-name>
              <string-name>Shou, L.</string-name>
              <string-name>Pei, J.</string-name>
              <string-name>Gong, M.</string-name>
              <string-name>Ren, H.</string-name>
              <string-name>Zuccon, G.</string-name>
              <string-name>Region, B</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Typos-Aware Bottlenecked Pre-Training for Robust Dense Retrieval</article-title>
            <source>Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region</source>
            <volume>26</volume>
            <pub-id pub-id-type="doi">10.1145/3624918.3625324</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B25">
        <label>25.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bashiri, H. and Naderi, H. (2024) Comprehensive Review and Comparative Analysis of Transformer Models in Sentiment Analysis. <italic>Knowledge and Information Systems</italic>, 66, 7305-7361. https://doi.org/10.1007/s10115-024-02214-3 <pub-id pub-id-type="doi">10.1007/s10115-024-02214-3</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10115-024-02214-3">https://doi.org/10.1007/s10115-024-02214-3</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bashiri, H.</string-name>
              <string-name>Naderi, H.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Comprehensive Review and Comparative Analysis of Transformer Models in Sentiment Analysis</article-title>
            <source>Knowledge and Information Systems</source>
            <volume>66</volume>
            <pub-id pub-id-type="doi">10.1007/s10115-024-02214-3</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B26">
        <label>26.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, H., Li, X., Ren, Z., Wang, M. and Ma, C. (2023) Multimodal Sentiment Analysis Representations Learning via Contrastive Learning with Condense Attention Fusion. <italic>Sensors</italic>, 23, Article 2679. https://doi.org/10.3390/s23052679 <pub-id pub-id-type="doi">10.3390/s23052679</pub-id><pub-id pub-id-type="pmid">36904883</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/s23052679">https://doi.org/10.3390/s23052679</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, H.</string-name>
              <string-name>Li, X.</string-name>
              <string-name>Ren, Z.</string-name>
              <string-name>Wang, M.</string-name>
              <string-name>Ma, C.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Multimodal Sentiment Analysis Representations Learning via Contrastive Learning with Condense Attention Fusion</article-title>
            <source>Sensors</source>
            <volume>23</volume>
            <elocation-id>2679</elocation-id>
            <pub-id pub-id-type="doi">10.3390/s23052679</pub-id>
            <pub-id pub-id-type="pmid">36904883</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B27">
        <label>27.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Yan, H., Dai, J., Ji, T., Qiu, X. and Zhang, Z. (2021) A Unified Generative Framework for Aspect-Based Sentiment Analysis. <italic>Proceedings of the</italic> 59 <italic>th Annual Meeting of the Association for Computational Linguistics and the</italic> 11 <italic>th International Joint Conference on Natural Language Processing</italic> ( <italic>Volume</italic> 1: <italic>Long Papers</italic>), Online, August 2021, 2416-2429. https://doi.org/10.18653/v1/2021.acl-long.188 <pub-id pub-id-type="doi">10.18653/v1/2021.acl-long.188</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.18653/v1/2021.acl-long.188">https://doi.org/10.18653/v1/2021.acl-long.188</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Yan, H.</string-name>
              <string-name>Dai, J.</string-name>
              <string-name>Ji, T.</string-name>
              <string-name>Qiu, X.</string-name>
              <string-name>Zhang, Z.</string-name>
              <string-name>Online, A</string-name>
            </person-group>
            <year>2021</year>
            <article-title>A Unified Generative Framework for Aspect-Based Sentiment Analysis</article-title>
            <source>Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers)</source>
            <volume>2416</volume>
            <pub-id pub-id-type="doi">10.18653/v1/2021.acl-long.188</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B28">
        <label>28.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, Z., Xia, R. and Yu, J. (2022) Unified ABSA: A Unified ABSA Framework Based on Multi-Task Instruction Tuning.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, Z.</string-name>
              <string-name>Xia, R.</string-name>
              <string-name>Yu, J.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Unified ABSA: A Unified ABSA Framework Based on Multi-Task Instruction Tuning</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B29">
        <label>29.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Fei, H., Li, F., Li, C., Wu, S., Li, J. and Ji, D. (2022) Inheriting the Wisdom of Predecessors: A Multiplex Cascade Framework for Unified Aspect-Based Sentiment Analysis. <italic>Proceedings of the</italic>31 <italic>st International Joint Conference on Artificial Intelligence</italic>, Vienna, 23-29 July 2022, 4096-4103. https://doi.org/10.24963/ijcai.2022/572 <pub-id pub-id-type="doi">10.24963/ijcai.2022/572</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.24963/ijcai.2022/572">https://doi.org/10.24963/ijcai.2022/572</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Fei, H.</string-name>
              <string-name>Li, F.</string-name>
              <string-name>Li, C.</string-name>
              <string-name>Wu, S.</string-name>
              <string-name>Li, J.</string-name>
              <string-name>Ji, D.</string-name>
              <string-name>Intelligence, V</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Inheriting the Wisdom of Predecessors: A Multiplex Cascade Framework for Unified Aspect-Based Sentiment Analysis</article-title>
            <source>Proceedings of the 31st International Joint Conference on Artificial Intelligence</source>
            <volume>23</volume>
            <pub-id pub-id-type="doi">10.24963/ijcai.2022/572</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B30">
        <label>30.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Liu <italic>,</italic>X.Y., Ding, Y., An, K.K., Xiao, C.Y., <italic>et al</italic>. (2023) Towards Robust Aspect-Based Sentiment Analysis through Non-Counterfactual Augmentations.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Liu, X.Y.</string-name>
              <string-name>Ding, Y.</string-name>
              <string-name>An, K.K.</string-name>
              <string-name>Xiao, C.Y.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Towards Robust Aspect-Based Sentiment Analysis through Non-Counterfactual Augmentations</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B31">
        <label>31.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wilson, S., Magdy, W., McGillivray, B., Garimella, K. and Tyson, G. (2020) Urban Dictionary Embeddings for Slang NLP Applications.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wilson, S.</string-name>
              <string-name>Magdy, W.</string-name>
              <string-name>McGillivray, B.</string-name>
              <string-name>Garimella, K.</string-name>
              <string-name>Tyson, G.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Urban Dictionary Embeddings for Slang NLP Applications</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>