Local Rademacher Complexity Bounds based on Covering Numbers

6 October 2015

Papers citing "Local Rademacher Complexity Bounds based on Covering Numbers"

6 / 6 papers shown

Title
Improved Diversity-Promoting Collaborative Metric Learning for Recommendation Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang 58 5 0 02 Sep 2024
Fitted Value Iteration Methods for Bicausal Optimal Transport Erhan Bayraktar Bingyan Han OT 37 6 0 22 Jun 2023
The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang 43 8 0 30 Sep 2022
Sample Complexity of Offline Reinforcement Learning with Deep ReLU Networks Thanh Nguyen-Tang Sunil R. Gupta Hung The Tran Svetha Venkatesh OffRL 70 7 0 11 Mar 2021
Optimistic bounds for multi-output prediction Henry W. J. Reeve A. Kabán 28 9 0 22 Feb 2020
Local Rademacher Complexity-based Learning Guarantees for Multi-Task Learning Niloofar Yousefi Yunwen Lei Marius Kloft M. Mollaghasemi G. Anagnostopoulos 23 29 0 18 Feb 2016