Papers by Latifur Khan
Controllable Fake Document Infilling for Cyber Deception (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to deter malicious intrusion generate multiple fake versions of a document that are context-agnostic and produce sub-optimal outputs. |
| Approach: | They propose a context-aware model for creating fake documents that masks important concepts of varied lengths and then infills a realistic but fake alternative considering both the previous and future contexts. |
| Outcome: | The proposed model outperforms baseline models in generating highly believable fakes with moderate modification to protect critical information and deceive adversaries. |
LPC: A Logits and Parameter Calibration Framework for Continual Learning (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to solve catastrophic forgetting problem are varied . current approaches to learn continuous learning are based on replay-based methods . |
| Approach: | They propose to calibrate parameters and logits so that preserving old parameters and generalized learning on new concepts can be solved simultaneously. |
| Outcome: | The proposed model achieves state-of-the-art performance in all scenarios. |
ConfliBERT: A Pre-trained Language Model for Political Conflict and Violence (2022.naacl-main)
Copied to clipboard
Yibo Hu, MohammadSaleh Hosseini, Erick Skorupa Parolin, Javier Osorio, Latifur Khan, Patrick Brandt, Vito D’Orazio
| Challenge: | Traditionally, researchers used manual coding to track conflict processes worldwide, but the high costs and slow pace of domain experts make it difficult and costly to monitor complex and rapidly changing conflicts. |
| Approach: | They propose a domain-specific pre-trained language model for conflict and political violence that can be used to train a language model from scratch and continue training. |
| Outcome: | The proposed model outperforms BERT in conflict research. |
Let The Jury Decide: Fair Demonstration Selection for In-Context Learning through Incremental Greedy Evaluation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing demonstration selection strategies focus on optimizing performance metrics such as accuracy. |
| Approach: | They propose a framework for selecting fair and representative demonstrations that improve group fairness in In-Context Learning. |
| Outcome: | The proposed framework improves fairness metrics without compromising accuracy. |
Leveraging Codebook Knowledge with NLI and ChatGPT for Zero-Shot Political Relation Classification (2024.acl-long)
Copied to clipboard
| Challenge: | Existing annotation codebook is labor-intensive for coding events from large datasets. |
| Approach: | They propose to use existing annotation codebook to classify political relations without extensive annotations. |
| Outcome: | The proposed methods outperform dictionary-based methods and the existing ontology annotation codebook and improve interpretability and efficiency. |
Dual Contrastive Learning Framework for Incremental Text Classification (2023.findings-emnlp)
Copied to clipboard
| Challenge: | In incremental learning, large models learn and refresh knowledge continuously . many approaches have been proposed to preserve knowledge from previous tasks while learning new concepts in online NLP applications. |
| Approach: | They propose a dual contrastive learning framework that fosters transferability across different tasks . they use global contrastive and task-specific learning to promote a generalized embedding space . |
| Outcome: | The proposed framework outperforms the current state-of-the-art methods on text datasets. |
BERT Has More to Offer: BERT Layers Combination Yields Better Sentence Embeddings (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Obtaining sentence representations from BERT-based models is valuable as it takes less time to pre-compute a one-time representation of the data and then use it for the downstream tasks. |
| Approach: | They propose to combine certain layers of a BERT-based model rested on the data set and model to achieve substantially better results. |
| Outcome: | The proposed method outperforms baseline models on seven semantic textual similarity datasets and on eight transfer data sets. |
SetConv: A New Approach for Learning from Imbalanced Data (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for classification are biased towards the majority class when the Imbalance Ratio (IR) is high. |
| Approach: | They propose a set convolution operation and an episodic training strategy to extract a single representative for each class, so that classifiers can later be trained on a balanced class distribution. |
| Outcome: | The proposed algorithm is permutation-invariant despite the order of inputs and shows superiority on multiple large-scale benchmark text datasets. |