| Challenge: | Existing methods to learn from unlabeled data generate noisy supervisory signals . current methods only rely on semantic similarities to generate supervisory signal . |
| Approach: | They propose a weighted DWGF framework to capture semantic similarities and structure relationships in data. |
| Outcome: | The proposed method outperforms state-of-the-art models on evaluation metrics across multiple benchmark datasets. |
Similar Papers
New Intent Discovery with Attracting and Dispersing Prototype (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for detecting new intents with labeled data are not cluster-friendly . a robust prototypical attracting learning (RPAL) method is designed to compel instances to gravitate toward their corresponding prototype . |
| Approach: | They propose a robust and adaptive prototypical learning framework for globally distinct decision boundaries for both known and new intent categories. |
| Outcome: | The proposed method improves on CLINC, BANKING, and StackOverflow benchmarks on three challenging benchmarks. |
Towards Real-world Scenario: Imbalanced New Intent Discovery (2024.acl-long)
Copied to clipboard
| Challenge: | Existing studies focus on detecting known and previously undefined categories of user intent . skewed and long-tailed distributions often encountered in open-world scenarios . |
| Approach: | They propose to use imbalanced new intent discovery task to identify familiar and novel intent categories within long-tailed distributions. |
| Outcome: | The proposed model outperforms the existing benchmark on three datasets to simulate the real-world long-tail distributions. |
Learning Geometry-Aware Representations for New Intent Discovery (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for intent classification fail to distinguish new intents due to intertwined centers . a novel framework that learns geometry-aware representations to maximally separate all intents is proposed . |
| Approach: | They propose a new intent discovery framework that learns geometry-aware representations to maximally separate all intents. |
| Outcome: | The proposed framework achieves a new state-of-the-art performance on three benchmarking datasets. |
New Intent Discovery with Pre-training and Contrastive Learning (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for identifying intents from unlabeled utterances are label-intensive, inefficient, and inaccurate. |
| Approach: | They propose a multi-task strategy to leverage unlabeled data and external labeled data for representation learning. |
| Outcome: | The proposed method outperforms state-of-the-art methods on three intent recognition benchmarks. |
LANID: LLM-assisted New Intent Discovery (2024.lrec-main)
Copied to clipboard
| Challenge: | Data annotation is expensive in Task-Oriented Dialogue systems. |
| Approach: | They propose a framework that leverages Large Language Models' zero-shot capability to enhance the performance of a smaller text encoder on the NID task. |
| Outcome: | The proposed framework surpasses all strong baselines in both unsupervised and semi-supervised settings. |
A Probabilistic Framework for Discovering New Intents (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for detecting unknown intents do not explore the intrinsic structure of unlabeled data. |
| Approach: | They propose a probabilistic framework for discovering intents where intent assignments are treated as latent variables. |
| Outcome: | The proposed framework can be used to discover intents with latent variables . it can be applied to three challenging real-world datasets . |
Intent Discovery with Frame-guided Semantic Regularization and Augmentation (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing intent discovery methods focus on transferring prior knowledge of known intents to unknown ones. |
| Approach: | They propose to use frame knowledge as conceptual semantic guidance to bridge the gap between known intents representation learning and unknown intents clustering. |
| Outcome: | The proposed method outperforms solid baselines on two benchmark datasets. |
HDiff: Confidence-Guided Denoising Diffusion for Robust Hyper-relational Link Prediction (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Hyper-relational Knowledge Graph Completion (HKGC) is more sensitive to inherent noise, particularly struggling with two prevalent HKG-specific noise types: Intra-fact Inconsistency and Cross-fact Association Noise. |
| Approach: | They propose a conditional denoising diffusion framework that learns to reverse structured noise corruption. |
| Outcome: | The proposed framework outperforms state-of-the-art HKGC methods in a variety of noisy conditions. |
Novel Relation Detection: Discovering Unknown Relation Types via Multi-Strategy Self-Supervised Learning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to relation extraction can only recognize predefined relation types . new or out-of-scope relation types may continually emerge after the model is deployed . |
| Approach: | They propose a novel relation detection task that uses self-supervised learning to handle shallow semantic similarity problem. |
| Outcome: | The proposed method outperforms state-of-the-art methods on two datasets. |
Going beyond research datasets: Novel intent discovery in the industry setting (2023.findings-eacl)
Copied to clipboard
| Challenge: | Novel intent discovery automates grouping of similar messages to identify previously unknown intents. |
| Approach: | They propose to use question-only data to improve the intent discovery pipeline . they propose to utilize conversational structure of real-life datasets for clustering . |
| Outcome: | The proposed method gives 33pp performance boost over state-of-the-art model for question only . it also gives 13pp performance increase over the naive baseline model . |