Papers by Hui Su
Copied to clipboard
| Challenge: | Existing sentiment lexicons do not handle word sense and the concept of semantic compositionality is non-existent in simple lexiconic approaches. |
| Approach: | They propose a lexicon-driven contextual attention mechanism and a contrastive co-attention mechanism that models contrasting polarities between all positive and negative words in a sentence. |
| Outcome: | The proposed model outperforms many other neural baselines on sentiment classification tasks on multiple benchmark datasets. |
Copied to clipboard
| Challenge: | Existing methods for adapting LLMs to streaming rely on expensive re-encoding or limited scalability. |
| Approach: | They propose a group position encoding paradigm built on batch architectures to enhance consistency between streaming and batch modes. |
| Outcome: | The proposed method outperforms existing methods on cross-lingual and cross-modal tasks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) excel in reasoning tasks through Chain-of-Thought prompting. |
| Approach: | They examine the factors influencing CoT distillation including granularity, format and teacher model. |
| Outcome: | The proposed model is based on four teacher models and seven student models across seven mathematical and commonsense reasoning datasets. |
Copied to clipboard
| Challenge: | Existing literature on mechanistic interpretation (MI) treats it as an observational science, leaving practical applications underexplored. |
| Approach: | They propose a survey structured around the pipeline to identify and improve MI models. |
| Outcome: | The proposed framework enables tangible improvements in Alignment, Capability, and Efficiency. |
Copied to clipboard
| Challenge: | Existing studies have found that the test loss of LLMs scales as power-laws with model size, computational budget, and dataset size. |
| Approach: | They propose a concept of Temporal Scaling Law to study test loss of LLMs . they break down test loss into fine-grained token positions and develop a dynamic hyperbolic-law . |
| Outcome: | The proposed model predicts the test loss of LLMs as the training steps scale up. |
Copied to clipboard
| Challenge: | Sequence-to-Sequence models favor short generic responses . however, the model is not suitable for modeling dialogues . |
| Approach: | They propose a model that connects preceding and following conversations to a prior distribution to avoid non-differentiability of discrete natural language tokens. |
| Outcome: | The proposed model is highly efficient in learning the backbone of human-computer communications, but favors short generic responses. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have been attracting much attention due to their impressive performance in all kinds of downstream tasks. |
| Approach: | They propose a mix-of-experts model that allows the model size to grow without raising training costs. |
| Outcome: | The proposed model outperforms existing models in perplexity and robustness tests. |
Copied to clipboard
| Challenge: | Recent research has achieved impressive results in single-turn dialogue modelling, but multi-turn models still remain challenging. |
| Approach: | They propose to rewrite human utterances as a pre-process to help multi-turn dialgoue modelling. |
| Outcome: | The proposed architecture achieves remarkably good performance on the utterance rewriting task. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) suffer from significant computational overhead due to the quadratic growth of attention computations with the number of multimodal tokens. |
| Approach: | They propose a training-free pruning framework that prunes multimodal tokens without a trained pruning method. |
| Outcome: | The proposed pruning framework outperforms existing token pruning methods and generalizes across diverse MLLMs. |
Copied to clipboard
| Challenge: | Existing methods for misinformation detection are limited by domain knowledge and expert experience. |
| Approach: | They propose a Multi-Agent Framework for cross-domain misinformation detection with Automated Decision Rule Optimization (MARO) they first employ multiple expert agents to analyze target-domain news, then introduce a question-reflection mechanism that guides expert agents for higher-quality analysis. |
| Outcome: | The proposed framework improves on a common dataset and shows that iteratively improves over existing methods. |
Copied to clipboard
| Challenge: | Recent neural attention models conflate all steps into a single end-to-end system and simplify training process. |
| Approach: | They propose to explicitly segment target text into fragment units and align them with their data correspondences. |
| Outcome: | The proposed model outperforms neural attention models on E2E and WebNLG benchmarks. |
Copied to clipboard
| Challenge: | Current mathematical benchmarks focus on evaluating MLLMs’ problem-solving ability, yet there is a crucial gap in addressing more complex scenarios such as error detection. |
| Approach: | They propose to evaluate multimodal error detection by evaluating two sub-tasks error step identification and error categorization. |
| Outcome: | The proposed task evaluates MLLMs' ability to handle multimodal questions compared to text-only models. |
Copied to clipboard
| Challenge: | Sarcasm is a figurative speech act which manifests on social networks such as Twitter and Reddit. |
| Approach: | They propose a model that looks in-between rather than across to explicitly model contrast and incongruity. |
| Outcome: | The proposed model achieves state-of-the-art performance on all datasets and improves interpretability. |
Copied to clipboard
| Challenge: | Existing methods for training reasoning-oriented large language models assume high-resource settings with abundant data. |
| Approach: | They propose a framework that integrates high-value general-domain data to promote more diverse exploration. |
| Outcome: | The proposed framework matches or surpasses RLVR trained with 32 target-domain samples using 32 target domain samples. |
Copied to clipboard
| Challenge: | Existing studies on large language models (LLMs) focus on basic plan validity, but neglect critical aspects such as route efficiency, POI appeal, and real-time adaptability. |
| Approach: | They propose a benchmark for retrieval-augmented, spatiotemporal-aware travel planning that integrates retrieved trajectories with LLMs’ intrinsic reasoning. |
| Outcome: | The proposed framework improves spatial efficiency and POI rationality while challenging universality and robustness due to conflicting references and noisy data. |
Copied to clipboard
| Challenge: | Recent AI methods have shown promise in tasks such as hypothesis generation and experimental design, but they fail to replicate the collaborative nature of real-world scientific practices. |
| Approach: | They propose a virtual scientific system that mimics the collaborative nature of scientific research by organizing a team of agents to generate, evaluate, and refine research ideas. |
| Outcome: | The proposed system outperforms the state-of-the-art method in producing new scientific ideas and offers valuable insights to guide future research. |
Copied to clipboard
| Challenge: | Recent neural network models conflate content selection and surface realization into a black-box architecture, resulting in content to be described in text cannot be explicitly controlled. |
| Approach: | They propose to decouple content selection from the decoder to allow finer-grained control over the generation. |
| Outcome: | The proposed model can be trained end-to-end without human annotations and achieves promising results in data-totext and headline generation tasks. |
Copied to clipboard
| Challenge: | Currently, open-domain chatbots are far from satisfactory. |
| Approach: | They propose a unified, readily scalable neural approach which reconciles all subtasks like intent prediction and knowledge retrieval. |
| Outcome: | The proposed approach outperforms commercial systems replying on complex rules on static and interactive tests and shows that the results are remarkably good. |
Copied to clipboard
| Challenge: | Recent advances in open-domain question answering (ODQA) have led to human-level performance on many datasets. |
| Approach: | They provide a comprehensive and quantitative analysis about the difficulty of book QA . they compare the results of their research with extensive ODQA experiments . |
| Outcome: | The proposed model outperforms existing models on event-oriented questions on the NarrativeQA dataset. |
Copied to clipboard
| Challenge: | MultiConIR is a benchmark designed to evaluate retrieval and reranking models under nuanced multi-condition query scenarios. |
| Approach: | They propose a benchmark to evaluate retrieval and reranking models under nuanced multi-condition query scenarios. |
| Outcome: | The proposed benchmark evaluates retrieval and reranking models under nuanced multi-condition query scenarios across five domains. |
Copied to clipboard
| Challenge: | Modern pointer generators only capture exact word matches, ignoring possible inflections or abstractions, which restricts its power of capturing richer latent alignment. |
| Approach: | They propose a pointer generator architecture that allows the model to "edit" pointed tokens instead of always copying them. |
| Outcome: | The proposed model captures more latent alignment relations than exact word matches and generates higher-quality summaries validated by both qualitative and quantitative evaluations. |
Copied to clipboard
| Challenge: | Large-scale pretrained language models have achieved SOTA results on NLP tasks but are vulnerable to adversarial attacks especially for logographic languages like Chinese. |
| Approach: | They propose a pretrained Chinese Bert that is robust to various forms of adversarial attacks like word perturbation, synonyms, typos, etc. |
| Outcome: | The proposed model outperforms baselines on 5 Chinese NLU tasks without sacrificing performance on clean testsets. |
Copied to clipboard
| Challenge: | Neural data-to-text generation is a difficult task for many new applications because of a lack of training data. |
| Approach: | They propose a few-shot approach that augments the data available for training by generating new text samples based on replacing specific values by alternative ones from the same category and pairing the new text with data samples. |
| Outcome: | The proposed approach outperforms fully supervised sequence-to-sequence models with less than 10% of the training set on both datasets. |
Copied to clipboard
| Challenge: | Neural network-based sequence-to-sequence models suffer from low diversity in open-domain dialogue generation. |
| Approach: | They propose a way to diversify dialogue generation by leveraging non-conversational text . they collect large-scale corpus from forum comments, idioms and book snippets . |
| Outcome: | The proposed model produces significantly more diverse responses without sacrificing relevance with context. |
Copied to clipboard
| Challenge: | Existing methods that optimize for scalar scores or ranking reward ignore multi-dimensional nature of human preferences. |
| Approach: | They propose to extend the preference of Direct Preference Optimization to two dimensions: segments and aspects. |
| Outcome: | The proposed framework decomposes the overall objective into multi-segment and multi-aspect objectives. |
Copied to clipboard
| Challenge: | Existing methods for detecting factual errors in text summarization are inadequate for the task. |
| Approach: | They propose an end-to-end large language model framework for detecting factual errors in text summarization. |
| Outcome: | The proposed framework achieves state-of-the-art (SOTA) balanced accuracy on the AggreFact-XSUM FTSOTA, TofuEval Summary-Level, and HaluEVAL Summarization benchmarks. |
Copied to clipboard
| Challenge: | Existing prompt-based paradigms have shown their competitive performance in many NLP tasks, but their effectiveness varies upon the model and training data. |
| Approach: | They propose a dual context-guided continuous prompt tuning method that integrates contextual information into the input input. |
| Outcome: | The proposed method outperforms existing prompt tuning methods in the few-shot setting and can be used in many NLP tasks. |
Copied to clipboard
| Challenge: | Existing methods for generating complex instructions are resource-intensive and lack diversity. |
| Approach: | They propose a framework to generate complex instructions with constraints using a document-generated initial instruction and an iterative refinement framework to incorporate LLM-as-judge guidance. |
| Outcome: | The proposed framework significantly outperforms existing methods for generating complex instructions, and outperformed existing methods. |
Copied to clipboard
| Challenge: | Existing approaches to QA that only measure the relevance between the question and each paragraph are not effective. |
| Approach: | They propose a method that learns vector representations of passages and models the sufficiency and diversity within the selected set, in addition to the relevance between the question and passages. |
| Outcome: | The proposed method significantly improves the accuracy of complementary evidence selection in open-domain question answering domain. |
Copied to clipboard
| Challenge: | Recent studies have explored Continual Instruction Tuning (CIT) in Multimodal Large Language Models (MLLMs), with a primary focus on Task-incremental CIT, where MLLM are required to continuously acquire new tasks. |
| Approach: | They propose a Sparse Mixture of Expert (SMoE) based method for domain-incremental CIT in Multimodal Large Language Models (MLLMs) . they equip the SMoA module with a domain-specific autoregressive loss (DSAL) they establish a new benchmark to evaluate the efficacy of their method . |
| Outcome: | The proposed method outperforms all baselines and is based on a Sparse Mixture of Experts (SMoE) module . |
Copied to clipboard
| Challenge: | Existing studies show that multimodal large language models extract visual features from the final layers of a pretrained Vision Transformer. |
| Approach: | They propose a feature fusion method that strategically incorporates shallower layers . they propose MLLMs that extract visual features from the final layers of a pretrained Vision Transformer . |
| Outcome: | The proposed method outperforms deep layers on fine-grained visual tasks . it is the first comprehensive study of visual layer selection for MLLMs . |
Copied to clipboard
| Challenge: | Existing approaches to verify agent behaviors in complex environments rely on rule-based verifiers or LLM-as-a-Judge models. |
| Approach: | They propose a benchmark to evaluate Agent-as-a-Judge across three domains . the benchmark covers search, data systems, and graphical user interfaces - with 155 tasks and 516 trajectories . |
| Outcome: | The proposed benchmark outperforms existing benchmarks in search, data systems, and GUI domains while revealing open challenges in agent-based verification. |
Copied to clipboard
| Challenge: | Existing sparsification methods like pruning can lose model knowledge through parameter removal. |
| Approach: | They propose a novel approach that achieves sparsification by partitioning pre-trained FFN layers into computational blocks. |
| Outcome: | The proposed approach achieves superior performance across language modeling and downstream tasks under equivalent computational constraints. |
Copied to clipboard
| Challenge: | Existing code generation models model abstract syntax tree (AST) but not suitable for all multi-branch nodes. |
| Approach: | They propose to equip a Seq2Tree model with a branch selector to determine optimal expansion orders for multi-branch nodes. |
| Outcome: | The proposed model can determine optimal expansion orders of branches for multi-branch nodes. |
Copied to clipboard
| Challenge: | Existing approaches to obtain high-quality instruction-following data rely heavily on existing documents and existing methods. |
| Approach: | They propose a data synthesis framework, DecIF, which automatically generates accurate and diverse instruction-following data from scratch for supervised fine-tuning and reinforcement learning. |
| Outcome: | Extensive experiments show that the proposed framework can synthesize accurate instruction-following data for both SFT and RL paradigms compared to baselines. |
Copied to clipboard
| Challenge: | Existing generative language models neglect an inherent challenge in text corpus during training, i.e., the imbalance between frequent tokens and infrequent ones. |
| Approach: | They propose a function to mitigate the imbalance between frequent and infrequent tokens . authors propose 'MiLe Loss' function to assess learning difficulty of tokens during training . |
| Outcome: | Experiments show that models with proposed model can improve on downstream benchmarks. |
Copied to clipboard
| Challenge: | Current frontier models sometimes generate false outputs or answers that are not substantiated by evidence. |
| Approach: | They propose Chinese SimpleQA, a Chinese benchmark to evaluate LLMs' factuality . they focus on Chinese language over 6 major topics with 99 diverse subtopics . |
| Outcome: | The Chinese SimpleQA benchmark evaluates the factuality ability of LLMs . the questions and answers are short and easy-to-evaluate . |
Copied to clipboard
| Challenge: | Existing approaches to cross-document relation extraction (RE) focus on identifying relations between head and tail entities from single sentence or document. |
| Approach: | They propose a hierarchical relation tree-based LLM-based hierarchic classification model for cross-document relation extraction (HCRE) based on predefined relations, the model can perform hierarchically classification level by level. |
| Outcome: | The proposed model outperforms existing baselines and validates its effectiveness. |
Copied to clipboard
| Challenge: | Existing benchmarks for Continual Language Learning (CLL) are limited due to the complexity of the task and the lack of unified benchmarks. |
| Approach: | They propose a Continual Language Learning Evaluation benchmark CLLE in multilingual translation. |
| Outcome: | The proposed method is effective when compared with other strong benchmarks. |
Copied to clipboard
| Challenge: | Large Multimodal Models (LMMs) have demonstrated impressive performance on general video comprehension benchmarks, but their robustness needs to be thoroughly investigated for broader applications. |
| Approach: | They propose a temporal robustness benchmark which introduces temporal inconsistency perturbations separately at the visual and textual modalities to assess the robustness of models. |
| Outcome: | The proposed method improves the model’s robustness and reliability in temporal analysis. |
Copied to clipboard
| Challenge: | k-Nearest-Neighbor Machine Translation (kNN-MT) is a popular research paradigm in machine translation. |
| Approach: | They propose a confidence-enhanced kNN-MT model with robust training to reduce noise . they introduce NMT confidence to refine the modeling of important components of kN-MT . |
| Outcome: | The proposed model improves on four benchmark datasets and is robust to training. |
Copied to clipboard
| Challenge: | Existing question reformulation models are based on supervised question labels without considering feedback information from answers. |
| Approach: | They propose a question reformulation model that integrates conversational history information with reinforcement learning. |
| Outcome: | The proposed model is more effective in conversational machine comprehension with reinforcement learning. |
Copied to clipboard
| Challenge: | Existing methods for tuning large language models from dense to MoE face significant data requirements and require large-scale post-training. |
| Approach: | They propose an upcycling instruction tuning approach for tuning a dense pre-trained model into a MoE instruction model using genetic algorithm and parameter merging. |
| Outcome: | The proposed approach improves the performance of large language models with a small amount of seed data and improves their scaling. |