ISTA Publications
metadata only
More flexible PAC-Bayesian meta-learning by learning learning algorithms
We introduce a new framework for studying meta-learning methods using PAC-Bayesian theory. Its main advantage over previous work is that it allows for more flexibility in how the transfer of knowledge between tasks is realized. For previous approaches, this could only happen indirectly, by means of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Temporal Consistency Improves Generalization in Contextual Offline Meta Reinforcement Learning#974344
- Model Predictive Task Sampling for Efficient and Robust Adaptation#1342302
- Finetuning with Sampling: SFT Learns Better Than You Think#1161030
- Finetuning with Sampling: SFT Learns Better Than You Think#1157488
- Safe Meta-Reinforcement Learning via Information Space Reachability#1109949
Record · ID 1251616
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive