# The dual IRLS scheme for (hyper-)graph p-Laplacians and ℓp regression with large exponents

arXiv: https://arxiv.org/abs/2603.26061 · HTML: https://mlsanity.com/paper/2603.26061/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Mar 2026.

## Built on by (most cited first, 1 of 1)

- [A Near-Linear-Time Solver for Graph p-Laplacian Semi-Supervised Learning via Continuation in p](https://mlsanity.com/paper/2607.03503/) (2026)

## Abstract (arXiv)

We introduce an iterative scheme for discrete convex minimization problems of p-Laplace type such as variational graph p-Laplace problems and ℓp regression. In each iteration, the scheme solves only a weighted least-squares problem. We verify linear convergence for suitably regularized problems and derive convergence to any prescribed tolerance.