29 citations · 46 across the 7 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.AP2020
Average-distance problem with curvature penalization for data parameterization: regularity of minimizers
Xinyang Lu, Dejan Slepcev
We propose a model for finding one-dimensional structure in a given measure. Our approach is based on minimizing an objective functional which combines the average-distance functio…
math.ST2020★ 4 cited
Rates of Convergence for Laplacian Semi-Supervised Learning with Low Labeling Rates
Jeff Calder, Dejan Slepčev, Matthew Thorpe
We study graph-based Laplacian semi-supervised learning at low labeling rates. Laplacian learning uses harmonic extension on a graph to propagate labels. At very low label rates, L…
cs.LG2020★ 29 cited
Poisson Learning: Graph Based Semi-Supervised Learning At Very Low Label Rates
Jeff Calder, Brendan Cook, Matthew Thorpe +1
We propose a new framework, called Poisson learning, for graph based semi-supervised learning at very low label rates. Poisson learning is motivated by the need to address the dege…