ORCCA: Optimal Randomized Canonical Correlation Analysis
원문 초록
Random features approach has been widely used for kernel approximation in large-scale machine learning. A number of recent studies have explored data-dependent sampling of features, modifying the stochastic oracle from which random features are sampled. While proposed techniques in this realm improve the approximation, their suitability is often verified on a single learning task. In this paper, we propose a task-specific scoring rule for selecting random features, which can be employed for different applications with some adjustments. We restrict our attention to Canonical Correlation Analysis (CCA), and we provide a novel, principled guide for finding the score function maximizing the canonical correlations. We prove that this method, called ORCCA, can outperform (in expectation) the corresponding Kernel CCA with a default kernel. Numerical experiments verify that ORCCA is significantly superior than other approximation techniques in the CCA task.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
h-calibration: Rethinking Classifier Recalibration with Probabilistic Error-Bounded Objective
Enforcing tail calibration when training probabilistic forecast models
Harnessing Superclasses for Learning from Hierarchical Databases
Bayesian Autoregressive Online Change-Point Detection with Time-Varying Parameters
Improving probabilistic forecasts of extreme wind speeds by training statistical post-processing models with weighted scoring rules
Distributional Regression U-Nets for the Postprocessing of Precipitation Ensemble Forecasts
토론
이 논문과 연결된 포럼 글이 아직 없습니다.