<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Fast rate bounds for multi-task and meta-learning with different sample sizes</dc:title>
   	<dc:title>Advances in Neural Information Processing Systems</dc:title>
   	<dc:creator>Zakerinia, Hossein ; https://orcid.org/0009-0007-3977-6462</dc:creator>
   	<dc:creator>Lampert, Christoph ; https://orcid.org/0000-0001-8622-7887</dc:creator>
   	<dc:description>We present new fast-rate PAC-Bayesian generalization bounds for multi-task and
meta-learning in the unbalanced setting, i.e. when the tasks have training sets of
different sizes, as is typically the case in real-world scenarios. Previously, only
standard-rate bounds were known for this situation, while fast-rate bounds were
limited to the setting where all training sets are of equal size. Our new bounds
are numerically computable as well as interpretable, and we demonstrate their
flexibility in handling a number of cases where they give stronger guarantees
than previous bounds. Besides the bounds themselves, we also make conceptual
contributions: we demonstrate that the unbalanced multi-task setting has different
statistical properties than the balanced situation, specifically that proofs from
the balanced situation do not carry over to the unbalanced setting. Additionally,
we shed light on the fact that the unbalanced situation allows two meaningful
definitions of multi-task risk, depending on whether all tasks should be considered
equally important or if sample-rich tasks should receive more weight than samplepoor ones.</dc:description>
   	<dc:publisher>Neural Information Processing Systems Foundation</dc:publisher>
   	<dc:date>2025</dc:date>
   	<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
   	<dc:type>doc-type:conferenceObject</dc:type>
   	<dc:type>conferenceObject</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/22824</dc:identifier>
   	<dc:source>Zakerinia H, Lampert C. Fast rate bounds for multi-task and meta-learning with different sample sizes. In: &lt;i&gt;39th Conference on Neural Information Processing Systems&lt;/i&gt;. Vol 38. Neural Information Processing Systems Foundation; 2025:9062-9093. doi:&lt;a href=&quot;https://doi.org/10.52202/085713-0278&quot;&gt;10.52202/085713-0278&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.52202/085713-0278</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/1049-5258</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/isbn/9798331338275</dc:relation>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
