14 results on '"Zhang, Wenqian"'
Search Results
2. SCOPE: Sign Language Contextual Processing with Embedding from LLMs
- Author
-
Liu, Yuqi, Zhang, Wenqian, Ren, Sihan, Huang, Chengyu, Yu, Jingyi, and Xu, Lan
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
Sign languages, used by around 70 million Deaf individuals globally, are visual languages that convey visual and contextual information. Current methods in vision-based sign language recognition (SLR) and translation (SLT) struggle with dialogue scenes due to limited dataset diversity and the neglect of contextually relevant information. To address these challenges, we introduce SCOPE (Sign language Contextual Processing with Embedding from LLMs), a novel context-aware vision-based SLR and SLT framework. For SLR, we utilize dialogue contexts through a multi-modal encoder to enhance gloss-level recognition. For subsequent SLT, we further fine-tune a Large Language Model (LLM) by incorporating prior conversational context. We also contribute a new sign language dataset that contains 72 hours of Chinese sign language videos in contextual dialogues across various scenarios. Experimental results demonstrate that our SCOPE framework achieves state-of-the-art performance on multiple datasets, including Phoenix-2014T, CSL-Daily, and our SCOPE dataset. Moreover, surveys conducted with participants from the Deaf community further validate the robustness and effectiveness of our approach in real-world applications. Both our dataset and code will be open-sourced to facilitate further research.
- Published
- 2024
3. More results on the spectral radius of graphs with no odd wheels
- Author
-
Zhang, Wenqian
- Subjects
Mathematics - Combinatorics ,05C50 - Abstract
For a graph $G$, the spectral radius $\lambda_{1}(G)$ of $G$ is the largest eigenvalue of its adjacency matrix. An odd wheel $W_{2k+1}$ with $k\geq2$ is a graph obtained from a cycle of order $2k$ by adding a new vertex connecting to all the vertices of the cycle. Let ${\rm SPEX}(n,W_{2k+1})$ be the set of $W_{2k+1}$-free graphs of order $n$ with the maximum spectral radius. Very recently, Cioab\u{a}, Desai and Tait \cite{CDT2} characterized the graphs in ${\rm SPEX}(n,W_{2k+1})$ for sufficiently large $n$, where $k\geq2$ and $k\neq4,5$. And they left the case $k=4,5$ as a problem. In this paper, we settle this problem. Moreover, we completely characterize the graphs in ${\rm SPEX}(n,W_{2k+1})$ when $k\geq4$ is even and $n\equiv2~(\mod4)$ is sufficiently large. Consequently, the graphs in ${\rm SPEX}(n,W_{2k+1})$ are characterized completely for any $k\geq2$ and sufficiently large $n$.
- Published
- 2024
4. Walks, infinite series and spectral radius of graphs
- Author
-
Zhang, Wenqian
- Subjects
Mathematics - Combinatorics ,05C50 - Abstract
For a graph G, the spectral radius \r{ho}(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, we seek the relationship between \r{ho}(G) and the walks of the subgraphs of G. Especially, if G contains a complete multi-partite graph as a spanning subgraph, we give a formula for \r{ho}(G) by using an infinite series on walks of the subgraphs of G. These results are useful for the current popular spectral extremal problem., Comment: 13 pages,0 figures, normal article
- Published
- 2024
5. BOTH2Hands: Inferring 3D Hands from Both Text Prompts and Body Dynamics
- Author
-
Zhang, Wenqian, Huang, Molin, Zhou, Yuxuan, Zhang, Juze, Yu, Jingyi, Wang, Jingya, and Xu, Lan
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
The recently emerging text-to-motion advances have spired numerous attempts for convenient and interactive human motion generation. Yet, existing methods are largely limited to generating body motions only without considering the rich two-hand motions, let alone handling various conditions like body dynamics or texts. To break the data bottleneck, we propose BOTH57M, a novel multi-modal dataset for two-hand motion generation. Our dataset includes accurate motion tracking for the human body and hands and provides pair-wised finger-level hand annotations and body descriptions. We further provide a strong baseline method, BOTH2Hands, for the novel task: generating vivid two-hand motions from both implicit body dynamics and explicit text prompts. We first warm up two parallel body-to-hand and text-to-hand diffusion models and then utilize the cross-attention transformer for motion blending. Extensive experiments and cross-validations demonstrate the effectiveness of our approach and dataset for generating convincing two-hand motions from the hybrid body-and-textual conditions. Our dataset and code will be disseminated to the community for future research., Comment: Accepted to CVPR 2024
- Published
- 2023
- Full Text
- View/download PDF
6. Detecting Spoilers in Movie Reviews with External Movie Knowledge and User Networks
- Author
-
Wang, Heng, Zhang, Wenqian, Bai, Yuyang, Tan, Zhaoxuan, Feng, Shangbin, Zheng, Qinghua, and Luo, Minnan
- Subjects
Computer Science - Artificial Intelligence - Abstract
Online movie review platforms are providing crowdsourced feedback for the film industry and the general public, while spoiler reviews greatly compromise user experience. Although preliminary research efforts were made to automatically identify spoilers, they merely focus on the review content itself, while robust spoiler detection requires putting the review into the context of facts and knowledge regarding movies, user behavior on film review platforms, and more. In light of these challenges, we first curate a large-scale network-based spoiler detection dataset LCS and a comprehensive and up-to-date movie knowledge base UKM. We then propose MVSD, a novel Multi-View Spoiler Detection framework that takes into account the external knowledge about movies and user activities on movie review platforms. Specifically, MVSD constructs three interconnecting heterogeneous information networks to model diverse data sources and their multi-view attributes, while we design and employ a novel heterogeneous graph neural network architecture for spoiler detection as node-level classification. Extensive experiments demonstrate that MVSD advances the state-of-the-art on two spoiler detection datasets, while the introduction of external knowledge and user interactions help ground robust spoiler detection. Our data and code are available at https://github.com/Arthur-Heng/Spoiler-Detection, Comment: EMNLP 2023
- Published
- 2023
7. InterGen: Diffusion-based Multi-human Motion Generation under Complex Interactions
- Author
-
Liang, Han, Zhang, Wenqian, Li, Wenxuan, Yu, Jingyi, and Xu, Lan
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
We have recently seen tremendous progress in diffusion advances for generating realistic human motions. Yet, they largely disregard the multi-human interactions. In this paper, we present InterGen, an effective diffusion-based approach that incorporates human-to-human interactions into the motion diffusion process, which enables layman users to customize high-quality two-person interaction motions, with only text guidance. We first contribute a multimodal dataset, named InterHuman. It consists of about 107M frames for diverse two-person interactions, with accurate skeletal motions and 23,337 natural language descriptions. For the algorithm side, we carefully tailor the motion diffusion model to our two-person interaction setting. To handle the symmetry of human identities during interactions, we propose two cooperative transformer-based denoisers that explicitly share weights, with a mutual attention mechanism to further connect the two denoising processes. Then, we propose a novel representation for motion input in our interaction diffusion model, which explicitly formulates the global relations between the two performers in the world frame. We further introduce two novel regularization terms to encode spatial relations, equipped with a corresponding damping scheme during the training of our interaction diffusion model. Extensive experiments validate the effectiveness and generalizability of InterGen. Notably, it can generate more diverse and compelling two-person motions than previous methods and enables various downstream applications for human interactions., Comment: accepted by IJCV 2024
- Published
- 2023
- Full Text
- View/download PDF
8. The Sub-Exponential Critical Slowing Down at Floquet Time Crystal Phase Transition
- Author
-
Zhang, Wenqian, Wu, Yadong, Qiu, Xingze, Nan, Jue, and Li, Xiaopeng
- Subjects
Quantum Physics ,Condensed Matter - Disordered Systems and Neural Networks - Abstract
Critical slowing down (CSD) has been a trademark of critical dynamics for equilibrium phase transitions of a many-body system, where the relaxation time for the system to reach thermal equilibrium or quantum ground state diverges with system size. The time crystal phase transition has attracted much attention in recent years for it provides a scenario of phase transition of quantum dynamics, unlike conventional equilibrium phase transitions. Here, we study critical dynamics near the Floquet time crystal phase transition. Its critical behavior is described by introducing a space-time coarse grained correlation function, whose relaxation time diverges at the critical point revealing the CSD. This is demonstrated by investigating the Floquet dynamics of one-dimensional disordered spin chain. Through finite-size scaling analysis, we show the relaxation time has a universal sub-exponential scaling near the critical point, in sharp contrast to the standard power-law behavior for CSD in equilibrium phase transitions. This prediction can be readily tested in present quantum simulation experiments., Comment: 4+5.5 pages, 3+1 figures
- Published
- 2023
- Full Text
- View/download PDF
9. KALM: Knowledge-Aware Integration of Local, Document, and Global Contexts for Long Document Understanding
- Author
-
Feng, Shangbin, Tan, Zhaoxuan, Zhang, Wenqian, Lei, Zhenyu, and Tsvetkov, Yulia
- Subjects
Computer Science - Computation and Language - Abstract
With the advent of pretrained language models (LMs), increasing research efforts have been focusing on infusing commonsense and domain-specific knowledge to prepare LMs for downstream tasks. These works attempt to leverage knowledge graphs, the de facto standard of symbolic knowledge representation, along with pretrained LMs. While existing approaches have leveraged external knowledge, it remains an open question how to jointly incorporate knowledge graphs representing varying contexts, from local (e.g., sentence), to document-level, to global knowledge, to enable knowledge-rich exchange across these contexts. Such rich contextualization can be especially beneficial for long document understanding tasks since standard pretrained LMs are typically bounded by the input sequence length. In light of these challenges, we propose KALM, a Knowledge-Aware Language Model that jointly leverages knowledge in local, document-level, and global contexts for long document understanding. KALM first encodes long documents and knowledge graphs into the three knowledge-aware context representations. It then processes each context with context-specific layers, followed by a context fusion layer that facilitates knowledge exchange to derive an overarching document representation. Extensive experiments demonstrate that KALM achieves state-of-the-art performance on six long document understanding tasks and datasets. Further analyses reveal that the three knowledge-aware contexts are complementary and they all contribute to model performance, while the importance and information exchange patterns of different contexts vary with respect to different tasks and datasets., Comment: ACL 2023
- Published
- 2022
10. BIC: Twitter Bot Detection with Text-Graph Interaction and Semantic Consistency
- Author
-
Lei, Zhenyu, Wan, Herun, Zhang, Wenqian, Feng, Shangbin, Chen, Zilong, Li, Jundong, Zheng, Qinghua, and Luo, Minnan
- Subjects
Computer Science - Artificial Intelligence - Abstract
Twitter bots are automatic programs operated by malicious actors to manipulate public opinion and spread misinformation. Research efforts have been made to automatically identify bots based on texts and networks on social media. Existing methods only leverage texts or networks alone, and while few works explored the shallow combination of the two modalities, we hypothesize that the interaction and information exchange between texts and graphs could be crucial for holistically evaluating bot activities on social media. In addition, according to a recent survey (Cresci, 2020), Twitter bots are constantly evolving while advanced bots steal genuine users' tweets and dilute their malicious content to evade detection. This results in greater inconsistency across the timeline of novel Twitter bots, which warrants more attention. In light of these challenges, we propose BIC, a Twitter Bot detection framework with text-graph Interaction and semantic Consistency. Specifically, in addition to separately modeling the two modalities on social media, BIC employs a text-graph interaction module to enable information exchange across modalities in the learning process. In addition, given the stealing behavior of novel Twitter bots, BIC proposes to model semantic consistency in tweets based on attention weights while using it to augment the decision process. Extensive experiments demonstrate that BIC consistently outperforms state-of-the-art baselines on two widely adopted datasets. Further analyses reveal that text-graph interactions and modeling semantic consistency are essential improvements and help combat bot evolution.
- Published
- 2022
11. TwiBot-22: Towards Graph-Based Twitter Bot Detection
- Author
-
Feng, Shangbin, Tan, Zhaoxuan, Wan, Herun, Wang, Ningnan, Chen, Zilong, Zhang, Binchi, Zheng, Qinghua, Zhang, Wenqian, Lei, Zhenyu, Yang, Shujie, Feng, Xinshun, Zhang, Qingyue, Wang, Hongrui, Liu, Yuhan, Bai, Yuyang, Wang, Heng, Cai, Zijian, Wang, Yanbo, Zheng, Lijing, Ma, Zihan, Li, Jundong, and Luo, Minnan
- Subjects
Computer Science - Social and Information Networks ,Computer Science - Artificial Intelligence - Abstract
Twitter bot detection has become an increasingly important task to combat misinformation, facilitate social media moderation, and preserve the integrity of the online discourse. State-of-the-art bot detection methods generally leverage the graph structure of the Twitter network, and they exhibit promising performance when confronting novel Twitter bots that traditional methods fail to detect. However, very few of the existing Twitter bot detection datasets are graph-based, and even these few graph-based datasets suffer from limited dataset scale, incomplete graph structure, as well as low annotation quality. In fact, the lack of a large-scale graph-based Twitter bot detection benchmark that addresses these issues has seriously hindered the development and evaluation of novel graph-based bot detection approaches. In this paper, we propose TwiBot-22, a comprehensive graph-based Twitter bot detection benchmark that presents the largest dataset to date, provides diversified entities and relations on the Twitter network, and has considerably better annotation quality than existing datasets. In addition, we re-implement 35 representative Twitter bot detection baselines and evaluate them on 9 datasets, including TwiBot-22, to promote a fair comparison of model performance and a holistic understanding of research progress. To facilitate further research, we consolidate all implemented codes and datasets into the TwiBot-22 evaluation framework, where researchers could consistently evaluate new models and datasets. The TwiBot-22 Twitter bot detection benchmark and evaluation framework are publicly available at https://twibot22.github.io/, Comment: NeurIPS 2022, Datasets and Benchmarks Track
- Published
- 2022
12. KCD: Knowledge Walks and Textual Cues Enhanced Political Perspective Detection in News Media
- Author
-
Zhang, Wenqian, Feng, Shangbin, Chen, Zilong, Lei, Zhenyu, Li, Jundong, and Luo, Minnan
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
Political perspective detection has become an increasingly important task that can help combat echo chambers and political polarization. Previous approaches generally focus on leveraging textual content to identify stances, while they fail to reason with background knowledge or leverage the rich semantic and syntactic textual labels in news articles. In light of these limitations, we propose KCD, a political perspective detection approach to enable multi-hop knowledge reasoning and incorporate textual cues as paragraph-level labels. Specifically, we firstly generate random walks on external knowledge graphs and infuse them with news text representations. We then construct a heterogeneous information network to jointly model news content as well as semantic, syntactic and entity cues in news articles. Finally, we adopt relational graph neural networks for graph-level representation learning and conduct political perspective detection. Extensive experiments demonstrate that our approach outperforms state-of-the-art methods on two benchmark datasets. We further examine the effect of knowledge walks and textual cues and how they contribute to our approach's data efficiency., Comment: accepted at NAACL 2022 main conference
- Published
- 2022
13. KGAP: Knowledge Graph Augmented Political Perspective Detection in News Media
- Author
-
Feng, Shangbin, Chen, Zilong, Zhang, Wenqian, Li, Qingyao, Zheng, Qinghua, Chang, Xiaojun, and Luo, Minnan
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence ,Computer Science - Computers and Society - Abstract
Identifying political perspectives in news media has become an important task due to the rapid growth of political commentary and the increasingly polarized political ideologies. Previous approaches focus on textual content and leave out the rich social and political context that is essential in the perspective detection process. To address this limitation, we propose KGAP, a political perspective detection method that incorporates external domain knowledge. Specifically, we construct a political knowledge graph to serve as domain-specific external knowledge. We then construct heterogeneous information networks to represent news documents, which jointly model news text and external knowledge. Finally, we adopt relational graph neural networks and conduct political perspective detection as graph-level classification. Extensive experiments demonstrate that our method consistently achieves the best performance on two real-world perspective detection benchmarks. Ablation studies further bear out the necessity of external knowledge and the effectiveness of our graph-based approach.
- Published
- 2021
14. A best bound for $\lambda_2(G)$ to guarantee $\kappa(G) \geq 2$
- Author
-
Zhang, Wenqian and Wang, Jianfeng
- Subjects
Mathematics - Combinatorics ,05C50 - Abstract
Let $G$ be a connected $d$-regular graph with a given order and the second largest eigenvalue $\lambda_2(G)$. Mohar and O (private communication) asked a challenging problem: what is the best upper bound for $\lambda_2(G)$ which guarantees that $\kappa(G) \geq t+1$, where $1 \leq t \leq d-1$ and $\kappa(G)$ is the vertex-connectivity of $G$, which was also mentioned by Cioab\u{a}. As a starting point, we solve this problem in the case $t =1$, and characterize all families of extremal graphs., Comment: 10 pages
- Published
- 2021
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.