Learning Structural Kernels for Natural Language Processing
원문 초록
Structural kernels are a flexible learning paradigm that has been widely used in Natural Language Processing. However, the problem of model selection in kernel-based methods is usually overlooked. Previous approaches mostly rely on setting default values for kernel hyperparameters or using grid search, which is slow and coarse-grained. In contrast, Bayesian methods allow efficient model selection by maximizing the evidence on the training data through gradient-based methods. In this paper we show how to perform this in the context of structural kernels by using Gaussian Processes. Experimental results on tree kernels show that this procedure results in better prediction performance compared to hyperparameter optimization via grid search. The framework proposed in this paper can be adapted to other structures besides trees, e.g., strings and graphs, thereby extending the utility of kernel-based methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
OptiMindTune: A Multi-Agent Framework for Intelligent Hyperparameter Optimization
Multi-Output Gaussian Processes for Graph-Structured Data
Selecting for Less Discriminatory Algorithms: A Relational Search Framework for Navigating Fairness-Accuracy Trade-offs in Practice
A Practitioner's Guide to Automatic Kernel Search for Gaussian Processes in Battery Applications
ATM: A distributed, collaborative, scalable system for automated machine learning
Hyperopt: A Python Library for Optimizing the Hyperparameters of Machine Learning Algorithms
토론
이 논문과 연결된 포럼 글이 아직 없습니다.