← Search

Hsuan-Tien Lin

13 accepted papers

2025

Preserving Zero-shot Capability in Supervised Fine-tuning for Multi-label Text Classification

NAACL 2025findings

Zero-shot multi-label text classification (ZMTC) requires models to predict multiple labels for a document, including labels unseen during training. Previous work assumes that models leveraging label descriptions ensures zero-shot capability. However, we find that supervised methods, despite achievi…

Cited by 0SourcePDFScholar
2025

Soft Separation and Distillation: Toward Global Uniformity in Federated Unsupervised Learning

ICCV 2025poster

Federated Unsupervised Learning (FUL) aims to learn expressive representations in federated and self-supervised settings. The quality of representations learned in FUL is usually determined by uniformity, a measure of how uniformly representations are distributed in the embedding space. However, exi…

2025

Tackling Dimensional Collapse toward Comprehensive Universal Domain Adaptation

ICML 2025poster

Universal Domain Adaptation (UniDA) addresses unsupervised domain adaptation where target classes may differ arbitrarily from source ones, except for a shared subset. A widely used approach, partial domain matching (PDM), aligns only shared classes but struggles in extreme cases where many source cl…

2024

CAD-DA: Controllable Anomaly Detection after Domain Adaptation by Statistical Inference

AISTATS 2024poster

We propose a novel statistical method for testing the results of anomaly detection (AD) under domain adaptation (DA), which we call CAD-DA—controllable AD under DA. The distinct advantage of the CAD-DA lies in its ability to control the probability of misidentifying anomalies under a pre-specified l…

Cited by 12SourcePDFScholar
2024

SLIM: Spuriousness Mitigation with Minimal Human Annotations

ECCV 2024poster

"Recent studies highlight that deep learning models often learn spurious features mistakenly linked to labels, compromising their reliability in real-world scenarios where such correlations do not hold. Despite the increasing research effort, existing solutions often face two main challenges: they e…

2024

TableRAG: Million-Token Table Understanding with Language Models

NeurIPS 2024poster

Recent advancements in language models (LMs) have notably enhanced their ability to reason with tabular data, primarily through program-aided mechanisms that manipulate and analyze tables. However, these methods often require the entire table as input, leading to scalability challenges due to the po…

2022

Even the Simplest Baseline Needs Careful Re-investigation: A Case Study on XML-CNN

NAACL 2022long

The power and the potential of deep learning models attract many researchers to design advanced and sophisticated architectures. Nevertheless, the progress is sometimes unreal due to various possible reasons. In this work, through an astonishing example we argue that more efforts should be paid to e…

2020

Unbiased Risk Estimators Can Mislead: A Case Study of Learning with Complementary Labels

ICML 2020poster

In weakly supervised learning, unbiased risk estimator(URE) is a powerful tool for training classifiers when training and test data are drawn from different distributions. Nevertheless, UREs lead to overfitting in many problem settings when the models are complex like deep networks. In this paper, w…

Cited by 69SourcePDFScholar
2018

REFUEL: Exploring Sparse Features in Deep Reinforcement Learning for Fast Disease Diagnosis

NeurIPS 2018poster

This paper proposes REFUEL, a reinforcement learning method with two techniques: {\em reward shaping} and {\em feature rebuilding}, to improve the performance of online symptom checking for disease diagnosis. Reward shaping can guide the search of policy towards better directions. Feature rebuilding…

Cited by 89SourcePDFScholar
2016

Rivalry of Two Families of Algorithms for Memory-Restricted Streaming PCA

AISTATS 2016poster

We study the problem of recovering the subspace spanned by the first k principal components of d-dimensional data under the streaming setting, with a memory bound of O(kd). Two families of algorithms are known for this problem. The first family is based on the framework of stochastic gradient descen…

Cited by 40SourcePDFScholar