Papers by Hongyu Sun
Copied to clipboard
| Challenge: | Existing methods for Named entity recognition (NER) rely on labeled data, which is labor-intensive. |
| Approach: | They propose a method to de-biase DS-NER models by a structural Causal Model . they propose to use a causal invariance regularizer to make them more robust . |
| Outcome: | The proposed method significantly improves DS-NER models on four datasets and three DS NER models. |
Copied to clipboard
| Challenge: | Existing code sandboxes fail to provide accurate verification and efficiency under high-concurrency workloads. |
| Approach: | They propose a high-fidelity code verification system that provides sandbox feedback for RL training and evaluation. |
| Outcome: | The proposed system outperforms heuristic-matching baselines on LiveCodeBench and training stability on high-concurrency workloads. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive capabilities but their application in open-ended, knowledge-intensive, complex reasoning scenarios is limited. |
| Approach: | They propose a framework that integrates risk assessment of intermediate reasoning states with dynamic retrieval-augmented generation within a Monte Carlo tree search paradigm. |
| Outcome: | The proposed framework outperforms the state-of-the-art KAR methods by up to 23.10% and the latest RAG-equipped large reasoning models by upto 25.37%. |
Copied to clipboard
| Challenge: | Existing mRAG systems suffer from a language bias during reranking, systematically favoring English and the query’s native language. |
| Approach: | They propose a language-agnostic utility-driven reranker alignment technique to mitigate language bias during re-ranking. |
| Outcome: | The proposed approach mitigates language bias and consistently improves mRAG performance across languages. |
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: | Large Reasoning Models (LRMs) show strong System-2-style reasoning, but at the cost of significant computational overhead. |
| Approach: | They propose a two-stage curriculum distillation framework which builds a robust internal problem-solving student model and then teaches the student model to externalize this knowledge as explicit reasoning. |
| Outcome: | The proposed model outperforms single-stage baselines on mathematical benchmarks and significantly outperformed LRMs on complex tasks. |
Copied to clipboard
| Challenge: | a new approach to extract parallel sentences from Wikipedia articles is proposed . the approach is based on multilingual sentence embeddings, but does not limit it to English . |
| Approach: | They propose to automatically extract parallel sentences from Wikipedia articles in 96 languages . they train neural MT baseline systems on the mined data and evaluate them on the TED corpus . |
| Outcome: | The proposed approach extracts parallel sentences from Wikipedia articles in 96 languages . the extracted sentences achieve strong BLEU scores for many language pairs . |
Copied to clipboard
| Challenge: | Current neural event detection approaches focus on trigger-centric representations, which work well on distilling discrimination knowledge, but poorly on learning generalization knowledge. |
| Approach: | They propose a Delta-learning approach to distill discrimination and generalization knowledge by incrementally learning and adaptively fusing event representation. |
| Outcome: | The proposed method significantly outperforms previous approaches on unseen/sparse trigger words and achieves state-of-the-art performance on ACE2005 and KBP2017 datasets. |
Copied to clipboard
| Challenge: | Instruction fine-tuning (IFT) is a crucial phase in building large language models (LLMs). |
| Approach: | They propose a knowledge intervention framework to decouple the potential underlying factors of IFT and enable individual analysis of different factors. |
| Outcome: | The proposed framework decouples the potential underlying factors of IFT, enabling individual analysis of different factors. |
Copied to clipboard
| Challenge: | Existing methods for annotating instruction data are expensive and difficult to scale. |
| Approach: | They propose a method to automatically build instruction data from an unlabeled corpus without heavy reliance on proprietary LLMs and human annotation. |
| Outcome: | The proposed method outperforms existing methods on AlpacaEval leaderboard and other open-source methods. |
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: | Recent advances in large language models (LLMs) have revolutionized the field of natural language processing and artificial intelligence, creating new SOTAs and reaching human-level language understanding performance on a series of tasks and benchmarks. |
| Approach: | They propose to use an algorithm test set sourced from Introduction to Algorithm to assess LLMs' code execution abilities. |
| Outcome: | The proposed model can execute programs described in natural language as long as no heavy numeric computation is involved. |
Copied to clipboard
| Challenge: | Information extraction suffers from its varying targets, heterogeneous structures, and demand-specific schemas. |
| Approach: | They propose a unified text-to-structure generation framework, namely UIE, which can universally model different IE tasks, adaptively generate targeted structures, and collaboratively learn general IE abilities from different knowledge sources. |
| Outcome: | The proposed framework can model different IE tasks, generate targeted structures, and learn general IE abilities from different knowledge sources. |
Copied to clipboard
| Challenge: | Existing presentation agents rely on predefined workflows and fixed templates to generate presentations. |
| Approach: | They propose an agentic framework that adapts to diverse user intents and iterative refinement based on observation. |
| Outcome: | The proposed framework can be used to generate presentations with environmental observations. |
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 paper search systems lack detailed information to support finer-grained queries. |
| Approach: | They propose a paper-based index that transforms abstract-based corpus index into hierarchical index tree and offline can support paper search queries. |
| Outcome: | The proposed system achieves the SOTA performance and excels in fine-grained scenarios. |
Copied to clipboard
| Challenge: | Detection problems involving positive instances are often deficient in information extraction tasks . a number of researches have employed neural network models to solve detection problems . |
| Approach: | They propose an algorithm which can handle positive sparsity problem and directly optimize over F-measure . they borrow the idea of marginal utility from economics and propose a theoretical framework for instance importance measuring . |
| Outcome: | The proposed algorithm improves on positive sparsity problem and over F-measure . it leads to more effective and stable training of neural network based detection models. |
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: | Existing knowledge injection frameworks focus on knowledge memorization and retrieval, but static nature of large language models leads to outdated information as the real world evolves or when adapting to domain-specific knowledge. |
| Approach: | They propose a four-tier knowledge injection framework that defines the levels of knowledge injection: memorization, retrieval, reasoning, and association. |
| Outcome: | The proposed framework defines the levels of knowledge injection: memorization, retrieval, reasoning, and association. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) is a fundamental task of information extraction. |
| Approach: | They propose to perform randomization tests on standard NER benchmarks to examine name regularity, mention coverage and context diversity. |
| Outcome: | The proposed model performs better on standard NER benchmarks than other models on open datasets. |
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: | 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 approaches to improve the reasoning performance of large language models rely on intuitive instance-level feedback, which limits the reasoning capabilities. |
| Approach: | They propose a framework that pushes LLMs toward System-2-like critic capability by using a step-wise CoT reasoning paradigm and automatic construction of weak-supervision data without human annotation. |
| Outcome: | The proposed model significantly improves task-solving performance by filtering out invalid solutions or iterative refinement. |
Copied to clipboard
| Challenge: | acquiring and representing commonsense in machines has posed a long-standing challenge (Li et al., 2021; Zhang e t al, 2022; Zhou e al. 2023) . |
| Approach: | They use a commonsense-based LLM to evaluate ChatGPT's commonsensing abilities by analyzing 11 datasets and generating knowledge descriptions. |
| Outcome: | The proposed model can achieve good QA accuracies while still struggling with certain domains of datasets. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on character-centric approach and fail to reflect real-world applications. |
| Approach: | RMTBench is a user-centric bilingual role-playing benchmark featuring 80 diverse characters and over 8,000 dialogue rounds. |
| Outcome: | RMTBench features 80 diverse characters and over 8,000 dialogue rounds. |
Copied to clipboard
| Challenge: | Recent studies show that pre-trained masked language models can be factual knowledge bases. |
| Approach: | They conduct a rigorous study to explore the underlying predicting mechanisms of MLMs . they find that previous decent performance mainly owes to the biased prompts which overfit dataset artifacts a . |
| Outcome: | The proposed model improves on illustrative cases and external contexts . the results question the previous findings that MLMs can be reliable factual knowledge bases . |
Copied to clipboard
| Challenge: | Existing approaches to identifying inappropriate content require extensive human-labeled data and lack cross-issue generalization. |
| Approach: | They propose a reasoning-enhanced multimodal large language model (MLLM) pretraining paradigm for unified inappropriate content detection. |
| Outcome: | The proposed model improves the MLLM's performance in both zero-shot and supervised fine-tuning settings and shows strong generalization capabilities to emergent, previously unseen issues. |
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: | 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 RAG paradigms suffer from the impact of flawed information introduced during the retrieval phrase, thereby diminishing the reliability and correctness of the generated output. |
| Approach: | They propose a framework that empowers models to discern and process information based on its credibility. |
| Outcome: | The proposed framework outperforms existing models with retrieval augmentation and exhibits robustness despite increasing noise in the context. |
Copied to clipboard
| Challenge: | Current research on large language models with retrieval-augmented code generation (RACG) has focused on single-language settings, leaving their cross-lingual effectiveness underexplored. |
| Approach: | They construct a dataset covering 13 PLs with nearly 14K instances to study cross-lingual code knowledge transfer in RACG. |
| Outcome: | The proposed model shows unequal cross-lingual knowledge transfer even with direct injection and shows limited reliance on natural language information embedded in code when equipped with a code-specific retriever. |
Copied to clipboard
| Challenge: | Large language models exhibit behavior that deviates from the boundaries of their knowledge during response generation. |
| Approach: | They propose a framework that allows large language models to explore their knowledge boundaries and self-correct generation behavior through fine-grained feedback signals. |
| Outcome: | The proposed framework enables LLMs to explore their knowledge boundaries and self-correct generation behavior through fine-grained feedback signals. |
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) is a parameter-efficient fine-tuning algorithm for large-scale language models. |
| Approach: | They conduct a systematic study of Low-Rank Adaptation (LoRA) on diverse tasks and rich resources with different learning capacities. |
| Outcome: | The proposed algorithm can achieve remarkable performance in high-resource and multi-task scenarios, even comparable to full fine-tuning. |
Copied to clipboard
| Challenge: | Existing work neither proves that pre-trained models successfully learn the injected factual knowledge nor proves there is a causal relation between injected knowledge and downstream performance improvements. |
| Approach: | They propose a counterfactual-based analysis framework to explore the causal effects of factual knowledge injection on the performance of language models within pretrain-finetune paradigm. |
| Outcome: | The proposed framework shows that factual knowledge injection is successful but correctness of injected knowledge only has limited effect on the models’ downstream performance. |
Copied to clipboard
| Challenge: | Existing studies in retrieval-augmented generation (RAG) do not sufficiently address the design of complex engineering solutions. |
| Approach: | They propose a retrieval-augmented generation system that leverages tree-based exploration and bi-point thinking mechanism to generate reliable solutions. |
| Outcome: | Experiments show that the proposed system achieves state-of-the-art (SOTA) performance on the SolutionBench, highlighting its potential to enhance the automation and reliability of complex engineering solution design in real-world applications. |
Copied to clipboard
| Challenge: | Existing methods often apply coarse-grained constraints over entire reasoning trajectories . Existing approaches often apply unsafe constraints, causing unsafe outputs . |
| Approach: | They propose a trajectory-level training framework that mitigates Self-Jailbreak . they propose 'chain-of-guardrail' to mitigate self-jailbreak by targeting step-level interventions . |
| Outcome: | The proposed framework mitigates Self-Jailbreak by targeting step-level interventions while maintaining reasoning ability. |
Copied to clipboard
| Challenge: | Low-shot relation extraction (RE) aims to recognize novel relations with very few or even no samples. |
| Approach: | They propose a method that leverages triplet paraphrase to pre-train zero-shot label matching ability and uses meta-learning paradigm to learn few-shot instance summarizing ability. |
| Outcome: | The proposed method outperforms strong baselines and achieves the best performance on few-shot RE leaderboard. |
Copied to clipboard
| Challenge: | Existing approaches to automatically generate commit messages are repetitive or redundant. |
| Approach: | They propose a retrieval-augmented neural commit message generation method which treats the retrieved similar commit as an exemplar and leverages it to generate an accurate commit message. |
| Outcome: | The proposed method outperforms baselines on a large dataset with five programming languages and can boost existing Seq2Seq models in commit message generation. |
Copied to clipboard
| Challenge: | Recent studies have discovered notable disparities in their performance across different languages. |
| Approach: | They conduct a systematic investigation into the behaviors of large language models across 27 different languages on 3 different scenarios and reveals a Linguistic Map correlates with the richness of available resources and linguistic family relations. |
| Outcome: | The proposed model demonstrates that there are significant disparities in performance across languages across 27 different languages on 3 different scenarios. |
Copied to clipboard
| Challenge: | Document Structured Extraction (DSE) is a field of document structure analysis that aims to extract structured content from raw documents. |
| Approach: | They propose a benchmark to evaluate document structured extraction systems by converting unstructured PDFs into semantically rich Markdown. |
| Outcome: | The proposed benchmark is based on 3,576 diverse and real-world documents from arXiv, GitHub, and Zenodo. |
Copied to clipboard
| Challenge: | Current OpenRE models are often trained on the datasets generated from distant supervision, which often results in instability and makes the model easily collapsed. |
| Approach: | They propose to use a causal model to identify relation instances referring to the same relation . they propose to perform Element Interventions on context and entities respectively . |
| Outcome: | The proposed method outperforms existing methods and is robust across datasets. |
Copied to clipboard
| Challenge: | Existing methods to extract event records from text decompose complex structure prediction task into multiple subtasks. |
| Approach: | They propose a sequence-to-structure generation paradigm that can extract events from text . they propose unified event extraction, constrained decoding algorithm and curriculum learning algorithm . |
| Outcome: | The proposed method can achieve competitive performance using record-level annotations in both supervised learning and transfer learning settings. |
Copied to clipboard
| Challenge: | Existing methods for XMC struggle with the growing set of labels due to their static label assumptions, and embedding-based methods struggle with complex mapping relationships due to late interaction paradigm. |
| Approach: | They propose a large language model (LLM) powered agent framework for extreme multi-label classification, XMC-Agent, which can effectively learn, manage and predict the extremely large and dynamically increasing set of labels. |
| Outcome: | The proposed framework can learn, manage and predict the extremely large and dynamically growing set of labels and achieves state-of-the-art performance on three standard datasets. |
Copied to clipboard
| Challenge: | Experimental results show that our approach significantly outperforms the supervised counterparts, and can even achieve competitive performance to supervised state-of-the-art (SoA) model. |
| Approach: | They propose a syntactic and semantic-driven learning approach that can learn open IE models without human-labelled data by leveraging syntakic and semantic knowledge as noisier, higher-level supervision. |
| Outcome: | The proposed approach outperforms supervised counterparts and can achieve competitive performance to supervised state-of-the-art models. |
Copied to clipboard
| Challenge: | Recent advances in large language models have push NLP into a new era, moving away from traditional task-specific pre-train finetuning paradigm. |
| Approach: | They provide a comprehensive analysis of declarative and procedural knowledge for large language models and evaluate their effectiveness. |
| Outcome: | The proposed model can perform better with both kinds of knowledge, but at different speeds. |
Copied to clipboard
| Challenge: | In-context learning (ICL) has gained considerable attention due to its data efficiency and task adaptability. |
| Approach: | They propose to de-biase demonstration bias in in-context learning by focusing on semantic ambiguity induced by demonstrations and reducing the semantic hazard. |
| Outcome: | The proposed methods significantly improve performance on six datasets. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) capture semantics of short video content but fail to account for policy-specific details. |
| Approach: | They propose a framework that integrates In-prompt Process Supervision into MLLMs . they propose sequential reasoning over ancillary questions during fine-tuning . |
| Outcome: | IPS outperforms baseline MLLMs on public and proprietary benchmarks . replacing human-annotated ancillary labels with MLML-generated ones results in performance degradation. |
Copied to clipboard
| Challenge: | Entity matching (EM) is a critical step in entity resolution (ER). |
| Approach: | They propose a method that incorporates record interactions from different perspectives. |
| Outcome: | The proposed framework improves on 8 ER datasets and 10 LLMs and achieves higher efficiency and effectiveness. |
Copied to clipboard
| Challenge: | Prior research focused on developing data generation methods, while insufficient attention has been paid to quality control mechanisms and often produces inaccurate and unhelpful data. |
| Approach: | They propose an algorithm that automatically generates high-quality preference data, eliminating manual annotation requirements. |
| Outcome: | The proposed algorithm outperforms baselines in human preference alignment and reward optimization. |
Copied to clipboard
| Challenge: | Existing algorithms for post-training large datasets are requiring a large computational effort. |
| Approach: | They propose to model the changes at logits level during post-training using a separate neural network . they demonstrate that the value network can be seamlessly integrated with another pre-trained model . |
| Outcome: | The proposed model can be integrated with another pre-trained model during inference, enabling similar capability enhancements. |
Copied to clipboard
| Challenge: | Existing methods for code summarization do not capture rich information in ASTs . existing methods are labor-intensive and time-consuming to document code with good summaries manually. |
| Approach: | They propose a model that hierarchically splits and reconstructs ASTs by a neural network . they propose to use AST embeddings and a vanilla code token encoder to generate the model . |
| Outcome: | The proposed model splits and reconstructs ASTs into subtrees and then aggregates embeddings of subtreas to get the complete AST. |
Copied to clipboard
| Challenge: | Experimental results show that stories outperform rules as the expression for retrieving commonsense from LLMs, exhibiting higher generation confidence and commonsensense accuracy. |
| Approach: | They investigate the commonsense ability of large language models expressed through stories and rules to retrieve commonsensing knowledge from LLMs. |
| Outcome: | The stories outperform rules as commonsense expressions on 28 commonsensense QA datasets, exhibiting higher generation confidence and commonsence accuracy. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown significant potential in code generation, but they also present challenges regarding the protection of Intellectual Property (IP) related to model architectures, weights, and training data. |
| Approach: | They propose a multi-bit watermarking technique that embeds additional information to preserve provenance details, such as the vendor ID of an LLM. |
| Outcome: | The proposed technique preserves provenance details while maintaining syntactical correctness of generated code. |
Copied to clipboard
| Challenge: | Several studies have explored delta parameter properties via pruning, quantization, low-rank approximation, and extrapolation, but what properties of delta parameters are essential for maintaining performance? |
| Approach: | They propose to examine delta parameter properties along magnitude and sign . they propose to use a loss-based local surrogate analysis to examine editing effects . |
| Outcome: | The proposed analysis shows that delta parameters can be edited while maintaining performance. |
Copied to clipboard
| Challenge: | Automated Alignment (ALM) is a set of algorithms designed to align Large Language Models (LLMs) with human intentions and values while minimizing manual intervention. |
| Approach: | They propose an open-source toolkit that integrates mainstream automated algorithms through a consistent interface and an accessible workflow supporting one-click execution for prompt synthesis and automatic alignment signal construction. |
| Outcome: | The proposed framework enables easy reproduction of existing results through extensive benchmarks and facilitates the development of novel approaches via modular components. |
Copied to clipboard
| Challenge: | Existing research treats MLLMs as unified systems optimized through end-to-end training, but the impact of vision encoder’s prior knowledge is seldom investigated. |
| Approach: | They propose a metric to quantify the effect of prior knowledge on MLLM performance by integrating prior knowledge at the vision encoder level into a training framework. |
| Outcome: | The proposed training framework incorporates prior knowledge at the vision encoder level, and significantly boosts visual understanding capabilities of MLLMs. |
Copied to clipboard
| Challenge: | Large language models generate costly yet semantically void reasoning on beyond-capability tasks . the dominant failure mode is specious reasoning, superficially valid outputs with subtle hallucinations . |
| Approach: | They propose a capability-aligned reinforcement learning approach that aligns model behavior with capability boundaries. |
| Outcome: | The proposed model reduces futile reasoning while maintaining performance across tasks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have made significant advances in code generation through the ‘Chain-of-Thought’ prompting technique. |
| Approach: | They propose a framework which aims to transfer LLMs’ reasoning capabilities to smaller models through distillation. |
| Outcome: | The proposed framework improves the smaller model's code generation performance by over 130% on the APPS benchmark. |
Copied to clipboard
| Challenge: | Existing work on LLM-based planning uses language generation to produce free-style plans . however, these plans are not grounded in an executable set of actions . |
| Approach: | They propose a new task for open grounded planning that asks the model to generate an executable plan based on a variable action set. |
| Outcome: | The proposed task is open grounded planning, which is based on a set of variables. |
Copied to clipboard
| Challenge: | Existing methods for generating presentations from documents focus on improving and evaluating content quality in isolation, overlooking visual appeal and structural coherence. |
| Approach: | They propose an edit-based presentation generation system that analyzes and iterates on slides to create new slides. |
| Outcome: | The proposed presentation generation tool outperforms existing methods in three dimensions . it analyzes slides, iterates and generates edit actions based on selected slides . |
Copied to clipboard
| Challenge: | Recent approaches to classification of vulnerabilities ignore their relationships and treat each class in isolation, resulting in non-scalable code vector representations. |
| Approach: | They propose a hierarchical contrastive learning framework to bring vector representations of related CWEs closer together and use max-pooling to enable the model to handle longer vulnerability code inputs. |
| Outcome: | The proposed framework outperforms state-of-the-art methods by 2.97%-17.90% on accuracy and 0.98%-22.27% on weighted-F1 with even better performance on higher-quality datasets. |
Copied to clipboard
| Challenge: | Document logical structuring is crucial for document intelligence due to the complexity of text segment dependencies in the document. |
| Approach: | They propose an end-to-end, generation-based method for document logical structuring that generates the action sequence via a global context-aware generative model and updates its global context and current logical structure based on the generated actions. |
| Outcome: | Experiments on ChCatExt and HierDoc datasets show that Seg2Act performs better than previous methods in both supervised and transfer learning settings. |
Copied to clipboard
| Challenge: | Recent studies have found prompt-based probing evaluations inaccurate, inconsistent and unreliable. |
| Approach: | They propose to conduct debiasing via causal intervention to uncover biases in probing evaluations . authors argue that prompt-based probing is inaccurate, inconsistent and unreliable . |
| Outcome: | This paper examines the effectiveness of prompt-based probing in pretrained language models . it highlights critical biases which could induce biased results and conclusions . authors suggest rethinking criteria for evaluating better pretrained models based on such evaluations . |
Copied to clipboard
| Challenge: | Named entity recognition (NER) approaches restrict each word belonging to at most one entity mention. |
| Approach: | They propose to model and leverage the head-driven phrase structures of entity mentions to solve this problem. |
| Outcome: | The proposed architecture achieves state-of-the-art on three standard nested entity mention detection benchmarks. |
Copied to clipboard
| Challenge: | Word frequency is a key variable in psycholinguistics, useful for modeling human familiarity with words . a recent study shows that frequency from YouTube subtitles is comparable to and often better than the best available resources. |
| Approach: | They use YouTube subtitles to construct frequency norms for five languages . they find they are comparable to and often better than the best currently available resources . |
| Outcome: | The proposed method improves on the best currently available resources for Chinese, English, Indonesian, Japanese, and Spanish. |
Copied to clipboard
| Challenge: | Existing approaches to fine-grained entity typing are based on independent classification paradigms, which make them difficult to recognize inter-dependent, long-tailed and fine-granular entities. |
| Approach: | They propose a label reasoning network that exploits label dependencies knowledge entailed in the data. |
| Outcome: | The proposed network can model, learn and reason complex labels in a sequence-to-set, end-to end manner. |
Copied to clipboard
| Challenge: | Existing event-centric knowledge graphs rely on explicit connectives to extract relations between events. |
| Approach: | They propose a knowledge projection paradigm for event relation extraction using commonalities between events. |
| Outcome: | The proposed method achieves state-of-the-art performance and extrinsic results verify the extracted event relations. |
Copied to clipboard
| Challenge: | Web documents are one of the most primary and biggest data resources in current era, and understanding their discourse structure will benefit various downstream document processing applications. |
| Approach: | They propose a web document discourse structure representation schema by extending classical discourse theories and adding special features to well represent discourse characteristics of web documents. |
| Outcome: | The proposed task is feasible but challenging for current models. |
Copied to clipboard
| Challenge: | Existing Chinese resources are small in scale and limited to specific domains, making them insufficient for LLM post-training. |
| Approach: | They propose a Chinese-annotated reward model and a preference dataset to address this gap . they evaluate Chinese RMs on CheemsBench and construct an RM that captures human preferences . |
| Outcome: | The proposed RM achieves state-of-the-art performance on CheemsBench and CheeMePreference. |
Copied to clipboard
| Challenge: | Existing approaches to answer open-domain question have encountered term mismatch and limited interaction between IR systems and large language models. |
| Approach: | They propose a method which leverages the guidance and feedback gained from the analysis to provide faithful and consistent extensions for effective question answering. |
| Outcome: | Experiments on four open-domain question answering datasets show the proposed method performs well under zero-shot settings. |
Copied to clipboard
| Challenge: | Distant supervision (DS) is a promising learning approach for machine reading comprehension (MRC) however, the annotated dataset will inevitably lead to mislabeled instances, resulting in answer bias and context noise problems. |
| Approach: | They propose an algorithm that can learn to distinguish confusing and noisy instances via confidence-aware contrastive learning. |
| Outcome: | The proposed algorithm can learn to distinguish confusing and noisy instances via confidence-aware contrastive learning. |
Copied to clipboard
| Challenge: | Recent studies in formal mathematical reasoning have shown an unstoppable growth trend. |
| Approach: | They constructed 18k high-quality instruction-response pairs across five mainstream formal specification languages and evaluated them against ten open-sourced LLMs. |
| Outcome: | The proposed model compared instruction-response pairs across five formal specification languages and found that the LLMs were good at writing proof segments when given either the code, or the detailed description of proof steps. |
Copied to clipboard
| Challenge: | Recent advances in event detection focus on wordwise classification with one NIL class for tokens do not trigger any event. |
| Approach: | They propose a cost-sensitive regularization method which penalizes more on mislabeling . they propose two estimators which can effectively measure such label confusion based on instance-level statistics . |
| Outcome: | The proposed method can improve the performance of different models in English and Chinese event detection. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) is a fundamental NLP task. |
| Approach: | They propose a gazetteer-based attentive neural network which can enhance region-based NER . they first model the mention-context association and then an auxiliary gazetteers . |
| Outcome: | The proposed approach can achieve state-of-the-art on ACE2005 named entity recognition benchmark. |
Copied to clipboard
| Challenge: | Nugget Proposal Networks (NPNs) can solve word-trigger mismatch problem . word-wise event detection models suffer from word-tree mismatch because of multiple triggers . |
| Approach: | They propose a novel way to detect event triggers in a character-wise paradigm . they propose entire trigger nuggets centered at each character regardless of word boundaries . |
| Outcome: | The proposed model outperforms the state-of-the-art methods on two datasets. |
Copied to clipboard
| Challenge: | Existing code benchmarks focus on code generation, while those for code reasoning are insufficient. |
| Approach: | They propose a multi-lingual code reasoning benchmark that contains 19 programming languages and at least 600 subjects for each language. |
| Outcome: | The proposed model trains on Python and achieves 34.4% Pass@1 in other languages, revealing the cross-language generalization of LLMs. |
Copied to clipboard
| Challenge: | Existing instruction following datasets lack logical coherence across turns, narrow topical breadth and heavy manual effort. |
| Approach: | They propose a pipeline that leverages LLMs’ reasoning capabilities to assemble rich, topic-related single-instruction data into multi-turn dialogues and produce chains that are logically coherent, progressively deepen in content, and span diverse domains without fixed templates or extensive human annotation. |
| Outcome: | The proposed pipeline improves the performance of existing LLMs by integrating multiple topic-related data into multi-turn dialogues without fixed templates or extensive human annotation. |
Copied to clipboard
| Challenge: | Current evaluations for large language models use a single-item assessment paradigm . current evaluations struggle to discern whether a model possesses the required capabilities or merely memorizes/guesses the answers to specific questions. |
| Approach: | They propose a framework to evaluate large language models using atomic test objectives. |
| Outcome: | The proposed evaluation framework resists data contamination and reduces interference of potential biases, and sheds light on the design of future principled and trustworthy LLM evaluation protocols. |
Copied to clipboard
| Challenge: | In this study, we uncover interpretable latents that govern RAG behavior in large language models . Sparse Autoencoders are used to control large language model (LLM) behavior . |
| Approach: | They leverage Sparse Autoencoders within the LLaMA Scope to uncover latents that govern RAG behaviors. |
| Outcome: | The proposed model can be used to control large language models without architectural modifications. |
Copied to clipboard
| Challenge: | Existing studies on event-centric opinion mining focus on entity-centric opinions . entity-centered opinions focus on sentimental polarity of events, while event-centered ones focus on content . |
| Approach: | They propose to perform event-centric opinion mining on event-argument structure and expression categorizing theory and benchmark it against a pioneer corpus. |
| Outcome: | The proposed task is feasible and challenging, and the results are beneficial for future studies. |
Copied to clipboard
| Challenge: | Existing neural semantic parsers require a large amount of training data which is expensive and difficult to obtain. |
| Approach: | They propose a framework for a supervised retrieval system based on pretrained language models . they propose ambiguous supervision to improve the precision and coverage of the task . |
| Outcome: | The proposed approach outperforms state-of-the-art zero-shot parsing methods in ambiguous supervision. |
Copied to clipboard
| Challenge: | Existing methods for sparse upcycling lead to performance degradation in instruction tuning scenarios. |
| Approach: | They propose a representation-based approach to convert dense language models into sparsely activated ones by initializing router weights from language models. |
| Outcome: | The proposed architecture improves model capabilities and routing consistency across multiple benchmarks. |
Copied to clipboard
| Challenge: | Existing alignment methods fail to adapt to the diversity of preferences and regulatory standards. |
| Approach: | They propose a method for prioritizing rules over user instructions to minimize misalignments in Large Language Models. |
| Outcome: | The proposed approach minimizes misalignments and adapts smoothly to various unseen rules, ensuring they are shielded from hijacking and that the model responds appropriately. |