Papers by Xianglong Liu

17 papers
Scaling Laws for Code: Every Programming Language Matters (2026.findings-acl)

Copied to clipboard

Challenge: Existing studies focus on language-agnostic settings, neglecting the inherently multilingual nature of modern software development.
Approach: They propose a proportion-dependent scaling law that prioritizes high-utility languages . they propose PLs to have varying effects during pre-training that affect model performance .
Outcome: The proposed scaling law is based on 1000+ experiments across multiple languages and models.
Outlier Suppression+: Accurate quantization of large language models by equivalent and effective shifting and scaling (2023.emnlp-main)

Copied to clipboard

Challenge: asymmetric outliers in transformer language models are a challenge for post-training quantization . we propose a framework for outlier suppression that can be seamlessly migrated into subsequent modules .
Approach: They propose a framework for post-training quantization that includes the channel-wise shifting and scaling for concentration.
Outcome: The proposed framework can be migrated into subsequent modules while maintaining equivalence.
LoopCoder: Scaling Code Intelligence via Looped Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Large language models have mastered syntax-level code generation, but complex algorithmic reasoning remains a challenge.
Approach: They propose a recurrent inductive bias that aligns with the recursive nature of programming logic.
Outcome: The proposed model achieves comparable performance to standard dense models with more parameters.
Dynamic Parallel Tree Search for Efficient LLM Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Recent methods focus on search accuracy while overlooking computational efficiency.
Approach: They propose a parallelism framework that dynamically optimizes reasoning path in inference.
Outcome: The proposed framework improves efficiency by 2-4 on average while maintaining or even surpassing existing reasoning algorithms in accuracy.
SharedRequest: Privacy-Preserving Model-Agnostic Inference for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing privacy-preserving inference methods sacrifice utility or efficiency, authors say . current approaches suffer a trilemma between privacy, utility, and efficiency, they say .
Approach: They propose a model-agnostic framework for privacy-preserving LLM inference that reformulates privacy protection at the batch level rather than the individual-prompt level.
Outcome: The proposed model-agnostic framework achieves 20% higher utility than previous models . it reduces query cost by up to 5 compared to non-batched inference .
Context as a Tool: Context Management for Long-Horizon SWE-Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing large language models rely on append-only context maintenance or passively triggered compression heuristics, leading to context explosion, semantic drift, and degraded reasoning in long-running interactions.
Approach: They propose a new context management paradigm that elevates context maintenance to a callable tool . they propose 'cat' framework that injects context-management actions into complete interaction trajectories .
Outcome: The proposed model outperforms ReAct-based agents and static compression baselines on SWE-Verified tests.
DB-LLM: Accurate Dual-Binarization for Efficient LLMs (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for ultra-low bit quantization cause severe accuracy drops . a novel Dual-Binarization method is proposed for efficient Large Language Models .
Approach: They propose a Dual-Binarization method that takes 2-bit-width and binarization into account . they propose DB-LLM, which uses a 2-bit binarized weighted model to represent weights efficiently .
Outcome: The proposed method surpasses the current State-of-the-Art in ultra-low bit quantization and achieves 20% reduction in computational consumption compared to the SOTA method under the same bit-width.
SecureWebArena: A Holistic Security Evaluation Benchmark for LVLM-based Web Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing security benchmarks only cover user-level prompts and environmental threats . however, these models are vulnerable to pop-up attacks and prompt injections .
Approach: They propose a security benchmark that covers a set of six attack vectors that span both user-level and environment-level manipulations.
Outcome: The proposed security benchmarks cover a set of six real-world web environments with 2,970 adversarial trajectories and a multi-layered evaluation protocol dissecting agent failures across internal reasoning, behavioral execution, and task outcomes.
Reasoning-Augmented Conversation for Multi-Turn Jailbreak Attacks on Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for implementing multi-turn jailbreaks struggle to balance semantic coherence with attack effectiveness, resulting in benign semantic drift or ineffective detection evasion.
Approach: They propose a framework that reformulates harmful queries into benign reasoning tasks and leverages LLMs’ strong reasoning capabilities to compromise safety alignment.
Outcome: The proposed framework achieves state-of-the-art attack effectiveness in complex conversational scenarios, with average ASRs increasing by up to 96%.
Token-Aware Editing of Internal Activations for Large Language Model Alignment (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to optimize the behavior of large language models neglect misalignment discrepancies among tokens, resulting in deviant alignment direction and inflexible editing strength.
Approach: They propose a token-aware editing approach to exploit the misalignment discrepancy among tokens to enhance activation probing and facilitate intervention.
Outcome: Extensive experiments on three alignment capabilities demonstrate the efficacy of the proposed approach surpassing baseline by 25.8% on the primary metric of truthfulness with minimal cost.
Adaptive Contrastive Knowledge Distillation for BERT Compression (2023.findings-acl)

Copied to clipboard

Challenge: Existing knowledge distillation methods for BERT implicitly learn discriminative student features by mimicking the teacher features.
Approach: They propose a new knowledge distillation approach called adaptive contrastive knowledge distilling for BERT compression using hidden state features in BERT as explicit supervision to learn discriminative student features.
Outcome: The proposed approach improves on multiple natural language processing tasks.
Lexical Diversity-aware Relevance Assessment for Retrieval-Augmented Generation (2025.acl-long)

Copied to clipboard

Challenge: Extensive experiments on widely used benchmarks demonstrate the efficacy of our approach, yielding a 10.6% accuracy improvement on HotpotQA.
Approach: They propose a Lexical Diversity-aware RAG method to address the biases in relevant information retrieval and utilization induced by lexical diversity.
Outcome: Extensive experiments on widely used benchmarks show the proposed method yields a 10.6% accuracy improvement on HotpotQA.
Uncovering Strategic Egoism Behaviors in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Extensive experiments on 9 proprietary LLMs reveal that SE behaviors are widespread . study identifies egoistic decision-making as a risk for large language models .
Approach: They propose a benchmark to measure egoistic behavior in large language models . they propose toxicity, jailbreak vulnerability and a lightweight mitigation that reinforces situational constraints .
Outcome: The proposed model has a 67.96% occurrence rate and frequently manifests as manipulative coercion.
FrontCoder: Scaling Visual Fidelity in Front-End Code Generation (2026.findings-acl)

Copied to clipboard

Challenge: Existing work on front-end code generation fails to provide visual fidelity and rendering quality for front- end developers.
Approach: They propose a three-stage pipeline to enhance front-end code generation capabilities in LLMs . they use synthetic data, quality-controlled supervised fine-tuning, and reinforcement learning .
Outcome: The proposed model achieves competitive performance with frontier models while maintaining generation efficiency.
Half-S: Halving the Scale for Near-Lossless 4-Bit LLM Training (2026.findings-acl)

Copied to clipboard

Challenge: Existing 4-bit training pipelines rely on max-scaling, which causes representation collapse . despite this, there are limitations in the accuracy of 4-bit LLM training .
Approach: They propose a scaling strategy that uses half-scaling as a hardware-friendly default . they propose fp4 support that allows for a faster scaling of large language models .
Outcome: The proposed scaling strategy narrows the gap between theoretical optimum and BF16 while maintaining the efficiency benefits of 4-bit training.
LLMC: Benchmarking Large Language Model Quantization with a Versatile Compression Toolkit (2024.emnlp-industry)

Copied to clipboard

Challenge: Existing quantization techniques have been categorized as 'simple' and 'highly efficient' however, their configurations vary from each other and cannot be fairly compared .
Approach: They propose a plug-and-play compression toolkit to explore the impact of quantization.
Outcome: The proposed toolkit explores the impact of quantization on large language models.
UCoder: Unsupervised Code Generation by Internal Probing of Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated remarkable capabilities in code generation tasks, but their effectiveness relies on supervised training with extensive labeled data and computational resources.
Approach: They propose an unsupervised method that leverages Internal Probing of Large language models for Code generation without any external corpus, even unlabeled code snippets.
Outcome: The proposed method can achieve competitive performance compared to supervised approaches while reducing the dependency on labeled data and computational resources.

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