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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tsai-Tsung Chen

dblp:410/8169 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0009-9544-6104ORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 75% Recommender systems · 25%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models › neural retrieval › dense retrieval
bi-encoder retrieval
0.912025
Dynamic Margin-based Contrastive Learning for Robust Negative Sampling in Information Retrieval · SIGIR 2025
Recommender systems › representation learning for recommendation
contrastive learning for recommendation
0.912025
Dynamic Margin-based Contrastive Learning for Robust Negative Sampling in Information Retrieval · SIGIR 2025
Information retrieval › retrieval models › neural retrieval
dense retrieval
0.912025
Dynamic Margin-based Contrastive Learning for Robust Negative Sampling in Information Retrieval · SIGIR 2025
Information retrieval
hard negative mining
0.912025
Dynamic Margin-based Contrastive Learning for Robust Negative Sampling in Information Retrieval · SIGIR 2025

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

dynamic margin · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2025 Dynamic Margin-based Contrastive Learning for Robust Negative Sampling in Information Retrieval
abstract
Modern information retrieval (IR) systems, powered by bi-encoder architectures and pretrained language models, rely on effective negative sampling for contrastive learning. While easy negatives are computationally simple, they fail to challenge the model, whereas hard negatives-selected via methods like BM25, ANCE, or ADORE-can be overly difficult and misleading. To this end, this paper proposes dynamic margin-based contrastive learning (DMCL), which adaptively adjusts the decision boundary based on query-negative similarity, ensuring consistent exposure to moderately hard negatives. Experiments across diverse datasets and models show that DMCL outperforms traditional methods, achieving state-of-the-art retrieval performance with minimal computational cost.
Tsai-Tsung Chen, Chuan-Ju Wang, Ming-Feng Tsai
SIGIR1