Papers by Feng Zheng
Copied to clipboard
| Challenge: | Existing studies have shown that rule-based evaluation methods are ineffective for open-ended natural language generation. |
| Approach: | They propose a pointwise generative reward model with a dedicated two-stage rollout method and unified query-based criteria that can be trained with 5.7K high-quality data. |
| Outcome: | The proposed model achieves superior performance on diverse reward model benchmarks, especially in Best-of-N scenarios, and delivers more effective improvements in downstream RL practice. |
Copied to clipboard
| Challenge: | High-quality post-training data is the primary engine driving LLM capabilities . datasets are often treated as isolated artifacts, overlooking their true developmental context . |
| Approach: | They propose a framework to reconstruct the evolutionary graph of dataset development using data lineage. |
| Outcome: | The proposed framework characterizes domain-specific structural patterns in Math-oriented datasets and general-domain corpora. |
Copied to clipboard
| Challenge: | Large Audio Language Models (LALMs) exhibit a degradation in knowledge and reasoning capabilities . empirical results show that CORD significantly bridges the audio–text performance gap . |
| Approach: | They propose a framework that performs online cross-modal self-distillation to bridge the acoustic-semantic gap between LALMs and text-based models. |
| Outcome: | The proposed framework bridges the acoustic-semantic gap between LALMs and text-based models . it employs on-policy reverse KL divergence with importance-aware weighting . |
Copied to clipboard
| Challenge: | Experimental results show that retrieval-augmented generation improves accuracy and relevance of large language models. |
| Approach: | They propose to introduce the information bottleneck theory into retrieval-augmented generation by maximizing mutual information between compression and ground output while minimizing mutual information . |
| Outcome: | The proposed approach improves accuracy and correctness of answer generation and conciseness with 2.5% compression rate. |
Copied to clipboard
| Challenge: | Existing methods to gauge model’s uncertainty through self-consistency in responses to the target query are misleading: an LLM may confidently provide an incorrect answer to a target query, yet give a confident and accurate answer to that same query when answering a knowledge-preserving perturbation of the query. |
| Approach: | They propose a method that uses multi-agent interaction to estimate black-box LLMs' uncertainty. |
| Outcome: | The proposed method outperforms existing self-consistency based methods and improves hallucination detection. |
Copied to clipboard
| Challenge: | Existing solutions for sign language production are limited due to phonological differences and data scarcity. |
| Approach: | They propose a unified framework for continuous sign language production that generates sign predictions step by step from text or speech embeddings. |
| Outcome: | The proposed model achieves competitive performance on how2sign and PHOENIX14T datasets. |
Copied to clipboard
| Challenge: | Existing frameworks that increase context window do not guarantee robust performance across long input tasks. |
| Approach: | They propose a framework that enables language models to handle extended inputs within limited context windows efficiently. |
| Outcome: | The framework improves performance on long-document question-answering and Needle-in-a-Haystack tasks. |
Copied to clipboard
| Challenge: | Existing approaches to integrate natural logic with neural networks are brittle and prone to fail in the presence of noise and uncertainty. |
| Approach: | They propose to integrate natural logic with neural networks to create differentiable models that integrate natural reasoning with subsymbolic vector representations and neural components. |
| Outcome: | The proposed model can model monotonicity-based reasoning, compared to baseline models without inductive bias. |
Copied to clipboard
| Challenge: | Existing methods to learn from unlabeled data are difficult for zero-shot text classification tasks. |
| Approach: | They propose a self-training based method to efficiently leverage unlabeled data. |
| Outcome: | The proposed method significantly outperforms existing methods in zero-shot text classification tasks on benchmarks and a real-world e-commerce dataset. |
Copied to clipboard
| Challenge: | TexSmart supports fine-grained named entity recognition (NER) Large-scale fine-granular entity types are expected to provide richer semantic information for downstream NLP applications. |
| Approach: | They introduce TexSmart, a text understanding system that supports fine-grained named entity recognition (NER) and enhanced semantic analysis functionalities. |
| Outcome: | The proposed system supports fine-grained named entity recognition (NER) and enhanced semantic analysis functions. |
Copied to clipboard
| Challenge: | Existing methods for code comments generate comments manually, but they suffer from poor scalability and high maintenance cost due to the expensive overhead of writing comment templates. |
| Approach: | They propose a method to automatically generate code comments at a function level by targeting object-oriented programming languages. |
| Outcome: | The proposed approach outperforms the state-of-the-art methods and is comparable with existing methods. |
Copied to clipboard
| Challenge: | Existing methods for table instruction tuning are limited due to limited data diversity and lack of data quality. |
| Approach: | They propose a weakness-guided data synthesis framework for table instruction tuning that explores the vast input space of table understanding tasks and then iterates through the input space. |
| Outcome: | The proposed framework boosts the average accuracy of Llama3.1-8B-instruct by 11.62% with 27K GPT-4o synthetic data and outperforms state-of-the-art data synthesis baselines which use more training data. |
Copied to clipboard
| Challenge: | Existing methods for achieving this require a limited understanding of constraints and can be hallucinating or brittle. |
| Approach: | They propose a framework that combines adversarial training dynamics with an encoder-only reward model to progressively learn and adapt to increasingly complex constraints. |
| Outcome: | Extensive experiments show that GAPO significantly outperforms existing methods like PPO, DPO, and KTO in fine-grained constraints. |
Copied to clipboard
| Challenge: | Synthetic lethality (SL) is a genetic interaction where a single gene mutation allows cell survival, but simultaneous mutations in two genes lead to cell death. |
| Approach: | They propose a prompt-based pipeline for generating natural language explanations using a dataset derived from New Bing . |
| Outcome: | The proposed pipeline improves on existing biomedical language models in terms of text quality and explainability. |
Copied to clipboard
| Challenge: | Pretrained large language models excel in a variety of natural language processing tasks . however, they pose significant security risks due to their tendency to memorize training data . |
| Approach: | They propose a method to estimate LLM memorization using dynamic, prefix-dependent soft prompts. |
| Outcome: | The proposed method can achieve maximum relative improvement of 135.3% and 39.8% over baseline compared to state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing reward models evaluate empathy from a single perspective, overlooking bidirectional interaction nature of empathy. |
| Approach: | They propose a reward model that evaluates empathy from a single perspective . they propose PERM to integrate a bystander perspective to monitor overall interaction quality . |
| Outcome: | a new reward model outperforms state-of-the-art models on an emotional intelligence benchmark and an industrial daily conversation dataset. |
Copied to clipboard
| Challenge: | Existing models focus on the textual content of the review, while spoiler detection requires putting the review into the context of facts and knowledge regarding movies. |
| Approach: | They propose a network-based spoiler detection model that takes into account external knowledge about movies and user activities on movie review platforms. |
| Outcome: | The proposed model takes into account external knowledge about movies and user activities on movie review platforms while incorporating user networks. |
Copied to clipboard
| Challenge: | Existing approaches to understanding tables rely on textual inputs and table images are difficult to access in real-world scenarios. |
| Approach: | They propose a multimodal table understanding problem where the model needs to generate correct responses to various table-related requests based on the given table image. |
| Outcome: | The proposed model outperforms open-source MLLMs on 23 benchmarks under held-in and held-out settings. |
Copied to clipboard
| Challenge: | Existing academic search engines cannot detect relevant papers where a resource is mentioned. |
| Approach: | They propose a framework to model the role and function of on-line resource citations . they construct a dataset SciRes, which includes 3,088 manually annotated resource contexts based on a multi-task framework . |
| Outcome: | The proposed model achieves the best results on both the classification task and recommendation task. |
Copied to clipboard
| Challenge: | Existing methods to improve the learning of data-scarce target domains have negative transfer due to the data distributions between source and target domain. |
| Approach: | They propose a method that uses a reinforced selector to select helpful data for transfer learning and a Wasserstein-based discriminator to maximize the distance between the selected data and target data. |
| Outcome: | The proposed method performs better on three real-world text mining tasks. |
Copied to clipboard
| Challenge: | MT-RewardTree provides a framework for constructing, evaluating, and deploying process reward models in machine translation (MT) |
| Approach: | They propose a method for automatically generating token-level preference pairs using approximate Monte Carlo Tree Search. |
| Outcome: | The proposed framework achieves state-of-the-art performance in token-level evaluation and sequence-level analysis. |
Copied to clipboard
| Challenge: | Recent advances in machine translation have focused on a single pre-trained decoder . encoder-decoder architectures have received relatively little attention in NMT . |
| Approach: | They propose a method that leverages LLMs as MT encoders and pairs them with lightweight decoders to develop universal translation models. |
| Outcome: | The proposed method matches or surpasses baselines in terms of translation quality but achieves 75% reduction in memory footprint of the KV cache. |
Copied to clipboard
| Challenge: | Existing methods to learn compact cluster representations from coarsely labeled data are noisy and degrade the quality of learning. |
| Approach: | They propose a framework that encodes semantic structures of data into the embedding space . they retrieve k-nearest neighbors of a query as positive keys to capture similarities . |
| Outcome: | The proposed framework can retrieve more accurate neighbors and outperform state-of-the-art models by a large margin. |
Copied to clipboard
| Challenge: | Recent years, Chinese Spelling Check (CSC) has been greatly improved by designing task-specific pre-training methods or introducing auxiliary tasks. |
| Approach: | They propose to decompose Chinese Spelling Check into detection, reasoning, and searching subtasks and to train a module that is compatible with existing CSC models. |
| Outcome: | The proposed module can be trained for one model and benefit other models. |
Copied to clipboard
| Challenge: | Vision-Language Models (VLMs) often prioritize linguistic fluency over visual fidelity . despite widespread adoption, VLMs often exhibit a critical failure mode: hallucination . |
| Approach: | They propose a framework for Token-level Inference-Time Alignment that steers the decoding process without updating the base model parameters. |
| Outcome: | The proposed framework improves performance on 13 benchmarks across architectures . it boosts LLaVA-1.5-7B by 8.6% on MMVet and achieves a 74.0 MMStar score . |
Copied to clipboard
| Challenge: | DialogUSR is a plug-in and domain-agnostic module that empowers multi-intent detection for chatbots . a single user query triggers inquiries on highspeed train ticket price and weather of destination. |
| Approach: | They propose a dialog utterance splitting and reformulation task that splits multi-intent user query into multiple single-intention sub-queries and recovers all coreferred and omitted information in the sub-questions. |
| Outcome: | The proposed model can be used to split multi-intent user queries into multiple sub-queries . it can be trained in two stages and perform in-depth analyses on the proposed models . |
Copied to clipboard
| Challenge: | Hierarchical Text Classification (HTC) is a challenging task which aims to extract the labels in a tree structure corresponding to a given text. |
| Approach: | They propose an explicit-agmented-generativ-e framework with distribution modification for hierarchical text classification. |
| Outcome: | The proposed framework improves on the initial distributions of tail classes and avoids misinterpreting predictions on unbalanced data. |
Copied to clipboard
| Challenge: | Existing knowledge-enhanced pretrained language models focus on entity information and ignore fine-grained relationships between entities. |
| Approach: | They propose to incorporate KG into the language learning process to obtain a KG-enhanced pretrained Language Model. |
| Outcome: | The proposed model improves on several knowledge-driven tasks, such as entity typing and relation classification, compared with the state-of-the-art knowledge-enhanced PLMs. |
Copied to clipboard
| Challenge: | Experimental results show that the combination of regular expressions and NNs improves learning effectiveness when a small number of training examples are available. |
| Approach: | They propose to combine a neural network (NN) with regular expressions (RE) to improve supervised learning for NLP by exploiting the rich expressiveness of REs at different levels within a NN. |
| Outcome: | The proposed approach significantly improves learning effectiveness when a small number of training examples are available. |
Copied to clipboard
| Challenge: | Large Language Models are increasingly used as agents that interact with external tools and data sources to solve tasks that require fresh knowledge, precise computation, or action in a real environment. |
| Approach: | They propose a framework that decomposes the MCP workflow into a six-stage communication pipeline and enables granular attribution of computational costs. |
| Outcome: | The proposed framework decomposes the MCP workflow into a six-stage communication pipeline, enabling granular attribution of computational costs. |
Copied to clipboard
| Challenge: | Recent studies have shown that the effective use of contextual information between sentences can achieve better performance in document-level machine translation. |
| Approach: | They propose a recurrent memory unit to the Transformer to support the information exchange between the sentence and previous context. |
| Outcome: | The proposed model outperforms the previous work on TED and News by 0.91 s-BLEU and 1.49 d-BLUE on average. |
Copied to clipboard
| Challenge: | Existing methods for inference use heuristics to determine which positions to unmask and which tokens to commit . MEDAL is an inference-time scaling framework that integrates Monte Carlo Tree SEarch initialization for Diffusion Language Model inference. |
| Approach: | They propose a framework that integrates Monte Carlo Tree SEarch initialization for Diffusion Language Model inference. |
| Outcome: | The proposed framework achieves 22.0% improvement over existing inference strategies across multiple benchmarks. |
Copied to clipboard
| Challenge: | Current approaches to value alignment focus on a few core values, such as helpfulness, harmlessness, and honesty. |
| Approach: | They propose to use latent causal value graphs to guide two lightweight value-steering methods . role-based prompting and sparse autoencoder (SAE) steering are also used . |
| Outcome: | Experiments on Gemma-2B-IT and Llama3-8B- IT show that the proposed methods are effective and controllable. |
Copied to clipboard
| Challenge: | Existing approaches to planning involve implicit planning or introduce explicit planners without systematically optimizing the planning stage. |
| Approach: | They propose an end-to-end RL framework that enhances the planning capabilities of deep research agents. |
| Outcome: | Experiments show that DeepPlanner improves planning quality and achieves state-of-the-art results under a lower training budget. |
Copied to clipboard
| Challenge: | Emotion-Cause Pair Extraction (ECPE) aims to identify the document’s emotion clauses and corresponding cause clauses. |
| Approach: | They propose a constrained learning framework with boundary-adjusting for Emotion-Cause Pair Extraction that summarizes prior rules and forces the model to take them into consideration in optimization. |
| Outcome: | The proposed framework achieves competitive results compared with state-of-the-art methods on unbalanced data and proves robustness on unbalancing data. |
Copied to clipboard
| Challenge: | Existing tools for building TOD systems often lack a user-friendly interface . a toolkit with advanced, easily integrable modules is needed to bridge this gap . |
| Approach: | They propose a multifaceted dialogue system toolkit that integrates diverse datasets and models with a streamlined training process and in-depth evaluation tools. |
| Outcome: | The proposed toolkit combines RL and transfer learning to support the rapid development and evaluation of robust dialogue policies. |
Copied to clipboard
| Challenge: | Existing knowledge graph construction frameworks require predefined schemas, limiting their scalability and domain coverage. |
| Approach: | They propose a framework for fully autonomous knowledge graph construction that eliminates the need for predefined schemas. |
| Outcome: | The proposed framework outperforms state-of-the-art models on multi-hop QA tasks and enhances LLM factuality. |
Copied to clipboard
| Challenge: | Existing studies on Large Vision-Language Models (LVLMs) primarily focus on real-world scenarios, leaving surreal, highly stylized, and semantically hybrid virtual-world situations significantly underexplored. |
| Approach: | They propose to use a manually annotated benchmark to evaluate LVLMs' ability to perceive and describe game character from the virtual-world. |
| Outcome: | The proposed task evaluates LVLMs’ ability to perceive and describe game character from the virtual-world. |
Copied to clipboard
| Challenge: | Existing methods for novel category discovery focus on the scenario where known and novel categories are of the same granularity. |
| Approach: | They propose a novel scenario for fine-grained category discovery under coarse-grain supervision that allows for adapting models to categories of different granularity from known ones. |
| Outcome: | The proposed model can adapt models to categories of different granularity from known ones and reduce labeling cost. |
Copied to clipboard
| Challenge: | Structural heterogeneity between knowledge graphs is an outstanding challenge for entity alignment. |
| Approach: | They propose a framework for entity alignment that uses a neighborhood matching module to combine neighborhood differences. |
| Outcome: | The proposed framework outperforms existing methods on three datasets. |
Copied to clipboard
| Challenge: | Existing pruning methods rely on spatial proximity and remove relevant relations, thereby undermining reliable spatial reasoning. |
| Approach: | They propose a scene graph pruning model that integrates fuzzy semantic relevance with spatial proximity to estimate the importance of relations. |
| Outcome: | Experiments show that CAPruner outperforms proximity-based pruning with negligible cost savings. |
Copied to clipboard
| Challenge: | In-context learning (ICL) struggles with complex reasoning due to superficial, example-level implicit imitation. |
| Approach: | They propose an automated method that shifts from surface-level examples to more guidance-oriented thought patterns. |
| Outcome: | The proposed method achieves 80.6% accuracy on MATH and 62.5% on AMC, surpassing GPT-4o’s 77.2% and 57.5% accuracy. |
Copied to clipboard
| Challenge: | Recent studies have identified a critical drawback of aligning models with human judgments and outputs that are flawed or incorrect. |
| Approach: | They evaluate a range of LLMs to examine whether CoT reasoning mitigates sycophancy . they find that reasoning masks a tendency to scophage in some cases . |
| Outcome: | The proposed model models show that CoT reasoning reduces sycophancy but masks it in some cases. |
Copied to clipboard
| Challenge: | Existing methods to identify bots rely on text or networks alone . text-graph interactions and semantic consistency are essential improvements to combat bot evolution. |
| Approach: | They propose to combine text-graph interaction and semantic Consistency to model Twitter bots' behavior based on attention weights and a text-graphic interaction module to enable information exchange across modalities in the learning process. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on two widely adopted datasets and the results are consistent with previous work. |
Copied to clipboard
| Challenge: | Existing studies attribute catastrophic forgetting to fine-tuning, and they retain pre-trained knowledge indiscriminately without identifying what knowledge is transferable. |
| Approach: | They propose a unified objective for fine-tuning to retrieve the causality back from pre-trained data and use it to mitigate negative transfer while preserving knowledge. |
| Outcome: | The proposed method outperforms state-of-the-art fine-tuning methods on commonsense QA datasets and can be implemented as a plug-in module to inflate the performance of existing QA models. |
Copied to clipboard
| Challenge: | Existing approaches to theorem proving in large language models rely on value functions and/or Monte Carlo Tree Search (MCTS), but the potential of simpler methods like Best-First Tree Search remains underexplored. |
| Approach: | They propose a scalable expert iteration framework that implements strategic data filtering at each expert iteration round, excluding problems solvable via beam search node expansion to focus on harder cases. |
| Outcome: | The proposed framework achieves a state-of-the-art score of 72.95 on the MiniF2F test set and challenges the perceived necessity of complex tree search methods. |
Copied to clipboard
| Challenge: | Existing TEC-VQA benchmarks focus on high-resource languages like English and Chinese . existing benchmarks have a "visual-textual misalignment" problem resulting in unreliable evaluation results . |
| Approach: | They propose a benchmark that expands multilingual QA pairs in non-text-centric datasets through translation to eight languages, including Standard Chinese, Korean, and six minority languages. |
| Outcome: | The proposed benchmarks are contamination-free and more challenging . they include eight languages including Chinese, Korean, and six minority languages . |
Copied to clipboard
| Challenge: | Existing federated frameworks for cross-domain sequential recommendation rely on user alignment, which increases communication costs and privacy risks. |
| Approach: | They propose a federated cross-domain sequential recommendation framework that eliminates the need for user alignment between platforms. |
| Outcome: | The proposed framework eliminates the need for user alignment between platforms. |
Copied to clipboard
| Challenge: | Existing methods for evaluation of large language models are inefficient and inefficient due to inaccuracy of standard metrics in human perception of text quality and inefficiency in sampling informative test examples. |
| Approach: | They propose a sample-efficient human evaluation method for large language models based on the principle of MAximum Discrepancy (MAD) competition. |
| Outcome: | The proposed method achieves the “golden” ranking of LLMs with a minimum set of input instructions, which in turn reveal their relative strengths and weaknesses. |
Copied to clipboard
| Challenge: | Existing methods for reconstruction of large language models overlook diversity among experts, leading to potential redundancy. |
| Approach: | They propose a pruning-based expert reconstruction method that prunes a specific LLM and retrains it on routers, experts and normalization modules. |
| Outcome: | The proposed method outperforms pruning and MoE reconstruction methods on Llama-style models with open-source training corpora. |
Copied to clipboard
| Challenge: | Existing Chinese preference datasets suffer from limited scale, restricted domain coverage, and insufficiently rigorous data validation. |
| Approach: | They propose an LLM-based data annotation pipeline with no human intervention to annotate Chinese preference datasets. |
| Outcome: | The proposed pipeline outperforms existing Chinese preference datasets on AlignBench and Chinese Reward Benchmark. |
Copied to clipboard
| Challenge: | a large-scale visionlanguage pre-training framework is limited by the scarcity of large-sized annotated vision-language data . noise-resistant data construction pipeline is needed to filter and caption web-sourced images . noisy text tokens can be a problem for fine-grained representation learning . |
| Approach: | They develop a noise-resistant data construction pipeline that leverages in-context learning capabilities of MLLMs to automatically filter and caption web-sourced images. |
| Outcome: | The proposed framework improves cross-modal alignment by masking noisy textual tokens based on the gradient-attention similarity score. |
Copied to clipboard
| Challenge: | Existing efforts focus on activation within ongoing dialogues, while overlooking a key real-world bottleneck. |
| Approach: | They propose a conversation starter generation system that generates personalized starters to guide users into conversation without explicit user intent. |
| Outcome: | The proposed system improves user active days by +1.84 and click-through rate by +94.25 and has been deployed in production. |
Copied to clipboard
| Challenge: | Mixed Boolean-Arithmetic (MBA) expressions are difficult to simplify because of interleaving bitwise and arithmical operations. |
| Approach: | They propose a method to learn and reduce MBA expressions using a string to string method . they propose to use a dataset to train the method to reduce MBA rules . |
| Outcome: | The proposed method outperforms all other tools in terms of accuracy, solving time, and performance overhead. |
Copied to clipboard
| Challenge: | Existing studies fine-tune discriminative models on specific defined intent classes, preventing them from being directly adopted to new intent domains. |
| Approach: | They propose to use a pre-trained generative intent model to detect new intents from different domains with no parameter updates. |
| Outcome: | The proposed model outperforms baselines that need further fine-tuning or domain-specific samples. |
Copied to clipboard
| Challenge: | Existing reward models concatenate contexts and responses, but they often ignore crucial segments of the context that are important for evaluating the response quality. |
| Approach: | They propose a reward model that evaluates the response quality based on a given context and assigns a rewards reward. |
| Outcome: | The proposed framework significantly improves preference modeling by increasing attention to relevant information within the context and achieves better generalizability. |
Copied to clipboard
| Challenge: | Existing approaches focus on textual data and voting records to induce political actors' stances. |
| Approach: | They propose a Political Actor Representation learning framework that leverages social context and expert knowledge to model ideological stances. |
| Outcome: | The proposed framework improves political text understanding and improves roll call vote prediction and political perspective detection. |
Copied to clipboard
| Challenge: | Existing methods to learn from unlabeled data generate noisy supervisory signals . current methods only rely on semantic similarities to generate supervisory signal . |
| Approach: | They propose a weighted DWGF framework to capture semantic similarities and structure relationships in data. |
| Outcome: | The proposed method outperforms state-of-the-art models on evaluation metrics across multiple benchmark datasets. |
Copied to clipboard
| Challenge: | Recent studies have used Large Language Models to help decision-making and planning in environments, but their capacity to acquire environmental knowledge and adapt in an open world remains uncertain. |
| Approach: | They propose an approach to spur LLMs to explore the open world, gather experiences, and learn to improve their task-solving capabilities by using a feedback-revision mechanism. |
| Outcome: | The proposed model enhances the efficiency of the LLM in exploring the open world and improves its ability to accomplish more tasks through fine-tuning with merely 1.3k instances of collected data, showing minimal training costs compared to baseline using reinforcement learning. |
Copied to clipboard
| Challenge: | Conventional topic models suffer different problems in different settings. |
| Approach: | They propose a novel way to model word-pairs named biterms in the whole corpus and a Graph Convolutional Networks (GCNs) with residual connections to extract transitive features from biterm. |
| Outcome: | The proposed model generates more coherent topics compared with previous methods. |
Copied to clipboard
| Challenge: | Entity alignment is a viable method for integrating heterogeneous knowledge among different knowledge graphs (KGs). |
| Approach: | They propose a Graph Convolutional Network-based framework for learning relation representations by embedding relation seeds into entities and incorporating relation approximation into entities to iteratively improve alignment. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on three real-world cross-lingual datasets. |
Copied to clipboard
| Challenge: | Large language models have significantly advanced Multilingual Machine Translation (MMT) yet scaling to many languages while maintaining robust performance across directions remains challenging. |
| Approach: | They propose a strategy to reduce the number of translations in one direction . they propose auxiliary parallel sentences to promote cross-lingual transfer . |
| Outcome: | The proposed model performs on par with or better than substantially larger baselines. |
Copied to clipboard
| Challenge: | Special attention is paid to the cross-modal misalignment in text-image datasets which may mislead the learning. |
| Approach: | They propose a multimodal back-translation method which uses diffusion-based generative models for pseudo-paralleled pairs and a divergence estimator to construct a high-resource corpora as a bridge for low-ressource learners. |
| Outcome: | The proposed method outperforms 14 state-of-the-art methods in both entity and relation extraction tasks. |
Copied to clipboard
| Challenge: | Recent studies on fine-grained intent detection have focused on collecting large-scale and high-quality samples via crowdsourcing resulting in data scarcity. |
| Approach: | They propose an iterative differential generation framework with contrastive feedback to generate high-quality pseudo samples and accurately capture the crucial nuances in target class distribution. |
| Outcome: | The proposed framework generates high-quality pseudo samples and captures crucial nuances in target class distribution. |
Copied to clipboard
| Challenge: | Existing methods for converting visual tokens into tokens are limited by their high volume . et al., 2023; Zheng e.t., 2023): a revolution in video understanding. |
| Approach: | They propose a language-aware dynamic token compression system that converts video clips into soft caption tokens as visual representations. |
| Outcome: | The proposed method reduces FLOPs by 49% while maintaining competitive performance. |
Copied to clipboard
| Challenge: | Current studies personalize emotion analysis by focusing on the author but neglect the impact of the intended reader on implicit emotional feedback. |
| Approach: | They propose a model which incorporates reader feedback into implicit emotion analysis (IEA) they use large language models to create reader agents to simulate reader feedback . |
| Outcome: | The proposed model outperforms state-of-the-art models in a text-centric environment. |
Copied to clipboard
| Challenge: | Existing studies have shown the effectiveness of sequence-to-sequence (Seq2Seque) on mathematics solving. |
| Approach: | They propose a graph-to-sequence neural network which can learn hierarchical information of graphs inputs to solve mathematical problems and speculate answers. |
| Outcome: | The proposed neural network outperforms other neural networks in hidden information learning and mathematics resolving. |
Copied to clipboard
| Challenge: | examining the behaviors of Large Language Models as artificial social actors is underexplored, especially in unverifiable scenarios where conventional benchmarking has little to help improve their abilities. |
| Approach: | They propose a method to collect, compare, and reason about human and LLMs' decisions in an unverifiable scenario and use it to examine their behaviors. |
| Outcome: | The proposed method compared human and LLM decisions in an unverifiable scenario on GitHub and found that proprietary LLMs behave more like humans than open-source LLM systems. |
Copied to clipboard
| Challenge: | Customized black-box prompt tuning is a new approach to customize large language models . however, as models grow, the resources required for training and deployment become increasingly expensive . |
| Approach: | They propose a framework that facilitates efficient local customization while preserving bidirectional privacy. |
| Outcome: | The proposed framework facilitates efficient local customization while preserving bidirectional privacy. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have shown their potential to deliver human-like judgments. |
| Approach: | They propose a systematic LLM-based multi-agent framework for advanced LLM as-a-judge MT evaluation that integrates dimension-specific results into a final evaluation judgment. |
| Outcome: | The proposed framework outperforms existing LLM-as-a-judge methods and competes with state-of-the-art automatic metrics even when powered by a suboptimal model like GPT-4o mini. |
Copied to clipboard
| Challenge: | Existing studies evaluate the tool utilization ability of large language models based on the final output or only consider the single-step tool calling. |
| Approach: | They propose a new approach to evaluate the tool utilization capability of large language models (LLMs) they decompose the tool usage into multiple sub-processes, including instruction following, planning, reasoning, retrieval, understanding, and review. |
| Outcome: | The proposed model exhibits consistency with the outcome-oriented evaluation and provides a more fine-grained analysis of the capabilities of LLMs. |