Metraipolis › archive › dc_3515096006e8
NPBoost: Neural Processes with Gradient-Boosted Fixed Effects — arXiv:2609.28122
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28122
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T10:58:17.169Z
- SHA-256 of the archived text
019e8491d9fdc711bfdadd8d2fe71b0e71b7254dcbe1741d542a64d31177005f- Stable URL of this page
https://metraipolis.com/documento/dc_3515096006e8
How to cite
NPBoost: Neural Processes with Gradient-Boosted Fixed Effects — arXiv:2609.28122 — arXiv (en), https://arxiv.org/abs/2609.28122 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3515096006e8 (Metraipolis archive dc_3515096006e8, sha256 019e8491d9fdc711bfdadd8d2fe71b0e71b7254dcbe1741d542a64d31177005f)
BibTeX
@misc{dc3515096006e8,
title = {NPBoost: Neural Processes with Gradient-Boosted Fixed Effects — arXiv:2609.28122},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28122},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3515096006e8; sha256 019e8491d9fdc711bfdadd8d2fe71b0e71b7254dcbe1741d542a64d31177005f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28122. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Neural Processes (NPs) are model-based meta-learners that implicitly learn a stochastic process and adapt to a new task from a small context set. Most extensions of NPs focus on improving the neural network architecture. We instead develop an extension motivated by the shared hierarchical interpretation of meta-learning and mixed-effects models. Specifically, we introduce Neural Process Boosting (NPBoost), which decomposes structured response variability into tree-boosted fixed effects shared across tasks and NP random effects that capture stochastic task-to-task variation. We propose to train the two components jointly using a boosting algorithm in which an NP learns residual task-specific structure and a tree ensemble estimates common patterns across tasks. Across synthetic and real-world tabular meta-learning problems, this decomposition improves over a standard NP when the shared structure contains discontinuities or other irregular patterns that boosted trees can represent effectively. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-24 in cs.LG). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.28122 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T10:06:16.838Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).