Anton Gusarov, Anastasia Volkova, Valentin Khrulkov, Andrey Kuznetsov, Evgenii Maslov, Ivan Oseledets
Knowledge graph question answering has traditionally focused on Resource Description Framework (RDF) graphs, SPARQL queries, and triple-based representations. Labeled Property Graphs (LPGs), however, pose a different challenge for LLM-based query generation: executable Cypher queries must align with schema structure, traversal direction, property keys, and literal entity values. This motivated us to introduce VeriCypher, an LLM-based text-to-Cypher framework for question answering over LPGs. It combines query generation conditioned on Cypher-like graph schema summaries with runtime execution, LLM-based query evaluation, and iterative correction where the central mechanism is named-entity verification: the system extracts node labels, relationship patterns, property keys, and literal values from generated queries, checks them against the target graph and schema, and turns mismatches into correction instructions for the next generation step. We evaluate VeriCypher on the CypherBench benchmark across multiple domains and LLM backbones. Compared with an LLM baseline, this method consistently improves answer correctness and query robustness. Ablation results further show that named-entity verification helps correct hallucinated schema elements and entity values, supporting more reliable LLM-based question answering over heterogeneous property graphs.
Diffusion-based text-to-image models have recently been distilled into few-step samplers and fast generators, reducing inference cost while maintaining high image quality. However, text-guided editing with such accelerated backbones remains challenging: inversion in a small number of steps is unreliable, local errors accumulate along the trajectory, and existing fast-editing methods typically rely on backbone-specific inversion procedures, which limits their transferability. In this work, we propose a simple and universal framework for text-guided image editing with arbitrary accelerated diffusion and flow-matching models. Instead of optimizing local, per-timestep objectives, we directly minimize a global editing objective over the entire inversion-generation trajectory. The framework fine-tunes only 1.5-7 % of the base-model parameters through two lightweight LoRA adapters (forward and backward), trained on fewer than 10 K triplets from the publicly available HQ-Edit dataset. We validate our method on three architecturally distinct backbones: consistency-distilled SD1.5 LCM-Dreamshaper, adversarial-distilled SDXL-Turbo, and rectified-flow-distilled Z-Image-Turbo. On PIE-Bench, our method achieves the strongest editing alignment within each backbone family while ensuring a strong level of content preservation. Inference adds no extra steps beyond the standard inversion and editing passes. The project page with visual results is available at iliabeletskii.github.io/inverse-and-edit.
Viktoriia A. Chekalina FusionBrain Lab, Gerasin Timofey Independent, Andrey Kuznetsov Innopolis University and FusionBrain Lab, Evgeny Frolov Higher School of Economics, Higher School of Economics and AXXX
Quantization has shown strong results in preserving model quality under compression. However, under aggressive bit-width reductions, even quantization may require additional information to prevent performance degradation. A natural source of it is second-order curvature information, captured by the Hessian. Since the Hessian of the model layers is prohibitively large, direct computation is infeasible, making structured parameterizations and approximations crucial in practice.In this work, we propose efficient Kronecker-factored approximation yielding state-of-the-art performance when integrated into existing quantization schemes. Evaluations on the LLaMA and Qwen model families show near-baseline quality at 4-bit compression and only a 5–6% degradation at 2-bit. Moreover, our method substantially accelerates the most expensive component in second-order quantization – Hessian parameterization – achieving up to a 10× speedup over prior approaches.
尚无 AI 解读，展示原文摘要
cs.CL
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表