Meta-Learning MCMC Proposals
원문 초록
Effective implementations of sampling-based probabilistic inference often require manually constructed, model-specific proposals. Inspired by recent progresses in meta-learning for training learning agents that can generalize to unseen environments, we propose a meta-learning approach to building effective and generalizable MCMC proposals. We parametrize the proposal as a neural network to provide fast approximations to block Gibbs conditionals. The learned neural proposals generalize to occurrences of common structural motifs across different models, allowing for the construction of a library of learned inference primitives that can accelerate inference on unseen models with no model-specific training required. We explore several applications including open-universe Gaussian mixture models, in which our learned proposals outperform a hand-tuned sampler, and a real-world named entity recognition task, in which our sampler yields higher final F1 scores than classical single-site Gibbs sampling.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Selecting and Merging: Towards Adaptable and Scalable Named Entity Recognition with Large Language Models
Label-Guided In-Context Learning for Named Entity Recognition
Named Entity Recognition in Historical Italian: The Case of Giacomo Leopardi's Zibaldone
A Comparative Analysis of Static Word Embeddings for Hungarian
Methods for Recognizing Nested Terms
Multimodal LLMs for OCR, OCR Post-Correction, and Named Entity Recognition in Historical Documents
토론
이 논문과 연결된 포럼 글이 아직 없습니다.