Demo Data from EDBT 2026 / reviewers in the wild / expert
Keiya Sakabe
dblp:392/2419
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0003-8894-4400ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 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.
| Theoretical computer science
2 papers |
Mathematical optimization · 57% Automated reasoning and model checking · 38% Logic in computer science · 6% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Emerging computing paradigms · 100% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Emerging computing paradigms
quantum computer architecture |
1.0 | 1 | 2026 | Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions · LICS 2026 |
Emerging computing paradigms › quantum computer architecture
quantum programming |
1.0 | 1 | 2026 | Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions · LICS 2026 |
Automated reasoning and model checking
program verification |
1.0 | 1 | 2026 | Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions · LICS 2026 |
Automated reasoning and model checking › program verification
relational hoare logic |
1.0 | 1 | 2026 | Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions · LICS 2026 |
Mathematical optimization › continuous optimization
convex optimization |
0.8 | 1 | 2024 | Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and its Applications to Scaling Problems · FOCS 2024 |
Mathematical optimization
non-commutative optimization |
0.8 | 1 | 2024 | Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and its Applications to Scaling Problems · FOCS 2024 |
Mathematical optimization › continuous optimization › matrix optimization
operator scaling |
0.8 | 1 | 2024 | Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and its Applications to Scaling Problems · FOCS 2024 |
Mathematical optimization › riemannian optimization
riemannian gradient descent |
0.8 | 1 | 2024 | Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and its Applications to Scaling Problems · FOCS 2024 |
Logic in computer science
completeness |
0.3 | 1 | 2026 | Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions · LICS 2026 |
Methods — techniques the papers use, named apart from their topics
unbounded assertions · 2.0relational logic · 2.0moment-weight inequality · 0.8gradient flow analysis · 0.8duality theorem · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions
Gilles Barthe, Minbo Gao, Jam Kabeer Ali Khan, Matthijs Muis, Ivan Renison, Keiya Sakabe, Michael Walter 0005, Yingte Xu, Tianshi Yu, Li Zhou 0013 |
LICS | 6 |
| 2024 | Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and its Applications to Scaling ProblemsabstractIn this paper, we study asymptotic behaviors of continuous-time and discrete-time gradient flows of a “lower-unbounded” convex function on a Hadamard manifold, particularly, their convergence properties to the boundary at infinity. We establish a duality theorem that the infimum of the gradient-norm of a convex function is equal to the supremum of the negative of the recession function over the boundary, provided that the infimum is positive. Furthermore, the infimum and the supremum are obtained by the limits of the gradient flows of the function. Our results feature convex-optimization ingredients of the moment-weight inequality for reductive group actions by Georgoulas, Robbin, and Salamon, and are applied to noncommutative optimization by Bürgisser et al. FOCS 2019. We show that the gradient descent of the KempfNess function for an unstable orbit converges to a 1-parameter subgroup in the Hilbert-Mumford criterion, and the associated moment-map sequence converges to the minimum-norm point of the moment polytope. We show further refinements for operator scaling-the left-right action on a matrix tuple. We characterize the gradient-flow limit of operator scaling via a vector-space generalization of the classical Dulmage-Mendelsohn decomposition of a bipartite graph. Keiya Sakabe |
FOCS | 2 |