A nonlinear aggregation type classifier
Alejandro Cholaquidis, Ricardo Fraiman, Juan Kalemkerian, Pamela Llop

TL;DR
This paper proposes a nonlinear aggregation classifier for functional data that combines multiple classifiers, ensuring consistency and asymptotic optimality, with demonstrated effectiveness through simulations and real data analysis.
Contribution
It introduces a novel nonlinear aggregation rule for functional data classification that guarantees consistency and asymptotic optimality when combining arbitrary classifiers.
Findings
Aggregation rule is consistent if individual classifiers are consistent.
Asymptotically, the rule performs as well as the best individual classifier.
Simulation and real data results demonstrate effectiveness.
Abstract
We introduce a nonlinear aggregation type classifier for functional data defined on a separable and complete metric space. The new rule is built up from a collection of arbitrary training classifiers. If the classifiers are consistent, then so is the aggregation rule. Moreover, asymptotically the aggregation rule behaves as well as the best of the classifiers. The results of a small simulation are reported both, for high dimensional and functional data, and a real data example is analyzed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
