We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
By leveraging experience from previous tasks, meta-learning algorithms can achieve effective fast adaptation ability when encountering new tasks. However it is unclear how the generalization property applies to new tasks. Probably approximately correct (PAC) Bayes bound theory provides a theoretical framework to analyze the generalization performance for meta-learning. We derive three novel generalisation error bounds for meta-learning based on PAC-Bayes relative entropy bound. Furthermore, using the empirical risk minimization (ERM) method, a PAC-Bayes bound for meta-learning with data-dependent prior is developed. Experiments illustrate that the proposed three PAC-Bayes bounds for meta-learning guarantee a competitive generalization performance guarantee, and the extended PAC-Bayes bound with data-dependent prior can achieve rapid convergence ability.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2102.03748")
get_code_for_paper("2102.03748")
have("2102.03748")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2102.03748.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2102.03748)
Connect an agent — have() is free.