Abstract
We propose a bias corrected regularization kernel ranking (BCRKR) method and characterize the asymptotic bias and variance of the estimated ranking score function. The results show that BCRKR has smaller asymptotic bias than the traditional regularization kernel ranking (RKR) method. The variance of BCRKR has the same order of decay as that of RKR when the sample size goes to infinity. Therefore, BCRKR is expected to be as effective as RKR and its smaller bias favors its use in block wise data analysis such as distributed learning for big data. The proofs make use of a concentration inequality of integral operator U-statistic.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
