% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@ARTICLE{Shi:644957,
author = {Shi, Kehan and Burger, Martin},
title = {{H}ypergraph p-{L}aplacian {E}quations for {D}ata
{I}nterpolation and {S}emi-supervised {L}earning},
journal = {Journal of scientific computing},
volume = {103},
number = {3},
issn = {0885-7474},
address = {New York, NY [u.a.]},
publisher = {Springer Science + Business Media B.V.},
reportid = {PUBDB-2026-00500},
pages = {93},
year = {2025},
abstract = {Hypergraph learning with p-Laplacian regularization has
attracted a lot of attention due to its flexibility in
modeling higher-order relationships in data. This paper
focuses on its fast numerical implementation, which is
challenging due to the non-differentiability of the
objective function and the non-uniqueness of the minimizer.
We derive a hypergraph p-Laplacian equation from the
subdifferential of the p-Laplacian regularization. A
simplified equation that is mathematically well-posed and
computationally efficient is proposed as an alternative.
Numerical experiments verify that the simplified p-Laplacian
equation suppresses spiky solutions in data interpolation
and improves classification accuracy in semi-supervised
learning. The remarkably low computational cost enables
further applications.},
cin = {FS-CI},
ddc = {004},
cid = {I:(DE-H253)FS-CI-20230420},
pnm = {623 - Data Management and Analysis (POF4-623)},
pid = {G:(DE-HGF)POF4-623},
experiment = {EXP:(DE-MLZ)NOSPEC-20140101},
typ = {PUB:(DE-HGF)16},
doi = {10.1007/s10915-025-02908-y},
url = {https://bib-pubdb1.desy.de/record/644957},
}