Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A notion of task relatedness yielding provable multiple-task learning guarantees

From MaRDI portal
Publication:1009297
Jump to:navigation, search

DOI10.1007/s10994-007-5043-5zbMath1470.68082OpenAlexW2040852548MaRDI QIDQ1009297

Reba Schuller Borbely, Shai Ben-David

Publication date: 31 March 2009

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-007-5043-5


zbMATH Keywords

learning theoryVC-dimensionmulti-task learninggeneralization boundsclassification predictioninductive transfertask relatedness


Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)


Related Items (3)

Unnamed Item ⋮ Least square regularized regression for multitask learning ⋮ A no-free-lunch theorem for multitask learning



Cites Work

  • Learnability and the Vapnik-Chervonenkis dimension
  • Learning Theory and Kernel Machines
  • On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
  • Unnamed Item


This page was built for publication: A notion of task relatedness yielding provable multiple-task learning guarantees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1009297&oldid=13005556"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 22:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki