Pages that link to "Item:Q1959489"

The following pages link to Transfer bounds for linear feature learning (Q1959489):

Displaying 10 items.

• A chain rule for the expected suprema of Gaussian processes (Q329618) (← links)
• Slepian's inequality for Gaussian processes with respect to weak majorization (Q389178) (← links)
• A note on Slepian's inequality based on majorization (Q514131) (← links)
• Slepian's inequality with respect to majorization (Q624374) (← links)
• Few-shot learning with adaptively initialized task optimizer: a practical meta-learning approach (Q2183600) (← links)
• Inequalities for Gaussian random variables under Archimedean copula dependence (Q2189752) (← links)
• Risk bound of transfer learning using parametric feature mapping and its application to sparse coding (Q2331678) (← links)
• A Vector-Contraction Inequality for Rademacher Complexities (Q2830263) (← links)
• Multi-task and Lifelong Learning of Kernels (Q2835628) (← links)
• (Q4998861) (← links)