Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Weijing Huang

dblp:72/9436 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
1since 2021 · last 2026
0009-0007-9468-2426ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 2 first-authorArtificial intelligence and machine learning · 4 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Language models and text generation · 45% Efficient and distributed learning · 32% Question answering and dialogue systems · 14%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%

Topics — the 6 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › inference efficiency
context compression
1.012026
Bridging the Memorization-Utilization Gap: Near-Lossless Context Compression via Reinforcement Learning · ACL (1) 2026
Natural language and speech › Language models and text generation › language modeling
long-context language modeling
1.012026
Bridging the Memorization-Utilization Gap: Near-Lossless Context Compression via Reinforcement Learning · ACL (1) 2026
Natural language and speech › Language models and text generation › text generation › domain-specific text generation
legal text generation
0.412020
Generating Reasonable Legal Text through the Combination of Language Modeling and Question Answering · IJCAI 2020
Machine learning › Reinforcement learning
outcome-based reinforcement learning
0.312026
Bridging the Memorization-Utilization Gap: Near-Lossless Context Compression via Reinforcement Learning · ACL (1) 2026
Web and social media mining › social network analysis
influence maximization
0.212013
Influence maximization with limit cost in social network · Sci. China Inf. Sci. 2013
Web and social media mining
social network analysis
0.212013
Influence maximization with limit cost in social network · Sci. China Inf. Sci. 2013

Methods — techniques the papers use, named apart from their topics

outcome-based reinforcement learning · 1.0instruction tuning · 1.0average pooling · 1.0language modeling · 0.4key-value memory network · 0.4
YearPublicationVenuePosition
2026 Bridging the Memorization-Utilization Gap: Near-Lossless Context Compression via Reinforcement Learning
abstract
Despite recent progress in context compression, we identify a fundamental memorizationutilization gap where models can compress context with near-perfect fidelity yet fail to effectively utilize these compressed representations for downstream tasks.We address this with a holistic training paradigm spanning pretraining, instruction tuning, and reinforcement learning, built upon an average pooling compression.Our key innovation uses outcomebased RL to enable implicit expansion: the model learns to adaptively unfold task-relevant details during generation, interleaving reconstruction with reasoning.We achieve nearlossless 16× context compression (≈5.3× decoder sequence-length reduction in our current implementation) across 7B and 32B models, recovering over 98% of full-context QA performance and outperforming prior methods by 11 points.Our 32B model demonstrates strong out-of-distribution and length generalization, robustly scaling to 120k-token contexts despite training on no more than 4k tokens, matching full-context performance on NIAH, Long-Bench v2, and multi-hop reasoning.We verify the implicit expansion behavior in experiments.
Yujan Ting, Terrence Chen, Weijing Huang
ACL (1)4
2020 Generating Reasonable Legal Text through the Combination of Language Modeling and Question Answering
abstract
Due to the improvement of Language Modeling, the emerging NLP assistant tools aiming for text generation greatly reduce the human workload on writing documents. However, the generation of legal text faces greater challenges than ordinary texts because of its high requirement for keeping logic reasonable, which can not be guaranteed by Language Modeling right now. To generate reasonable legal documents, we propose a novel method CoLMQA, which (1) combines Language Modeling and Question Answering, (2) generates text with slots by Language Modeling, and (3) fills the slots by our proposed Question Answering method named Transformer-based Key-Value Memory Networks. In CoLMQA, the slots represent the text part that needs to be highly constrained by logic, such as the name of the law and the number of the law article. And the Question Answering fills the slots in context with the help of Legal Knowledge Base to keep logic reasonable. The experiment verifies the quality of legal documents generated by CoLMQA, surpassing the documents generated by pure Language Modeling.
Weijing Huang, Xianfeng Liao, Bojin Zhuang, Jing Xiao 0006
IJCAI1
2017 Category-Level Transfer Learning from Knowledge Base to Microblog Stream for Accurate Event Detection
Weijing Huang, Tengjiao Wang 0003, Wei Chen 0021
DASFAA (1)1
2017 Efficient Topic Modeling on Phrases via Sparsity
abstract
Topic modeling on phrases is important in understanding documents by providing interpretable topics. But existing methods are not as efficient as the topic modeling methods on words, which may limit their potential application.Towards providing a more efficient method, we propose a novel topic model SparseTP, which (1) models the words and phrases by linking them in Markov Random Field when necessary; (2) provides a well-formed lower bound of the model for Gibbs sampling; (3) utilizes the sparse distribution of words and phrases on topics to speed up the inference. The experiments demonstrate that it can achieve the high efficiency without sacrificing the effectiveness.
Weijing Huang, Wei Chen 0021, Tengjiao Wang 0003, Shibo Tao
ICTAI1
2016 An Efficient Online Event Detection Method for Microblogs via User Modeling
Weijing Huang, Wei Chen 0021, Lamei Zhang, Tengjiao Wang 0003
APWeb (1)1
2015 ASEM: Mining Aspects and Sentiment of Events from Microblog
abstract
Microblogs contain the most up-to-date and abundant opinion information on current events. Aspect-based opinion mining is a good way to get a comprehensive summarization of events. The most popular aspect based opinion mining models are used in the field of product and service. However, existing models are not suitable for event mining. In this paper we propose a novel probabilistic generative model (ASEM) to simultaneously discover aspects and the specified opinions. ASEM incorporate a sequence labeling model(CRF) into a generative topic model. Additionally, we adopt a set of features for separating aspects and sentiments. Moreover, we novelly present a continuously learning model. It can utilize the knowledge of one event to learn another, and get a better performance. We use five real world events to do experiment. The experimental results show that ASEM extracts aspects and sentiments well, and ASEM outperforms other state-of-art models and the intuitive two-step method.
Ruhui Wang, Weijing Huang, Wei Chen 0021, Tengjiao Wang 0003, Kai Lei
CIKM2
2013 Influence maximization with limit cost in social network
Yue Wang 0014, Weijing Huang, Lang Zong, Tengjiao Wang 0003, Dongqing Yang
Sci. China Inf. Sci.2
2011 An Empirical Study of Massively Parallel Bayesian Networks Learning for Sentiment Extraction from Unstructured Text
Wei Chen 0021, Lang Zong, Weijing Huang, Gaoyan Ou, Yue Wang 0014, Dongqing Yang
APWeb3
2011 Informed Prediction with Incremental Core-Based Friend Cycle Discovering
Yue Wang 0014, Weijing Huang, Wei Chen 0021, Tengjiao Wang 0003, Dongqing Yang
WAIM2