Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ting-Ji Huang

dblp:348/9391 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Language models and text generation · 30% Transfer learning and domain adaptation · 23% Trustworthy machine learning · 23%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
tokenization
0.912025
Improving LLMs for Recommendation with Out-Of-Vocabulary Tokens · ICML 2025
Recommender systems
large language model-based recommendation
0.912025
Improving LLMs for Recommendation with Out-Of-Vocabulary Tokens · ICML 2025
Machine learning › Trustworthy machine learning
model ranking
0.712023
Model Spider: Learning to Rank Pre-Trained Models Efficiently · NeurIPS 2023
Machine learning › Efficient and distributed learning › model reuse
model zoo
0.712023
Model Spider: Learning to Rank Pre-Trained Models Efficiently · NeurIPS 2023
Machine learning › Transfer learning and domain adaptation › pre-trained models
pre-trained model selection
0.712023
Model Spider: Learning to Rank Pre-Trained Models Efficiently · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

representation clustering · 1.7out-of-vocabulary token construction · 1.7representation learning · 0.7learning to rank · 0.7
YearPublicationVenuePosition
2025 Improving LLMs for Recommendation with Out-Of-Vocabulary Tokens
abstract
Characterizing users and items through vector representations is crucial for various tasks in recommender systems. Recent approaches attempt to apply Large Language Models (LLMs) in recommendation through a question&answer format, where real items (eg, Item No.2024) are represented with compound words formed from in-vocabulary tokens (eg, “item“, “20“, “24“). However, these tokens are not suitable for representing items, as their meanings are shaped by pre-training on natural language tasks, limiting the model’s ability to capture user-item relationships effectively. In this paper, we explore how to effectively characterize users and items in LLM-based recommender systems from the token construction view. We demonstrate the necessity of using out-of-vocabulary (OOV) tokens for the characterization of items and users, and propose a well-constructed way of these OOV tokens. By clustering the learned representations from historical user-item interactions, we make the representations of user/item combinations share the same OOV tokens if they have similar properties. This construction allows us to capture user/item relationships well (memorization) and preserve the diversity of descriptions of users and items (diversity). Furthermore, integrating these OOV tokens into the LLM’s vocabulary allows for better distinction between users and items and enhanced capture of user-item relationships during fine-tuning on downstream tasks. Our proposed framework outperforms existing state-of-the-art methods across various downstream recommendation tasks.
Ting-Ji Huang, Chunxu Shen, Kai-Qi Liu, De-Chuan Zhan, Han-Jia Ye
ICML1
2023 Model Spider: Learning to Rank Pre-Trained Models Efficiently
abstract
Figuring out which Pre-Trained Model (PTM) from a model zoo fits the target task is essential to take advantage of plentiful model resources. With the availability of numerous heterogeneous PTMs from diverse fields, efficiently selecting the most suitable one is challenging due to the time-consuming costs of carrying out forward or backward passes over all PTMs. In this paper, we propose Model Spider, which tokenizes both PTMs and tasks by summarizing their characteristics into vectors to enable efficient PTM selection. By leveraging the approximated performance of PTMs on a separate set of training tasks, Model Spider learns to construct representation and measure the fitness score between a model-task pair via their representation. The ability to rank relevant PTMs higher than others generalizes to new tasks. With the top-ranked PTM candidates, we further learn to enrich task repr. with their PTM-specific semantics to re-rank the PTMs for better selection. Model Spider balances efficiency and selection ability, making PTM selection like a spider preying on a web. Model Spider exhibits promising performance across diverse model zoos, including visual models and Large Language Models (LLMs). Code is available at https://github.com/zhangyikaii/Model-Spider.
Yi-Kai Zhang, Ting-Ji Huang, Yao-Xiang Ding 0001, De-Chuan Zhan, Han-Jia Ye
NeurIPS2