Papers by Jiawei Han
Copied to clipboard
| Challenge: | Existing models for text-rich networks do not take inter-document structure into account. |
| Approach: | They propose a pretraining framework for a text-rich network using a masked language model and a masking node prediction framework. |
| Outcome: | The proposed model outperforms baselines on four tasks in academic and e-commerce domains. |
Copied to clipboard
| Challenge: | ACE 2005 2 is the first large-scale event extraction dataset with 205K event mentions and 3,465 different types. |
| Approach: | They propose to use the DWD Overlay to map PropBank rolesets to a large distantlysupervised training dataset with partial labels to make event extraction more accessible. |
| Outcome: | The proposed model performs better than baselines including InstructGPT and ACE 2005 2 despite being 18 years old . key limitations of ACE include its small event ontology of 33 types, small dataset size of around 600 documents and restricted domain (with a significant portion concentrated on military conflicts). |
Copied to clipboard
| Challenge: | Existing Relation extraction models require extensive annotated training data, which is costly and labor-intensive to collect. |
| Approach: | They propose a new zero-shot RE task where only relation definitions are provided instead of seen-unseen relation instances. |
| Outcome: | The proposed task significantly improves cost-effective zero-shot performance by large margins. |
Copied to clipboard
| Challenge: | Existing methods to recognize entities in text are limited by the diversity of entity types and the lack of high-quality annotations. |
| Approach: | They propose an in-context learning-based NER approach that can inject in-const NER ability into PLMs and recognize entities of novel types on-the-fly using only a few demonstrative instances. |
| Outcome: | The proposed method outperforms the PLMs+fine-tuning counterparts on 4 few-shot NER datasets and significantly outperformed the Plms+initialized extractors. |
Copied to clipboard
| Challenge: | Admin (Adaptive model initialization) is more stable, converges faster, and leads to better performance. |
| Approach: | They propose a model initialization algorithm to stabilize early training and unleash its full potential in the late stage. |
| Outcome: | The proposed model initialization method stabilizes early training and unleashes full potential in late stage. |
Copied to clipboard
| Challenge: | Recent automated taxonomies over-rely on a specific corpus, sacrificing generalizability, or depend heavily on the general knowledge of large language models (LLMs) . |
| Approach: | They propose a framework that dynamically adapts an LLM-generated taxonomy to a given corpus across multiple dimensions. |
| Outcome: | The proposed framework performs iterative hierarchical classification, expanding both the taxonomy width and depth based on corpus’ topical distribution. |
Copied to clipboard
| Challenge: | Existing evaluation frameworks for natural language generation are dominated by similarity-based metrics. |
| Approach: | They propose a multi-dimensional evaluator for natural language generation that integrates multiple dimensions into one evaluer. |
| Outcome: | The proposed evaluator improves on three typical NLG tasks and improves with external knowledge. |
Copied to clipboard
| Challenge: | Existing work on grounding events into a precise timeline has been limited due to the inherent ambiguity of language and the requirement for information propagation over inter-related events. |
| Approach: | They propose a 4-tuple temporal representation for entity slot filling to ground events into a timeline using a graph attention network approach. |
| Outcome: | The proposed approach yields 7.0% match rate over contextualized embedding approaches and 16.3% higher match rate compared to sentence-level manual event time argument annotation. |
Copied to clipboard
| Challenge: | Recent LLM-based search agents often concatenate the full interaction history into the context, producing long and noisy inputs and increasing compute cost and memory overhead. |
| Approach: | They propose an agent framework that maintains a compact memory during multi-turn interactions. |
| Outcome: | The proposed framework outperforms strong history-concatenation (ReAct-style) baselines on a range of public datasets while maintaining nearly constant token counts across multi-turn interactions. |
Copied to clipboard
| Challenge: | Existing red-teaming methods for large language models often discover safety risks without addressing them. |
| Approach: | They propose a multi-round automatic red-teaming method that incorporates both adversarial prompt writing and safe response generation. |
| Outcome: | The proposed method significantly increases red-teaming scalability and the safety of the target LLM. |
Copied to clipboard
| Challenge: | Existing topic models adopt a fully unsupervised setting and their discovered topics may not reflect user preferences well due to their unsupervised nature. |
| Approach: | They propose a framework that allows out-of-vocabulary seeds to be used to find latent topics from text corpora. |
| Outcome: | The proposed framework can find topics that are never seen in the corpus and can benefit from the general knowledge of pre-trained language models. |
Copied to clipboard
| Challenge: | Existing methods for aspect-based sentiment analysis of review text use only a few keywords describing each aspect/sentiment without using any labeled examples. |
| Approach: | They propose a weakly-supervised approach for aspect-based sentiment analysis which uses only a few keywords describing each aspect/sentiment without using any labeled examples. |
| Outcome: | The proposed method generates quality joint topics and outperforms baselines significantly on benchmark datasets. |
Copied to clipboard
| Challenge: | lexical overlap is a common evaluation metric for extractive summarization, but recent studies reveal its limitations. |
| Approach: | They propose a facet-aware evaluation setup for better assessment of information coverage in extractive summaries. |
| Outcome: | The proposed evaluation setup improves human correlation with extractive summarization datasets and improves comparative analysis. |
Copied to clipboard
| Challenge: | Existing surveys on scientific LLMs focus on one or two fields or a single modality. |
| Approach: | They survey 260 scientific LLMs and examine their architectures and pre-training techniques . they also discuss commonalities and differences between LLM architectures . |
| Outcome: | The proposed model architectures and evaluation techniques are used to improve scientific discovery. |
Copied to clipboard
| Challenge: | Event schemas encode knowledge of stereotypical structures of events and their connections . previous work on event schema induction focuses on atomic events or linear temporal sequences . |
| Approach: | They propose a Temporal Complex Event Schema: a graph-based schema representation that encompasses events, arguments, temporal connections and argument relations. |
| Outcome: | The proposed model outperforms existing models on HITS@1 by 17.8%. |
Copied to clipboard
| Challenge: | Few-shot named entity recognition (NER) aims to identify entities of target types with limited number of illustrative instances. |
| Approach: | They propose a superposition concept discriminator which solves the intrinsic generalization problem by an active learning paradigm. |
| Outcome: | The proposed model significantly improves few-shot named entity recognition (FS-NER) with minimal additional efforts. |
Copied to clipboard
| Challenge: | Existing comparative summarization methods focus on surface-level semantic differences, which may not capture the most relevant distinctions. |
| Approach: | They propose a framework which transforms scientific papers into LLM personas that debate their respective novelties. |
| Outcome: | The proposed framework generates informative arguments and effectively contrasts papers, and supports researchers in their literature review. |
Copied to clipboard
| Challenge: | Reaction Miner is a system designed to extract chemical reactions from raw scientific PDFs. |
| Approach: | They propose a system that extracts chemical reactions directly from raw scientific PDFs. |
| Outcome: | The proposed system can extract chemical reactions from raw scientific PDFs. |
Copied to clipboard
| Challenge: | Document-level relation extraction (DocRE) aims to extract semantic relations among entity pairs in a document. |
| Approach: | They propose an evidence-enhanced framework that empowers document-level relation extraction (DocRE) Eider efficiently extracts evidence and effectively fuses extracted evidence in inference. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on three benchmark datasets. |
Copied to clipboard
| Challenge: | Existing methods for calibration of large reasoning models (LRMs) focus on clean inputs, leaving noise unexplored. |
| Approach: | They propose a confidence calibration framework for character-level noisy inputs that extracts uncertainty signals from both the empirical answer distribution and the model’s predictive distribution and integrates them via a learned calibrator. |
| Outcome: | Experiments on multiple mathematical reasoning benchmarks show that DisCal outperforms existing calibration methods under noisy inputs, reducing expected calibration error (ECE) by up to 39.21% and improving Area Under the Receiver Operating Characteristic Curve (AUROC) by 31.44%. |
Copied to clipboard
| Challenge: | Existing methods to build named entity recognition systems with limited labeled data are lacking. |
| Approach: | They propose three orthogonal schemes to build named entity recognition systems when labeled data is limited. |
| Outcome: | The proposed NER systems outperform existing methods on few-shot and training-free settings. |
Copied to clipboard
| Challenge: | Existing methods for dynamic web navigation rely on greedy strategies or value estimation, struggle to achieve effective backtracking and are heavily dependent on proprietary models. |
| Approach: | They propose a cognitive multi-agent collaboration framework that enhances cyberspace exploration capability through In-Context Exploration. |
| Outcome: | The proposed framework surpasses the proprietary model Claude-3.5 Sonnet on the WebArena benchmark. |
Copied to clipboard
| Challenge: | Current text classification methods require a large number of labeled documents as training data. |
| Approach: | They propose a model that uses only the label name of each class to train classification models on unlabeled data without using any labeled examples. |
| Outcome: | The proposed model achieves 90% accuracy on four benchmark datasets using label names as the only supervision . |
Copied to clipboard
| Challenge: | Existing approaches to optimize retrieval using search-only metrics ignore downstream utility and fine-tune entire LLM to jointly reason and retrieve limit retrieval utility and compatibility with frozen or proprietary models. |
| Approach: | They propose a lightweight, model-agnostic framework that decouples the searcher from the generator and trains the search user using a Gain Beyond RAG reward. |
| Outcome: | The proposed framework outperforms baselines trained on over 70 more data with 2.4k training samples. |
Copied to clipboard
| Challenge: | Existing Dynamic topic models are either fully supervised, requiring expensive human annotations, or fully unsupervised, producing topic evolutions that often do not cater to a user’s needs. |
| Approach: | They propose to use a framework that ensembles semantic similarity, category indicative, and time indicative scores to produce informative topic evolutions. |
| Outcome: | The proposed framework can be used to discover topic evolutions from temporal corpora that align with user-provided category names and uniquely capture topics at each time step. |
Copied to clipboard
| Challenge: | Existing few-shot named entity recognition (NER) models capture information from limited instances while transferring useful knowledge from external resources. |
| Approach: | They propose a self-describing mechanism for few-shot NER which can universally describe mentions using concepts and automatically map novel entity types to concepts. |
| Outcome: | The proposed model can universally describe mentions using concepts and automatically map novel entity types to concepts and adaptively recognize entities on-demand. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have produced models that exhibit remarkable performance across a variety of NLP tasks. |
| Approach: | They analyze a large-scale collection of user-GPT conversations to identify a significant gap between academic research in NLP and the needs of real-world NLP applications. |
| Outcome: | The proposed model outperforms existing models in a large-scale collection of user-GPT conversations and identifies a significant gap between the tasks that users frequently request from LLMs and the tasks commonly studied in academic research. |
Copied to clipboard
| Challenge: | Existing instruction data synthesis methods focus on single-turn instructions and neglect cross-turn coherence, resulting in context drift and reduced task completion rates. |
| Approach: | They propose a framework that constrains multi-turn instruction synthesis by explicitly modeling human conversational intent. |
| Outcome: | The proposed framework outperforms existing models trained on single-turn and multi-turn instruction datasets. |
Copied to clipboard
| Challenge: | Existing efforts to train pre-trained language models have brought significant improvements to various NLP applications. |
| Approach: | They propose to compress bulky LMs while preserving useful information for a specific task. |
| Outcome: | The proposed method can detach any layer without affecting others, and stretch shallow and wide LMs to be deep and narrow. |
Copied to clipboard
| Challenge: | Existing methods to augment knowledge graph completion require factual triples or manual prompts to extract knowledge from a pre-trained language model. |
| Approach: | They propose a tool that generates quality query prompts and retrieves support information from large text corpora to probe knowledge from a pre-trained language model. |
| Outcome: | The proposed method outperforms embedding-based, graph-based and PLM-based methods on two benchmark datasets. |
Copied to clipboard
| Challenge: | Scientific extreme summarization (TLDR) aims to form ultra-short summaries of scientific papers . previous attempts failed to scale up due to heavy human annotation and domain expertise . |
| Approach: | They propose a method to automatically extract TLDR summaries from scientific papers . they propose 'citeSum' with no human annotation, which is 30 times larger than SciTLDR . |
| Outcome: | The proposed approach outperforms most fully-supervised methods on SciTLDR without fine-tuning and achieves state-of-the-art results with only 128 examples. |
Copied to clipboard
| Challenge: | Open-domain question answering aims at locating answers to user-generated questions in massive collections of documents. |
| Approach: | They propose an algorithm with a novel reader-retriever design that differs from both families of algorithms. |
| Outcome: | The proposed algorithm outperforms retrieval-based methods with two large-scale datasets and is state-of-the-art. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have advanced tasks like text summarization, but their size and computational demands limit their use in resource-constrained and privacy-centric settings. |
| Approach: | They propose a framework for distilling LLMs’ text summarization abilities into a compact, local model using a curriculum learning strategy that evolves from simple to complex tasks. |
| Outcome: | The proposed framework outperforms baseline models on CNN/DailyMail, XSum, and ClinicalTrial, and improves interpretability by providing insights into the summarization rationale. |
Copied to clipboard
| Challenge: | Recent supervised ED approaches have achieved promising performance but require large number of manually annotated event data. |
| Approach: | They propose to overfit the trigger confounder of the context and the result . they propose to intervene on the context via backdoor adjustment during training . |
| Outcome: | The proposed method significantly improves the FSED on ACE05 and MAVEN datasets. |
Copied to clipboard
| Challenge: | Existing event extraction models have been limited to the sentence level . this formulation signifies a misalignment between the information seeking behavior and the informative seeking behavior. |
| Approach: | They propose a document-level neural event argument extraction model by formulating the task as conditional generation following event templates. |
| Outcome: | The proposed model achieves 7.6% F1 and 5.7% F1 over the best baseline on the document-level event extraction dataset WikiEvents and 9.3% F1 on the informative argument extraction task. |
Copied to clipboard
| Challenge: | Pre-trained language models have shown remarkable memory formation, but vanilla networks without pre-training suffer catastrophic forgetting problem. |
| Approach: | They conduct experiments to investigate the retentive-forgetful contradiction between vanilla and pre-trained language models by controlling the target knowledge types, learning strategies and learning schedules. |
| Outcome: | The results show that pre-trained language models are forgetful and pre-training leads to retentive models . |
Copied to clipboard
| Challenge: | Existing relation extraction methods rely on exact matching with human-annotated reference relations, while GRE methods produce diverse and semantically accurate relations. |
| Approach: | They propose a multi-dimensional assessment of relation extraction methods using human-annotated reference relations. |
| Outcome: | The proposed method is consistent with human preferences for RE quality. |
Copied to clipboard
| Challenge: | Pretrained language models (LMs) are a powerful transfer learning approach for knowledge graph (KG) completion. |
| Approach: | They propose a parameter-lite transfer learning approach for pretrained language models for knowledge graph (KG) completion. |
| Outcome: | The proposed model outperforms the state-of-the-art models on a knowledge graph completion benchmark by tuning 1% of the parameters. |
Copied to clipboard
| Challenge: | Existing methods for open relation extraction give sub-optimal results on specific topics. |
| Approach: | They propose a method that leverages the built-in knowledge of large language models to maintain a dynamic seed relation dictionary for the topic. |
| Outcome: | The proposed approach empowers better topic-oriented control over the generated relations and improves ORE performance along the five dimensions, especially on specialized and narrow topics. |
Copied to clipboard
| Challenge: | Large language models with instruction-following capabilities are not suitable for long-tail ad hoc extraction use cases for non-expert users. |
| Approach: | They propose a task that follows instructions to extract the desired content from the associated text and present it in a structured tabular format. |
| Outcome: | The proposed paradigm outperforms existing open-source models of similar size in terms of information extraction. |
Copied to clipboard
| Challenge: | Conventional "closed-world" information extraction methods rely on human ontologies to define scope for extraction. |
| Approach: | They propose a type abstraction approach where models are prompted to generalize and name the type . they use the similarity between inferred names to induce clusters . |
| Outcome: | The proposed method is complementary to token representations on relation extraction and event extraction datasets. |
Copied to clipboard
| Challenge: | Existing hierarchical text classification methods make local decisions regarding labels or ignore hierarchy information during inference. |
| Approach: | They propose to learn a Label Assignment Policy via deep reinforcement learning to determine where to place an object and when to stop the assignment process. |
| Outcome: | The proposed method outperforms state-of-the-art methods on five datasets and four base models and achieves an average improvement of 33.4% over flat classifiers. |
Copied to clipboard
| Challenge: | We present a new information extraction system that can construct temporal event graphs from news documents. |
| Approach: | They propose a temporal event graph extraction system that can extract news documents . they extend the system from sentence-level event extraction to cross-document cross-media event extraction . |
| Outcome: | The proposed system can extract temporal event graphs from news documents in multiple languages and multiple data modalities. |
Copied to clipboard
| Challenge: | Retrieval Augmented Generation (RAG) is a non-parametric approach for large language models. |
| Approach: | They propose a framework that shifts from triples to context-rich propositions and introduces an efficient, LLM-free online beam search over proposition paths to discover multi-step reasoning chains. |
| Outcome: | The proposed framework achieves state-of-the-art zero-shot Recall@5 and F1 scores on 2Wiki, HotpotQA, and MuSiQue. |
Copied to clipboard
| Challenge: | Entity set expansion and synonym discovery are two critical NLP tasks that are often performed separately, without exploring their interdependencies. |
| Approach: | They propose a framework that enables two tasks to mutually enhance each other by including popular entities’ infrequent synonyms into the set, which boosts set expansion recall. |
| Outcome: | The proposed framework can be used to enhance two NLP tasks by including popular entities’ infrequent synonyms into the set, which boosts set expansion recall. |
Copied to clipboard
| Challenge: | Complex news events require swift responses from government and society, authors say . relying on historical events to project the future is insufficient, they say - a simulator for complex news events is needed . |
| Approach: | They propose a controllable complex news event simulator guided by event schema and user-provided assumptions . they incorporate a geo-diverse commonsense and cultural norm-aware knowledge enhancement component . |
| Outcome: | The proposed simulator achieves higher coherence and appropriateness than existing models. |
Copied to clipboard
| Challenge: | Existing methods for event prediction are incomplete and noisy. |
| Approach: | They propose to use news-related event schemas to extract newsworthy events . they build a demo website and include a video demonstrating the framework . |
| Outcome: | The proposed framework can be applied to a wide variety of newsworthy scenarios. |
Copied to clipboard
| Challenge: | Existing methods for relation extraction only implicitly learn to model relevant contexts and entity types while being trained for RE. |
| Approach: | They propose to explicitly teach the model to capture relevant contexts and entity types by supervising and augmenting intermediate steps (SAIS) for RE. |
| Outcome: | The proposed method outperforms the runner-up method on three benchmarks by 5.04% . textual contexts and entity types are the major information sources that lead to the success of previous approaches. |
Copied to clipboard
| Challenge: | Large language models are deployed in long-horizon tasks that require agents to track interleaved goals, resolve references to prior information, and coordinate actions over extended trajectories. |
| Approach: | They propose an agentic memory system that indexes each trajectory step with a structured retrieval cue, contextual intent, and retrieves history by matching the current step’s intent. |
| Outcome: | The proposed system outperforms the strongest benchmark by 35.6%, with the largest gains as trajectory length increases. |
Copied to clipboard
| Challenge: | Speculative decoding is a novel method to expedite inference in autoregressive (large) language models. |
| Approach: | They propose to use a smaller model as a draft model to speculate a block of tokens, which the target model then evaluates for acceptance. |
| Outcome: | The proposed method can be used to accelerate inference in autoregressive (large) language models by using smaller models as draft models to speculate tokens for multiple inference steps. |
Copied to clipboard
| Challenge: | Abstractive conversation summarization systems rely on large-scale annotated summaries, but collecting and annotating these conversations can be time-consuming and labor-intensive. |
| Approach: | They propose a method for generating diverse and high-quality pairs of conversations and summaries by extracting conversation structures and organizing meaningful conversation snippets. |
| Outcome: | The proposed method outperforms baseline methods on SAMSum and DialogSum datasets and achieves a 10% increase in ROUGE scores with limited data. |
Copied to clipboard
| Challenge: | Using mixture-of-memory augmenting to augment language models improves model generalization but with diminishing return. |
| Approach: | They develop a mechanism that augments language models with mixture-of-memory Augmentation (MoMA) they augment strong T5-based retrievers with the option to "plug in" unseen memory at inference time. |
| Outcome: | The proposed model outperforms methods with larger model sizes on the BEIR benchmark and achieves comparable or even better performance than methods relying on target-specific pretraining. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) is a fundamental step in scientific literature analysis to build AI-driven systems for molecular discovery, synthetic strategy designing, and manufacturing. |
| Approach: | They propose an ontology-guided method for fine-grained named entity recognition (NER) it leverages the chemistry type ontologies to generate distant labels with flexible KB-matching . |
| Outcome: | The proposed method significantly outperforms the state-of-the-art methods with a .25 absolute F1 improvement. |
Copied to clipboard
| Challenge: | a method that extracts experimental procedures from human language into actionable sequences in robotics language is challenging given the complexity of the instructions and context-dependent nature of the instruction. |
| Approach: | They propose a method that converts actions written in natural language into Python code that can be easily translated into robotics language. |
| Outcome: | The proposed method can extract experimental procedures from human language into actionable sequences in robotics language. |
Copied to clipboard
| Challenge: | Structured chemical reaction information is a vital tool for chemists engaged in laboratory work and advanced endeavors such as computer-aided drug design. |
| Approach: | They propose a method which utilizes frequent patterns within the text as linguistic cues to identify specific characteristics of chemical reactions. |
| Outcome: | The proposed model outperforms baselines and outperformed existing models. |
Copied to clipboard
| Challenge: | Existing approaches for local citation recommendation map or translate a query to citation-worthy research papers. |
| Approach: | They propose a local citation recommendation task that uses latent evidence spans to recommend papers . proposed system retrieves ranked lists of evidence span and recommended paper pairs . |
| Outcome: | The proposed system retrieves ranked lists of evidence span and recommended paper pairs based on evidence from the existing literature. |
Copied to clipboard
| Challenge: | Linguistic steganography studies how to hide secret messages in natural language cover texts. |
| Approach: | They propose a method which encodes secret messages using self-adjusting arithmetic coding based on a neural language model. |
| Outcome: | The proposed method outperforms the state-of-the-art methods on four datasets by 15.3% and 38.9% in terms of bits/word and KL metrics. |
Copied to clipboard
| Challenge: | a new framework to digest relevant biomedical knowledge is needed to combat COVID-19 . quantity of research results is a bottleneck, and false information promoted in publications . |
| Approach: | a team of researchers has developed a framework to extract multimedia knowledge elements from scientific literature to combat COVID-19. |
| Outcome: | a new framework extracts fine-grained multimedia knowledge elements from scientific literature . it provides detailed contextual sentences, subfigures, and knowledge subgraphs as evidence . the framework is based on a case study of drug repurposing . |
Copied to clipboard
| Challenge: | Academic paper search often struggles to match underlying academic concepts between queries and documents. |
| Approach: | They propose a framework that extracts key concepts from papers and organizes them as a semantic index guided by an academic taxonomy. |
| Outcome: | The proposed framework can be flexibly employed to enhance existing retrieval frameworks. |
Copied to clipboard
| Challenge: | Recent studies also use large language models (LLMs) for query understanding, but these methods lack grounding in corpus-specific knowledge and may generate unreliable or unfaithful content. |
| Approach: | They propose a paper retrieval framework that combines large language models (LLMs) with a concept-based semantic index to capture scientific concepts. |
| Outcome: | The proposed framework improves the performance of various base retrievers, surpasses strong existing LLM-based baselines, and remains highly efficient. |
Copied to clipboard
| Challenge: | Existing detectors rely on stylistic cues to distinguish between surface-level language refinement and genuine content generation. |
| Approach: | They propose a content-based detection paradigm to detect substantive AI-generation . they propose 'CoCoDet' detector that can detect surface-level language refinement . |
| Outcome: | The proposed detector achieves a macro F1 score of 98.24% on permissible machine-polished reviews and maintains 3.89% false positive rate on real-world reviews. |
Copied to clipboard
| Challenge: | Claims are often nuanced and cannot be clearly labeled as “true” or “false” . however, a claim can be dissected into integral aspects and sub-aspects that are individually easier to validate . |
| Approach: | They propose a retrieval-augmented generation-based framework for deconstructing nuanced claims . claim can be dissected into integral aspects and sub-aspects, which are easier to validate . |
| Outcome: | The proposed framework can be easily deconstructed into integral aspects and sub-aspects, which are easier to validate. |
Copied to clipboard
| Challenge: | Current large language models often give away solutions directly, making them ineffective instructors. |
| Approach: | They propose to use a state space-based planning algorithm to build a question tree based on a student's knowledge state to help students independently identify and resolve errors. |
| Outcome: | The proposed model is able to debug code efficiently with minimal turns and highly Socratic questioning. |
Copied to clipboard
| Challenge: | Existing IE tools for atomic events are limited when applied to such complex events. |
| Approach: | They propose to use event schemas to guide the organization of complex events and to edit hierarchical graphs. |
| Outcome: | The proposed tool outperforms existing IE visualization tools in both IE result analysis and general model improvements. |
Copied to clipboard
| Challenge: | State-of-the-art automatic event detection struggles with interpretability and adaptability to evolving large-scale key events. |
| Approach: | They propose a task which identifies episodes within a news corpus of key event articles. |
| Outcome: | The proposed framework achieves 59.2% gain across all metrics compared to baselines. |
Copied to clipboard
| Challenge: | Recent studies on single-document summarization (SDS) benefit from advances in neural sequence learning, but they produce unsatisfactory results on multi-document summary (MDS). |
| Approach: | They propose a neural sequence learning method that unifies advanced neural SDS methods and statistical measures used in classical MDS. |
| Outcome: | The proposed method achieves state-of-the-art performance on benchmark MDS datasets. |
Copied to clipboard
| Challenge: | Existing methods for text classification use human annotations or a set of class seed words for supervision, which can be costly, especially in emerging domains. |
| Approach: | They propose a weakly-supervised method that leverages mutually-enhancing text granularities to learn a contextualized document representation that captures the most discriminative class indicators. |
| Outcome: | Extensive experiments on seven benchmark datasets show that MEGClass outperforms other weakly and extremely weakly supervised methods. |
Copied to clipboard
| Challenge: | Existing frameworks for fine-grained few-shot entity extraction are difficult to implement in the chemical domain due to the information overload of scientific papers. |
| Approach: | They propose a sequence-to-sequence based few-shot entity extraction approach . it uses a seq2seq entity extractor and a self-validation module to reconstruct original input sentence . |
| Outcome: | The proposed framework achieves 8.26% and 6.84% performance gains on two datasets. |
Copied to clipboard
| Challenge: | Existing methods for expanding seed entities with new entities belong to the same semantic class are difficult to implement and can lead to accumulative errors. |
| Approach: | They propose an iterative set expansion framework that leverages automatically generated class names to address the semantic drift issue. |
| Outcome: | The proposed framework generates high-quality class names and outperforms state-of-the-art methods significantly. |
Copied to clipboard
| Challenge: | Existing methods for parameter-efficient language model tuning (PELT) match the performance of fine-tuning with fewer trainable parameters. |
| Approach: | They propose a framework which integrates different PELT methods as submodules and learns to activate the ones that best suit the current data or task setup via gating mechanism. |
| Outcome: | The proposed framework outperforms fine-tuning methods on the GLUE benchmark and achieves 14% gains over the best individual PELT method. |
Copied to clipboard
| Challenge: | Hierarchical multi-label text classification (HMTC) aims to assign each text document to a set of relevant classes from a taxonomy. |
| Approach: | They propose to conduct HMTC based on only class surface names as supervision signals to mimic human experts. |
| Outcome: | The proposed framework outperforms the best existing method by 25% on two challenging datasets. |
Copied to clipboard
| Challenge: | Existing methods only conduct network growth in a single dimension, but compound growth operators are beneficial for multiple dimensions. |
| Approach: | They propose a method to train BERT progressively using a Transformer model and explore alternative growth operators in each dimension via controlled comparison. |
| Outcome: | The proposed method speeds up BERT pre-training by 73.6% and 82.2% for the base and large models respectively while achieving comparable performances. |
Copied to clipboard
| Challenge: | Existing methods for instruction tuning do not include associating instructions with existing datasets. |
| Approach: | They propose a dynamic growth paradigm for the automatic curation of instruction-tuning data . they use existing datasets to automatically construct instruction-uning datasets . |
| Outcome: | The proposed model reduces the API cost for generating instructions and provides high-quality data. |
Copied to clipboard
| Challenge: | EVIDENCEMINER is a web-based system that allows users to query a natural language statement and retrieve textual evidence from a background corpora for life sciences. |
| Approach: | They propose a web-based system that lets users query a natural language statement and automatically retrieves textual evidence from a background corpora for life sciences. |
| Outcome: | EVIDENCEMINER is a web-based system that lets users query a natural language statement and automatically retrieves textual evidence from a background corpora for life sciences. |
Copied to clipboard
| Challenge: | Recent studies have achieved inspiring success in unsupervised grammar induction using masked language modeling (MLM) as the proxy task. |
| Approach: | They propose to regularize the parser with phrases extracted by an unsupervised phrase tagger to help the LM model quickly manage low-level structures. |
| Outcome: | The proposed method improves the identification of high-level structures using phrase-guided masking. |
Copied to clipboard
| Challenge: | Current methods for information extraction (IE) focus on integrating IE output with the database . a long-overlooked question is what counts as "relevant knowledge" |
| Approach: | They propose a task that emphasizes integration of IE output and the database . they introduce a benchmark and an LLM agent framework for this task . |
| Outcome: | The proposed task integrates IE output and the target database (or knowledge base) it meets common demands such as data infilling, row population, and column addition . |
Copied to clipboard
| Challenge: | Existing pre-training methods for NLP tasks require massive computation resources. |
| Approach: | They propose a method that trains a discriminator to detect replaced tokens and select original tokens from candidate sets. |
| Outcome: | The proposed method improves ELECTRA based on multi-task learning on GLUE and SQUAD datasets. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) models can identify labels in 5.38% of test sentences . a framework to handle label mistakes during NER model training is proposed . |
| Approach: | They propose a framework to manually correct label mistakes in named entity recognition (NER) they aim to improve the accuracy of models by re-evaluating popular models on corrected test sets . |
| Outcome: | The proposed framework can detect label mistakes in 5.38% of test sentences . the proposed framework improves on three datasets with a high-performance model . |
Copied to clipboard
| Challenge: | Existing studies suggest augmenting LLMs with external text corpora to alleviate hallucination problems. |
| Approach: | They propose to augment large language models with text units retrieved from external knowledge corpora to alleviate the issue. |
| Outcome: | The proposed framework outperforms baselines on GRBench with three LLMs and shows that iterative reasoning outperformed the baselines. |
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) integrates knowledge from tables with an external knowledge base to improve the answer relevance and accuracy. |
| Approach: | They propose a table-corpora-aware RAG framework called T-RAG to integrate external knowledge into Large Language Models (LLMs) they then develop a multi-table question answering benchmark called MultiTableQA which spans 3 different task types, 57,193 tables, and 23,758 questions in total. |
| Outcome: | The proposed framework achieves state-of-the-art accuracy, recall, and runtime performance, with improvements of up to 9.4%. |
Copied to clipboard
| Challenge: | Existing approaches to answer open-domain questions use sparse representations and sparsity. |
| Approach: | They propose a method which augments a query by generating relevant contexts from heuristically discovered contexts without external supervision. |
| Outcome: | The proposed approach outperforms state-of-the-art dense retrieval methods on natural questions and triviaQA datasets. |
Copied to clipboard
| Challenge: | Existing studies view entity set expansion, taxonomy expansion, and seed-guided taxonomies as three separate tasks. |
| Approach: | They propose a taxonomy-guided instruction tuning framework to teach a large language model to generate siblings and parents for query entities. |
| Outcome: | The proposed framework outperforms baselines on multiple benchmark datasets. |
Copied to clipboard
| Challenge: | Word embeddings are used to encode semantic information, but their quality is not consistent across the vocabulary due to the long-tail distribution of word frequency. |
| Approach: | They propose a reliability-aware name tagging model that uses word frequency to indicate word quality . they propose to use word frequency-based reliability signals to dynamically select and compose features . |
| Outcome: | The proposed model outperforms the baseline model on OntoNotes 5.0 and up to 5% gain on cross-genre data sets. |
Copied to clipboard
| Challenge: | Existing methods for topic taxonomies focus on frequent terms and local topic-subtopic relations, which leads to limited topic term coverage. |
| Approach: | They propose a framework for topic taxonomy expansion that directly generates topic-related terms belonging to new topics. |
| Outcome: | The proposed framework outperforms baseline methods on two real-world text corpora. |
Copied to clipboard
| Challenge: | Prior methods to retrieve demonstrations based on embedding similarity or generation probability, resulting in irrelevant or redundant examples. |
| Approach: | They propose a topic coverage-based retrieval framework that selects demonstrations to comprehensively cover topic-level knowledge relevant to both the test input and the model. |
| Outcome: | The proposed framework covers all the necessary knowledge for the test input and the model. |
Copied to clipboard
| Challenge: | Existing event extraction methods require predefined event types and their annotations to learn event extractors. |
| Approach: | They propose to represent each event type as a cluster of predicate sense, object head> pairs. |
| Outcome: | The proposed method can discover salient and high-quality event types on three datasets from different domains. |
Copied to clipboard
| Challenge: | Existing models for text-to-text generation do not explicitly focus on important concepts in the input and output. |
| Approach: | They propose a framework to automatically extract, denoise, and enforce important input concepts as lexical constraints. |
| Outcome: | The proposed framework performs comparably or better than its unconstrained counterpart on automatic metrics and receives better ratings in the human evaluation. |
Copied to clipboard
| Challenge: | Graph Neural Networks (GNNs) with CLIP pipeline are difficult because of the scarcity of labeled data and text supervision, different levels of downstream tasks, and conceptual gaps between domains. |
| Approach: | They propose a multi-modal prompt learning paradigm to adapt pre-trained GNNs to downstream tasks with weak text supervision. |
| Outcome: | The proposed model can generalize graphs to unseen classes with weak text supervision. |
Copied to clipboard
| Challenge: | Biomedical event extraction requires domain-specific knowledge and deep understanding of complex contexts. |
| Approach: | They propose a knowledge base-driven tree-structured long short-term memory networks framework . tree-LSTM framework incorporates dependency structures and entity properties from ontologies . |
| Outcome: | The proposed framework is based on the BioNLP shared task with Genia dataset and achieves state-of-the-art results. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have excellent performance in various tasks, but fine-tuning requires extensive supervision. |
| Approach: | They propose to use a pre-trained Large Language Model to generate rationale-augmented answers for unlabeled questions and fine-tune the LLM using those self-generated solutions as target outputs. |
| Outcome: | The proposed approach improves the general reasoning ability of a 540B-parameter LLM without any ground truth label. |
Copied to clipboard
| Challenge: | Existing methods for text classification use label names of target classes as the only supervision. |
| Approach: | They propose a method that uses keyword-based keyword matching to generate pseudo labels . they propose 'pieclass' module that iteratively trains classifiers and updates pseudo labels. |
| Outcome: | The proposed method achieves better performance than existing strong baselines on seven benchmark datasets and similar performance to fully-supervised classifiers on sentiment classification tasks. |
Copied to clipboard
| Challenge: | Existing methods based on large language models (LLMs) rely heavily on predefined entity attribute schemas or annotated datasets, often leading to incomplete extraction results. |
| Approach: | They propose a novel approach to entity structure extraction that does not require any schema or annotated datasets. |
| Outcome: | Experiments show that ZOES improves LLMs’ ability to extract more complete entity structures across three different domains, showcasing both the effectiveness and generalizability of the method. |
Copied to clipboard
| Challenge: | Existing methods to build reliable named entity recognition systems require large amounts of manually-labeled training data. |
| Approach: | They propose a revised fuzzy CRF layer to handle tokens with multiple possible labels to address noisy distant supervision. |
| Outcome: | The proposed model can handle tokens with multiple possible labels under the traditional framework and improves on the existing model with a new Tie or Break scheme. |
Copied to clipboard
| Challenge: | Recent methods for event schema induction use information extraction systems to construct event graph instances from documents . compared to the previous state-of-the-art closed-domain schema inducing model, human assessors were able to cover 10% more events when translating the schemas into coherent stories . |
| Approach: | They propose to treat event schemas as commonsense knowledge that can be derived from large language models. |
| Outcome: | The proposed method simplifies the schema induction process and improves readability. |
Copied to clipboard
| Challenge: | Existing methods for automating taxonomy induction often divide the problem into two subtasks . a novel end-to-end reinforcement learning approach is proposed to improve the accuracy of such methods. |
| Approach: | They propose an end-to-end reinforcement learning approach to automatic taxonomy induction from a set of terms. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on two public datasets of different domains. |
Copied to clipboard
| Challenge: | Experimental results confirm the substantial superiority of GranuSum on multi-granularity summarization over strong baselines. |
| Approach: | They propose to rank events by their salience and annotate a benchmark for GranuSum that contains multiple summaries at different granularities for each document cluster. |
| Outcome: | The proposed framework is capable of producing multi-granular summaries in unsupervised manner over strong baselines. |
Copied to clipboard
| Challenge: | Named entity recognition models require abundant high-quality annotations to train . distant supervision may induce incomplete and noisy labels, making supervised learning ineffective. |
| Approach: | They propose a noise-robust learning scheme for training named entity recognition models using only distantly-labeled data and a self-training method that uses contextualized augmentations created by pre-trained language models. |
| Outcome: | The proposed method outperforms existing supervised NER models on three datasets by significant margins. |
Copied to clipboard
| Challenge: | Current Large Language Models excel in general reasoning yet struggle with specialized tasks requiring proprietary or domain-specific knowledge. |
| Approach: | They propose a collaborative framework that pairs a specialized weak model with a general strong model to optimize collaboration. |
| Outcome: | The proposed framework outperforms each model alone by leveraging complementary strengths. |
Copied to clipboard
| Challenge: | Current open-domain question answering systems follow a Retriever-Reader architecture . current systems do not use a reranker, which reranked passages based on top predictions of the reader . |
| Approach: | They propose a reader-guIDEd reranking method that reranked passages based on top predictions . they show that RIDER achieves 10 to 20 absolute gains in top-1 retrieval accuracy . |
| Outcome: | The proposed method achieves 10 to 20 gains in top-1 retrieval accuracy and 1 to 4 Exact Match gains without training. |
Copied to clipboard
| Challenge: | Existing studies on event extraction depend on pre-defined argument roles . despite great progress, many studies still rely on hand-crafted ontologies . |
| Approach: | They propose an unsupervised framework for customizing argument roles for event extraction . they propose a human-annotated event extraction dataset with 143 customized argument roles . |
| Outcome: | The proposed framework outperforms existing methods on an event extraction dataset. |