An optimization problem on the sphere

Simple item page
dc.creatorMaurer, Andreas
dc.date2008-05-15
dc.date.accessioned2026-07-07T09:39:08Z
dc.date.available2026-07-07T09:39:08Z
dc.descriptionWe prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existence and uniqueness result for an optimal algorithm for halfspace learning, when data and target functions are drawn from the uniform distribution.
dc.identifierhttps://arxiv.org/abs/0805.2362
dc.identifierhttp://arxiv.org/abs/0805.2362
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/161057
dc.subjectMachine Learning
dc.subjectComputational Geometry
dc.titleAn optimization problem on the sphere
dc.typetext

Files

Collections

arXiv