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...
Saved in:
Main Authors: | LEI, Yunwen, LEDENT, Antoine, KLOFT, Marius |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2020
|
Subjects: | |
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Fine-grained generalization analysis of vector-valued learning
by: WU, Liang, et al.
Published: (2021) -
Improved generalisation bounds for deep learning through L∞ covering numbers
by: LEDENT, Antoine, et al.
Published: (2019) -
Norm-based generalisation bounds for deep multi-class convolutional neural networks
by: LEDENT, Antoine, et al.
Published: (2021) -
Fine-grained analysis of structured output prediction
by: MUSTAFA, Waleed, et al.
Published: (2021) -
Fine-grained generalization analysis of inductive matrix completion
by: LEDENT, Antoine, et al.
Published: (2021)