no code implementations • 10 Mar 2024 • Yun-Ang Wu, Yun-Da Tsai, Shou-De Lin
In this study, we delve into the Thresholding Linear Bandit (TLB) problem, a nuanced domain within stochastic Multi-Armed Bandit (MAB) problems, focusing on maximizing decision accuracy against a linearly defined threshold under resource constraints.
no code implementations • 12 Feb 2024 • Yun-Da Tsai, Ting-Yu Yen, Pei-Fu Guo, Zhe-Yan Li, Shou-De Lin
This research paper addresses the challenge of modality mismatch in multimodal learning, where the modalities available during inference differ from those available at training.
no code implementations • 29 Jan 2024 • Tzu-Hsien Tsai, Yun-Da Tsai, Shou-De Lin
We demonstrate that the sample complexity of the first $\lambda$ output arm in lil'HDoC is bounded by the original HDoC algorithm, except for one negligible term, when the distance between the expected reward and threshold is small.
no code implementations • 20 Oct 2023 • Felix Liawi, Yun-Da Tsai, Guan-Lun Lu, Shou-De Lin
Initially, we introduce a text-swapping network that seamlessly substitutes the original text with the desired replacement.
no code implementations • 8 Oct 2023 • Pei-Fu Guo, Ying-Hsuan Chen, Yun-Da Tsai, Shou-De Lin
In this work, we conduct an assessment of the optimization capabilities of LLMs across various tasks and data sizes.
no code implementations • 13 Mar 2023 • Yun-Da Tsai, Tzu-Hsien Tsai, Shou-De Lin
This paper targets a variant of the stochastic multi-armed bandit problem called good arm identification (GAI).