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

Siyu Gai

dblp:331/6237 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0002-5912-5196ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 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.

Artificial intelligence
1 paper
Segmentation and scene understanding · 67% Transfer learning and domain adaptation · 33%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding
biomedical image segmentation
0.912025
Pancakes: Consistent Multi-Protocol Image Segmentation Across Biomedical Domains · NeurIPS 2025
Computer vision › Segmentation and scene understanding › semantic segmentation › transfer learning for semantic segmentation
domain adaptive semantic segmentation
0.912025
Pancakes: Consistent Multi-Protocol Image Segmentation Across Biomedical Domains · NeurIPS 2025
Machine learning › Transfer learning and domain adaptation
domain generalization
0.912025
Pancakes: Consistent Multi-Protocol Image Segmentation Across Biomedical Domains · NeurIPS 2025
Information retrieval › retrieval models
hybrid retrieval
0.812024
An Analysis of Fusion Functions for Hybrid Retrieval · ACM Trans. Inf. Syst. 2024
Information retrieval › ranking
rank aggregation
0.812024
An Analysis of Fusion Functions for Hybrid Retrieval · ACM Trans. Inf. Syst. 2024
Information retrieval
retrieval models
0.812024
An Analysis of Fusion Functions for Hybrid Retrieval · ACM Trans. Inf. Syst. 2024

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

multi-label segmentation · 0.9reciprocal rank fusion · 0.8convex combination · 0.8
YearPublicationVenuePosition
2025 Pancakes: Consistent Multi-Protocol Image Segmentation Across Biomedical Domains
abstract
A single biomedical image can be segmented in multiple valid ways, depending on the application. For instance, a brain MRI may be divided according to tissue types, vascular territories, broad anatomical regions, fine-grained anatomy, or pathology. Existing automatic segmentation models typically either (1) support only a single protocol---the one they were trained on---or (2) require labor-intensive prompting to specify the desired segmentation. We introduce _Pancakes_, a framework that, given a new image from a previously unseen domain, automatically generates multi-label segmentation maps for _multiple_ plausible protocols, while maintaining semantic consistency across related images. In extensive experiments across seven previously unseen domains, _Pancakes_ consistently outperforms strong baselines, often by a wide margin, demonstrating its ability to produce diverse yet coherent segmentation maps on unseen domains.
Marianne Rakic, Siyu Gai, Etienne Chollet, John V. Guttag, Adrian V. Dalca
NeurIPS2
2024 An Analysis of Fusion Functions for Hybrid Retrieval
abstract
We study hybrid search in text retrieval where lexical and semantic search are fused together with the intuition that the two are complementary in how they model relevance. In particular, we examine fusion by a convex combination of lexical and semantic scores, as well as the reciprocal rank fusion (RRF) method, and identify their advantages and potential pitfalls. Contrary to existing studies, we find RRF to be sensitive to its parameters; that the learning of a convex combination fusion is generally agnostic to the choice of score normalization; that convex combination outperforms RRF in in-domain and out-of-domain settings; and finally, that convex combination is sample efficient, requiring only a small set of training examples to tune its only parameter to a target domain.
Sebastian Bruch 0001, Siyu Gai, Amir Ingber
ACM Trans. Inf. Syst.2