Wasserstein Distance Regularized Sequence Representation for Text Matching in Asymmetrical Domains (2020.emnlp-main)
Copied to clipboard
| Challenge: | Asymmetrical text matching is a fundamental problem in information retrieval and natural language processing. |
| Approach: | They propose a method that regularizes features vectors projected from different domains . WD-Match can be used to improve different text matching methods . |
| Outcome: | The proposed method outperforms existing methods and benchmarks on four datasets. |
Similar Papers
Adaptive Feature Discrimination and Denoising for Asymmetric Text Matching (2022.coling-1)
Copied to clipboard
| Challenge: | Existing models focus on asymmetric text matching but rarely perform feature denoising . existing models focus only on recognizing discriminative features and filtering out irrelevant features . |
| Approach: | They propose a novel adaptive feature discrimination and denoising model for asymmetric text matching . it explicitly distinguishes discriminative features and filters out irrelevant features in context . |
| Outcome: | The proposed model achieves significant performance gains over current state-of-the-art models on four real-world datasets. |
Simple and Effective Text Matching with Richer Alignment Features (P19-1)
Copied to clipboard
| Challenge: | Existing models only use a single inter-sequence alignment layer to make full use of this process. |
| Approach: | They propose to keep three key features available for inter-sequence alignment . they conduct experiments on four well-studied benchmark datasets . |
| Outcome: | The proposed model is able to perform on four well-studied datasets with fewer parameters and the inference speed is at least 6 times faster than similar models. |
A Strong and Robust Baseline for Text-Image Matching (P19-2)
Copied to clipboard
| Challenge: | Text-image matching is one of the most popular methods for training text-image embeddings. |
| Approach: | They propose to use a kNN-margin loss that utilizes hard negatives and is robust to noise . they advocate using Inverted Softmax and Cross-modal Local Scaling during inference . |
| Outcome: | The proposed loss function is robust to noise and pseudo negatives are tolerable . the proposed loss functions improve scores of all metrics by a large margin . |
The Dominance of Text Space: Unveiling the Asymmetric Nature of Cross-Modal Alignment in Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for cross-modal alignment assume a symmetric interaction between visual and textual modalities, implying that both spaces adapt to each other. |
| Approach: | They propose a method that regularizes the projector to maintain the geometric structure of the text embedding space via spectral filtering. |
| Outcome: | The proposed method preserves the LLM’s inherent linguistic capabilities and reduces object hallucination significantly better than standard fine-tuning methods. |
Composition-contrastive Learning for Sentence Embeddings (2023.acl-long)
Copied to clipboard
| Challenge: | Recent work shows potential to learn vector representations from unlabelled data without task-specific fine-tuning. |
| Approach: | They propose to maximize alignment between textual embeddings and a composition of their phrasal constituents. |
| Outcome: | The proposed approach improves on similarity tasks comparable to state-of-the-art approaches. |
What’s in a Domain? Learning Domain-Robust Text Representations using Adversarial Training (N18-2)
Copied to clipboard
| Challenge: | a key roadblock is application to new domains, unseen in training. |
| Approach: | They propose a method to optimise in- and out-of-domain accuracy by combing domain-specific and domain-general components with adversarial training for domain. |
| Outcome: | The proposed method improves on domain adaptation and domain-adversarial training. |
Extractive Summarization as Text Matching (2020.acl-main)
Copied to clipboard
| Challenge: | Currently, most of the neural extractive summarization systems score and extract sentences individually and model the relationship between sentences. |
| Approach: | They propose to instantiate a neural extractive summarization task as a semantic text matching problem and use it to match a source document and candidate summaries in a semantic space. |
| Outcome: | The proposed framework is faster and more efficient than existing frameworks. |
Enhancing Word Embeddings with Knowledge Extracted from Lexical Resources (2020.acl-srw)
Copied to clipboard
| Challenge: | In this paper, we present an effective method for semantic specialization of word vector representations. |
| Approach: | They propose a method for semantic specialization of word vector representations using BabelNet. |
| Outcome: | The proposed method improves on word similarity and dialog state tracking tasks. |
Domain Adversarial Fine-Tuning as an Effective Regularizer (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing fine-tuning techniques can degrade general-domain representations . however, fine-timing can lead to catastrophic forgetting of knowledge . |
| Approach: | They propose a new regularization technique that complements the task-specific loss used during fine-tuning with an adversarial objective. |
| Outcome: | Empirical results show that AFTER improves performance on various natural language understanding tasks compared to standard fine-tuning. |
Matching Varying-Length Texts via Topic-Informed and Decoupled Sentence Embeddings (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing approaches to matching text with non-comparable lengths are limited due to truncation issues. |
| Approach: | They propose a model that decouples sentences and embeds them into natural sentences for matching texts of significantly different lengths. |
| Outcome: | The proposed model matches texts of significantly different lengths across three well-studied datasets. |