EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Decentralized First-Order Methods Under Hölder Continuous Gradients: A Numerical Study on a Reaction-Diffusion Equation and Multi-Slice Sparse Reconstruction

Yuxuan Song

Algorithms · 18.11.2026 · 19 (11) · 1015

DOI: 10.3390/a19111015 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithms, online erschienen am 18.11.2026. Verfasst von Yuxuan Song. Die Arbeit nennt 50 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Fixed-step gradient methods for objectives whose gradient is Hölder but not Lipschitz continuous stagnate at a step-dependent error level, and the standard analyses of exact decentralized methods such as gradient tracking assume Lipschitz gradients. This paper is a numerical study of what decentralized first-order methods do in that regime, on two small test problems: a two-dimensional steady reaction-diffusion equation with a fractional reaction order and a dead core (121 unknowns and 4 workers in the main runs, up to 2209 unknowns and 16 workers in a scaling study), and multi-slice sparse reconstruction with a shared/private image model (four 64×64 synthetic slices, plus eight 128×128 slices of a real brain template). On the reaction-diffusion problem, gradient tracking needs 828 iterations to reach a relative error of 10−3 against 67 for forward Euler and 12 for backward Euler, and, once the backward-Euler steps are solved accurately, it is also far less accurate than backward Euler. Forward Euler distributed by strips needs only neighbour exchange as well, so on this problem gradient tracking offers no advantage; the problem serves as a controlled test of its behaviour under Hölder gradients. In reconstruction, the decentralized solution differs from the pooled-data solution by 0.050±0.006 dB over 25 synthetic instances, and the shared/private model gains 2.46±0.09 dB over per-slice reconstruction; the gain survives smooth anatomical drift and moderate intensity variation but is lost under a one-pixel misregistration. With a fixed step, the disagreement between workers does not vanish: it settles on a floor that persists without the private variables and with them frozen, disappears at the Lipschitz exponent and under a smoothed penalty, and follows a power of the step size whose fitted exponent (1.61±0.05 with the private step fixed, 1.50 with it proportional) depends on the step protocol. A proximal form of gradient tracking removes the floor.

Zitieren

APA

Song, Y. (2026). Decentralized First-Order Methods Under Hölder Continuous Gradients: A Numerical Study on a Reaction-Diffusion Equation and Multi-Slice Sparse Reconstruction. Algorithms, 19(11), 1015. https://doi.org/10.3390/a19111015

Vancouver

Song Y. Decentralized First-Order Methods Under Hölder Continuous Gradients: A Numerical Study on a Reaction-Diffusion Equation and Multi-Slice Sparse Reconstruction. Algorithms. 2026;19(11):1015. doi:10.3390/a19111015

BibTeX
@article{Song2026,
  author = {Song, Yuxuan},
  title = {Decentralized First-Order Methods Under Hölder Continuous Gradients: A Numerical Study on a Reaction-Diffusion Equation and Multi-Slice Sparse Reconstruction},
  journal = {Algorithms},
  year = {2026},
  volume = {19},
  number = {11},
  pages = {1015},
  doi = {10.3390/a19111015}
}
Kostenlos starten →