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

Kunjie Ren

dblp:421/0397 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 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.

Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › continuous optimization › convex optimization
oracle complexity
0.912025
A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization · ICML 2025
Mathematical optimization
stochastic optimization
0.912025
A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization · ICML 2025
Mathematical optimization › black-box optimization
zeroth-order optimization
0.912025
A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization · ICML 2025

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

finite differences · 0.9adaptive smoothing · 0.9
YearPublicationVenuePosition
2025 A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization
abstract
This paper studies zeroth-order optimization for stochastic convex minimization problems. We propose a parameter-free stochastic zeroth-order method (POEM), which introduces a step-size scheme based on the distance over finite difference and an adaptive smoothing parameter. Our theoretical analysis shows that POEM achieves near-optimal stochastic zeroth-order oracle complexity. Furthermore, numerical experiments demonstrate that POEM outperforms existing zeroth-order methods in practice.
Kunjie Ren, Luo Luo
ICML1