Papers by Feng Yan
Copied to clipboard
| Challenge: | Existing methods for large reasoning models have improved efficiency but still face limitations such as conflicting objectives and limited adaptability. |
| Approach: | They propose an adaptive reasoning framework that applies a uniform, computation-intensive deep reasoning strategy to all problems. |
| Outcome: | The proposed framework reduces the average response length of DeepSeek-R1-Distill-Qwen-7B by 54.9% while improving accuracy by up to 4.8% on five mathematical datasets. |
Copied to clipboard
| Challenge: | LLaMA-Omni 2 is a series of speech language models (SpeechLMs) based on large language models. |
| Approach: | They introduce a series of speech language models capable of real-time speech interaction . LLaMA-Omni 2 trains on 200K multi-turn speech dialogue samples . |
| Outcome: | The proposed speech language models surpass state-of-the-art models on spoken question answering and speech instruction. |
Copied to clipboard
| Challenge: | Existing subgraph-based models focus on predicting missing relations in knowledge graphs . a new meta-learning model extracts concepts from entities to construct commonsense subgraphs based on semantic information . |
| Approach: | They propose a commonsense subgraph meta-learning model that extracts concepts from entities to construct commonsensible subgraphs. |
| Outcome: | The proposed model outperforms existing models in inductive reasoning tasks and in few-shot scenarios. |
Copied to clipboard
| Challenge: | Existing methods to train retrieval-based dialogue systems rely on crowd-sourced data . however, it is difficult to collect large-scale dialogues that are grounded on background knowledge . |
| Approach: | They propose to decompose training of knowledge-grounded response selection into three tasks . they propose to combine query-passage matching task with query-dialogue history matching task . |
| Outcome: | Experimental results show that the proposed model can perform comparable to existing methods . the retrieval-based system can leverage background knowledge when conversing with humans . |
Copied to clipboard
| Challenge: | General-purpose Large Language Models (LLMs) like GPT-4 have exhibited strong translation abilities. |
| Approach: | They propose to use a model-agnostic model to refine the performance of general-purpose large-language models for machine translation (MT) by utilizing Gemma-2B/7B as the backbone. |
| Outcome: | The proposed model-agnostic and cost-effective tool improves the performance of general-purpose large-language models for machine translation (MT) by integrating it with any general-use LLM. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have achieved impressive results in Machine Translation (MT). human evaluations reveal that LLM-generated translations still contain various errors. |
| Approach: | They propose a LLM-based self-refinement framework that feeds error information back into LLMs to facilitate self-finement, leading to enhanced translation quality. |
| Outcome: | The proposed framework outperforms internal refinement and feedback methods while ensuring a robust translation quality baseline. |
Copied to clipboard
| Challenge: | Existing methods for large language models (LLMs) use one agent to iterate and execute tools, but they suffer from performance degradation when addressing practical tasks. |
| Approach: | They propose a tool learning framework that coordinates three specialized agents for tool selection, tool execution, and action calibration separately. |
| Outcome: | The proposed framework outperforms baseline models on three datasets with 14% higher success rate. |
Copied to clipboard
| Challenge: | Existing direct speech-to-speech translation models require text supervision during training, which is not feasible for numerous unwritten languages. |
| Approach: | They propose a non-autoregressive (NAR) model that generates discrete units from the source speech and employs a unit-based vocoder to synthesize the target. |
| Outcome: | The proposed model achieves translation quality comparable to the autoregressive model while preserving up to 26.81 decoding speedup. |
Copied to clipboard
| Challenge: | Currently, large language models (LLMs) focus on the text modality, making speech modeling difficult. |
| Approach: | They propose a cross-lingual speech language model that trains on discrete speech tokens to achieve cross-modal and cross-linguistic alignment through continual pre-training. |
| Outcome: | The proposed method achieves cross-modal and cross-lingual alignment through continual pre-training. |
Copied to clipboard
| Challenge: | Existing methods for instruction selection rely on external models or rules, overlooking the intrinsic association between pre-trained model and instruction data. |
| Approach: | They propose a method that utilizes noise injection to identify the quality of instruction data without relying on external models. |
| Outcome: | The proposed method outperforms the model trained on the entire dataset and established baselines. |
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: | Existing methods for medical vision-language models overlook modality misalignment . HSCR generates high-quality preference data with higher sampling probability . |
| Approach: | They propose a hierarchical self-contrastive reward approach that addresses two challenges in alignment . they leverage the inherent capability of Med-VLMs to generate dispreferred responses . |
| Outcome: | The proposed approach improves accuracy and trustworthiness of medical vision-label models with 2,000 training entries. |
Copied to clipboard
| Challenge: | Existing methods for learning a robust matching model from noisy training data are retrieval-based or generation-based. |
| Approach: | They propose a general co-teaching framework that learns matching models from noisy training data. |
| Outcome: | The proposed learning framework can improve existing models on two public data sets. |
Copied to clipboard
| Challenge: | Existing studies on multimodal faithfulness have focused on perceptual hallucinations, raising concerns about the validity of reasoning traces. |
| Approach: | They propose a diagnostic benchmark that enforces explicit visual comparison to assess faithfulness of reasoning traces. |
| Outcome: | The proposed framework improves visual routing and aligns reasoning with perception. |
Copied to clipboard
| Challenge: | Existing work on augmenting question answering models with external knowledge (e.g., knowledge graphs) lacks transparency into the model’s prediction rationale. |
| Approach: | They propose a knowledge-aware approach that equips pre-trained language models with a multi-hop relational reasoning module that performs multi-relational reasoning over subgraphs extracted from external knowledge graphs. |
| Outcome: | The proposed model performs multi-hop, multi-relational reasoning over subgraphs extracted from external knowledge graphs. |
Copied to clipboard
| Challenge: | Existing methods to generate knowledge graph-to-text (KG-to) text rely on pre-trained language models to bridge the gap between the different structures of the input KG and the target text. |
| Approach: | They propose a method that integrates graph structure-aware modules with pre-trained language models to capture the intricate topology information present in the KG. |
| Outcome: | The proposed model captures the topology information present in the knowledge graph and distinguishes similar input KGs through contrastive learning techniques. |
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: | Recent advances in large language models have been remarkable . users face a choice between using cloud-based LLMs for generation quality or local-based ones for lower computational cost . |
| Approach: | They propose a new LLM utilization paradigm that facilitates collaborative operation . they evaluate AdaSwitch across 7 benchmarks and compare it to other LLMs . |
| Outcome: | The proposed model improves performance of local and cloud agents across 7 benchmarks . it achieves competitive results compared to the cloud agent while utilizing less computational overhead. |
Copied to clipboard
| Challenge: | Existing work on LLMs does not address their social intelligence (SI) and their discrepancy with humans. |
| Approach: | They propose a script-based bilingual SI benchmark that integrates outcome-oriented goal achievement evaluation and process-oriented interpersonal ability evaluation by manually crafting narrative scripts. |
| Outcome: | The proposed model is based on a script-based bilingual evaluation paradigm that integrates outcome- and process-oriented evaluation by manually crafting narrative scripts. |
Copied to clipboard
| Challenge: | Existing approaches to encode natural languages without orders are lacking. |
| Approach: | They conduct a comprehensive analysis of the ability of neural models to organize sentences from a bag of words under three typical scenarios. |
| Outcome: | The proposed models can reorder or reconstruct sentences from a bag of words under three typical scenarios. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have made safety issues of LLMs more prominent and critical. |
| Approach: | They propose a framework which attacks LLMs through semantic camouflage and replaces unsafe content with semantic features to conceal malicious intent . |
| Outcome: | The proposed framework outperforms existing models in over 80% of cases and is highly effective against various defenses. |
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: | Existing studies focus on constructing a matching model with sophisticated neural architectures, but do little to how to effectively learn such architectures from data. |
| Approach: | They propose to sample negative examples to automatically construct a training set for effective model learning in retrieval-based dialogue systems by using four sampling strategies. |
| Outcome: | The proposed learning method improves the performance of matching models on two benchmarks with three matching models. |
Copied to clipboard
| Challenge: | Existing LLMs' abilities to detect evidence in long contexts are far inferior to humans. |
| Approach: | They propose a benchmark to assess LLMs' abilities in evidence and multi-step commonsense reasoning within a long context. |
| Outcome: | The proposed method improves the performance of LLMs in evidence detection and commonsense reasoning. |
Copied to clipboard
| Challenge: | Large-scale reinforcement learning (RL) methods have proven effective in enhancing the reasoning abilities of large language models. |
| Approach: | They propose an open-source adaptation of the R1-Zero RL framework for machine translation (MT) their code is available at https://github.com/fzp0424/MT-R1-zero. |
| Outcome: | The proposed framework surpasses towerinstruct-7B-v0.2 on the english-chinese benchmark by 1.26 points. |
Copied to clipboard
| Challenge: | Reinforcement learning with verifiable rewards (RLVR) approaches face two challenges: the near-miss reward problem and exploration stagnation. |
| Approach: | They propose an algorithm that partitions valid reasoning chains into reasoning steps using multi-level stepwise hints. |
| Outcome: | The proposed method outperforms competing RLVR enhancement methods across six mathematical benchmarks and two out-of-domain benchmarks. |
Copied to clipboard
| Challenge: | Prior Diversify-then-Verify pipelines generate interpretations and then retrieve evidence . ambiguous queries require RAG to disambiguate into interpretations that can be answered from corpus . |
| Approach: | They propose a novel approach that unifies diversification with verification by integrating retriever relevance and generator answerability feedback early. |
| Outcome: | The proposed approach improves grounding-aware F1 by 23% over baselines across multiple LLMs. |
Copied to clipboard
| Challenge: | SURVEYFORGE automates survey paper writing, but quality gap between LLM-generated and human-written surveys remains significant. |
| Approach: | They propose a survey tool that automatically generates and refines human-written surveys. |
| Outcome: | Experiments show that SURVEYFORGE outperforms previous work such as AutoSurvey in outline quality and content quality. |
Copied to clipboard
| Challenge: | Existing methods for related search have limited semantic redundancy and wasted retrieval quota . generative retrieval approaches lack explicit reasoning, relying on superficial click-through rate rewards . |
| Approach: | They propose a framework that transforms related search into a reasoning-enhanced listwise generation task. |
| Outcome: | Experimental results show that ReList outperforms state-of-the-art methods in query diversity and user engagement. |
Copied to clipboard
| Challenge: | Existing work on building a conversational system for open domain human-machine conversation is attracting more attention . early models concatenate all utterances or independently encode each dialogue turn, which may lead to an inadequate understanding of dialogue status. |
| Approach: | They propose to use a turn-aware context modeling layer to adapt existing models . they propose to model multi-turn contexts from the perspective of sequential relationship, local relationship, and query-alike manner . |
| Outcome: | The proposed method can be adapted to several advanced response selection models. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have enabled agentic systems trained with reinforcement learning over multi-turn interaction, but practical deployment is bottlenecked by rapidly growing textual histories that inflate token and memory costs. |
| Approach: | They propose a framework that represents the accumulated observation-action history as a compact rendered image. |
| Outcome: | The proposed framework preserves over 95% of text-based agent performance while significantly reducing token consumption (>50%), yielding consistent token and memory efficiency. |
Copied to clipboard
| Challenge: | Existing studies focus on contrastive learning on the instance level without discriminating the contribution of each word. |
| Approach: | They propose a hierarchical contrastive learning mechanism which can unify semantic meaning in the input text. |
| Outcome: | The proposed model outperforms baselines on storytelling, paraphrasing, dialogue generation, and storytelling tasks. |
Copied to clipboard
| Challenge: | Existing approaches to discourse parsing focus on studying the semantic and syntactic aspects of EDU pairs, but they do not address long span dependencies. |
| Approach: | They propose a new transition-based discourse parser that takes discourse cohesion into account by using memory networks. |
| Outcome: | The proposed method outperforms traditional features and improves performance on the RST discourse treebank. |
Copied to clipboard
| Challenge: | Existing evaluations of LLMs in finance are text-only, monolingual, and largely saturated by current models. |
| Approach: | They propose a multilingual and multimodal benchmark for evaluating LLMs in real financial contexts. |
| Outcome: | The first expert-annotated multilingual and multimodal benchmark is released . it evaluates 21 leading LLMs and shows they perform better in multilingual settings . |
Copied to clipboard
| Challenge: | Recent advances in news summarization have created problems with “hallucinations” that are factually inconsistent with the source text. |
| Approach: | They propose to disentangle LLMs’ propensities to generate faithful and fake content by adopting a probing-based specific training method to improve their capacity of distinguishing two types of propensity. |
| Outcome: | The proposed method disentangles LLMs’ propensities to generate faithful and fake content and improves their ability to distinguish between two types of propensity. |
Copied to clipboard
| Challenge: | Existing reasoning-oriented LLMs lack a blind self-thinking paradigm . current models fail to recognize when their reasoning is underinformed or based on ambiguous user instructions . |
| Approach: | They propose a new reasoning paradigm that transforms LLMs into proactive inquirers that interleave reasoning with clarification. |
| Outcome: | The proposed model outperforms baseline models on mathematical reasoning, code generation, and document editing. |
Copied to clipboard
| Challenge: | FlowSearch is a multi-agent framework that actively constructs and evolves a dynamic structured knowledge flow to drive subtask execution and reasoning. |
| Approach: | They propose a multi-agent framework that actively constructs and evolves a dynamic structured knowledge flow to drive subtask execution and reasoning. |
| Outcome: | The proposed framework achieves competitive performance on GAIA, HLE, GPQA and TRQA benchmarks and is available to download. |
Copied to clipboard
| Challenge: | Existing work on front-end code generation fails to provide visual fidelity and rendering quality for front- end developers. |
| Approach: | They propose a three-stage pipeline to enhance front-end code generation capabilities in LLMs . they use synthetic data, quality-controlled supervised fine-tuning, and reinforcement learning . |
| Outcome: | The proposed model achieves competitive performance with frontier models while maintaining generation efficiency. |
Copied to clipboard
| Challenge: | Long-context understanding is crucial for many NLP applications, but transformers struggle with efficiency due to quadratic complexity of self-attention. |
| Approach: | They propose a dynamic sparse attention mechanism that assigns adaptive masks at the attention-map level, preserving heterogeneous attention patterns. |
| Outcome: | The proposed method achieves high alignment with full-attention models while reducing memory and compute overhead. |
Copied to clipboard
| Challenge: | Experimental results show that pre-trained language models outperform standard prompt learning in zero-shot settings. |
| Approach: | They propose a pipeline for annotating and filtering examples from unlabeled examples . they propose 'model bias validation' method that utilizes unlabed examples as validation set . |
| Outcome: | The proposed approach outperforms standard prompt learning on six text classification tasks. |
Copied to clipboard
| Challenge: | Existing text embedding models have not addressed syntactic understanding challenges, highlighting ineffectiveness and enhancing generalization ability. |
| Approach: | They propose to examine the ability of text embedding models to generalize across syntactic contexts. |
| Outcome: | The proposed models exhibit high similarity socres at this simple task. |
Copied to clipboard
| Challenge: | Current knowledge graph reasoning methods rely on extensive structural information to perform in these few-shot scenarios. |
| Approach: | They propose a task-aware language model that activates the language model’s in-context learning ability for structured KG tasks. |
| Outcome: | The proposed method achieves state-of-the-art in few-shot scenarios while reducing the inference time required by previous methods. |
Copied to clipboard
| Challenge: | Existing approaches to mitigate inference inefficiency and optimization difficulty are fragmented and constrained by inherent trade-offs. |
| Approach: | They propose a framework that reconceptualizes discrete reasoning steps as a continuous probabilistic flow, quantifying the contribution of each step toward the ground-truth answer. |
| Outcome: | The proposed framework achieves a superior balance between inference efficiency and reasoning performance on challenging benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for hallucinate formal dependencies lack scalability and precision to leverage ever-growing public datasets. |
| Approach: | They propose a retrieval-augmented framework based on Direct Dependency Retrieval to generate formal dependencies from natural-language mathematical descriptions and verify their existence via an efficient Suffix Array Check (SAC). |
| Outcome: | The proposed framework outperforms state-of-the-art methods in retrieval precision and recall and can be used to validate formal representations in a public dataset. |
Copied to clipboard
| Challenge: | Existing methods fail to reconcile click-through rate (CTR) optimization with topic expansion. |
| Approach: | They propose a query generation framework that aligns click-through rate and topic expansion goals through an online DPO paradigm. |
| Outcome: | The proposed approach achieves significant CTR gains (+2.3%) and higher human-rated query quality compared to state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing methods to adapt Large Language Models for Recommendation (LLMRec) do not represent collaborative information in a text-like format, which may not align optimally with LLMs. |
| Approach: | They propose a novel LLMRec method that integrates collaborative information through text-like encoding. |
| Outcome: | Extensive experiments show that BinLLM integrates collaborative information better with LLMs. |
Copied to clipboard
| Challenge: | Recent research has made significant progress in developing empathetic spoken chatbots based on large language models (LLMs). |
| Approach: | They propose an end-to-end empathetic spoken chatbot trained efficiently that generates emotionally expressive speech and outperforms other emmpathetic models in emphatic dialogue, SER, and SpokenQA tasks. |
| Outcome: | The proposed model outperforms other empathetic models on e-dialog, SER, and SpokenQA tasks and achieves strong results on several speech tasks. |
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 Large Language Model (LLM)-based recommender systems face challenges to adapt to dynamic user interests without any model-level updates. |
| Approach: | They propose a framework that establishes recommendation-oriented in-context learning by structuring recent user interactions and current inputs into ICL formats. |
| Outcome: | The proposed model adapts to dynamic user interests without model updates without any model updates and is available online at https://anonymous.4open.science/r/RecICL-8003. |
Copied to clipboard
| Challenge: | Generalized Category Discovery (GCD) is a crucial task that aims to recognize both known and novel categories from a set of unlabeled data. |
| Approach: | They propose a framework that introduces Large Language Models into the training loop to generate category names without human effort. |
| Outcome: | The proposed framework outperforms SOTA models on three benchmark datasets and generates accurate category names for the discovered clusters. |
Copied to clipboard
| Challenge: | Existing methods to translate speech signals into text are limited by the modality gap between speech and text. |
| Approach: | They propose Cross-modal Mixup via Optimal Transport to overcome the modality gap between speech and text by finding alignment between modalities. |
| Outcome: | Experiments on the MuST-C ST benchmark show that CMOT achieves an average BLEU of 30.0 in 8 translation directions, outperforming previous methods. |
Copied to clipboard
| Challenge: | Existing fine-tuning approaches that focus on English-centric training corpora often introduce implicit cross-lingual alignment, overlooking the potential for more profound, latent-level cross-linguistic interactions. |
| Approach: | They propose a multilingual fine-tuning paradigm that explicitly establishes a cross-lingual connection mechanism at the latent level. |
| Outcome: | The proposed model outperforms vanilla SFT and offers a strong latent-level alternative to data-level augmentation methods. |
Copied to clipboard
| Challenge: | . - (EN) |
| Approach: | . - (EN) |
| Outcome: | . - (EN) |
Copied to clipboard
| Challenge: | Existing approaches to cross-lingual knowledge graph (KG) alignment rely on entity embeddings derived from monolingual KG structural information. |
| Approach: | They propose a topic entity graph to represent entities with contextual information in KGs. |
| Outcome: | The proposed model outperforms state-of-the-art methods by a large margin. |
Copied to clipboard
| Challenge: | Existing methods to generate adversarial examples for relation classification are vulnerable to adversarials. |
| Approach: | They propose a method that uses most important parts of speech to substitute words with synonyms or hyponyms to generate adversarial texts of high quality. |
| Outcome: | The proposed method can generate adversarial texts of high quality and most relationships can be correctly identified in the process of human evaluation. |
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. |