activity
20232026
most citedWhen ControlNet Meets Inexplicit Masks: A Case Study of ControlNet on its Contour-following Ability

3 citations · 8 across the 19 of their papers we have counts for

collaborators
Showing 2024Show all

6 papers · 1 filter

cs.CL2024

Learning from Imperfect Data: Towards Efficient Knowledge Distillation of Autoregressive Language Models for Text-to-SQL

Qihuang Zhong, Kunfeng Chen, Liang Ding +3

Large Language Models (LLMs) have shown promising performance in text-to-SQL, which involves translating natural language questions into SQL queries. However, current text-to-SQL L…

cs.CL2024★ 1 cited

Iterative Data Generation with Large Language Models for Aspect-based Sentiment Analysis

Qihuang Zhong, Haiyun Li, Luyao Zhuang +2

Aspect-based Sentiment Analysis (ABSA) is an important sentiment analysis task, which aims to determine the sentiment polarity towards an aspect in a sentence. Due to the expensive…

cs.CV2024

RFL-CDNet: Towards Accurate Change Detection via Richer Feature Learning

Yuhang Gan, Wenjie Xuan, Hang Chen +2

Change Detection is a crucial but extremely challenging task of remote sensing image analysis, and much progress has been made with the rapid development of deep learning. However,…

cs.CL2024★ 3 cited

Achieving >97% on GSM8K: Deeply Understanding the Problems Makes LLMs Better Solvers for Math Word Problems

Qihuang Zhong, Kang Wang, Ziyang Xu +3

Chain-of-Thought (CoT) prompting has enhanced the performance of Large Language Models (LLMs) across various reasoning tasks. However, CoT still falls short in dealing with complex…

cs.CV2024★ 3 cited

When ControlNet Meets Inexplicit Masks: A Case Study of ControlNet on its Contour-following Ability

Wenjie Xuan, Yufei Xu, Shanshan Zhao +4

ControlNet excels at creating content that closely matches precise contours in user-provided masks. However, when these masks contain noise, as a frequent occurrence with non-exper…

cs.DC2024

PICO: Accelerating All k-Core Paradigms on GPU

Chen Zhao, Ting Yu, Zhigao Zheng +4

Core decomposition is a well-established graph mining problem with various applications that involves partitioning the graph into hierarchical subgraphs. Solutions to this problem…