On the Generalization Power of the Overfitted Three-Layer Neural Tangent Kernel Model

von Ju, Peizhong
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 34 of 50 (2023)

Provably Efficient Model-Free Constrained RL with Linear Function Approximation

von Ghosh, Arnob
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 18 of 50 (2023)

A Faster FPTAS for Knapsack Problem with Cardinality Constraint

von Li, Wenxin
Veröffentlicht in WAOA (18. : 2020 : Online) Approximation and Online Algorithms (2021)

ON SAMPLE COMPLEXITY UPPER AND LOWER BOUNDS FOR EXACT RANKING FROM NOISY COMPARISONS

von Ren, Wenbo
Veröffentlicht in NeurIPS (33. : 2019 : Vancouver, British Columbia) 32nd Conference on Neural Information Processing Systems (NeurIPS 2019) ; Volume 13 of 20 (2020)

Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons

von Ren, Wenbo
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 6 of 36 (2022)

ON THE GENERALIZATION POWER OF OVERFITTED TWO-LAYER NEURAL TANGENT KERNEL MODELS

von JU, PEIZHONG
Veröffentlicht in International Conference on Machine Learning (38. : 2021 : Online) International Conference on Machine Learning (ICML 2021 ; Part 7 of 16 (2022)

THE SAMPLE COMPLEXITY OF BEST-K ITEMS SELECTION FROM PAIRWISE COMPARISONS

von Ren, Wenbo
Veröffentlicht in International Conference on Machine Learning (37. : 2020 : Online) 37th International Conference on Machine Learning (ICML 2020) ; Part 11 of 15 (2021)