Pith. sign in

REVIEW 1 cited by

On Hypothesis Transfer Learning of Functional Linear Models

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 2206.04277 v5 pith:TBQUF2C7 submitted 2022-06-09 stat.ML cs.LG

classification stat.MLcs.LG
keywords transferfunctionallearninglinearalgorithmsdataproposedrkhs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study the transfer learning (TL) for the functional linear regression (FLR) under the Reproducing Kernel Hilbert Space (RKHS) framework, observing that the TL techniques in existing high-dimensional linear regression are not compatible with the truncation-based FLR methods, as functional data are intrinsically infinite-dimensional and generated by smooth underlying processes. We measure the similarity across tasks using RKHS distance, allowing the type of information being transferred to be tied to the properties of the imposed RKHS. Building on the hypothesis offset transfer learning paradigm, two algorithms are proposed: one conducts the transfer when positive sources are known, while the other leverages aggregation techniques to achieve robust transfer without prior information about the sources. We establish asymptotic lower bounds for this learning problem and show that the proposed algorithms enjoy a matching upper bound. These analyses provide statistical insights into factors that contribute to the dynamics of the transfer. We also extend the results to functional generalized linear models. The effectiveness of the proposed algorithms is demonstrated via extensive synthetic data as well as real-world data applications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Sufficiency-principled Transfer Learning via Model Averaging

    stat.ME 2025-07 conditional novelty 6.0 of 10

    A sufficiency-penalized model averaging transfer learning method that adaptively selects informative domains, with convergence rates, optimality, and asymptotic normality.

Pith tools