Demo Data from EDBT 2026 / reviewers in the wild / expert
Rohit Dhaipule
dblp:346/2908
· DBLP profile ↗
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 2021Graphics, computer vision, multimedia, augmented reality and games · 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 |
Efficient and distributed learning · 67% Optimization for machine learning · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
bilevel optimization |
0.9 | 1 | 2025 | Federated Stochastic Bilevel Optimization with Fully First-Order Gradients · IJCAI 2025 |
Machine learning › Efficient and distributed learning › federated learning › federated optimization
federated bilevel optimization |
0.9 | 1 | 2025 | Federated Stochastic Bilevel Optimization with Fully First-Order Gradients · IJCAI 2025 |
Machine learning › Efficient and distributed learning
federated learning |
0.9 | 1 | 2025 | Federated Stochastic Bilevel Optimization with Fully First-Order Gradients · IJCAI 2025 |
Methods — techniques the papers use, named apart from their topics
variance reduction · 0.9first-order gradient descent · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Federated Stochastic Bilevel Optimization with Fully First-Order GradientsabstractFederated stochastic bilevel optimization has been actively studied in recent years due to its widespread applications in machine learning. However, most existing federated stochastic bilevel optimization algorithms require the computation of second-order Hessian and Jacobian matrices, which leads to longer running times in practice. To address these challenges, we propose a novel federated stochastic variance-reduced bilevel gradient descent algorithm that relies solely on first-order oracles. Specifically, our approach does not require the computation of second-order Hessian and Jacobian matrices, significantly reducing running time. Furthermore, we introduce a novel learning rate mechanism, i.e., a constant single-time-scale learning rate, to coordinate the update of different variables. We also present a new strategy to establish the convergence rate of our algorithm. Finally, the extensive experimental results confirm the efficacy of our proposed algorithm. Rohit Dhaipule, Chiu C. Tan 0001, Haibin Ling, Hongchang Gao |
IJCAI | 2 |