Skip to content

28 results for “Large Language Models”

What you seeeverything
  1. A Unified Hessian-Guided Framework for Post-Training Quantization

    This preprint proposes a unified post-training quantization framework for large language models. It derives a Hessian-guided approximation of the output change caused by joint weight and activation quantization, using a tractable Fisher approximation. Quantization ranges, linear transformations and weight rounding are optimized together under one output-sensitivity objective. The authors report gains over state-of-the-art transformation and rounding methods in channel-wise and block-wise settings.

    arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

  2. TrussTutor-Bench: Benchmarking large language models on solution accuracy, sycophancy, and error detection in statics

    TrussTutor-Bench is a benchmark of 200 verified two-dimensional truss problems from statics, paired with automatically generated student solutions. It evaluates thirteen LLMs on solution accuracy (64.5% to 97.0%), error detection (90.4% to 100%) and sycophancy. Models rejected their own correct solutions in 1.6% to 50.0% of cases when a student insisted the work was wrong. Sycophancy separated models; error detection did not.

    arxiv.orgpaperAdded 31 Oct 2026, published 28 Oct 2026🧠 AI

  3. Benchmarking decision models against generative large language models on medical multiple-choice questions

    This preprint benchmarks 13 decision models against 15 generative LLM configurations, including different reasoning settings, on 1,273 text-only four-option MedQA questions. Accuracy ran 67.71% to 89.08% for decision models and 78.32% to 96.86% for generative configurations. Decision models were cheaper and faster, but answers with probability of at least 0.90 still had error rates of 1.71% to 12.77%, and probability repeatability varied across three runs.

    arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🧠 AI

  4. Post-Training Large Language Models with LLMON

    LLMON (LLM Object Notation) is a framework that separates instructions from data and requires explicit identifier-based execution. The authors post-train Granite-4.1 3B and 8B base models with SFT then RL on a 4.6B-token structured corpus covering general, RAG and tool-calling data, with distractor variants. Attack success rates on indirect prompt-injection benchmarks fall from 53-100% to 0.02-5.6%, and general capability is preserved. Attention-based metrics diagnose failures per transformer layer.

    arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🛡️ Security

  5. Post-Training Large Language Models with LLMON

    LLMON (LLM Object Notation) is a framework that separates executable instructions from passive data and requires explicit identifier-based execution. The paper post-trains Granite-4.1 3B and 8B base models on a 4.6B-token corpus of general, RAG and tool-calling data with distractor variants, using SFT then RL. Attack success rates on indirect prompt-injection benchmarks fall from 53-100% to 0.02-5.6%, with general capabilities preserved. It also adds attention-based per-layer diagnostics.

    arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🧠 AI

  6. Reva: Real-Time Vulnerability Detection through Contextual Probing of Large Language Models

    REVA (REal-time Vulnerability Analysis) is a vulnerability detector that puts a module threat model, lightweight static analysis findings and call-graph information into one LLM forward pass. A trained probe reads the model's internal representations of the new function. On PrimeVul's held-out test set, REVA on GLM-5.3-Flash reaches 60.0% accuracy in about one second per function, matching the agentic VulTriage (59.2%) at over 250 times the speed and under a tenth of the cost. The probe is 14% to 17% more accurate than the LLM's own verdict.

    arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🧠 AI

  7. Reva: Real-Time Vulnerability Detection through Contextual Probing of Large Language Models

    REVA (REal-time Vulnerability Analysis) is an LLM-based vulnerability detector that screens each new function in one forward pass. It feeds the model a pre-computed module threat model, lightweight static analysis findings and call-graph data, then reads the model's internal representations with a trained probe. On PrimeVul's held-out test set with GLM-5.3-Flash it reaches 60.0% accuracy in about one second per function, matching the agentic VulTriage (59.2%) while over 250 times faster.

    arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🛡️ Security

  8. An Empirical Study of Recent Large Language Models for Knowledge Graph to Text Generation on Standard Benchmarks

    This empirical study benchmarks recent LLMs against fine-tuned encoder-decoder models on knowledge graph-to-text generation, using reference-based metrics and graph-grounded, reference-free LLM-based evaluation validated against human annotations. Recent LLMs narrow or close the gap on reference-based metrics and do better on graph-grounded ones. Prompted models make fewer contradictions and triple omissions, and fine-tuned models' errors grow faster with graph size.

    arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🧠 AI

  9. The Geometry of Metaphor: Probing and Steering Metaphor Representations in Large Language Models

    The Geometry of Metaphor is an October 2026 arXiv preprint that uses mechanistic interpretability to find causal subspaces for metaphor in LLMs of different architectures and sizes. The authors steer output on classification tasks across parts of speech. They also steer generation tasks, showing the metaphoricity of model output can be controlled. The abstract gives no model names or metrics.

    arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🧠 AI

  10. TRIAD: Benchmarking Omni-Modal Ambiguity in Multimodal Large Language Models

    TRIAD is a benchmark for omni-modal ambiguity resolution. It has 327 hand-written text-image-audio queries in 86 scene groups across 18 ambiguity categories, and removing any one modality makes the answer non-unique. Across 14 omni-modal systems, the best model trails humans by over 20 points in group accuracy. Without answer options, model group accuracy falls to single digits, and leave-one-out tests show audio cues are often underused.

    arxiv.orgpaperAdded 23 Oct 2026, published 22 Oct 2026🧠 AI

  11. HERMES: High-Performance Private Decoding for Large Language Models

    HERMES is a privacy-preserving inference (PI) system optimised for multi-token LLM decoding rather than prefill. It swaps high-round nonlinear protocols for compute- and bandwidth-heavy ones with fewer rounds, and adds a homomorphic-encryption matrix-multiplication protocol that keeps the KV cache encrypted on the server and uses grouped-query attention. On Llama 3.1 8B Instruct it cuts TPOT by up to 2.7× and total PI latency by up to 2.1×.

    eprint.iacr.orgpaperAdded 19 Oct 2026, published 18 Oct 2026🧠 AI

  12. Trapped in Your Story: Evaluating Narrative-Induced Sycophancy in Large Language Models

    This paper builds a benchmark of 500 debatable questions across ten domains to measure how user narratives steer LLM agreement. Each question has 11 matched conditions (one neutral, five mirrored narrative levels per opposing stance), giving 5,500 instances across seven LLMs. Causal framing and worldview synthesis raise agreement, personal experience can lower it, and GPT-5.1 ablations show bullet formatting also increases agreement.

    arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🧠 AI

  13. GACC-Bench: Benchmarking Goal-Adaptive Context Compression Ability across Large Language Models

    GACC-Bench is a benchmark for Goal-Adaptive Context Compression, testing how well LLMs retain goal-relevant information when compressing a source context under a length budget before downstream questions are known. It has 500 goals and 2,571 human-reviewed questions over 281 document and agent-trace contexts from seven collections; a fixed reader answers the withheld questions from the compressed context. Ten LLM compressors show large gaps to full-context performance, especially in answering every question tied to a goal. Target-goal conditioning improves accuracy over goal-agnostic compression, while mismatched goals hurt it.

    arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

  14. Self-correction Optimization for Interleaved Multimodal Generation

    This paper introduces Self-Correction Optimization (SCO), a training-free method that improves consistency in interleaved image-text generation from multimodal large language models. SCO treats the classifier-free guidance update as a reference signal and applies minimal corrections under two constraints—a new-event constraint for temporal consistency and a state-preserving constraint for visual-subject coherence—avoiding the computational cost of additional training with augmented data. The authors show improvements on interleaved multimodal generation benchmarks and extend the method to video generation tasks like robot manipulation and long-horizon handcrafting.

    arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🧠 AI

  15. TaoD2C-Bench: Benchmarking MLLMs for Industrial UI Code Generation Beyond Visual Fidelity

    TaoD2C-Bench is a benchmark for evaluating multimodal large language models (MLLMs) on industrial design-to-code (D2C) tasks — converting UI designs into code that satisfies implementation constraints, not just visual fidelity. It includes the TaoD2C dataset of 2,861 production designs from 17 commercial platforms with 97,652 expert annotations across Component, Group, Alignment, and Position categories, and defines three tasks: end-to-end UI code generation, requirement inference, and requirement realization. Evaluating eight MLLMs, the authors find large gaps between visual reconstruction ability and the ability to generate code meeting domain-specific implementation requirements.

    arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🧠 AI

  16. Fault-tolerant foundation models

    This arXiv paper shows that large language models can be trained to tolerate unreliable, faulty digital hardware, and that their error resilience improves rather than degrades as model size increases. Using modified neural scaling laws derived from 40,000 GPU-hours of training runs on simulated faulty hardware, the authors argue that LLMs learn to compute within "good" error-correcting codes whose relative overhead stays finite regardless of scale, suggesting a path toward running AI inference on low-energy, unreliable hardware for substantial energy savings.

    arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🧠 AI

  17. Secure Speculative Decoding for Large Language Models

    This arXiv paper presents the first systematic study of security implications of speculative decoding, a technique that speeds up LLM inference using a smaller draft model to propose tokens verified by the target model. The authors find a security-utility asymmetry: lossy speculative decoding methods raise jailbreak and prompt-injection attack success rates much faster than they degrade utility, with security degradation traced to early tokens generated by the draft model. They propose SecureSD, which applies stricter verification to early-position draft tokens, improving security while preserving inference efficiency and utility on security and utility benchmarks.

    arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026🛡️ Security

  18. Lens3D: Target-Conditioned Visual Foveation for Fine-Grained 3D Understanding

    Lens3D is a method for improving fine-grained object understanding in 3D large language models by using 3D localization to select informative 2D views that are fed to an external vision-language model (the LensUnd pipeline), then distilling that knowledge back into native 3D LLMs via detailed caption supervision (LensDistill), avoiding the need for external VLM calls at inference time. The authors also release LensBench, a held-out evaluation set of 2,068 objects with three reference descriptions each, and show gains in fine-grained object captioning on Video-3D LLM and 3DRS while preserving grounding and scene-level QA performance.

    arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026🧠 AI

  19. Security in the LLM Age - Greg Kroah-Hartman

    Linux kernel maintainer Greg Kroah-Hartman examines how large language models are impacting kernel security and open-source software maintainers. He analyzes automated vulnerability hunting by systems like Anthropic's Mythos, reveals empirical false-positive and error rates of approximately 50%, and outlines operational strategies for maintainers to defend against low-quality AI bug reports while leveraging local models safely.

    youtu.bevideoAdded 2 Oct 2026🛡️ Security

  20. Do Large Language Models Know Colombian Law? A Reliability Benchmark for the Colombian Legal System

    This paper introduces an expert-validated benchmark of 1,042 items spanning ten areas of Colombian law and three question formats (closed multiple-choice, semi-open, open-ended IRAC), used to evaluate 15 proprietary and open-weight LLMs. Closed-question accuracy ranges from 0.577 up to 0.905 (Gemini 3.1 Pro), but free-text factual correctness never exceeds 0.45 for any model, and only about half of the legal norms models cite in free-text answers are correct — the rest are wrong or fabricated. The study also finds a negative correlation (rho = -0.46) between answer relevancy and factual correctness, meaning models sound confident and responsive while frequently being wrong, and argues current LLMs need expert supervision plus source-grounding for reliable legal use.

    arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026🧠 AI

  21. Evaluating and Improving the Robustness of Large Language Models to Input Sequence Variations

    Thesis on evaluating and improving LLM robustness to adversarial input perturbations. It proposes the R_stab robustness metric (Jensen-Shannon divergence), ASA, an evolutionary black-box attack on LLM-as-a-Judge systems (up to 73.8% ASR), trojan trigger recovery on Trojan Detection Challenge 2023 (Pythia-1.4B), and a systematization of bypasses of multi-layer defenses from SaTML CTF 2024. For MCP agents it proposes AttestMCP (HMAC-attested tool calls) and the Commit Boundary pattern, cutting ASR from 53.7% to 12.4% on the 847-scenario MCPBench; the methods are implemented in JudgeGuard, TrojanArmor and MCPSec.

    arxiv.orgpaperAdded 9 Oct 2026, published 1 Oct 2026🛡️ Security

  22. Evaluating and Improving the Robustness of Large Language Models to Input Sequence Variations

    An arXiv thesis-style paper proposing R_stab(f), a Jensen-Shannon-divergence-based robustness metric for LLM outputs under small input perturbations, along with a proven bound V(h) <= 1 - R_class(h) for localized attacks. It introduces ASA, an adaptive evolutionary black-box attack against LLM-as-a-Judge systems reaching up to 73.8% attack success rate (62.6% cross-model transfer), evaluates trojan/backdoor detection on the Trojan Detection Challenge 2023 (Pythia-1.4B) and SaTML CTF 2024, shows that committees of 5-7 heterogeneous models cut Gemma-3-4B's ASR to 19.3%, and presents AttestMCP, an HMAC-based tool-call attestation scheme plus a "Commit Boundary" isolation pattern for MCP agents that cuts average ASR on the 847-scenario MCPBench from 53.7% to 12.4%. Methods ship as the JudgeGuard, TrojanArmor, and MCPSec software suites.

    arxiv.orgpaperAdded 5 Oct 2026, published 1 Oct 2026🛡️ Security

  23. A Citation-Grounded Benchmark for Trustworthy Earnings Call Transcript Analysis with Large Language Models

    This arXiv paper introduces a benchmark for evaluating whether LLM-generated financial analyses of earnings call transcripts are properly grounded in citable evidence. It proposes a numeric evidence evaluation method that assesses groundedness without expert annotation, an automated dataset construction pipeline, and the resulting ECTs-100 dataset built from the top 100 S&P 500 constituents. The study also examines "conscious incompetence" — whether models correctly abstain when evidence is insufficient rather than hallucinating — finding LLMs ground claims well but still struggle with factual correctness and recognizing insufficient evidence.

    arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026🧠 AI

  24. The Alignment Illusion in Multimodal Large Language Models

    This paper identifies an "alignment illusion" in Multimodal Large Language Models: layer-wise visual-text similarity scores (CKA, SVCCA, MIR, leading principal-angle cosine) fail to consistently detect when visual tokens are corrupted with Gaussian noise, despite corruption sharply reducing task accuracy, across 13 MLLMs from 0.5B to 72B parameters spanning five model families. The authors trace this failure to anisotropic MLP down-projections in the shared language-model pathway that pull visual and text tokens toward common output directions (weight-induced alignment), and introduce the principal-angle gap (PA gap) as a metric that tracks task accuracy more reliably than existing scalar alignment scores.

    arxiv.orgpaperAdded 26 Sep 2026, published 24 Sep 2026🧠 AI

  25. NEUROTESTGEN: Neuro-Symbolic Guided Test Generation with Large Language Models

    NEUROTESTGEN is a hybrid test generation approach that combines symbolic execution (via the Z3 SMT solver) with LLM-driven test synthesis to reach target lines and branches for structural code coverage. It uses Z3 to derive path constraints as a guidance specification, has an LLM synthesize concrete executable tests from that specification (falling back to LLM-inferred constraints for object-related conditions SMT solvers cannot handle), and iterates with feedback until coverage goals are met. Evaluated across Llama 3.3 70B, GPT-4o Mini, Claude 3.5 Haiku, and Claude Sonnet 4.6, it outperforms prior state-of-the-art on a standard benchmark.

    arxiv.orgpaperAdded 26 Sep 2026, published 24 Sep 2026🧠 AI

  26. Flash-dLLM: IO-Aware KV Caching and Parallel Decoding for Fast, Memory-Efficient Diffusion LLMs

    Flash-dLLM is a training-free inference acceleration framework for diffusion large language models (dLLMs) that tackles GPU memory I/O bottlenecks in KV-cache-enabled dLLM inference via an I/O-aware fused KV-cache kernel, combined with a draft-and-verify decoding strategy where the same dLLM acts as both drafter and verifier. It reports 5.1x and 11.0x speedups over the prior strongest baseline Elastic-Cache on GSM8K and HumanEval respectively, while preserving generation quality and scaling to longer sequences and larger batches.

    arxiv.orgpaperAdded 23 Sep 2026, published 22 Sep 2026🧠 AI

  27. tmylla/Awesome-LLM4Cybersecurity

    Awesome-LLM4Cybersecurity is a GitHub-hosted, continuously updated literature review (861+ papers as of 2026) organized around three research questions: building domain-specific security LLMs, applying LLMs to cybersecurity tasks (threat intelligence, fuzzing, vulnerability detection, program repair, insecure code generation, LLM-assisted attack and defense), and future directions like security-focused LLM agents. It accompanies the paper "When LLMs Meet Cybersecurity: A Systematic Literature Review" (Zhang et al., Cybersecurity journal, 2025) and serves as an index for researchers tracking the intersection of large language models and security.

    github.comrepoPublished and added 10 Jun 2026🛡️ Security

  28. The EASIEST Way To Hack Every AI Model (Crescendo Jailbreak Method)

    A YouTube video demonstrating the "Crescendo" jailbreak method, a multi-turn conversational technique for gradually steering large language models into producing restricted or harmful outputs by escalating context across successive prompts. The video claims applicability across "every AI model," positioning it as a practical walkthrough of a known LLM jailbreak class rather than a single-model exploit. Actual page content (description/transcript) was not retrievable at fetch time, so technical depth is unconfirmed.

    youtu.betalkAdded 9 May 2026, published 13 May 2025🛡️ Security