Combining Independent Modules in Lexical Multiple-Choice Problems
Peter D. Turney, Michael L. Littman, Jeffrey Bigham, Victor Shnayder
Abstract
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be best for all problem instances. Many researchers are examining ensemble methods that combine the output of multiple modules to create more accurate solutions. This paper examines three merging rules for combining probability distributions: the familiar mixture rule, the logarithmic rule, and a novel product rule. These rules were applied with state-of-the-art results to two problems used to assess human mastery of lexical semantics -- synonym questions and analogy questions. All three merging rules result in ensembles that are more accurate than any of their component modules. The differences among the three rules are not statistically significant, but it is suggestive that the popular mixture rule is not the best rule for either of the two problems.
Create a lesson
Related papers
Coarse Semantic Blocks for Efficient Training-Free Sparse Attention
Sosuke Kobayashi, Shoichiro Yamaguchi, Seiya Tokui
What Is the Influence of Task Order in Continual Learning? An Empirical Study and Order-Aware Evaluation for Motion Forecasting
Zirui Li, Yunlong Lin, Haohan Yang et al.
Reciprocity Can Erase Direction:tructural Boundaries and Controlled Utility of Magnetic Graph Networks
Dawei Han, Zicheng Wang, Yaoxing Ren et al.
Deep Learning Compilers: Architecture, Optimization, and Empirical Characterization
Jinghao Wen, Ruixuan Wang, Xun Jiao
OmniST: Topology-Invariant Spatiotemporal Forecasting with Guaranteed-Coverage Uncertainty at Unseen Sensor Locations
Praveg Vashishtha
LIRA: A More Interpretable Dynamic Loss-Informed Rank Allocation for Low-Rank Adaptation
Sihao Wang, Bozheng Li, Xuemiao Xu et al.