← Search

Yu-Neng Chuang

17 accepted papers

2026

DTS: Enhancing Large Reasoning Models via Decoding Tree Sketching

ICML 2026poster

Large Reasoning Models (LRMs) achieve remarkable inference-time improvements through parallel thinking. However, existing methods rely on redundant sampling of reasoning trajectories, failing to effectively explore the reasoning space to uncover high-quality solutions. To address these limitations, …

Cited by 0SourceScholar
2026

FAFO: Lossy KV Cache Compression for Lossless Inference Acceleration via Draftless Fumble Decoding

ICML 2026poster

Lossy KV cache compression is a well-explored subfield of machine learning efficiency, with improved latency being one of its major gains. However, lossy compression techniques can fumble from time to time, exhibiting various — and often catastrophic — failure patterns that are not only difficult to…

Cited by 0SourceScholar
2025

A Decoupled Multi-Agent Framework for Complex Text Style Transfer

EMNLP 2025

Text style transfer (TST) modifies a source sentence to match a target style while preserving its semantics. While existing models perform well on simple styles like sentiment and formality, they struggle with complex, entangled styles such as poetry and brand-specific tones, which require advanced

Cited by 0SourcePDFScholar
2025

DHP Benchmark: Are LLMs Good NLG Evaluators?

NAACL 2025findings

Large Language Models (LLMs) are increasingly serving as evaluators in Natural Language Generation (NLG) tasks; this is often referred to as “LLM-as-a-judge” paradigm. However, the capabilities of LLMs in evaluating NLG quality remain underexplored. Current studies depend on human assessments and si…

Cited by 6SourcePDFScholar
2025

Learning to Route LLMs with Confidence Tokens

ICML 2025poster

Large language models (LLMs) have demonstrated impressive performance on several tasks and are increasingly deployed in real-world applications. However, especially in high-stakes settings, it becomes vital to know when the output of an LLM may be unreliable. Depending on whether an answer is trustw…

Cited by 0SourcePDFScholar
2025

LoRATK: LoRA Once, Backdoor Everywhere in the Share-and-Play Ecosystem

EMNLP 2025

Backdoor attacks are powerful and effective, but distributing LLMs without a proven track record like ‘meta-llama‘ or ‘qwen‘ rarely gains community traction. We identify LoRA sharing as a unique scenario where users are more willing to try unendorsed assets, since such shared LoRAs allow them to enj

2025

Quantized Can Still Be Calibrated: A Unified Framework to Calibration in Quantized Large Language Models

ACL 2025long

Although weight quantization helps large language models (LLMs) in resource-constrained environments, its influence on the uncertainty calibration remains unexplored. To bridge this gap, we presents a comprehensive investigation of uncertainty calibration for quantized LLMs in this work. Specificall…

Cited by 0SourcePDFScholar
2025

ReasonerRank: Redefining Language Model Evaluation with Ground-Truth-Free Ranking Frameworks

ACL 2025finding

Large Language Models (LLMs) are increasingly adopted across real-world applications, yet traditional evaluations rely on expensive, domain-specific ground-truth labels that are often unavailable or infeasible. We introduce a ground-truth-free evaluation framework focused on reasoning consistency an…

Cited by 0SourcePDFScholar
2025

Self-Ensemble: Mitigating Confidence Distortion for Large Language Models

EMNLP 2025

Although Large Language Models (LLMs) perform well in general fields, they exhibit a **confidence distortion problem** on multi-choice question-answering (MCQA), particularly as the number of answer choices increases. Specifically, on MCQA with many choices, LLMs suffer from under-confidence in corr

Cited by 0SourcePDFScholar
2024

KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches

EMNLP 2024finding

Long context capability is a crucial competency for large language models (LLMs) as it mitigates the human struggle to digest long-form texts. This capability enables complex task-solving scenarios such as book summarization, code assistance, and many more tasks that are traditionally manpower-inten…

2024

Learning to Compress Prompt in Natural Language Formats

NAACL 2024long

Large language models (LLMs) are great at processing multiple natural language processing tasks, but their abilities are constrained by inferior performance with long context, slow inference speed, and the high cost of computing the results. Deploying LLMs with precise and informative context helps…

2024

Secure Your Model: An Effective Key Prompt Protection Mechanism for Large Language Models

NAACL 2024findings

Large language models (LLMs) have notably revolutionized many domains within natural language processing due to their exceptional performance. Their security has become increasingly vital. This study is centered on protecting LLMs against unauthorized access and potential theft. We propose a simple…

2024

TVE: Learning Meta-attribution for Transferable Vision Explainer

ICML 2024poster

Explainable machine learning significantly improves the transparency of deep neural networks. However, existing work is constrained to explaining the behavior of individual model predictions, and lacks the ability to transfer the explanation across various models and tasks. This limitation results i…

2024

Taylor Unswift: Secured Weight Release for Large Language Models via Taylor Expansion

EMNLP 2024main

Ensuring the security of released large language models (LLMs) poses a significant dilemma, as existing mechanisms either compromise ownership rights or raise data privacy concerns. To address this dilemma, we introduce TaylorMLP to protect the ownership of released LLMs and prevent their abuse. Spe…

2023

CoRTX: Contrastive Framework for Real-time Explanation

ICLR 2023poster

Recent advancements in explainable machine learning provide effective and faithful solutions for interpreting model behaviors. However, many explanation methods encounter efficiency issues, which largely limit their deployments in practical scenarios. Real-time explainer (RTX) frameworks have thus b…

2022

Accelerating Shapley Explanation via Contributive Cooperator Selection

ICML 2022spotlight

Even though Shapley value provides an effective explanation for a DNN model prediction, the computation relies on the enumeration of all possible input feature coalitions, which leads to the exponentially growing complexity. To address this problem, we propose a novel method SHEAR to significantly a…

2020

Skewness Ranking Optimization for Personalized Recommendation

UAI 2020poster

In this paper, we propose a novel optimization criterion that leverages features of the skew normal distribution to better model the problem of personalized recommendation. Specifically, the developed criterion borrows the concept and the flexibility of the skew normal distribution, based on which t…