Generative engine optimization (GEO) has reshaped how sellers compete for visibility in LLM-generated rankings. By embedding persuasive arguments in the content they control, sellers can influence how generative engines rank products and web pages and push their own items to the top. Existing defenses either detect harmful intent or unnatural language, which fluent GEO content often lacks, or rewrite all candidates, which alters legitimate listings without identifying the manipulated ones. However, these approaches overlook the persuasive structure through which GEO attacks influence LLM-based rankings. To address this gap, we present SCI-Defense, a framework for detecting persuasion-structured ranking manipulation, in which an LLM judge scores five persuasion devices grounded in research on influence and deception: authority, social proof, scarcity and urgency, comparative claims, and narrative purposiveness. Two lightweight gates for unnatural strings and inflated relevance complement the judge, and flagged candidates are demoted rather than rewritten, each with a record of the candidate and the criterion that triggered the flag. On 1,152 optimized CORE attacks across six Amazon product categories and six MS MARCO web domains, SCI-Defense detects 89.6% of reasoning attacks and 96.2% of review attacks at a 1.2% false positive rate and blocks 96.1% of the attacks that pushed their target into the top three. On a 120-query subset, paraphrasing and truncation block a similar share of attacks but push 4.0--4.5% of honest items out of the top three, compared with 0.6% for SCI-Defense.
Post-training quantization (PTQ) has emerged as a promising approach for reducing the memory footprint and computational cost of large language models (LLMs), enabling efficient deployment without full model retraining. However, existing PTQ methods struggle to simultaneously support weight–activation joint quantization and extreme low-bit weight quantization. This limitation primarily arises from the depth of LLMs and their strong cross-layer dependencies, which cause quantization errors to propagate and accumulate across layers, ultimately leading to significant performance degradation. In this paper, we present ACBQ, a simple yet effective framework that simultaneously addresses weight–activation joint quantization and extreme weight quantization. We first propose a granular quantization strategy that treats self-attention and FFN as separate quantization units with module-specific optimization objectives. To mitigate the propagation and accumulation of quantization errors across layers, we introduce an adaptive cross-block quantization strategy that explicitly accounts for cross-layer dependencies by encouraging consistency across blocks. Extensive experiments across diverse LLMs, including OPT and the LLaMA family, demonstrate that ACBQ achieves superior performance under both W4A4 and highly aggressive W2 settings, while incurring negligible additional computational overhead.
尚无 AI 解读，展示原文摘要
cs.CL
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表
Qihua Dong, Yitian Zhang, Huimin Zeng Northeastern University, Yizhou Wang Adobe Systems, Jianglin Lu, Kuo Yang Northeastern University, Yun Fu
Multimodal large language models (MLLMs) are making rapid strides in complex visual reasoning. This survey synthesizes the emerging paradigm of Image-Grounded Chain-of-Thought (IG-CoT), where models ground intermediate inferences by interleaving textual rationales with visual state updates. We formalize IG-CoT, present a method-centric taxonomy covering prompting, supervised fine-tuning, and reinforcement learning, and map these techniques to representative benchmarks. Our analysis identifies two domains where IG-CoT offers significant advantages: detail-oriented reasoning requiring meticulous perception, and imagined-world reasoning for simulating unseen states in games, geometry, and planning. We discuss the practical trade-offs of current methods regarding controllability, data, and compute. We conclude by highlighting key challenges (efficiency, data quality, and generative capabilities) and outlining promising future directions, including lightweight architectures, richer intermediate supervision, and method-aware evaluations that better assess faithfulness and long-horizon reasoning. We maintain a continuously updated paper list at https://github.com/dddraxxx/Awesome-Image-Grounded-CoT.
尚无 AI 解读，展示原文摘要
cs.CL · cs.CV
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表
Jiaju Chen, Yuxuan Lu, Xiaojie Wang Amazon, Huimin Zeng, Jing Huang Amazon, Jiri Gesi Amazon Science, Ying Xu Harvard University, Harvard University, Bingsheng Yao Northeastern University 等 9 位作者
Nearly all human work is collaborative; thus, the evaluation of real-world NLP applications often requires multiple dimensions that align with diverse human perspectives. As real human evaluator resources are often scarce and costly, the emerging “LLM-as-a-judge” paradigm sheds light on a promising approach to leverage LLM agents to believably simulate human evaluators. Yet, to date, existing LLM-as-a-judge approaches face two limitations: persona descriptions of agents are often arbitrarily designed, and the frameworks are not generalizable to other tasks. To address these challenges, we propose MAJ-EVAL, a Multi-Agent-as-Judge evaluation framework that can automatically construct multiple evaluator personas with distinct dimensions from relevant text documents (e.g., research papers), instantiate LLM agents with the personas, and engage in-group debates with multi-agents to generate multi-dimensional feedback. Our evaluation experiments in both the educational and medical domains demonstrate that MAJ-EVAL can generate evaluation results that better align with human experts’ ratings compared with conventional automated evaluation metrics and existing LLM-as-a-judge methods.
尚无 AI 解读，展示原文摘要
cs.CL · cs.MA
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表