Papers by Rongrong Ji

10 papers
Automated Fine-Grained Mixture-of-Experts Quantization (2025.findings-acl)

Copied to clipboard

Challenge: specialized quantization framework for Mixture of Experts architectures is inadequate for model compression.
Approach: They propose a specialized quantization framework for Mixture of Experts architectures . they find that expert networks exhibit distinctive channel-wise outlier distributions ."
Outcome: The proposed framework improves on the Mixtral-8x7b-v0.1 architecture while maintaining minimal computational overhead.
Enhancing Language Model Hypernetworks with Restart: A Study on Optimization (2025.naacl-long)

Copied to clipboard

Challenge: a comprehensive investigation into optimization strategies for hypernetworks remains lacking.
Approach: They propose restart optimization strategies to improve hypernetworks' performance for language models.
Outcome: The proposed restart strategy improves hypernetworks' performance for language models, compared to conventional deep neural networks.
AnyTrans: Translate AnyText in the Image with Large Scale Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in natural language processing and computer vision have made it possible to translate images with text in one language into equivalent images displaying that text translated into another language.
Approach: They propose an all-encompassing framework for the task–In-Image Machine Translation (IIMT) that incorporates contextual cues from both textual and visual elements during translation.
Outcome: The proposed framework can be constructed using open-source models and requires no training, making it highly accessible and expandable.
ALGOGEN: Tool-Generated Verifiable Traces for Reliable Algorithm Visualization (2026.findings-acl)

Copied to clipboard

Challenge: Recent LLM-based systems require simulation of algorithm flow and video rendering constraints.
Approach: They propose a paradigm that decouples algorithm execution from rendering.
Outcome: The proposed paradigm reduces execution success rates, element overlap, and inter-frame inconsistencies.
Training Long-Context LLMs Efficiently via Chunk-wise Optimization (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in long-context large language models have demonstrated superior retrieval quality compared to retrievalaugmented generation (RAG) approaches.
Approach: They propose a memory-efficient training paradigm that partitions lengthy inputs into manageable chunks.
Outcome: The proposed model expands maximum sequence length from 1K to 16K tokens on a single RTX 3090 GPU, while SpaCO achieves accelerated training speed.
Code Membership Inference for Detecting Unauthorized Data Use in Code Pre-trained Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Code pre-trained language models (CPLMs) are trained on open-source code, raising concerns about data infringement.
Approach: They propose a framework for detecting unauthorized code use in CPLMs . they use signal extraction from pre-training tasks and weighted inference to identify code membership status accurately.
Outcome: The proposed framework detects unauthorized code use with high accuracy.
Monte Carlo Tree Search Based Prompt Autogeneration for Jailbreak Attacks against LLMs (2025.coling-main)

Copied to clipboard

Challenge: Jailbreak attacks craft specific prompts or append adversarial suffixes to prompts, thereby inducing language models to generate harmful or unethical content and bypassing the model’s safety guardrails.
Approach: They propose a Monte Carlo Tree Search (MCTS) based Prompt Auto-generation (MPA) method to generate adversarial suffixes for valid jailbreak attacks.
Outcome: The proposed method outperforms existing methods on open-source and closed-source models and shows that it can generate harmful responses.
EMA: An Episodic Memory Agent for Efficient and Selective Memory (2026.findings-acl)

Copied to clipboard

Challenge: Existing memory-augmented methods often incorporate full dialog histories without filtering, resulting in information redundancy and inference latency.
Approach: They propose a framework that abstracts conversational context into Episodic Memory Units (EMUs) they propose EMA, MemDecider and a filtering decision module to reduce noise and improve overall performance.
Outcome: The proposed framework reduces token consumption by 11.48% while improving performance on two widely-used benchmarks.
Relaxing the Constraints: A Dual-Importance Projection Mechanism for Lifelong Model Editing (2026.findings-acl)

Copied to clipboard

Challenge: Existing knowledge editing methods rely on strict orthogonal projection to preserve previously edited knowledge, but this constraint limits gradient expressiveness, resulting in degradation of model generalization and overall performance as the number of edits increases.
Approach: They propose a method that leverages Singular Value Decomposition to identify critical gradient subspaces and introduces a dual mechanism comprising "accumulated importance" and "projection importance"
Outcome: Extensive experiments on five mainstream LLMs show that the proposed method achieves an average comprehensive performance improvement of 10.36% and effectively maintains the model’s general capabilities on downstream tasks.
MMAPS: End-to-End Multi-Grained Multi-Modal Attribute-Aware Product Summarization (2024.lrec-main)

Copied to clipboard

Challenge: Existing product summarization methods lack end-to-end product summaries and multi-grained multi-modal modeling.
Approach: They propose an end-to-end multi-grained multi-modal attribute-aware product summarization method that jointly models product attributes and generates product summaries.
Outcome: The proposed method outperforms state-of-the-art product summarization methods on a large-scale Chinese e-commence dataset.

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