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.
In conventional supervised training, a model is trained to fit all the training examples. However, having a monolithic model may not always be the best strategy, as examples could vary widely. In this work, we explore a different learning protocol that treats each example as a unique pseudo-task, by reducing the original learning problem to a few-shot meta-learning scenario with the help of a domain-dependent relevance function. When evaluated on the WikiSQL dataset, our approach leads to faster convergence and achieves 1.1%-5.4% absolute accuracy gains over the non-meta-learning counterparts.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1803.02400")
get_code_for_paper("1803.02400")
have("1803.02400")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1803.02400.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1803.02400)
Connect an agent — have() is free.