Pith. sign in

REVIEW 2 cited by

Non-parametric regression for robot learning on manifolds

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.19561 v2 pith:WD2T5NJD submitted 2023-10-30 cs.RO cs.LG

classification cs.ROcs.LG
keywords datamanifoldlearningmanifold-valuedmanifoldsrobotaccuracyalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Many of the tools available for robot learning were designed for Euclidean data. However, many applications in robotics involve manifold-valued data. A common example is orientation; this can be represented as a 3-by-3 rotation matrix or a quaternion, the spaces of which are non-Euclidean manifolds. In robot learning, manifold-valued data are often handled by relating the manifold to a suitable Euclidean space, either by embedding the manifold or by projecting the data onto one or several tangent spaces. These approaches can result in poor predictive accuracy, and convoluted algorithms. In this paper, we propose an "intrinsic" approach to regression that works directly within the manifold. It involves taking a suitable probability distribution on the manifold, letting its parameter be a function of a predictor variable, such as time, then estimating that function non-parametrically via a "local likelihood" method that incorporates a kernel. We name the method kernelised likelihood estimation. The approach is conceptually simple, and generally applicable to different manifolds. We implement it with three different types of manifold-valued data that commonly appear in robotics applications. The results of these experiments show better predictive accuracy than projection-based algorithms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Unified Framework for Probabilistic Dynamic-, Trajectory- and Vision-based Virtual Fixtures

    cs.RO 2025-06 conditional novelty 6.0 of 10

    A unified probabilistic virtual-fixture framework fuses dynamical-system, trajectory, and vision-based haptic guidance through uncertainty-weighted arbitration and variable impedance, supporting manual, semi-automated...

  2. A cheat sheet for probability distributions of orientational data

    stat.ME 2024-12 conditional novelty 3.0 of 10

    A review-style cheat sheet that compiles existing orientation distributions (von Mises, vMF, Kent, Bingham, ACG, Matrix Fisher, tangent-space Gaussians) with fitting and sampling recipes, plus a Python library and two...

Pith tools