Papers by Yanpeng Zhao
v-HUB: A Benchmark for Video Humor Understanding from Vision and Sound (2026.acl-long)
Copied to clipboard
Zhengpeng Shi, Yanpeng Zhao, Jianqun Zhou, Yuxuan Wang, Qinrong Cui, Wei Bi, Song-Chun Zhu, Bo Zhao, Zilong Zheng
| Challenge: | Humor enriches our daily lives and appears in many forms, from jokes and cartoons to comedies and viral videos. |
| Approach: | They introduce a video humor understanding benchmark to test their ability to understand humor from visual cues. |
| Outcome: | The proposed video humor understanding benchmark is based on a collection of short videos . it features rich annotations and a study of environmental sound that can enhance humor . |
Gaussian Mixture Latent Vector Grammars (P18-1)
Copied to clipboard
| Challenge: | Existing models of latent variable grammars are not observable in treebanks, so latent variables are learned using expectation-maximization. |
| Approach: | They propose a new framework that extends latent variable grammars such that each nonterminal symbol is associated with a continuous vector space representing the set of (infinitely many) subtypes of the nonterminals. |
| Outcome: | The proposed framework can achieve competitive accuracies in part-of-speech tagging and constituency parsing. |
PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbols (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent work shows that probabilistic context-free grammars with neural parameterization can be effective in unsupervised constituency parsing. |
| Approach: | They propose a parameterization form of PCFGs based on tensor decomposition which has at most quadratic computational complexity in the symbol number. |
| Outcome: | The proposed model improves unsupervised constituency parsing performance across ten languages. |
Connecting the Dots between Audio and Text without Parallel Data through Visual Knowledge Transfer (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for learning audio-text connections rely on parallel audio- text data . a new approach allows for the representation of environmental soundscapes without using parallel data - a challenge for many applications . |
| Approach: | They propose a model that induces Audio-Text alignment without using parallel audio-text data. |
| Outcome: | The proposed model outperforms the current state-of-the-art for audio classification tasks with no audio-text data by 2.2% on the ESC50 and US8K tasks. |
On the Transferability of Visually Grounded PCFGs (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies on visually grounded grammar induction have not evaluated text domains that are different from the training domain. |
| Approach: | They extend visually grounded grammar induction model to transfer across text domains . they find that benefits transfer to text in a domain similar to the training domain . |
| Outcome: | The proposed model can transfer across text domains but fails to transfer to remote domains. |
Visually Grounded Compound PCFGs (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing work on visual groundings for language understanding has been drawing much attention. |
| Approach: | They propose to use an extension of probabilistic context-free grammar model to do fully-differentiable end-to-end visually grounded learning. |
| Outcome: | The proposed model outperforms the previous grounded model and significantly outperformed the previous model on the MSCOCO test captions. |
Unsupervised Natural Language Parsing (Introductory Tutorial) (2021.eacl-tutorials)
Copied to clipboard
| Challenge: | Unsupervised parsing learns a syntactic parser from training sentences without parse tree annotations. |
| Approach: | This tutorial will introduce what unsupervised parsing does and how it can be useful for and beyond syntactic parse. |
| Outcome: | This paper will provide an overview of major approaches to unsupervised parsing and analyze their strengths and weaknesses. |
Neural Bi-Lexicalized PCFG Induction (2021.acl-long)
Copied to clipboard
| Challenge: | Neural lexicalized PCFGs make strong independence assumption on the generation of the child word and thus bilexical dependencies are ignored. |
| Approach: | They propose an approach to parameterize L-PCFGs without making implausible independence assumptions. |
| Outcome: | The proposed approach improves both running speed and unsupervised parsing performance on the English WSJ dataset. |