| Home > Publications database > Hypergraph p -Laplacian regularization on point clouds for data interpolation |
| Journal Article | PUBDB-2026-01165 |
;
2025
Elsevier, Pergamon Press
Amsterdam [u.a.]
This record in other databases:
Please use a persistent id in citations: doi:10.1016/j.na.2025.113807
Report No.: arXiv:2405.01109
Abstract: As a generalization of graphs, hypergraphs are widely used to model higher-order relationsin data. This paper explores the benefit of the hypergraph structure for the interpolationof point cloud data that contain no explicit structural information. We define the ππ-ballhypergraph and the ππ-nearest neighbor hypergraph on a point cloud and study the π-Laplacian regularization on the hypergraphs. We prove the variational consistency betweenthe hypergraph π-Laplacian regularization and the continuum π-Laplacian regularization in asemisupervised setting when the number of points π goes to infinity while the number oflabeled points remains fixed. A key improvement compared to the graph case is that the resultsrely on weaker assumptions on the upper bound of ππ and ππ. To solve the convex but non-differentiable large-scale optimization problem, we utilize the stochastic primalβdual hybridgradient algorithm. Numerical experiments on data interpolation verify that the hypergraphπ-Laplacian regularization outperforms the graph π-Laplacian regularization in preventing thedevelopment of spikes at the labeled points.
|
The record appears in these collections: |
Preprint
Hypergraph $p$-Laplacian regularization on point clouds for data interpolation
[10.3204/PUBDB-2025-04757]
Files
Fulltext by arXiv.org
BibTeX |
EndNote:
XML,
Text |
RIS