Papers by Ning Wang
Copied to clipboard
| Challenge: | Text embedding models are used for various natural language processing tasks such as sentiment analysis, text clustering, and content-based information retrieval. |
| Approach: | They propose a synthesis framework that leverages large language models to generate diverse negative samples with varying levels of similarity with the query. |
| Outcome: | The proposed framework achieves state-of-the-art performance surpassing existing synthesis strategies with synthetic data and when combined with public retrieval datasets. |
Copied to clipboard
| Challenge: | Existing methods for temporal knowledge Graphs neglect internal structural interactions between subgraphs and ignore potential smooth features that do not lead to semantic changes. |
| Approach: | They propose to use a disentangled multi-span evolutionary network to capture local neighbor features while perceiving historical neighbor semantic information. |
| Outcome: | Extensive experiments show that the proposed model outperforms the state-of-the-art in TKG reasoning by 22.7%. |
Copied to clipboard
| Challenge: | Recent studies suggest that pre-trained language models have gained rich knowledge during pre-training. |
| Approach: | They propose to tune pre-trained language models with task-specific prompts to improve and stabilize prompttuning. |
| Outcome: | Extensive experiments on zero and few-shot text classification tasks show that prompt-tuning improves and stabilizes prompttun-ing. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained large language models in a parameter-efficient manner are gaining traction within the research community. |
| Approach: | They propose a method of low-rank adaptation that enables dynamic adjustments to the intrinsic rank during the adaptation process. |
| Outcome: | The proposed approach outperforms the current method with a fixed and unalterable intrinsic rank and a low-rank adaptation process. |
Copied to clipboard
| Challenge: | Prior work has shown that safety behaviors are governed by low-rank structures . Low-Rank Adaptation (LoRA) consistently underperforms full fine-tuning and reinforcement learning on safety benchmarks . |
| Approach: | They propose a safety alignment system that disentangles safety-relevant directions into monosemantic features and constructs an interpretable safety subspace from SAE directions. |
| Outcome: | Empirically, the proposed model achieves 99.6% safety rates across multiple model families and scales . low-rank Adaptation consistently underperforms full fine-tuning and reinforcement learning on safety benchmarks compared with previous methods . |
Copied to clipboard
| Challenge: | Existing pipelines for relational triple extraction are underutilizing regional information of triple. |
| Approach: | They propose a one-stage Object Detection framework for Relational Triple Extraction . framework uses vertices-based bounding box detection and global relational triple region detection . |
| Outcome: | The proposed framework could extract all types of triples on two widely used datasets. |
Copied to clipboard
| Challenge: | Pre-trained language models are vulnerable to simple perturbations, causing poor robustness . recent studies show that adversarial training is useless or harmful for the model to detect these semantic changes. |
| Approach: | They propose to use adversarial training to improve the robustness of pre-trained models . they propose to construct negative examples with similar and opposite semantics . |
| Outcome: | Empirical results show that the proposed approach improves on sentiment analysis, reasoning, and reading comprehension tasks. |
Copied to clipboard
| Challenge: | Existing methods for sparse attention apply the same pattern across different attention heads and inputs, but fail to capture the intrinsic attention clustering in large language models. |
| Approach: | They propose a training-free sparse attention method that provides an efficient prompt cache compression scheme under intrinsic attention clustering for efficient LLM inference. |
| Outcome: | The proposed method reduces memory usage by 10%–65% and increases throughput by 2.6–4.8 times with no accuracy loss. |
Copied to clipboard
| Challenge: | Existing methods for solving math word problem (MWP) use shortcut learning to train solvers based on samples with a single question. |
| Approach: | They propose to generate diverse yet consistent questions from a common scenario . they then feed the equations to a question generator to obtain the diverse questions . their method leads to performance improvement on the current benchmark Math23K . |
| Outcome: | The proposed method generates diverse yet consistent questions with a variety of equations and questions . it improves on the current benchmark, which is based on the proposed method . |
Copied to clipboard
| Challenge: | Existing QA research on question answering is focused on specific question types, knowledge domains, or reasoning skills. |
| Approach: | They propose a unified QA paradigm that solves various tasks through a single model. |
| Outcome: | The proposed model improves QA-centric ability on 11 QA benchmarks. |
Copied to clipboard
| Challenge: | Current approaches to temporal knowledge representation face limited generalization to unseen facts and insufficient interpretability of reasoning processes. |
| Approach: | They propose a framework that uses a denoising diffusion process to complete reasoning tasks . they propose introducing a noise source and historical conditionguiding mechanism to improve interpretability . |
| Outcome: | The proposed framework outperforms state-of-the-art methods on three benchmark datasets. |
Copied to clipboard
| Challenge: | Procedural Multimodal Documents organize textual instructions and corresponding images step by step. |
| Approach: | They propose a novel temporal-modal entity Graph for comprehending PMDs . they propose encoding and reasoning modules to capture textual and visual entities . |
| Outcome: | The proposed model can capture textual and visual entities and trace their temporal-modal evolution. |
Copied to clipboard
| Challenge: | Large-scale language models (LLMs) are increasingly exposed to private data and are becoming more and more prevalent. |
| Approach: | They propose a collaborative generation framework that integrates large and small language models to address privacy concerns logically. |
| Outcome: | The proposed framework combines large and small models to address privacy concerns logically. |
Copied to clipboard
| Challenge: | Existing models with statistical bias are prone to memorized correlations . large pre-trained models such as BERT have revolutionized the model development paradigm in natural language processing . |
| Approach: | They propose a framework to tackle the problem from a causal perspective using a latent space interpolation approach. |
| Outcome: | Extensive experiments show that CAT achieves substantial performance improvement over SOTA across different downstream tasks, including sentence classification, natural language inference and question answering. |
Copied to clipboard
| Challenge: | Existing unified information extraction approaches face challenges such as noise interference, abstract label semantics, and diverse span granularity. |
| Approach: | They propose a general Collaborative Information Extraction framework to address these challenges in universal information extraction tasks. |
| Outcome: | The proposed framework is based on a general Recognizer and task-specific Experts for recognizing predefined types and extracting spans respectively. |
Copied to clipboard
| Challenge: | Existing methods for fewshot learning use embeddings in space, but they lack expressivity and are difficult to perform statistically. |
| Approach: | They propose a method where class information is represented by hyperspheres with dynamic sizes with two sets of learnable parameters: the hypersphere’s center and the radius. |
| Outcome: | The proposed method is much more expressive than embeddings and performs better than statistical modeling. |
Copied to clipboard
| Challenge: | Existing WebAgents suffer from computational cost attacks due to long reasoning processes and excessive computational cost. |
| Approach: | They propose a framework that generates adversarial prompts and a reinforcement learning-enhanced selector to identify the most effective perturbations. |
| Outcome: | The proposed framework exploits large language models to generate diverse adversarial prompts and a reinforcement learning–enhanced selector to identify the most effective perturbations. |
Copied to clipboard
| Challenge: | Existing methods, such as a n-terminal coding, do not provide accurate data for large language models. |
| Approach: | They propose a lightweight framework that leverages attention distributions and uncertainty signals in a single-pass decoding. |
| Outcome: | Experiments on open-book QA datasets show that DAGCD improves faithfulness and robustness while preserving computational efficiency. |
Copied to clipboard
| Challenge: | Existing approaches to optimize pre-trained language models are expensive and slow to scale. |
| Approach: | They propose to search for instance-level lottery prompts and generalize them to unseen data . they validate the assumption that for every instance, there is almost always a lottery prompt that induces the correct prediction from the PLM . |
| Outcome: | The proposed method can achieve comparable results with other gradient-free and optimization-free baselines. |
Copied to clipboard
| Challenge: | Existing MKGC methods train with all modalities available, implicitly assuming consistent complementarity . however, this often induces modality dependence and modality competition under heterogeneous noise, which can hinder robust multi-modal fusion and limit overall performance. |
| Approach: | They propose a framework to infer missing links in multimodal knowledge graphs by leveraging structured triples together with auxiliary modalities such as text and images. |
| Outcome: | The proposed framework outperforms baselines and achieves new state-of-the-art results. |
Copied to clipboard
| Challenge: | Existing approaches to few-shot named entity recognition (NER) focus on coarse-grained entities with few examples, while most unseen entities are fine-grounded. |
| Approach: | They present a human-annotated few-shot named entity recognition dataset . they construct benchmark tasks to assess the generalization capability of models . |
| Outcome: | The proposed model is the first few-shot NER dataset and the largest human-crafted NER data set. |
Copied to clipboard
| Challenge: | Existing approaches to align LLMs with diverse human values rely on ground-truth scores . existing approaches implicitly approximate an average-user preference, thereby failing to capture heterogeneity of human values or accommodate conflicting user needs. |
| Approach: | They propose a framework that transforms passive reward dependency into an intrinsic adaptive sensing capability. |
| Outcome: | The proposed framework outperforms state-of-the-art models in multiple model scales and improves preference alignment. |
Copied to clipboard
| Challenge: | SpeechMatrix is a large-scale multilingual corpus of speech-to-speech translations mined from real speech of European Parliament recordings. |
| Approach: | They present a large-scale multilingual corpus of speech-to-speech translations mined from real speech of European Parliament recordings. |
| Outcome: | The proposed model can train bilingual models on 136 language pairs with 418 thousand hours of speech. |
Copied to clipboard
| Challenge: | Large Language Models have demonstrated remarkable capabilities in open-domain dialogues, but their performance in service dialogues remains suboptimal. |
| Approach: | They propose a framework that enables agents to learn effective strategies without large-scale human annotations. |
| Outcome: | The proposed framework decouples user modeling into two components that provide adaptive training scenarios rather than acting as an unfair adversary. |
Copied to clipboard
| Challenge: | Existing block-granularity sparsification can reduce latency, but coarse blocks impose an intrinsic sparsity ceiling. |
| Approach: | They propose a method that performs early stopping for sparse attention via online permutation. |
| Outcome: | The proposed approach reduces the complexity of the model and its performance. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) based on Mixture-of-Experts (MoE) enforce uniform expert sizes, creating a rigidity that fails to align computational costs with varying token-level complexity. |
| Approach: | They propose a mixture of heterogeneous grouped experts (MoHGE) that allows for flexible, resource-aware expert combinations. |
| Outcome: | The proposed model matches the performance of existing Mixture-of-Experts architectures while maintaining balanced GPU utilization. |
Copied to clipboard
| Challenge: | LongLeader aims to assess different LLMs' long-context comprehension abilities . long-constext comprehension is a key bottleneck for many use cases . |
| Approach: | They propose a leaderboard to assess different LLMs' long-context comprehension abilities . they offer open-source access to the benchmarks and maintain a dedicated website . |
| Outcome: | The proposed model assesses different LLMs on selected benchmarks and provides open-source access to the benchmarks. |
Copied to clipboard
| Challenge: | Existing monotonic scaling methods for large reasoning models are not reliable. |
| Approach: | They propose a universal framework for modulating reasoning progress in large reasoning models at test time. |
| Outcome: | The proposed framework unifies and generalizes existing monotonic scaling methods and enables flexible and dense slow-to-fast reasoning modulation. |
Copied to clipboard
| Challenge: | Recent advances in video-text retrieval models have limited training data annotations. |
| Approach: | They propose a Video-Text Retrieval Paradigm with Relevance-based Augmentation which enhances video and text data using large foundation models to learn more generalized features. |
| Outcome: | The proposed method improves video-text retrieval performance over existing methods. |
Copied to clipboard
| Challenge: | Existing reasoning-augmented systems that handle complex queries are lacking . we present a framework that enhances LLM-based recommendation assistants . |
| Approach: | They propose a reinforcement fine-tuning framework that enhances LLM-based recommendation . they use a dual-graph Enhanced Reward Shaping framework to integrate recommendation metrics . |
| Outcome: | The proposed framework outperforms state-of-the-art recommendations and preserves core abilities. |
Copied to clipboard
| Challenge: | Existing methods for multimodal sensing ignore significant sentiment distribution imbalances and cross-modal sentiment conflicts, hindering performance improvement. |
| Approach: | They propose a method to learn stable multimodal invariant sentiment representations by incorporating distributional discrepancies and sentiment conflicts into the model training. |
| Outcome: | The proposed method improves MSA performance and achieves new state-of-the-art. |
Copied to clipboard
| Challenge: | Event Extraction (EE) is widely used in the Chinese financial field to provide valuable structured information. |
| Approach: | They propose a task which extracts financial events from raw texts and an efficient method called MACK. |
| Outcome: | The proposed method is fault-tolerant and can visualize interactions among text components. |
Copied to clipboard
| Challenge: | Traditional recommender systems focus on the user-platform paradigm, where users are directly exposed under the control of the platform's recommendation algorithms. |
| Approach: | They propose a user-agent-platform paradigm where agent serves as the protective shield between user and recommender system that enables indirect exposure. |
| Outcome: | The proposed model improves 16.6% over baselines on four datasets and mitigates echo chamber effects and reduces model bias in disadvantaged users. |
Copied to clipboard
| Challenge: | Existing work on benchmarks containing publicly available information has been interpreted as a temporal signal for benchmark contamination. |
| Approach: | They show that LLM-transformed questions can produce remarkably different temporal patterns compared to fill-in-the-blank questions directly retrieved from the very same documents. |
| Outcome: | The proposed model can produce different temporal patterns compared to fill-in-the-blank questions retrieved from the same documents. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have revolutionized the landscape of artificial intelligence. |
| Approach: | They propose a self-guided method to identify and select cherry samples from open-source datasets, minimizing manual curation and potential cost for instruction tuning an LLM. |
| Outcome: | The proposed method enables LLMs to identify discrepancies between expected responses and intrinsic generation capability, and a marked uptick in model training efficiency. |
Copied to clipboard
| Challenge: | Experimental results show that INTERVENOR surpasses baseline models, exhibiting improvements of approximately 18% and 4.3% over GPT-3.5 in code generation and code translation tasks. |
| Approach: | They propose a system that prompts Large Language Models to play distinct roles during the code repair process, functioning as both a Code Learner and a code teacher. |
| Outcome: | The proposed system surpasses baseline models in code generation and code translation tasks and improves on syntax errors and assertion errors. |
Copied to clipboard
| Challenge: | Existing work reveals only randomly permuted activations to the client, allowing adversaries to extract model weights. |
| Approach: | They propose an attack that aligns differently shuffled activations to a common permutation and exploits them to extract model weights. |
| Outcome: | The proposed attack can align shuffled activations to a common permutation and exploit them to extract model weights with a query cost of approximately $1. |
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: | Existing datasets only cover limited relation types at once, which prevents models from taking full advantage of relation interactions. |
| Approach: | They construct a large-scale human-annotated ERE dataset with improved annotation schemes to address these drawbacks. |
| Outcome: | The proposed dataset is larger than existing datasets of all the ERE tasks by at least an order of magnitude. |
Copied to clipboard
| Challenge: | Text embedding requires a highly efficient method for training domain-specific models on limited corpora. |
| Approach: | They propose a model that combines a denoising variational autoencoder with a target-specific discriminator to generate synonymous sentences that closely resemble human language. |
| Outcome: | The proposed model surpasses ConSERT by 2.8 points in small-dataset training on STS benchmarks. |
Copied to clipboard
| Challenge: | Experimental results show that MAViS achieves state-of-the-art performance in assistive capability, visual quality, and video expressiveness. |
| Approach: | They propose an end-to-end multi-agent collaborative framework for long-sequence video storytelling that orchestrates specialized agents across multiple stages. |
| Outcome: | The proposed framework achieves state-of-the-art performance in assistive capability, visual quality, and video expressiveness. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are too large to be fine-tuned with budget constraints and some are only accessible via APIs. |
| Approach: | They propose a pluggable Reward-Driven Contextual Adapter that integrates large language models as generators and trains them to refine the retrieved information. |
| Outcome: | The proposed method improves ReQA performance on three datasets by up to 20% compared to existing methods. |
Copied to clipboard
| Challenge: | Language Models (LMs) are increasingly challenging the dominance of domain-specific models, such as Graph Neural Networks (GNNs) and Graph Transformers (GTs). |
| Approach: | They propose a novel approach that empowers off-the-shelf LMs to achieve performance comparable to state-of-the art (SOTA) GNNs on node classification tasks without requiring any architectural modifications. |
| Outcome: | The proposed approach outperforms existing GNNs on node classification tasks and is open-source upon publication. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained models are limited due to suboptimal activation subspaces. |
| Approach: | They propose a method that leverages tail eigenvectors of model output activations to construct low-rank adapters. |
| Outcome: | The proposed method outperforms existing methods across 16 benchmarks and surpasses full fine-tuning in certain scenarios. |
Copied to clipboard
| Challenge: | Multimodal large language models have demonstrated promising results in a variety of tasks that combine vision and language. |
| Approach: | They propose a benchmark to assess the ability of models to use contextual information in free-form text to enhance visual comprehension. |
| Outcome: | The proposed model fails to extract and utilize contextual information to improve understanding of images. |
Copied to clipboard
| Challenge: | Existing Learning-Based Binary Code Similarity Detection (LB-BCSD) methods exhibit lower accuracy in recognizing functions with the same functionality but different implementations. |
| Approach: | They propose a gradient-guided adversarial attack method based on critical code called FuncFooler which perturbs critical code to generate multiple variants of the same function. |
| Outcome: | The proposed method increases the accuracy of the current Learning-Based Binary Code Similarity Detection (LB-BCSD) model by 5%-7%. |
Copied to clipboard
| Challenge: | Existing models lack multimodal understanding capabilities, resulting in closed-source model that does not support multimodal interleaved sequences. |
| Approach: | They propose a foundation model built on multimodal tokens capable of understanding and generating speech, text, images, and videos in an end-to-end, autoregressive manner. |
| Outcome: | The proposed model is able to understand speech, text, images, and videos in an end-to-end, autoregressive manner. |
Copied to clipboard
| Challenge: | Existing multimodal emotion and intent recognition tasks focus on classification, not rationale and intrinsic connections between these states. |
| Approach: | They propose a task that requires models to jointly predict emotion and intent while generating natural language explanations for why they co-occur. |
| Outcome: | The proposed model outperforms baseline models in prediction and explanation generation. |
Copied to clipboard
| Challenge: | General-purpose language models (LMs) are aligned to diverse user intents, but fall short when it comes to specific applications. |
| Approach: | They propose a framework that uses constraints to automatically produce supervision signals for user alignment with constraints. |
| Outcome: | The proposed framework can produce supervision signals for user alignment with constraints. |
Copied to clipboard
| Challenge: | Earlier studies of instruction tuning on Large Language Models focus on creating large, varied, and high-quality datasets with responses curated by human experts. |
| Approach: | They propose to use a smaller and weaker model to fine tune a larger and stronger model . they find it can largely speed up the data filtering and improve performance . |
| Outcome: | The proposed model can filter instruction data faster and better on benchmarks. |
Copied to clipboard
| Challenge: | autoregressive inference requires repeated computation across transformer layers. |
| Approach: | They propose a hybrid compression framework built on both quantization and eviction . they propose varying importance metric and flexible conversion policies to reduce memory overhead . |
| Outcome: | The proposed framework outperforms state-of-the-art methods under memory constraints. |
Copied to clipboard
| Challenge: | Prior work on multimodal fashion tasks has been limited by the data in individual benchmarks or has leveraged generic vision-and-language pre-training but have not taken advantage of the characteristics of fashion data. |
| Approach: | They propose a fashion-specific pre-training framework based on weakly-supervised triplets constructed from fashion image-text pairs. |
| Outcome: | The proposed framework is based on weakly-supervised triplets constructed from fashion image-text pairs and is competitive on a diverse set of fashion tasks. |
Copied to clipboard
| Challenge: | Long-form question answering requires two procedures: information retrieval and information synthesis. |
| Approach: | They propose a Chinese long-form question answering dataset called WebCPM . the dataset is based on a web search interface that engages with a search engine in real time . |
| Outcome: | The proposed dataset generates answers that are no worse than human-written ones . the dataset is the first Chinese LFQA dataset . |
Copied to clipboard
| Challenge: | Existing studies focus on internal features of Chinese named entity recognition, but neglect other lingual modalities. |
| Approach: | They propose a bilingual enhancement module for Chinese Named Entity Recognition . they integrate rich English information into Chinese representation and use it to learn the interaction between bilinguals and dependent information within Chinese. |
| Outcome: | The proposed model can learn the interaction of bilinguals and dependent information within Chinese. |
Copied to clipboard
| Challenge: | Existing studies focus on optimizing model structures to handle uncertain missingness, but models still face challenges when dealing with uncertain missing data. |
| Approach: | They propose a data-centric robust multimodal sentiment analysis method, Proxy-Driven Robust Multimodal Fusion, which maps unimodal data to the latent space of Gaussian distributions to capture core features and structure. |
| Outcome: | The proposed method outperforms existing models in noise resistance and achieves state-of-the-art performance on multiple benchmark datasets. |
Copied to clipboard
| Challenge: | Existing benchmarks for semantic textual similarity (STS) use averaged human ratings as gold standard. |
| Approach: | They propose to use a Chinese sentence-to-sentence dataset to study collective human opinions in semantic textual similarity (STS) neither a scalar nor a single Gaussian fits a set of observed judgments adequately, they argue . |
| Outcome: | The proposed dataset does not capture disagreements on individual instances, but rather the confidence over the aggregate dataset. |
Copied to clipboard
| Challenge: | a cloud-based smart compose system is designed to improve human-to-human conversation efficiency. |
| Approach: | They propose a cloud-based smart compose system to improve conversation efficiency . they propose heuristics to achieve the best trade-off between quality and latency . |
| Outcome: | The proposed system reduces latency without losing composing quality further. |
Copied to clipboard
| Challenge: | Inference of LLMs incurs high computational costs, memory access overhead, and memory usage, leading to inefficiencies in terms of latency, throughput, power consumption, and storage. |
| Approach: | This tutorial introduces the basics of efficient inference for LLMs and explains how to diagnose efficiency bottlenecks for a given workload on specific hardware. |
| Outcome: | The tutorial introduces the basic concepts of modern LLMs, software and hardware. |
Copied to clipboard
| Challenge: | Existing methods for visual information-seeking tasks rely on textual knowledge . existing methods can impair information retrieval and confuse MLLMs . |
| Approach: | They propose a framework which leverages a multimodal knowledge base to address these limitations. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on the InfoSeek and E-VQA benchmarks. |
Copied to clipboard
| Challenge: | Extensive experiments on fine-grained entity typing under fully supervised, few-shot, and zero-shot settings show the effectiveness of prompt-learning. |
| Approach: | They propose a prompt-learning pipeline that stimulates versatile knowledge of pre-trained language models (PLMs) by constructing entity-oriented verbalizers and templates and conducting masked language modeling. |
| Outcome: | The proposed approach can be applied to fine-grained entity typing in fully supervised, few-shot, and zero-shot scenarios. |
Copied to clipboard
| Challenge: | Existing safety defenses typically intervene internally within the generative model, but suffer from severe concept entanglement, leading to degradation of benign generation quality. |
| Approach: | They propose a structurally isolated safety module that performs external, interpretable rectification without modifying the base model. |
| Outcome: | The proposed module performs external, interpretable rectification without modifying the base model. |
Copied to clipboard
| Challenge: | Existing methods assume a direct alignment between images and aspects, matching the entire image with a corresponding aspect. Existing algorithms assume 'direct alignment' between images, introducing noise. |
| Approach: | They propose a Dual-Aware Enhanced Alignment Network (DaNet) that can enhance fine-grained multimodal aspect-image alignment and denoising. |
| Outcome: | The proposed system outperforms existing methods in three subtasks and is available on https://github.com/***/DaNet. |
Copied to clipboard
| Challenge: | Recent advances in slow-thinking reasoning models have shown exceptional performance in complex reasoning tasks. |
| Approach: | They propose a framework that enables models to automatically adjust Chain-of-Thought (CoT) length based on problem difficulty. |
| Outcome: | The proposed framework penalizes inefficiency on simple problems while incentivizing deep reasoning for complex ones. |
Copied to clipboard
| Challenge: | Recent studies have demonstrated that many layers are functionally redundant in large language models (LLMs), enabling model compression by removing these layers to reduce inference cost. |
| Approach: | They propose a framework that removes redundant layers to reduce inference cost by preserving sensitivity-aware singular values. |
| Outcome: | The proposed framework outperforms existing methods in 90% of the original model under a 20% compression ratio. |
Copied to clipboard
| Challenge: | Open-source large language models (LLMs) have gained strength across diverse fields, but the majority of studies focus on English. |
| Approach: | They propose a knowledge-grounded data augmentation approach to elicit more language-specific knowledge of LLMs by enhancing their ability to serve users from different countries. |
| Outcome: | The proposed method can prune the language-agnostic supervised fine-tuning dataset without any performance degradation. |
Copied to clipboard
| Challenge: | CCTA reports provide an assessment of coronary disease severity to guide patient management. |
| Approach: | They propose a pipeline that decouples structuring from classification by an LLM-based parser . CCTA-RADS is the largest publicly available dataset of CCDA reports . |
| Outcome: | The proposed approach improves the F1-score by 6%-13% compared with direct methods. |
Copied to clipboard
| Challenge: | Existing methods for predicting future facts from time-evolving graphs rely on statistical co-occurrences and extensive path enumeration. |
| Approach: | They propose a Critic-Guided Rule Induction method which treats temporal rules as rule hypotheses to be examined and adopts a decoupled Generation-Discrimination pipeline to induce rules that are high-coverage and high-precision. |
| Outcome: | The proposed method outperforms strong baselines on three benchmarks and achieves state-of-the-art performance. |
Copied to clipboard
| Challenge: | Logic-Induced-Knowledge-Search (LINK) is a framework for generating factually-correct yet long-tail inferential knowledge. |
| Approach: | They introduce a framework to obtain factually-correct yet long-tail inferential statements using variable-wise prompting grounded on symbolic rules. |
| Outcome: | The proposed framework is able to obtain factually-correct yet long-tail inferential statements while ensuring factual correctness. |
Copied to clipboard
| Challenge: | Hierarchical Multilevel Contrastive Learning (HMCL) improves text representation for general large language models. |
| Approach: | a new contrastive learning framework is developed to improve general large language models . HMCL integrates 3-level semantic differentiation and unifies contrastive and pair classification into a strategy . |
| Outcome: | HMCL outperforms unsupervised methods and supervised fine-tuning approaches in multi-domain and multilingual benchmarks. |
Copied to clipboard
| Challenge: | Fully supervised neural approaches have achieved significant progress in the task of Chinese word segmentation (CWS) however, they suffer from the cross-domain issue when they come to processing of out-of-domain data. |
| Approach: | They propose to use Chinese word as a target domain for distant annotation and adversarial training to reduce noise and maximize utilization of the source domain information. |
| Outcome: | The proposed method outperforms existing state-of-the-art methods on real-world datasets and significantly outperformed previous state- of-the art methods. |
Copied to clipboard
| Challenge: | Synthesizing tool-use data through real-world simulations is effective for enhancing large language models (LLMs) however, training gains decay as synthetic data increases, and the model struggles to benefit from more synthetic data. |
| Approach: | They propose an iterative reinforced fine-tuning strategy to improve LLMs with external tools to augment their capabilities. |
| Outcome: | The proposed method achieves 13.11% better performance than the same-size base model and outperforms larger open-source and closed-source models. |
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: | Instruction Following (IF) is a core capability of LLMs, requiring strict adherence to diverse constraints. |
| Approach: | They propose a framework that uses tiny language models to evaluate instruction following . they propose to use a set of specialized tiny language model to provide rewards for soft constraints. |
| Outcome: | The proposed framework outperforms baseline models by 12% and speeds up training time by 3. |
Copied to clipboard
| Challenge: | Existing methods to pre-train speech and text use unlabeled data to learn universal feature representations. |
| Approach: | They propose a method to jointly pre-train speech and text in an encoder-decoder modeling framework for speech translation and recognition. |
| Outcome: | The proposed method achieves between 1.7 and 2.3 BLEU improvement above the state of the art on the MuST-C speech translation dataset and comparable WERs to wav2vec 2.0 on the Librispeech speech recognition task. |