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

Jaehyeon Jeong

dblp:405/3974 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—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
Language models and text generation · 87% Vision and language · 13%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › prompt tuning
black-box prompt tuning
0.912025
ZIP: An Efficient Zeroth-order Prompt Tuning for Black-box Vision-Language Models · ICLR 2025
Natural language and speech › Language models and text generation
prompt tuning
0.912025
ZIP: An Efficient Zeroth-order Prompt Tuning for Black-box Vision-Language Models · ICLR 2025
Computer vision › Vision and language
vision-language model
0.312025
ZIP: An Efficient Zeroth-order Prompt Tuning for Black-box Vision-Language Models · ICLR 2025

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

zeroth-order optimization · 0.9low-rank reparameterization · 0.9
YearPublicationVenuePosition
2025 ZIP: An Efficient Zeroth-order Prompt Tuning for Black-box Vision-Language Models
abstract
Recent studies have introduced various approaches for prompt-tuning black-box vision-language models, referred to as black-box prompt-tuning (BBPT). While BBPT has demonstrated considerable potential, it is often found that many existing methods require an excessive number of queries (i.e., function evaluations), which poses a significant challenge in real-world scenarios where the number of allowed queries is limited. To tackle this issue, we propose Zeroth-order Intrinsic-dimensional Prompt-tuning (ZIP), a novel approach that enables efficient and robust prompt optimization in a purely black-box setting. The key idea of ZIP is to reduce the problem dimensionality and the variance of zeroth-order gradient estimates, such that the training is done fast with far less queries. We achieve this by re-parameterizing prompts in low-rank representations and designing intrinsic-dimensional clipping of estimated gradients. We evaluate ZIP on 13+ vision-language tasks in standard benchmarks and show that it achieves an average improvement of approximately 6% in few-shot accuracy and 48% in query efficiency compared to the best-performing alternative BBPT methods, establishing a new state of the art. Our ablation analysis further shows that the proposed clipping mechanism is robust and nearly optimal, without the need to manually select the clipping threshold, matching the result of expensive hyperparameter search.
Seonghwan Park 0003, Jaehyeon Jeong, Jaeho Lee 0001, Namhoon Lee
ICLR2