Yilin Shen
Research Subjects
Research Interests
Yilin Shen has a total of 69 co-authors. Here are the top co-authors by number of shared publications:
- Hongxia Jin
Samsung Research America
22 shared publications - Yen-Chang Hsu
Samsung Research America
7 shared publications Hongxia Jin
4 shared publications- Ting Hua
Samsung Research America
4 shared publications - Chi-Heng Lin
Samsung Research America Samsung Research America Samsung Research America Samsung Research America Samsung Research America Samsung Research America Samsung Research America Samsung Research America
3 shared publications - Shangqian Gao
Samsung Research America
3 shared publications
Latest Publications
- Open Access
DynaMo: Accelerating Language Model Inference with Dynamic Multi-Token Sampling
Traditional language models operate autoregressively, i.e., they predict one token at a time. Rapid explosion in model sizes has resulted in high inference times. In this work, we propose DynaMo, a suite of multi-token prediction language models that reduce net inference times. Our models $\textit{dynamically}$ predict multiple tokens based on their confidence in the predicted joint probability distribution. We propose a lightweight technique to train these models, leveraging the weights of traditional autoregressive counterparts. Moreover, we propose novel ways to enhance the estimated joint probability to improve text generation quality, namely co-occurrence weighted masking and adaptive thresholding. We also propose systematic qualitative and quantitative methods to rigorously test the quality of generated text for non-autoregressive generation. One of the models in our suite, DynaMo-7.3B-T3, achieves same-quality generated text as the baseline (Pythia-6.9B) while achieving 2.57$\times$ speed-up with only 5.87% and 2.67% parameter and training time overheads, respectively.Open AccessDynaMo: Accelerating Language Model Inference with Dynamic Multi-Token Sampling
Traditional language models operate autoregressively, i.e., they predict one token at a time. Rapid explosion in model sizes has resulted in high inference times. In this work, we propose DynaMo, a suite of multi-token prediction language models that reduce net inference times. Our models $\textit{dynamically}$ predict multiple tokens based on their confidence in the predicted joint probability distribution. We propose a lightweight technique to train these models, leveraging the weights of traditional autoregressive counterparts. Moreover, we propose novel ways to enhance the estimated joint probability to improve text generation quality, namely co-occurrence weighted masking and adaptive thresholding. We also propose systematic qualitative and quantitative methods to rigorously test the quality of generated text for non-autoregressive generation. One of the models in our suite, DynaMo-7.3B-T3, achieves same-quality generated text as the baseline (Pythia-6.9B) while achieving 2.57$\times$ speed-up with only 5.87% and 2.67% parameter and training time overheads, respectively. - Open Access
- 1 January 2024
- Published by Association for Computational Linguistics (ACL)
- p. 227-241
Adaptive Rank Selections for Low-Rank Approximation of Language Models
Shangqian Gao, Ting Hua, Yen-Chang Hsu, Yilin Shen, Hongxia Jin. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.
- 1 January 2024
- Published by Association for Computational Linguistics (ACL)
- p. 227-241
Open AccessAdaptive Rank Selections for Low-Rank Approximation of Language Models
Shangqian Gao, Ting Hua, Yen-Chang Hsu, Yilin Shen, Hongxia Jin. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.
- Open Access
- 1 January 2024
- Published by Association for Computational Linguistics (ACL)
- p. 3322-3345
DynaMo: Accelerating Language Model Inference with Dynamic Multi-Token Sampling
Shikhar Tuli, Chi-Heng Lin, Yen-Chang Hsu, Niraj Jha, Yilin Shen, Hongxia Jin. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.
- 1 January 2024
- Published by Association for Computational Linguistics (ACL)
- p. 3322-3345
Open AccessDynaMo: Accelerating Language Model Inference with Dynamic Multi-Token Sampling
Shikhar Tuli, Chi-Heng Lin, Yen-Chang Hsu, Niraj Jha, Yilin Shen, Hongxia Jin. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.
- Open Access
- 1 January 2024
- Published by Association for Computational Linguistics (ACL)
- p. 1005-1017
SLiM: Speculative Decoding with Hypothesis Reduction
Chi-Heng Lin, Shikhar Tuli, James Smith, Yen-Chang Hsu, Yilin Shen, Hongxia Jin. Findings of the Association for Computational Linguistics: NAACL 2024. 2024.
- 1 January 2024
- Published by Association for Computational Linguistics (ACL)
- p. 1005-1017
Open AccessSLiM: Speculative Decoding with Hypothesis Reduction
Chi-Heng Lin, Shikhar Tuli, James Smith, Yen-Chang Hsu, Yilin Shen, Hongxia Jin. Findings of the Association for Computational Linguistics: NAACL 2024. 2024.
- Open Access
Compositional Generalization in Spoken Language Understanding
State-of-the-art spoken language understanding (SLU) models have shown tremendous success in benchmark SLU datasets, yet they still fail in many practical scenario due to the lack of model compositionality when trained on limited training data. In this paper, we study two types of compositionality: (a) novel slot combination, and (b) length generalization. We first conduct in-depth analysis, and find that state-of-the-art SLU models often learn spurious slot correlations during training, which leads to poor performance in both compositional cases. To mitigate these limitations, we create the first compositional splits of benchmark SLU datasets and we propose the first compositional SLU model, including compositional loss and paired training that tackle each compositional case respectively. On both benchmark and compositional splits in ATIS and SNIPS, we show that our compositional SLU model significantly outperforms (up to $5\%$ F1 score) state-of-the-art BERT SLU model.Open AccessCompositional Generalization in Spoken Language Understanding
State-of-the-art spoken language understanding (SLU) models have shown tremendous success in benchmark SLU datasets, yet they still fail in many practical scenario due to the lack of model compositionality when trained on limited training data. In this paper, we study two types of compositionality: (a) novel slot combination, and (b) length generalization. We first conduct in-depth analysis, and find that state-of-the-art SLU models often learn spurious slot correlations during training, which leads to poor performance in both compositional cases. To mitigate these limitations, we create the first compositional splits of benchmark SLU datasets and we propose the first compositional SLU model, including compositional loss and paired training that tackle each compositional case respectively. On both benchmark and compositional splits in ATIS and SNIPS, we show that our compositional SLU model significantly outperforms (up to $5\%$ F1 score) state-of-the-art BERT SLU model. - Open Access
Prompt Tuning for Zero-shot Compositional Learning
Open World Compositional Zero-Shot Learning (OW-CZSL) is known to be an extremely challenging task, which aims to recognize unseen compositions formed from seen attributes and objects without any prior assumption of the output space. In order to achieve this goal, a model has to be "smart" and "knowledgeable". To be smart, a model should be good at reasoning the interactions between attributes and objects from the seen compositions. While "knowledgeable" means the model owns "common sense" to the open world that can "foresee" some features of the unseen compositions. Most previous work focuses on the "smart" part, while few of them provided an effective solution to achieve the "knowledgeable" goal. In this paper, we proposed a framework named Multi-Modal Prompt Tuning (MMPT) to inherit the "knowledgeable" property from the large pre-trained vision-language model. Extensive experiments show that our proposed MMPT obtains new state-of-the-art results in OW-CZSL task. On the UT-Zappos dataset, MMPT pushes the AUC score to $29.8$, while the previous best score is $26.5$. On the more challenging MIT-States dataset, the AUC score of MMPT is 1.5 times better than the current state-of-the-art.Open AccessPrompt Tuning for Zero-shot Compositional Learning
Open World Compositional Zero-Shot Learning (OW-CZSL) is known to be an extremely challenging task, which aims to recognize unseen compositions formed from seen attributes and objects without any prior assumption of the output space. In order to achieve this goal, a model has to be "smart" and "knowledgeable". To be smart, a model should be good at reasoning the interactions between attributes and objects from the seen compositions. While "knowledgeable" means the model owns "common sense" to the open world that can "foresee" some features of the unseen compositions. Most previous work focuses on the "smart" part, while few of them provided an effective solution to achieve the "knowledgeable" goal. In this paper, we proposed a framework named Multi-Modal Prompt Tuning (MMPT) to inherit the "knowledgeable" property from the large pre-trained vision-language model. Extensive experiments show that our proposed MMPT obtains new state-of-the-art results in OW-CZSL task. On the UT-Zappos dataset, MMPT pushes the AUC score to $29.8$, while the previous best score is $26.5$. On the more challenging MIT-States dataset, the AUC score of MMPT is 1.5 times better than the current state-of-the-art. - Open Access
Token Fusion: Bridging the Gap between Token Pruning and Token Merging
Vision Transformers (ViTs) have emerged as powerful backbones in computer vision, outperforming many traditional CNNs. However, their computational overhead, largely attributed to the self-attention mechanism, makes deployment on resource-constrained edge devices challenging. Multiple solutions rely on token pruning or token merging. In this paper, we introduce "Token Fusion" (ToFu), a method that amalgamates the benefits of both token pruning and token merging. Token pruning proves advantageous when the model exhibits sensitivity to input interpolations, while token merging is effective when the model manifests close to linear responses to inputs. We combine this to propose a new scheme called Token Fusion. Moreover, we tackle the limitations of average merging, which doesn't preserve the intrinsic feature norm, resulting in distributional shifts. To mitigate this, we introduce MLERP merging, a variant of the SLERP technique, tailored to merge multiple tokens while maintaining the norm distribution. ToFu is versatile, applicable to ViTs with or without additional training. Our empirical evaluations indicate that ToFu establishes new benchmarks in both classification and image generation tasks concerning computational efficiency and model accuracy.
Open AccessToken Fusion: Bridging the Gap between Token Pruning and Token Merging
Vision Transformers (ViTs) have emerged as powerful backbones in computer vision, outperforming many traditional CNNs. However, their computational overhead, largely attributed to the self-attention mechanism, makes deployment on resource-constrained edge devices challenging. Multiple solutions rely on token pruning or token merging. In this paper, we introduce "Token Fusion" (ToFu), a method that amalgamates the benefits of both token pruning and token merging. Token pruning proves advantageous when the model exhibits sensitivity to input interpolations, while token merging is effective when the model manifests close to linear responses to inputs. We combine this to propose a new scheme called Token Fusion. Moreover, we tackle the limitations of average merging, which doesn't preserve the intrinsic feature norm, resulting in distributional shifts. To mitigate this, we introduce MLERP merging, a variant of the SLERP technique, tailored to merge multiple tokens while maintaining the norm distribution. ToFu is versatile, applicable to ViTs with or without additional training. Our empirical evaluations indicate that ToFu establishes new benchmarks in both classification and image generation tasks concerning computational efficiency and model accuracy.
- Open Access
TrojLLM: A Black-box Trojan Prompt Attack on Large Language Models
Large Language Models (LLMs) are progressively being utilized as machine learning services and interface tools for various applications. However, the security implications of LLMs, particularly in relation to adversarial and Trojan attacks, remain insufficiently examined. In this paper, we propose TrojLLM, an automatic and black-box framework to effectively generate universal and stealthy triggers. When these triggers are incorporated into the input data, the LLMs' outputs can be maliciously manipulated. Moreover, the framework also supports embedding Trojans within discrete prompts, enhancing the overall effectiveness and precision of the triggers' attacks. Specifically, we propose a trigger discovery algorithm for generating universal triggers for various inputs by querying victim LLM-based APIs using few-shot data samples. Furthermore, we introduce a novel progressive Trojan poisoning algorithm designed to generate poisoned prompts that retain efficacy and transferability across a diverse range of models. Our experiments and results demonstrate TrojLLM's capacity to effectively insert Trojans into text prompts in real-world black-box LLM APIs including GPT-3.5 and GPT-4, while maintaining exceptional performance on clean test sets. Our work sheds light on the potential security risks in current models and offers a potential defensive approach. The source code of TrojLLM is available at https://github.com/UCF-ML-Research/TrojLLM.
Open AccessTrojLLM: A Black-box Trojan Prompt Attack on Large Language Models
Large Language Models (LLMs) are progressively being utilized as machine learning services and interface tools for various applications. However, the security implications of LLMs, particularly in relation to adversarial and Trojan attacks, remain insufficiently examined. In this paper, we propose TrojLLM, an automatic and black-box framework to effectively generate universal and stealthy triggers. When these triggers are incorporated into the input data, the LLMs' outputs can be maliciously manipulated. Moreover, the framework also supports embedding Trojans within discrete prompts, enhancing the overall effectiveness and precision of the triggers' attacks. Specifically, we propose a trigger discovery algorithm for generating universal triggers for various inputs by querying victim LLM-based APIs using few-shot data samples. Furthermore, we introduce a novel progressive Trojan poisoning algorithm designed to generate poisoned prompts that retain efficacy and transferability across a diverse range of models. Our experiments and results demonstrate TrojLLM's capacity to effectively insert Trojans into text prompts in real-world black-box LLM APIs including GPT-3.5 and GPT-4, while maintaining exceptional performance on clean test sets. Our work sheds light on the potential security risks in current models and offers a potential defensive approach. The source code of TrojLLM is available at https://github.com/UCF-ML-Research/TrojLLM.
- Open Access
- 4 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 9, 1-5
To Wake-Up or Not to Wake-Up: Reducing Keyword False Alarm by Successive Refinement
Keyword spotting systems continuously process audio streams to detect keywords. One of the most challenging tasks in designing such systems is to reduce False Alarm (FA) which happens when the system falsely registers a keyword despite the keyword not being uttered. In this paper, we propose a simple yet elegant solution to this problem that follows from the law of total probability. We show that existing deep keyword spotting mechanisms can be improved by Successive Refinement, where the system first classifies whether the input audio is speech or not, followed by whether the input is keyword-like or not, and finally classifies which keyword was uttered. We show across multiple models with size ranging from 13K parameters to 2.41M parameters, the successive refinement technique reduces FA by up to a factor of 8 on in-domain held-out FA data, and up to a factor of 7 on out-of-domain (OOD) FA data. Further, our proposed approach is "plug-and-play" and can be applied to any deep keyword spotting model.
- 4 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 9, 1-5
Open AccessTo Wake-Up or Not to Wake-Up: Reducing Keyword False Alarm by Successive Refinement
Keyword spotting systems continuously process audio streams to detect keywords. One of the most challenging tasks in designing such systems is to reduce False Alarm (FA) which happens when the system falsely registers a keyword despite the keyword not being uttered. In this paper, we propose a simple yet elegant solution to this problem that follows from the law of total probability. We show that existing deep keyword spotting mechanisms can be improved by Successive Refinement, where the system first classifies whether the input audio is speech or not, followed by whether the input is keyword-like or not, and finally classifies which keyword was uttered. We show across multiple models with size ranging from 13K parameters to 2.41M parameters, the successive refinement technique reduces FA by up to a factor of 8 on in-domain held-out FA data, and up to a factor of 7 on out-of-domain (OOD) FA data. Further, our proposed approach is "plug-and-play" and can be applied to any deep keyword spotting model.
- Open Access
- 3 June 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (11) , 9052
Assessment and Factor Diagnosis of Water Resource Vulnerability in Arid Inland River Basin: A Case Study of Shule River Basin, China
Water resources in arid and semi-arid inland regions are highly vulnerable, facing threats from global climate change and human activities. Ensuring water resource sustainability requires scientifically evaluating the vulnerability of water resources and its driving factors. Taking the Shule River Basin, an inland river in northwest China, as an example, this study established an assessment system considering 16 influencing factors based on three aspects, including natural vulnerability, anthropogenic vulnerability, and carrying capacity vulnerability. The mature-element fuzzy model based on comprehensive weight and the Delphi method were used to evaluate the water resource vulnerability of the basin from 2005 to 2021. The results were as follows: (1) The water resource vulnerability in the Shule River Basin was between severe and moderate from 2005 to 2021, with a trend towards severe vulnerability. (2) The barrier analysis at the index level shows that factors of natural vulnerability had a low impact on water resource vulnerability in the basin from 2005 to 2019 but exerted a greater impact in 2020–2021, an impact that was far higher than that caused by factors of man-made vulnerability and water resource vulnerability. The impact of factors of anthropogenic vulnerability on water resource vulnerability was relatively low in the entire study period, except in 2016, 2017, 2020, and 2021. In 2005–2010, the factors of bearing capacity vulnerability had a great impact on water resource vulnerability, but in 2011–2021, the impact was alleviated and was gradually reduced. (3) Among the 16 factors affecting water resource vulnerability, the obstacle degree was higher than 6.5% for the following factors: the ratio of irrigation water use on farmland, the annual precipitation, total water resources, the annual quantity of wastewater effluent, the urbanization rate, the surface water control rate, and the degree of groundwater resource amount, exploration, and utilization obstacle values.
- 3 June 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (11) , 9052
Open AccessAssessment and Factor Diagnosis of Water Resource Vulnerability in Arid Inland River Basin: A Case Study of Shule River Basin, China
Water resources in arid and semi-arid inland regions are highly vulnerable, facing threats from global climate change and human activities. Ensuring water resource sustainability requires scientifically evaluating the vulnerability of water resources and its driving factors. Taking the Shule River Basin, an inland river in northwest China, as an example, this study established an assessment system considering 16 influencing factors based on three aspects, including natural vulnerability, anthropogenic vulnerability, and carrying capacity vulnerability. The mature-element fuzzy model based on comprehensive weight and the Delphi method were used to evaluate the water resource vulnerability of the basin from 2005 to 2021. The results were as follows: (1) The water resource vulnerability in the Shule River Basin was between severe and moderate from 2005 to 2021, with a trend towards severe vulnerability. (2) The barrier analysis at the index level shows that factors of natural vulnerability had a low impact on water resource vulnerability in the basin from 2005 to 2019 but exerted a greater impact in 2020–2021, an impact that was far higher than that caused by factors of man-made vulnerability and water resource vulnerability. The impact of factors of anthropogenic vulnerability on water resource vulnerability was relatively low in the entire study period, except in 2016, 2017, 2020, and 2021. In 2005–2010, the factors of bearing capacity vulnerability had a great impact on water resource vulnerability, but in 2011–2021, the impact was alleviated and was gradually reduced. (3) Among the 16 factors affecting water resource vulnerability, the obstacle degree was higher than 6.5% for the following factors: the ratio of irrigation water use on farmland, the annual precipitation, total water resources, the annual quantity of wastewater effluent, the urbanization rate, the surface water control rate, and the degree of groundwater resource amount, exploration, and utilization obstacle values.