Scores are our LLM-assisted heuristics (methodology), not peer review or citation counts. Author pages are generated from paper metadata; name variants may split one person across pages.
arXiv author page →
Papers, ranked by score
Ordered by a blend of empirical rigor (60%) and math complexity (40%).
We propose an optimal iterative scheme for federated transfer learning, where a central planner has access to datasets " D"1,," D"N for the same learning model f_θ. Our objective is to minimize the cumulative deviation of the generated parameters “θ_i(t)"“t=0”^T across all T iterations from the…
Holy GrailMath 8.5Rigor 6.0
Costs: Not applicableOut-of-sample: NoneResolution: Synthetic Data
Traditional mean-field game (MFG) solvers operate on an instance-by-instance basis, which becomes infeasible when many related problems must be solved (e.g., for seeking a robust description of the solution under perturbations of the dynamics or utilities, or in settings involving…
Dynamic Stackelberg games are a broad class of two-player games in which the leader acts first, and the follower chooses a response strategy to the leader’s strategy. Unfortunately, only stylized Stackelberg games are explicitly solvable since the follower’s best-response operator (as a function of…
Lab RatsMath 9.5Rigor 2.0
More details
Authors
Guillermo Alvarez, Ibrahim Ekren, Anastasis Kratsios, Xuwei Yang