Demo Data from SIGIR 2026 / reviewers in the wild / expert
Parham Yazdkhasti
dblp:398/3815
· 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 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% | |
| Artificial intelligence
1 paper |
Multi-agent systems · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Multi-agent systems › game theory
multi-player games |
0.9 | 1 | 2025 | Decoupled SGDA for Games with Intermittent Strategy Communication · ICML 2025 |
Mathematical optimization › stochastic optimization › stochastic gradient methods
stochastic gradient descent ascent |
0.9 | 1 | 2025 | Decoupled SGDA for Games with Intermittent Strategy Communication · ICML 2025 |
Mathematical optimization
stochastic optimization |
0.9 | 1 | 2025 | Decoupled SGDA for Games with Intermittent Strategy Communication · ICML 2025 |
Distributed systems
distributed optimization |
0.3 | 1 | 2025 | Decoupled SGDA for Games with Intermittent Strategy Communication · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
stochastic gradient descent ascent · 2.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Decoupled SGDA for Games with Intermittent Strategy CommunicationabstractWe introduce *Decoupled SGDA*, a novel adaptation of Stochastic Gradient Descent Ascent (SGDA) tailored for multiplayer games with intermittent strategy communication. Unlike prior methods, Decoupled SGDA enables players to update strategies locally using outdated opponent strategies, significantly reducing communication overhead. For Strongly-Convex-Strongly-Concave (SCSC) games, it achieves near-optimal communication complexity comparable to the best-known GDA rates. For *weakly coupled* games where the interaction between players is lower relative to the non-interactive part of the game, Decoupled SGDA significantly reduces communication costs compared to standard SGDA. Additionally, *Decoupled SGDA* outperforms federated minimax approaches in noisy, imbalanced settings. These results establish *Decoupled SGDA* as a transformative approach for distributed optimization in resource-constrained environments. Ali Zindari, Parham Yazdkhasti, Anton Rodomanov, Tatjana Chavdarova, Sebastian U. Stich |
ICML | 2 |