← Search

Yichun Yin

16 accepted papers

2025

RidgeLoRA: Matrix Ridge Enhanced Low-Rank Adaptation of Large Language Models

NeurIPS 2025spotlight

As one of the state-of-the-art parameter-efficient fine-tuning~(PEFT) methods, Low-Rank Adaptation (LoRA) enables model optimization with reduced computational cost through trainable low-rank matrix. However, the low-rank nature makes it prone to produce a decrease in the representation ability, lea…

Cited by 0SourceScholar
2025

Safe: Enhancing Mathematical Reasoning in Large Language Models via Retrospective Step-aware Formal Verification

ACL 2025long

Chain-of-Thought (CoT) prompting has become the de facto method to elicit reasoning capabilities from large language models (LLMs). However, to mitigate hallucinations in CoT that are notoriously difficult to detect, current methods such as process reward models (PRMs) or self-consistency operate as…

2024

DQ-LoRe: Dual Queries with Low Rank Approximation Re-ranking for In-Context Learning

ICLR 2024poster

Recent advances in natural language processing, primarily propelled by Large Language Models (LLMs), have showcased their remarkable capabilities grounded in in-context learning. A promising avenue for guiding LLMs in intricate reasoning tasks involves the utilization of intermediate reasoning steps…

2024

Preparing Lessons for Progressive Training on Language Models

AAAI 2024technical

The rapid progress of Transformers in artificial intelligence has come at the cost of increased resource consumption and greenhouse gas emissions due to growing model sizes. Prior work suggests using pretrained small models to improve training efficiency, but this approach may not be suitable for ne…

2023

AutoConv: Automatically Generating Information-seeking Conversations with Large Language Models

ACL 2023short

Information-seeking conversation, which aims to help users gather information through conversation, has achieved great progress in recent years. However, the research is still stymied by the scarcity of training data. To alleviate this problem, we propose AutoConv for synthetic conversation generati…

2023

DT-Solver: Automated Theorem Proving with Dynamic-Tree Sampling Guided by Proof-level Value Function

ACL 2023long

Recent advances in neural theorem-proving resort to large language models and tree searches. When proving a theorem, a language model advises single-step actions based on the current proving state and the tree search finds a sequence of correct steps using actions given by the language model. Howeve…

Cited by 35SourcePDFScholar
2023

NewsDialogues: Towards Proactive News Grounded Conversation

ACL 2023findings

Hot news is one of the most popular topics in daily conversations. However, news grounded conversation has long been stymied by the lack of well-designed task definition and scarce data. In this paper, we propose a novel task, Proactive News Grounded Conversation, in which a dialogue system can proa…

2023

One Cannot Stand for Everyone! Leveraging Multiple User Simulators to train Task-oriented Dialogue Systems

ACL 2023long

User simulators are agents designed to imitate human users; recent advances have found that Task-oriented Dialogue (ToD) systems optimized toward a user simulator could better satisfy the need of human users. However, this might result in a sub-optimal ToD system if it is tailored to only one ad hoc…

Cited by 16SourcePDFScholar
2023

Reusing Pretrained Models by Multi-linear Operators for Efficient Training

NeurIPS 2023poster

Training large models from scratch usually costs a substantial amount of resources. Towards this problem, recent studies such as bert2BERT and LiGO have reused small pretrained models to initialize a large model (termed the ``target model''), leading to a considerable acceleration in training. Despi…

Cited by 16SourcePDFScholar
2023

TRIGO: Benchmarking Formal Mathematical Proof Reduction for Generative Language Models

EMNLP 2023long main

Automated theorem proving (ATP) has become an appealing domain for exploring the reasoning ability of the recent successful generative language models. However, current ATP benchmarks are mainly focus on symbolic inference, but rarely involve the understanding of complex number combination reasoni…

Cited by 0SourcecodeScholar
2022

FPT: Improving Prompt Tuning Efficiency via Progressive Training

EMNLP 2022finding

Recently, prompt tuning (PT) has gained increasing attention as a parameter-efficient way of tuning pre-trained language models (PLMs). Despite extensively reducing the number of tunable parameters and achieving satisfying performance, PT is training-inefficient due to its slow convergence. To impro…

2022

G-MAP: General Memory-Augmented Pre-trained Language Model for Domain Tasks

EMNLP 2022main

General pre-trained language models (PLMs), such as BERT, have achieved remarkable performance on various NLP tasks. Recently, domain-specific PLMs have been proposed to boost the task performance of specific domains (e.g., biomedical and computer science) by continuing to pre-train general PLMs wit…

2022

bert2BERT: Towards Reusable Pretrained Language Models

ACL 2022long

In recent years, researchers tend to pre-train ever-larger language models to explore the upper limit of deep models. However, large language model pre-training costs intensive computational resources, and most of the models are trained from scratch without reusing the existing pre-trained models, w…

Cited by 86SourcePDFScholar
2021

AutoTinyBERT: Automatic Hyper-parameter Optimization for Efficient Pre-trained Language Models

ACL 2021long

Pre-trained language models (PLMs) have achieved great success in natural language processing. Most of PLMs follow the default setting of architecture hyper-parameters (e.g., the hidden dimension is a quarter of the intermediate dimension in feed-forward sub-networks) in BERT. Few studies have been…

2021

Generate & Rank: A Multi-task Framework for Math Word Problems

EMNLP 2021finding

Math word problem (MWP) is a challenging and critical task in natural language processing. Many recent studies formalize MWP as a generation task and have adopted sequence-to-sequence models to transform problem descriptions to mathematical expressions. However, mathematical expressions are prone to…

2020

PoD: Positional Dependency-Based Word Embedding for Aspect Term Extraction

COLING 2020main

Dependency context-based word embedding jointly learns the representations of word and dependency context, and has been proved effective in aspect term extraction. In this paper, we design the positional dependency-based word embedding (PoD) which considers both dependency context and positional con…

Cited by 26SourcePDFScholar