arXiv (All)
open access
Fast Convergence on Perfect Classification for Functional Data
We investigate the availability of approaching perfect classification on functional data with finite samples. The seminal work (Delaigle and Hall (2012)) showed that perfect classification for functional data is easier to achieve than for finite-dimensional data. This result is based on their findin
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Adaptively Truncated Signature-based Logistic Regression for Semi-parametric Functional Classification#1128507
- Efficient Neural Field Learning via Adaptive Coverage and Focused Sampling#1186724
- Selection of functional predictors and smooth coefficient estimation for scalar-on-function regression models#1232602
- Grouped Semi-Supervised Estimation of Two-Sample Functionals via Single-Index Conditional Imputation#1061420
- Simultaneous Change-Point Inference for High-Dimensional Functional Time Series#972029
Record · ID 1327168
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive