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

Keno Harada

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

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
Optimization for machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › stochastic optimization › adaptive gradient methods
adam convergence
0.812024
ADOPT: Modified Adam Can Converge with Any β2 with the Optimal Rate · NeurIPS 2024
Machine learning › Optimization for machine learning › stochastic optimization
adaptive gradient methods
0.812024
ADOPT: Modified Adam Can Converge with Any β2 with the Optimal Rate · NeurIPS 2024

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

convergence analysis · 0.8adam optimizer · 0.8
YearPublicationVenuePosition
2026 Automated Refinement of Essay Scoring Rubrics for Language Models via Reflect-and-Revise
abstract
Large Language Models (LLMs) are increasingly used for Automated Essay Scoring (AES), yet the scoring rubrics they rely on are typically designed for human raters and may not be optimal for LLMs.Inspired by the calibration process that human raters undergo before formal scoring, we propose Reflect-and-Revise, an iterative framework that refines scoring rubrics by prompting models to reflect on their own chain-of-thought rationales and score discrepancies with human labels.At each iteration, the model identifies scoring-error patterns from sampled mismatches and revises the rubric accordingly.Experiments on three essay scoring benchmarks (ASAP, ASAP 2.0, and TOEFL11) with three LLMs (GPT-5 mini, Gemini 3 Flash, and Qwen3-Next-80B-A3B-Instruct) demonstrate that our method yields improvements in Quadratic Weighted Kappa (QWK), achieving gains of up to +0.403 over human-authored rubrics.Starting from a minimal seed rubric that specifies only the score scale, our method matches or exceeds expert rubric performance in most dataset-model combinations, indicating that iterative refinement can reduce the manual effort of rubric authoring.Analysis of the refined rubrics reveals that the refinement process introduces explicit procedural structures, such as conditional gating rules and quantitative thresholds, that are absent from humanauthored rubrics, highlighting a gap between rubrics designed for human raters and those effective for LLMs. 1
Keno Harada, Lui Yoshida, Takeshi Kojima, Yusuke Iwasawa, Yutaka Matsuo
CoNLL1
2024 ADOPT: Modified Adam Can Converge with Any β2 with the Optimal Rate
Shohei Taniguchi, Keno Harada, Gouki Minegishi, Yuta Oshima, Seong Cheol Jeong, Go Nagahara, Tomoshi Iiyama, Masahiro Suzuki 0001, Yusuke Iwasawa, Yutaka Matsuo
NeurIPS2