KZKunjin Zou

Kunjin Zou

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Kunjin Zou has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Understanding generalization of functional linear regression from non-i.i.d. sample viewpoint

    by Kunjin Zou, Jianhao Tan, Chenchen Li, Ailong Feng, Bin Zou

    The known works on the generalization of functional linear regression are usually based on the assumption of independently and identically distributed (i.i.d.) sample and this i.i.d. assumption does not hold in many machine learning applications. In this paper, we want to understand the generalization ability of functional regularized least squares regression (FRLSR) and functional Huber linear regression (FHLR) from non-i.i.d. sample perspective. We first establish the generalization bounds of the FRLSR based on exponentially strongly mixing sequence (e.s.m.s.) and uniformly ergodic Markov chain (u.e.M.c.) samples, respectively. Since the solution of FRLSR may suffer from lack of robustness and be spoiled by outliers, fHLR can enhance the robustness of the squared error loss function to outliers, we then research the generalization bounds of FHLR based on e.s.m.s. and u.e.M.c. samples, respectively. These established results show that FRLSR and FHLR based on non-i.i.d. samples are consistent and the corresponding learning rates are same as that of i.i.d. sample.

  • Functional incremental least square regression algorithm

    by Yujing Shen, Kunjin Zou, Bin Zou, Jie Xu, Jingjing Zeng

    Functional linear regression is one of the main modeling tools for working with functional data. Since functional data are usually stream data essentially and there are some noises in functional data. Many numerical research studies of machine learning indicate that the noise samples not only increase the amount of storage space, but also affect the performance of algorithm. Therefore, in this paper we consider a new learning strategy by introducing incremental learning, Markov sampling for functional linear regression and propose a novel functional incremental linear square regression algorithm based on Markov sampling (FILSR-MS). To have a better understanding of the proposed FILSR-MS, we not only estimate the generalization bound of the proposed algorithm and establish the fast learning rate, but also present some useful discussions. The performance of the proposed algorithm is validated by the numerical experiments for benchmark repository.