Metropolis-Hastings with Levy jumps prevents entrapment in weighted random walks, yielding a convergence rate that accounts for data heterogeneity, network spectral gap, and jump probability.
Parallel coordinate descent methods for big data optimization
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
SC-DN establishes a global first-order stationary point per round and solves a mixed-integer signomial program to optimize four control variables for VFL, yielding better classification performance and lower resource use than greedy baselines on image and multi-modal data.
citing papers explorer
-
Decentralized Learning via Random Walk with Jumps
Metropolis-Hastings with Levy jumps prevents entrapment in weighted random walks, yielding a convergence rate that accounts for data heterogeneity, network spectral gap, and jump probability.
-
Optimizing Server Placement for Vertical Federated Learning in Dynamic Edge/Fog Networks
SC-DN establishes a global first-order stationary point per round and solves a mixed-integer signomial program to optimize four control variables for VFL, yielding better classification performance and lower resource use than greedy baselines on image and multi-modal data.