Papers by Nan Tang
Copied to clipboard
| Challenge: | Adapting a model to a handful of personalized data is challenging, authors say . standard fine-tuning requires hundreds of millions of parameters for each user . |
| Approach: | They propose a lightweight method that clamps millions of parameters of a Transformer model and optimizes a tiny user-specific vector. |
| Outcome: | The proposed method improves accuracy on Yelp and IMDB datasets and reduces the number of parameters added for each user. |
Copied to clipboard
| Challenge: | Pre-trained language models perform well on learning sentence semantics when fine-tuned with supervised data. |
| Approach: | They conduct a thorough examination of pretrained model based unsupervised sentence embeddings. |
| Outcome: | The proposed approach improves on whitening-based vector normalization with less than 10 lines of code. |
Copied to clipboard
| Challenge: | Existing approaches for inferential text generation ignore context that is not explicitly provided . Existing models ignore background knowledge that provides crucial evidence to generate inferences . |
| Approach: | They propose an approach that automatically finds evidence for an event from a large text corpus and leverages it to guide the generation of inferential texts. |
| Outcome: | The proposed model generates inferential texts from a large text corpus and uses evidence to guide it. |
Copied to clipboard
| Challenge: | Using deep neural networks to find codes is difficult . we present a dataset that includes 20,604 labels for natural language queries and codes . |
| Approach: | They introduce a contrastive learning method to enhance text-code matching . they find that CoSQA improves the accuracy of code question answering by 5.1% . |
| Outcome: | The proposed method improves the accuracy of code question answering by 5.1% and improves by 10.5% on a CodeBERT model. |
Copied to clipboard
| Challenge: | Existing approaches to image retrieval from contextual descriptions (IRCD) lag behind human performance in IRCD. |
| Approach: | They propose a method that relies on a doubly contextual alignment scheme for challenging IRCD. |
| Outcome: | The proposed method can yield comparable results with GPT-4V, despite fewer parameters. |
Copied to clipboard
| Challenge: | Using question generation, we learn a semantic parser with 30% of the supervised training data. |
| Approach: | They propose to use question generation to learn a semantic parser with less supervised training data. |
| Outcome: | The proposed method improves the state-of-the-art model with less training data. |
Copied to clipboard
| Challenge: | Existing clarification datasets with limited annotated examples do not address ambiguous phenomena. |
| Approach: | They propose a dataset that allows users to ask clarification questions using open-domain examples. |
| Outcome: | The proposed model achieves better performance than strong baselines and provides new challenges. |
Copied to clipboard
| Challenge: | Existing methods for table-to-text generation are limited and benchmarked on a limited number of datasets. |
| Approach: | They propose to use open-source tools to reproduce existing large language models for performance comparison and expedite the development of new models. |
| Outcome: | The proposed toolkit compares existing large language models on 9 table-to-text generation datasets and maintains a leaderboard to provide insights for future work. |
Copied to clipboard
| Challenge: | Data-to-text annotations can be costly when dealing with tables with nontrivial structures. |
| Approach: | They propose a procedure for extracting semantic triples from tables that encodes their structures by exploiting table headers and table title. |
| Outcome: | The proposed method exploits the semantic dependencies between table headers and title to extract semantic triples from tables. |
Copied to clipboard
| Challenge: | Existing methods for logical reasoning of text focus on contextual semantics while struggling to explicitly model the logical inference process. |
| Approach: | They propose a logic-driven context extension framework and a data-driven augmentation algorithm that uses contrastive learning to better capture logical information. |
| Outcome: | The proposed framework outperforms existing methods on two benchmark datasets, ReClor and LogiQA. |
Copied to clipboard
| Challenge: | Existing RAG frameworks either indiscriminately perform retrieval or rely on rigid single-label classifiers to select retrieval methods. |
| Approach: | They propose a framework that dynamically selects the most suitable retrieval strategy based on query complexity. |
| Outcome: | The proposed framework achieves state-of-the-art results on multiple single-hop and multi-hop datasets while reducing retrieval costs. |
Copied to clipboard
| Challenge: | Recent approaches to handle large knowledge base decompose tasks into subtasks and solve them sequentially. |
| Approach: | They propose a multi-task learning framework that resolves coreference in conversations . they propose enabling shared supervisions and type-aware entity detection model . |
| Outcome: | The proposed framework improves overall F1 score from 67% to 79% on a large-scale conversational question answering dataset. |
Copied to clipboard
| Challenge: | Existing methods for fact checking use string concatenation or fusing features of isolated evidence sentences. |
| Approach: | They propose a method suitable for reasoning about the semantic-level structure of evidence . they use graph convolutional network and graph attention network to exploit the structure . |
| Outcome: | The proposed method improves claim verification accuracy and FEVER score on a benchmark dataset. |
Copied to clipboard
| Challenge: | Existing table-based question answering datasets lack advanced information-based questions that require reasoning and integration of information pieces retrieved from structured knowledge sources. |
| Approach: | They propose a dataset with 10K Wikipedia-based table, question, free-form answer, supporting table cells pairs that can be used to generate an answer. |
| Outcome: | The proposed dataset has 10K Wikipedia-based table, question, free-form answer, supporting table cells pairs. |
Copied to clipboard
| Challenge: | Existing methods for injecting knowledge into pre-trained models are inconsistent and can flush out knowledge when multiple kinds of knowledge are injected. |
| Approach: | They propose a framework that retains the original parameters of pre-trained models fixed and supports the development of versatile knowledge-infused models. |
| Outcome: | The proposed framework retains the original parameters of the pre-trained model fixed and supports the development of versatile knowledge-infused models. |
Copied to clipboard
| Challenge: | Existing Table QA models are vulnerable to task-specific perturbations, such as replacing key question entities or shuffling table columns. |
| Approach: | They propose to use large language models to generate adversarial examples to enhance training, which significantly improves the robustness of Table QA models. |
| Outcome: | The proposed model significantly improves on existing Table QA models against human-annotated adversarial perturbations. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on “factual statements” that rephrase source materials, but ignore “cognitive statements” . evaluating and detecting "faithfulness hallucinations" remains challenging . |
| Approach: | They propose a framework to assess faithfulness of cognitive statements and introduce a dataset to scale easily across models. |
| Outcome: | The proposed framework assesses faithfulness of cognitive statements and scales easily across models. |
Copied to clipboard
| Challenge: | Traditional Knowledge Graph Question Answering (KGQA) methods rely on semantic parsing to retrieve knowledge strictly necessary for answer generation. |
| Approach: | They propose a retrieval-filtering-summarization pipeline that enhances QA coverage by retrieving a broader subgraph likely to contain relevant information. |
| Outcome: | The proposed pipeline surpasses state-of-the-art solutions by about 7% in quality and exceeds GPT-4o (Tool) by 10-21%. |
Copied to clipboard
| Challenge: | Table-based fact verification has attracted a lot of attention recently due to the lack of datasets that can be used to pre-train language models to be aware of common table operations. |
| Approach: | They propose a table-based fact verification tool that pre-trains language models to be aware of common table operations such as aggregating a column or comparing tuples. |
| Outcome: | The proposed method outperforms previous methods on two table-based fact verification datasets TabFact and SEM-TAB- FACTS. |
Copied to clipboard
| Challenge: | Large pre-trained models have improved performance on a variety of natural language processing tasks. |
| Approach: | They develop a bimodal pre-trained model for programming language (PL) and natural language (NL) it incorporates a hybrid objective function that detects replaced tokens from generators. |
| Outcome: | The proposed model performs better on two NL-PL applications by fine-tuning model parameters. |
Copied to clipboard
| Challenge: | Existing approaches generate a SQL query word-by-word but results are incorrect or not executable due to mismatch between question words and table contents. |
| Approach: | They propose a generative model to map natural language questions into SQL queries. |
| Outcome: | The proposed model significantly improves state-of-the-art execution accuracy from 69.0% to 74.4% on a large question- SQL dataset. |
Copied to clipboard
| Challenge: | Existing table-to-text generation techniques that transform complex tabular data into comprehensible narratives are lacking in real-world applications. |
| Approach: | They investigate the table-to-text capabilities of different LLMs using four datasets within two real-world information seeking scenarios. |
| Outcome: | The proposed models can generate table-to-text data in two real-world information seeking scenarios and perform better than existing models. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) and Retrieval-augmented Generation (RAG) systems show promise, but their performance on cross-document MEQA remains underexplored due to the lack of tailored benchmarks. |
| Approach: | They propose a scalable multi-document, multi-entity benchmark to evaluate LLMs' capacity to retrieve, consolidate, and reason over scattered and dense information. |
| Outcome: | The proposed benchmarks show that even advanced models achieve only 59% accuracy on MEBench. |
Copied to clipboard
| Challenge: | Existing methods that use syntax of text in pre-training and fine-tuning suffer from discrepancy between the two stages. |
| Approach: | They propose a model that utilizes the syntactic structure of text in pre-training and fine-tuning stages. |
| Outcome: | The proposed model achieves state-of-the-art on six public benchmark datasets. |
Copied to clipboard
| Challenge: | Current methods focus on detecting and removing duplicates, which risks the loss of valuable information and neglects the varying degrees of duplication. |
| Approach: | They propose a method that maintains dataset integrity while selectively reducing the sampling weight of data with high commonness. |
| Outcome: | The proposed method significantly improves training efficiency on deduplicated datasets and improves downstream accuracy by 1.77%. |
Copied to clipboard
| Challenge: | a context-aware retrieval model and a meta-learning paradigm are used for context-dependent semantic parsing . |
| Approach: | They propose a retrieval model and a meta-learner to incorporate retrieved datapoints as context-dependent semantic parsing evidence. |
| Outcome: | The proposed approach performs better than retrieve-and-edit baselines on CONCODE and CSQA datasets. |
Copied to clipboard
| Challenge: | Chart question answering (ChartQA) tasks are a critical part of visualization charts. |
| Approach: | They propose a chart question answering task that uses MLLMs to analyze charts . they propose 'Chain-of-Charts' textual prompt strategy that directs attention to visual elements . |
| Outcome: | The proposed model improves performance by 14.41% and 80% in low-level ChartQA tasks. |
Copied to clipboard
| Challenge: | Existing models with implicit reasoning ability struggle to solve analytical reasoning of text. |
| Approach: | They propose an approach to analyze text and use it to perform reasoning over it. |
| Outcome: | The proposed approach outperforms pre-trained models on an analysis of the Law School Admission Test dataset. |
Copied to clipboard
| Challenge: | Large language models (LLMs) exhibit excellent performance in various tasks, but memory requirements present a challenge when deploying on memory-limited devices. |
| Approach: | They propose a framework to compress LLM after quantization further, achieving about 2.2x compression ratio. |
| Outcome: | The proposed model can achieve 40% reduction in memory size with negligible loss in accuracy and inference speed. |
Copied to clipboard
| Challenge: | Existing approaches to deepfake detection typically represent documents with coarse-grained representations, but they struggle to capture factual structures of documents. |
| Approach: | They propose a graph-based model that captures factual structures of documents for deepfake detection. |
| Outcome: | The proposed model improves strong base models built with RoBERTa on two public deepfake datasets. |
Copied to clipboard
| Challenge: | Existing methods for temporal activity localization are expensive and difficult to satisfy due to subjective labeling. |
| Approach: | They propose a new TAL setting where a TAL model should be robust to mixed training data with noisy moment boundaries. |
| Outcome: | The proposed method is significantly more robust to noisy training data than existing methods. |
Copied to clipboard
| Challenge: | Existing methods for fact checking textual statements are not yet available. |
| Approach: | They propose a neural network approach capable of leveraging logical operations for fact checking . they use a textual statement and semi-structured tables to generate a program from it . |
| Outcome: | The proposed approach achieves state-of-the-art performance on TABFACT dataset . it derives a program (a.k.a. logical form) of the statement in semantic parsing manner . |
Copied to clipboard
| Challenge: | Existing methods for fake news detection rely on linguistic and semantic features from news content and do not exploit external knowledge. |
| Approach: | They propose a graph neural model which compares news to knowledge base through entities for fake news detection. |
| Outcome: | The proposed model significantly outperforms state-of-the-art methods on two benchmark datasets. |
Copied to clipboard
| Challenge: | Existing methods to retrieve target images suffer from inherent cognitive bias due to unknown candidate distribution. |
| Approach: | They propose a training-free framework that reframes ZS-CIR as a self-correcting process . they propose to use retrieved results as feedback to perceive the candidate distribution . |
| Outcome: | Experiments on public benchmarks show that CoRR outperforms other SOTA methods. |
Copied to clipboard
| Challenge: | Question answering (QA) and question generation (QG) are closely related tasks. |
| Approach: | They propose a training algorithm that generalizes both Generative Adversarial Network and Generating Domain-Adaptive Nets under the question answering scenario. |
| Outcome: | The proposed training algorithm generalizes both Generative Adversarial Network (GAN) and Generating Domain-Adaptive Nets (GDAN) under the question answering scenario. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) struggle with visual-based entity questions (VEQA) MLLM can identify A, but may refrain from answering due to privacy concerns. |
| Approach: | They propose a method that uses vector representations to analyze visual-based entity questions (VEQA) they use visual cues and textual information to integrate visual cus and visual information . |
| Outcome: | The proposed method significantly improves visual-based entity question answering (VEQA) it can identify faces, names, and alignments within visual objects, and then derive the answer over this matching graph. |
Copied to clipboard
| Challenge: | Existing methods for fine-grained propaganda detection are not based on input-output data, but instead use declarative knowledge to detect propagandistic text fragments. |
| Approach: | They propose a method to inject declarative knowledge of fine-grained propaganda techniques into training data to get better representations of propagandistic texts. |
| Outcome: | The proposed method achieves superior performance on a large dataset for propaganda detection. |
Copied to clipboard
| Challenge: | Existing text generation systems that can provide accurate table summaries can facilitate more efficient access to relevant data insights. |
| Approach: | They propose a query-focused task where text generation models have to perform human-like reasoning and analysis over the given table to generate a tailored table summary. |
| Outcome: | The proposed method improves existing baselines on table-to-text generation and large language models by concatenating generated facts to the model input. |
Copied to clipboard
| Challenge: | Machine reasoning is a field of research that aims to build interpretable AI systems . Symbolic reasoning methods represent knowledge using symbolic logic, perform inference . probabilistic reasoning methods combine probability and symbolic logic into a unified model . |
| Approach: | This tutorial introduces machine reasoning frameworks and aims to define them . it will show how they can be used to build interpretable AI systems . |
| Outcome: | This tutorial aims to show how machine reasoning frameworks perform in real-world scenarios. |
Copied to clipboard
| Challenge: | Human experts tackle difficult math problems by identifying and executing a few pivotal steps rather than listing every intermediate thought. |
| Approach: | They propose a method for producing training data that mirrors concise human reasoning by rewriting a problem's solution to retain only the essential steps. |
| Outcome: | The proposed method outperforms models trained on 800k long CoT and cuts training and inference costs. |