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

Hyeondong Woo

dblp:439/3055 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 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
Trustworthy machine learning · 50% Vision and language · 25% Transfer learning and domain adaptation · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
1.012026
Selective Test-Time Debiasing for CLIP via Reward Gating · ACL (1) 2026
Machine learning › Transfer learning and domain adaptation
test-time adaptation
1.012026
Selective Test-Time Debiasing for CLIP via Reward Gating · ACL (1) 2026
Computer vision › Vision and language
vision-language model
1.012026
Selective Test-Time Debiasing for CLIP via Reward Gating · ACL (1) 2026
Machine learning › Trustworthy machine learning › fairness › bias mitigation
vision-language model debiasing
1.012026
Selective Test-Time Debiasing for CLIP via Reward Gating · ACL (1) 2026

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

test-time adaptation · 1.0reinforcement learning · 1.0
YearPublicationVenuePosition
2026 Selective Test-Time Debiasing for CLIP via Reward Gating
abstract
Vision language models (VLMs) demonstrate strong zero-shot performance, but often perpetuate social stereotypes in person-centric queries, yielding skewed demographic distributions.Current debiasing methods apply uniform bias corrections across all input queries regardless of their bias sensitivity, creating a fundamental fairness-utility trade-off.Strong debiasing distorts semantically meaningful information in bias-insensitive queries, while weak debiasing fails to mitigate stereotypes in biassensitive ones.This one-size-fits-all approach hampers simultaneously achieving high utility on bias-insensitive queries and fairness on bias-sensitive queries.We introduce Reward-Gated Test-Time Adaptation (RG-TTA), a reinforcement learning-based test-time adaptation framework that selectively applies debiasing based on input sensitivity.RG-TTA adaptively triggers fairness regularization based on the bias sensitivity of each input during testtime policy adaptation, while focusing exclusively on optimizing cross-modal alignment for bias-insensitive inputs.Experiments on fairness benchmarks (e.g., FairFace, UTKFace) demonstrate substantial bias reduction while simultaneously improving zero-shot utility, resolving the trade-off of uniform debiasing.
Jaeho Han, Jisoo Yang, Hyeondong Woo, Mingyu Jeon, Sunjae Yoon, Junyeong Kim
ACL (1)3