Local Rademacher Complexity Bounds based on Covering Numbers

6 October 2015

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

8 / 8 papers shown

Title
Improved Diversity-Promoting Collaborative Metric Learning for Recommendation Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang 169 9 0 02 Sep 2024
Fitted Value Iteration Methods for Bicausal Optimal Transport Erhan Bayraktar Bingyan Han OT 113 10 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 95 9 0 30 Sep 2022
Understanding Deep Neural Function Approximation in Reinforcement Learning via $ε$ -Greedy Exploration Fanghui Liu Luca Viano Volkan Cevher 137 23 0 15 Sep 2022
Optimizing Two-way Partial AUC with an End-to-end Framework Zhiyong Yang Qianqian Xu Shilong Bao Yuan He Xiaochun Cao Qingming Huang 134 24 0 23 Jun 2022
Sample Complexity of Offline Reinforcement Learning with Deep ReLU Networks Thanh Nguyen-Tang Sunil R. Gupta Hung The Tran Svetha Venkatesh OffRL 190 7 0 11 Mar 2021
Optimistic bounds for multi-output prediction Henry W. J. Reeve A. Kabán 96 10 0 22 Feb 2020
Local Rademacher Complexity-based Learning Guarantees for Multi-Task Learning Niloofar Yousefi Yunwen Lei Matthias Kirchler M. Mollaghasemi G. Anagnostopoulos 155 29 0 18 Feb 2016