Pith. sign in

REVIEW 2 cited by

Biomechanical surrogate modelling using stabilized vectorial greedy kernel methods

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 2004.12670 v2 pith:JL4GJLZS submitted 2020-04-27 math.NA cs.LGcs.NA

classification math.NAcs.LGcs.NA
keywords algorithmsmodellingapproximationgreedykernelstabilizedvectorialvkoga
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Greedy kernel approximation algorithms are successful techniques for sparse and accurate data-based modelling and function approximation. Based on a recent idea of stabilization of such algorithms in the scalar output case, we here consider the vectorial extension built on VKOGA. We introduce the so called $\gamma$-restricted VKOGA, comment on analytical properties and present numerical evaluation on data from a clinically relevant application, the modelling of the human spine. The experiments show that the new stabilized algorithms result in improved accuracy and stability over the non-stabilized 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. State-Dependent Observation Noise Reintroduces Epistemic Value in Linear-Gaussian Active Inference

    q-bio.NC 2026-07 conditional novelty 5.0 of 10

    State-dependent observation noise, evaluated at a control-dependent belief mean, makes a linear-Gaussian active-inference agent's posterior covariance and (for scalar observations) epistemic value action-dependent, an...

  2. A mapping of the Min-Sum decoder to reduction operations, and its implementation using CUDA kernels

    cs.IT 2025-07 reject novelty 3.0 of 10

    The Min-Sum LDPC decoder is restated as masked matrix reductions and implemented with CUDA kernels that take the parity matrix as a runtime argument, with throughput measured on a CCSDS quasi-cyclic code.

Pith tools