Papers by Ruibin Wang

9 papers
Knowledge Graph Embedding by Adaptive Limit Scoring Loss Using Dynamic Weighting Strategy (2022.findings-acl)

Copied to clipboard

Challenge: Existing knowledge graph embedding models use a loss framework to distinguish between correct and incorrect triplets.
Approach: They propose a loss framework that reweights each triplet to highlight the less-optimized triplets.
Outcome: The proposed method performs on several knowledge graph embedding models, including TransE, TransH and ComplEx.
Reinforcement Learning on Pre-Training Data (2026.acl-long)

Copied to clipboard

Challenge: Recent progress in large language models is driven by scaling of training compute through pre-training with nexttoken prediction (NTP) or post-training (RL) Pre-training using NTP enables models to acquire extensive knowledge and skills from general data, but it suffers from data inefficiency and catastrophic forgetting in continual learning settings.
Approach: They propose to scale training compute through pre-training with next-token prediction (NTP) or post-training by scaling reinforcement learning (RL) to improve learning from general data.
Outcome: Experiments on multiple benchmarks and models show that the proposed approach improves continual pre-training and provides a strong foundation for post-training on Qwen3-8B-Base.
CLaMP 2: Multimodal Music Information Retrieval Across 101 Languages Using Large Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Current music information retrieval systems struggle to meet linguistic diversity challenges . current systems struggle with text queries in non-English languages .
Approach: They propose a music information retrieval system that supports both ABC notation and MIDI . CLaMP 2 includes a multilingual text encoder and a multiple-modal music encoder .
Outcome: The proposed system achieves state-of-the-art results in multilingual semantic search and music classification across modalities.
CIF-Bench: A Chinese Instruction-Following Benchmark for Evaluating the Generalizability of Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: a recent study shows that large language models have limited generalization in low-resource languages like Chinese.
Approach: They propose to evaluate the zero-shot generalizability of large language models to the Chinese language . they release only half of the dataset publicly, with the remainder kept private .
Outcome: The Chinese Instruction-Following Benchmark evaluates the generalizability of LLMs to the Chinese language.
Low-probability Tokens Sustain Exploration in Reinforcement Learning with Verifiable Reward (2026.findings-acl)

Copied to clipboard

Challenge: Recent studies show that RLVR training is slow and results plateau as policy entropy collapses . low-probability regularization (Lp-Reg) reduces the number of low-quality exploratory tokens induced by RL training .
Approach: They propose a method to reduce RLVR over-penalization by eliminating low-probability exploratory tokens . they propose 'Low-provability Regularization' to reduce the gradual elimination of low-quality exploratory entropy tokens.
Outcome: The proposed method eliminates low-probability exploratory tokens and prevents suppression of potentially valuable low-property candidates.
ChatMusician: Understanding and Generating Music Intrinsically with LLM (2024.findings-acl)

Copied to clipboard

Challenge: Despite LLMs' impressive capabilities in musical knowledge, music reasoning remains an unsolved task.
Approach: They propose an open-source large language model (LLM) that integrates intrinsic musical abilities into LLaMA2 and GPT-3.5.
Outcome: The proposed model can understand and generate music with a pure text tokenizer without external multi-modal neural structures or tokenizers.
Learning Hierarchy-Aware Quaternion Knowledge Graph Embeddings with Representing Relations as 3D Rotations (2022.coling-1)

Copied to clipboard

Challenge: Existing knowledge graph embedding models fail to model semantic hierarchies . Existing methods fail to understand the semantic hierarchies of knowledge graphs .
Approach: They propose a model which embeds entities as pure quaternions and constrains the modulus of entities to make them have hierarchical distributions.
Outcome: The proposed model can encode symmetry/antisymmetry, inversion, composition, multiple relation patterns and learn semantic hierarchies simultaneously.
COIG-CQIA: Quality is All You Need for Chinese Instruction Fine-tuning (2025.findings-naacl)

Copied to clipboard

Challenge: Existing datasets for Chinese instruction tuning are not well-aligned with Chinese users’ interaction patterns.
Approach: They propose to use Chinese instruction tuning datasets to improve instruction fine-tuning for Chinese users.
Outcome: The proposed dataset shows that Chinese models achieve competitive performance in diverse benchmarks.
HiddenGuard: Fine-Grained Safe Generation with Specialized Representation Router (2026.acl-long)

Copied to clipboard

Challenge: Current alignment approaches rely on refusal alignment to avoid harmful content . large language models are often overly cautious or overlook subtle harmful content.
Approach: They propose a framework for fine-grained safe generation in Large Language Models that enables real-time, token-level harmfulness detection and redaction without loss in capability.
Outcome: The proposed framework achieves over 90% in F1 score for detecting and redacting harmful content while preserving overall utility and informativeness of the model’s responses.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations