Sharper generalisation bounds for pairwise learning
Pairwise learning refers to learning tasks with loss functions depending on a pair of training examples, which includes ranking and metric learning as specific examples. Recently, there has been an increasing amount of attention on the generalization analysis of pairwise learning to understand its p...
محفوظ في:
المؤلفون الرئيسيون: | LEI, Yunwen, LEDENT, Antoine, KLOFT, Marius |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2020
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/7208 https://ink.library.smu.edu.sg/context/sis_research/article/8211/viewcontent/NeurIPS_2020_sharper_generalization_bounds_for_pairwise_learning_Paper.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
Fine-grained generalization analysis of vector-valued learning
بواسطة: WU, Liang, وآخرون
منشور في: (2021) -
Improved generalisation bounds for deep learning through L∞ covering numbers
بواسطة: LEDENT, Antoine, وآخرون
منشور في: (2019) -
Norm-based generalisation bounds for deep multi-class convolutional neural networks
بواسطة: LEDENT, Antoine, وآخرون
منشور في: (2021) -
Fine-grained analysis of structured output prediction
بواسطة: MUSTAFA, Waleed, وآخرون
منشور في: (2021) -
Fine-grained generalization analysis of inductive matrix completion
بواسطة: LEDENT, Antoine, وآخرون
منشور في: (2021)