p-Laplacian Equations on Point Clouds

• p-Laplacian equations on point clouds are a nonlinear regularization framework that generalizes classical Laplacian methods to discrete, high-dimensional data with applications in semi-supervised learning and clustering.
• The discrete-to-continuum analysis shows that as sample sizes grow, solutions of the discrete p-Laplacian converge to those of weighted continuum PDEs, ensuring methodological consistency.
• Algorithmic strategies like SPDHG and PDE-inspired methods enable scalable optimization and robust label propagation, outperforming traditional approaches in low-label regimes and image inpainting tasks.

The $p$-Laplacian on point clouds is a nonlinear operator and associated regularization framework that generalizes classical Laplacian-based methods to accommodate nonlinearity and adaptivity in semi-supervised learning, interpolation, clustering, and related computational tasks on high-dimensional data clouds. Point cloud $p$-Laplacian methods formalize the extension of $p$-Dirichlet functionals, traditionally defined on Euclidean domains, to discretized settings where only finite samples from an unknown manifold or density are available. The theory encompasses both pairwise (graph) and higher-order (hypergraph) connectivities, with rigorous connections to continuum $p$-Laplacian PDEs established via variational and viscosity-solution frameworks. Core results demonstrate that as the number of data points increases while the number of labeled points remains fixed and under appropriate growth conditions on neighborhood parameters, minimizers and solutions on finite point clouds converge to solutions of weighted continuum $p$-Laplacian equations with mixed Dirichlet and Neumann boundary conditions.

1. Discrete $p$-Laplacian Models on Point Clouds

Given a finite set of points $$\Omega_n = \{x_1,\ldots,x_n\} \subset \Omega \subset \mathbb{R}^d$$ drawn i.i.d. from a Borel probability measure $\mu=\rho(x)\,dx$, the standard approach is to define a neighborhood structure via either:

• An $\varepsilon_n$-ball relation, connecting points within distance $\varepsilon_n$;
• A $p$0-nearest neighbor relation, connecting each point to its $p$1 nearest neighbors.

Weights are typically assigned via a radial, compactly supported kernel $p$2, possibly scaled to ensure locality and proper normalization. For graphs (pairwise relationships), the discrete $p$3-Dirichlet energy is

$p$4

with $p$5. For hypergraphs, the energy penalizes the maximal difference within each neighborhood: $p$6 where $p$7 denotes the neighborhood of $p$8 (edge or hyperedge) (Shi et al., 2024, Shi, 22 Jan 2026).

Boundary and labeling constraints are imposed via hard Dirichlet conditions $p$9 for a fixed label set $p$0.

2. Discrete-to-Continuum Limit and PDE Connections

A central result is the discrete-to-continuum consistency of such $p$1-Laplacian energies and associated equations. Under the key assumptions:

• $p$2 (to ensure coercivity and regularity in Sobolev spaces $p$3),
• the number of labeled points $p$4 is fixed as $p$5,
• the scale parameter $p$6 satisfies optimal-transport and connectivity lower bounds, e.g., $p$7,

the empirical solution $p$8 converges (almost surely in appropriate topologies) to the unique viscosity or variational solution $p$9 of the weighted $p$0-Laplace equation: $p$1 subject to label Dirichlet data at $p$2 and homogeneous Neumann conditions on $p$3 (Shi, 22 Jan 2026, Crook et al., 2019, Shi et al., 2024).

For hypergraph regularization, the corresponding continuum energy for the $p$4-ball case is

$p$5

while $p$6-NN constructions induce a density-weighted energy $p$7 (Shi et al., 2024).

3. Algorithmic Strategies and Numerical Schemes

Solving discrete $p$8-Laplacian regularization problems on point clouds leads to large-scale, convex but often non-differentiable optimization. Two major classes of algorithms have been proposed:

• Stochastic primal-dual hybrid gradient (SPDHG): This approach solves the hypergraph $p$9-Laplacian minimization by alternating updates of primal and dual variables, touching only a single hyperedge per iteration for scalability. The scheme exploits proximal mappings for the nonsmooth norms and enforces label constraints via projection (Shi et al., 2024).
• PDE-inspired methods: Alternatively, one may first estimate the sampling density via kernel or spline-based methods, then solve the continuum $p$0-Laplacian PDE using spectral discretization (e.g., on Chebyshev grids), imposing Dirichlet constraints and updating via semi-implicit or gradient-flow schemes (Crook et al., 2019).

The table summarizes key algorithmic ingredients for point cloud $p$1-Laplacian solvers:

Approach	Core Discretization	Label Handling
SPDHG (Shi et al., 2024)	Hypergraph, max norm	Projection/Prox
PDE-spectral (Crook et al., 2019)	Density + Chebyshev grid	Value clamping

4. Regularity, Stability, and Boundary Effects

For $p$2, regularity results guarantee that minimizers are Hölder-continuous, ensuring stable propagation of labels without the formation of large spikes or artifacts near labeled points in the large-sample limit (Shi, 22 Jan 2026, Shi et al., 2024). Unlike lower-order ($p$3) Laplacian regularization, which may form singularities or "spikes" around scarce labels as neighborhood size increases, hypergraph $p$4-Laplacian penalization (based on the maximum difference in each neighborhood) enforces a more global smoothness, exhibiting Lipschitz-regularity properties inherited from the continuum theory.

Boundary treatment in these frameworks avoids artificial "ghost nodes" or padding; the Neumann condition arises naturally from the sampling geometry and analytic consistency arguments.

5. Empirical Performance and Applications

Numerical experiments on synthetic interpolation, image inpainting, and label propagation tasks demonstrate:

• For one-dimensional interpolation with few labels, the hypergraph $p$5-Laplacian remains smooth and passes through labels as the neighborhood grows, in contrast to the graph $p$6-Laplacian, which develops spikes at labeled nodes (Shi et al., 2024).
• In semi-supervised classification (such as MNIST), hypergraph $p$7-Laplacian regularization significantly outperforms graph-based approaches at very low label rates, e.g., test accuracy of $p$8-$p$9 (hypergraph) vs. $p$0-$p$1 (graph) at $p$2 label rates, with both converging for larger label proportions (Shi et al., 2024).
• For image inpainting on patch manifolds, hypergraph regularization improves peak signal-to-noise ratio (PSNR) by $p$3-$p$4 dB and structural similarity index (SSIM) by $p$5-$p$6 over graph approaches at all sampling rates (Shi et al., 2024).

These results point toward the advantage of higher-order, nonlocal regularization in data-scarce regimes, as well as the inheritability of continuum PDE regularity even in highly discrete settings.

6. Theoretical and Practical Implications

Recent advances provide rigorous justification for the use of $p$7-Laplacian models—both graph-based and hypergraph-based—as discrete approximations to weighted $p$8-Laplacian PDEs on the underlying data manifold. For $p$9, the schemes recover Lipschitz learning along with its optimality guarantees. The hypergraph construction enhances expressivity by encoding higher-order affinities, and the convergence theory (via $$\Omega_n = \{x_1,\ldots,x_n\} \subset \Omega \subset \mathbb{R}^d$$0-convergence and viscosity solution arguments) extends to large-scale, sparse, and irregularly sampled data.

In manifold learning and semi-supervised contexts, these frameworks ensure well-posedness at very low sampling rates, resist label-spikes, and support scalable optimization. The choice of $$\Omega_n = \{x_1,\ldots,x_n\} \subset \Omega \subset \mathbb{R}^d$$1 modulates the interpolation behavior: as $$\Omega_n = \{x_1,\ldots,x_n\} \subset \Omega \subset \mathbb{R}^d$$2 increases, solutions become closer to piecewise-constant, and interfaces align with minimal-perimeter sets, as formalized for classification and clustering models incorporating $$\Omega_n = \{x_1,\ldots,x_n\} \subset \Omega \subset \mathbb{R}^d$$3-Laplacian regularization (Cristoferi et al., 2018, Shi et al., 2024).

7. Extensions and Ongoing Directions

Extensions to anisotropic weights, phase transition models with nonlocal Ginzburg–Landau penalties, and density-weighted variants are well-established (Cristoferi et al., 2018). Optimal-transport-based frameworks provide additional flexibility in comparing discrete and continuum energies. Further research addresses fast solvers, adaptive neighborhood selection, and the role of $$\Omega_n = \{x_1,\ldots,x_n\} \subset \Omega \subset \mathbb{R}^d$$4 in high-dimensional scaling. A plausible implication is that as sampling density increases and higher-order connectivity is exploited, the correspondence between point cloud $$\Omega_n = \{x_1,\ldots,x_n\} \subset \Omega \subset \mathbb{R}^d$$5-Laplacian regularization and continuum geometric variational methods strengthens, supporting principled development of nonlinear, data-driven regularization schemes across learning and signal processing tasks (Shi, 22 Jan 2026, Shi et al., 2024, Crook et al., 2019).