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.

Gyumin Roh

dblp:323/9293 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 1 · 1 since 2021Security and privacy · 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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 87% Cryptographic protocols and secure computation · 13%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments › polynomial commitment
multilinear polynomial commitments
1.012026
Jagged Polynomial Commitments (or: How to Stack Multilinears) · EUROCRYPT (7) 2026
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
polynomial commitment
1.012026
Jagged Polynomial Commitments (or: How to Stack Multilinears) · EUROCRYPT (7) 2026
Mathematical optimization › continuous optimization › convex optimization › first-order methods › gradient-based optimization
accelerated gradient methods
0.612022
Continuous-Time Analysis of Accelerated Gradient Methods via Conservation Laws in Dilated Coordinate Systems · ICML 2022
Mathematical optimization
continuous-time analysis
0.612022
Continuous-Time Analysis of Accelerated Gradient Methods via Conservation Laws in Dilated Coordinate Systems · ICML 2022
Mathematical optimization
gradient descent
0.612022
Continuous-Time Analysis of Accelerated Gradient Methods via Conservation Laws in Dilated Coordinate Systems · ICML 2022
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.312026
Jagged Polynomial Commitments (or: How to Stack Multilinears) · EUROCRYPT (7) 2026

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

stacking · 1.0polynomial commitment · 1.0symplectic euler discretization · 0.6dilated coordinate systems · 0.6
YearPublicationVenuePosition
2026 Jagged Polynomial Commitments (or: How to Stack Multilinears)
Tamir Hemo, Kevin Jue, Eugene Rabinovich, Gyumin Roh, Ron Rothblum
EUROCRYPT (7)4
2022 Continuous-Time Analysis of Accelerated Gradient Methods via Conservation Laws in Dilated Coordinate Systems
abstract
We analyze continuous-time models of accelerated gradient methods through deriving conservation laws in dilated coordinate systems. Namely, instead of analyzing the dynamics of $X(t)$, we analyze the dynamics of $W(t)=t^\alpha(X(t)-X_c)$ for some $\alpha$ and $X_c$ and derive a conserved quantity, analogous to physical energy, in this dilated coordinate system. Through this methodology, we recover many known continuous-time analyses in a streamlined manner and obtain novel continuous-time analyses for OGM-G, an acceleration mechanism for efficiently reducing gradient magnitude that is distinct from that of Nesterov. Finally, we show that a semi-second-order symplectic Euler discretization in the dilated coordinate system leads to an $\mathcal{O}(1/k^2)$ rate on the standard setup of smooth convex minimization, without any further assumptions such as infinite differentiability.
Jaewook J. Suh, Gyumin Roh, Ernest K. Ryu
ICML2