Robust Kernel-based Distribution Regression
Zhan Yu, Daniel W. C. Ho, Ding-Xuan Zhou

TL;DR
This paper introduces a robust distribution regression method using a flexible, non-convex loss function that enhances robustness and broadens the scope of kernel-based distribution regression, with comprehensive theoretical analysis of learning rates.
Contribution
It proposes a novel robust distribution regression scheme with a versatile loss function, extending beyond least squares, and provides theoretical learning rate analysis under various conditions.
Findings
The proposed loss function includes many popular loss functions.
Robustness and learning rates depend critically on the scaling parameter .
Theoretical analysis demonstrates improved learning behavior over traditional methods.
Abstract
Regularization schemes for regression have been widely studied in learning theory and inverse problems. In this paper, we study distribution regression (DR) which involves two stages of sampling, and aims at regressing from probability measures to real-valued responses over a reproducing kernel Hilbert space (RKHS). Recently, theoretical analysis on DR has been carried out via kernel ridge regression and several learning behaviors have been observed. However, the topic has not been explored and understood beyond the least square based DR. By introducing a robust loss function for two-stage sampling problems, we present a novel robust distribution regression (RDR) scheme. With a windowing function and a scaling parameter which can be appropriately chosen, can include a wide range of popular used loss functions that enrich the theme of DR. Moreover,…
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.
