Spectral algorithms for learning with dependent observations

DOI10.1016/J.CAM.2023.115437MaRDI QIDQ6049257zbMATH OpenFDO

Authors Hongzhi Tong, Michael Ng

Publication date 17 October 2023

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2023.115437

zbMATH Keywords

regularizationreproducing kernel Hilbert spacestrongly mixing sequencelearning ratesspectral algorithms

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22)

Recommendations

• Learning theory of distributed spectral algorithms
• Learning from dependent observations
• Spectral Algorithms for Supervised Learning
• Regularized least square regression with dependent samples
• Learning rates of regularized regression for exponentially strongly mixing sequence

Cites work

• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• scientific article; zbMATH DE number 7306853 (Why is no real title available?)
• scientific article; zbMATH DE number 3103067 (Why is no real title available?)
• A CENTRAL LIMIT THEOREM AND A STRONG MIXING CONDITION
• A note on application of integral operator in learning theory
• Distributed learning with regularized least squares
• Fast learning from \(\alpha\)-mixing observations
• Introduction to strong mixing conditions. Vol. 3.
• Kernel ridge vs. principal component regression: minimax bounds and the qualification of regularization operators
• Learning Bounds for Kernel Regression Using Effective Data Dimensionality
• Learning from examples as an inverse problem
• Learning rates of regularized regression for exponentially strongly mixing sequence
• Learning theory estimates via integral operators and their approximations
• Learning theory estimates with observations from general stationary stochastic processes
• Learning theory of distributed spectral algorithms
• Minimum complexity regression estimation with weakly dependent observations
• Mixing: Properties and examples
• On learning with integral operators
• On regularization algorithms in learning theory
• Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces
• Optimal rates for the regularized least-squares algorithm
• Parallelizing spectrally regularized kernel algorithms
• Regularized least square regression with dependent samples
• Regularized semi-supervised least squares regression with dependent samples
• Signal Sampling and Recovery Under Dependent Errors
• Some Limit Theorems for Random Functions. I
• Some Limit Theorems for Stationary Processes
• Spectral Algorithms for Supervised Learning
• Theory of Reproducing Kernels

This page was built for publication: Spectral algorithms for learning with dependent observations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6049257)