We investigate the unsupervised constituency parsing task, which organizes words and phrases of a sentence into a hierarchical structure without using linguistically annotated data. We observe that existing unsupervised parsers capture differing aspects of parsing structures, which can be leveraged to enhance unsupervised parsing performance. To this end, we propose a notion of “tree averaging,” based on which we further propose a novel ensemble method for unsupervised parsing. To improve inference efficiency, we further distill the ensemble knowledge into a student model; such an ensemble-then-distill process is an effective approach to mitigate the over-smoothing problem existing in common multi-teacher distilling methods. Experiments show that our method surpasses all previous approaches, consistently demonstrating its effectiveness and robustness across various runs, with different ensemble components, and under domain-shift conditions.
Related Research
-
Flora: Low-Rank Adapters Are Secretly Gradient Compressors
Flora: Low-Rank Adapters Are Secretly Gradient Compressors
Y. Hao, Y. Cao, and L. Mou.
Publications
-
Conditional Diffusion Models as Self-supervised Learning Backbone for Irregular Time Series
Conditional Diffusion Models as Self-supervised Learning Backbone for Irregular Time Series
Hamed Shirzad, R. Deng, H. Zhao, and F. Tung. Workshop at International Conference on Representation Learning (ICLR)
Publications
-
AutoCast++ Enhancing World Event Prediction with Zero-shot Ranking-based Context Retrieval
AutoCast++ Enhancing World Event Prediction with Zero-shot Ranking-based Context Retrieval
T. Sylvain, and J. He.
Research
Work With Us!
Borealis AI is looking to hire for various roles across different teams. Visit our career page now and discover opportunities to join similar impactful projects!
Careers at Borealis AI