Skip to content

75 results for “TRON”

ListGrid
What you seeeverything
RecentOldestAddedA–Z
All types210Papers75Articles69Write-ups26Threads16Repos12
Tools5Advisories3Talks3Courses1
📑 Papers“TRON”Clear all
arxiv.orgpaper🧠 AI

From Small to Large: Assessing Medical Reasoning, Benchmark Contamination, and Model Size in Language Models

This paper evaluates fourteen LLMs from six providers on 3,076 questions from MedQA-USMLE, MedMCQA, PubMedQA and MedBullets. It tests standard multiple choice, questions with answer choices withheld, and reconstruction of hidden questions from choices alone. Mean accuracy falls from 82.3% to 50.9% without choices, smaller models trail larger ones by 8.7 points, and the strongest models reconstruct about one question in four.

LLM
MedQA-USMLEMedMCQAPubMedQA+2

evals, research· Added 3 Nov 2026, published 30 Oct 2026

arxiv.orgpaper🛡️ Security

SecPO: Principled Adversarial Training for Prompt Injection Security

SecPO is a prompt injection defense that combines a new preference-optimization loss with adversarial training. It replaces the insecure DPO reference model with an approximated injection-invariant oracle, and trains on strong injections synthesized at best@240. Against Meta-SecAlign, AT cuts attack success rates 1.5-14.5x, and on Qwen3.6-27B AgentDojo ASR@800 falls to 8.8% from 78.8%, with no noticeable utility loss across nine benchmarks. Code, training data and model are released.

QwenHugging FaceLLM
prompt injectionAgentDojoMeta-SecAlign+3

AI Security· Added 3 Nov 2026, published 30 Oct 2026

eprint.iacr.orgpaper🛡️ Security

A Quantitative Evaluation of Constant-Time Analysis Tools

AutoBench-CT is a modular benchmark for constant-time analysis tools, with manually verified per-violation ground truth across 64 cryptographic tasks. It scores seven tools on operational performance, detection quality and usability. The authors explain why CT-grind (2010) is still the most used tool, list recurring limitations across tools, and propose a composite pipeline for stronger constant-time guarantees. Accepted at ACSAC 2026.

AutoBench-CTCT-grind
ACSAC

Hardware & RF, AppSec· Added 31 Oct 2026, published 29 Oct 2026

eprint.iacr.orgpaper🛡️ Security

High Precision Noise Cleaning for CKKS with Application to Asynchronous Threshold CKKS

High Precision Noise Cleaning for CKKS is an IACR ePrint preprint (2026/2675) by Zhihao Li, Cheng Hong and Tao Wei. It composes lower-degree Hermite polynomials to reach output noise bounds such as 2^-300 for noise flooding, and uses this to build an asynchronous threshold CKKS scheme with strong simulation security in the random oracle model. In OpenFHE, binary-message cleaning falls from 9.63 s to 1.54 s.

CKKSOpenFHE
noise floodingHermite interpolationfunctional bootstrapping+2

other· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

AskStream: When and What to Ask Proactively under Uncertainty in Streaming Video Understanding

AskStream is a multi-turn benchmark for streaming video understanding that adds a third proactive action, ask, alongside wait and answer, for cases where video or user information is incomplete. It has 438 videos, 2,714 manually annotated frame-level time windows (wait, ask, answer), four task categories and eight subtasks. The strongest model reaches only 52.18% on the proposed Ask-F1 metric, in both multiple-choice and open-ended settings.

multimodal large language model
AskStreamAsk-F1arXiv

evals, multimodal, research· Added 30 Oct 2026, published 28 Oct 2026

arxiv.orgpaper🧠 AI

Repairs for Whom? Evaluator-Executor Mismatch in Selecting Repairs for Failed LLM Agents

Repairs for Whom? studies single-step repairs of failed LLM agent trajectories and asks whether common evaluators (greedy replay, stronger models, oracles, log-reading judges) pick repairs that help the deployed agent. Using independent rollouts in ALFWorld and WebShop, greedy replay loses 0.06-0.13 in expected gain, and Qwen2.5-14B rollouts misselect repairs for Qwen2.5-7B. The authors recommend verifying repairs with the executor that will run them.

LLMQwen
ALFWorldWebShopQwen2.5-7B+2

research, agents, evals· Added 30 Oct 2026, published 28 Oct 2026

arxiv.orgpaper🧠 AI

Know, then Draw: A New Learning Paradigm for Visual Generation

Know, then Draw is a learning paradigm for visual generation that uses autoregressive pretraining to acquire semantic knowledge and diffusion post-training for high-fidelity rendering. Controlled comparisons find autoregression the stronger pretraining objective, and semantic quality matters more than AR-only generation quality. This motivates a purely semantic tokenizer trained with language supervision only. A 3B text-to-image model trained in 6,600 H100 GPU-hours scores 86 on GenEval and 87 on DPG-Bench.

diffusion modelTransformer
arXivGenEvalDPG-Bench+1

research, multimodal, training· Added 28 Oct 2026, published 27 Oct 2026

arxiv.orgpaper🧠 AI

AxisQ: Depth-Adaptive Channel--Frequency Quantization for Camouflaged Object Detection

AxisQ is a post-training quantization framework for camouflaged object detection (COD) that allocates activation bits by feature depth. It uses the channel domain for shallow features and the local-frequency domain for deep features, under a fixed per-layer average bit budget. It adds a boundary-aware Hessian approximation for reconstruction. On CAMO at W2A2, weighted F-measure improves 12.7% for CFRN and 33.3% for CamoFormer-P over the strongest baselines.

CNNTransformer
AxisQCFRNCamoFormer-P+1

research, inference, multimodal· Added 28 Oct 2026, published 27 Oct 2026

arxiv.orgpaper🛡️ Security

Reversible Pseudonymisation of Documents Sent to External LLMs: an Open Bilingual Benchmark and an Engine

Open bilingual (Russian and UK English) benchmark of five open pseudonymisation tools and a regex baseline, plus a new engine built on the two strongest tools. On a held-out set of 1,000 synthetic documents per language, the best existing tools leave a whole personal value visible in 61% (Russian) and 58% (UK) of documents. The engine does so in 0.3% and 0.2%. Russian name restoration reaches only 94.6%, below the 99% threshold. Real documents were not tested.

LLMpii-guard

AI Security· Added 27 Oct 2026, published 25 Oct 2026

arxiv.orgpaper🧠 AI

Reversible Pseudonymisation of Documents Sent to External LLMs: an Open Bilingual Benchmark and an Engine

This paper presents an open benchmark of five existing pseudonymisation tools and a regex baseline on Russian and UK English documents, plus an open engine built on the two strongest tools. On a held-out set of 1,000 synthetic documents per language, the best existing tools leave a whole value visible in 58 to 61% of documents. The engine does so in 0.2 to 0.3%. Russian name restoration reaches only 94.6%, below the 99% threshold. Real documents were not tested.

LLMpii-guard
Vladimir BeskorovainyiarXiv

evals, llm-apps, research· Added 27 Oct 2026, published 25 Oct 2026

eprint.iacr.orgpaper🛡️ Security

The Exact Bit Security of Hash-Based Signatures

The Exact Bit Security of Hash-Based Signatures is a 2026 IACR ePrint paper that analyses XMSS with 128-bit digests and SLH-DSA-128s in the random oracle model, with proofs formalised in Lean4. Strong unforgeability comes to 127 bits under most accounting modes but only 122 bits if just direct random oracle queries are counted. The authors give matching attacks, and show how resource accounting changes the result.

XMSSSLH-DSALean
Mikhail KudinovBenedikt WagnerEmile Wambsgans

other· Added 26 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

Causal Chain of Thought: Mitigating Attention Leakage via Context Isolation

CausalCoT is an inference framework that splits a problem into a directed acyclic graph of atomic sub-questions and evaluates each node in an isolated context holding only its direct causal parents. This removes attention paths to non-parent content, so intermediate steps drive the answer rather than leaking from global context. It keeps benchmark accuracy competitive and raises causal sensitivity of reasoning steps by 12 points on average, up to 21, over the strongest baseline. The graph also allows test-time corrections that propagate downstream.

LLMTransformer
arXiv

research, prompting· Added 24 Oct 2026, published 22 Oct 2026

arxiv.orgpaper🧠 AI

Beyond 4 bits: Data-Centric Post-training Quantization and Recovery

This paper studies 2-bit post-training quantization (PTQ) of six dense and mixture-of-experts models from 3.8B to 32B parameters. It finds the quantization representation matters most: vector codebooks give usable models where scalar PTQ falls to chance. Calibration and recovery data must be chosen jointly. The recipe uses about 2.3 effective bits per weight, keeps 89 to 97% of full-precision QA accuracy, and needs 1.4 to 30x less compute than the strongest QAT baseline.

Mixture of ExpertsLLM
arXiv

research, inference· Added 22 Oct 2026, published 20 Oct 2026

eprint.iacr.orgpaper🧠 AI

Analysis of an AI based code distinguisher

The paper analyses DeepDistinguisher, a transformer-like model that tells Goppa codes apart from random linear codes. Saliency maps and attention visualisation reveal a low-weight-row artifact in the random training instances that the model partly relies on. A pairwise-XOR rule inspired by minimum distance correlates strongly with the model's predictions, and the model loses most of its power on random matrices meeting both constraints. This suggests it exploits general combinatorial properties, not hidden algebraic structure.

Transformer
DeepDistinguisher

research· Added 20 Oct 2026, published 19 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Analysis of an AI based code distinguisher

Analysis of DeepDistinguisher, a transformer model that tells Goppa codes from random linear codes. Using saliency maps and attention visualization, the authors find a low-weight-row artifact in the random training instances that the model partly uses. They propose a pairwise-XOR rule on generator matrix rows that correlates strongly with the model's predictions. On random matrices meeting the minimum distance and XOR constraints, the model loses most of its accuracy, so it exploits general combinatorial properties rather than hidden algebraic structure.

DeepDistinguisherGoppa Distinguisher problemGoppa code

AI Security, other· Added 20 Oct 2026, published 19 Oct 2026

arxiv.orgpaper🛡️ Security

Concerns in Benchmarking Jailbreaks: An Empirical Study of Attack Success Rates

This arXiv paper tests eight jailbreak attacks against three open-weight language models under three evaluation procedures. Low-resource language attacks score 96.0% mean ASR under keyword matching but 2.7% under a Qwen3 judge using StrongREJECT instructions. At Ollama's default temperature of 0.8, 100 samples of an unchanged request give 100% ASR by keywords and 50% by the judge. The authors recommend explicit success definitions, matched response budgets, validated evaluators and cumulative-failure reporting.

OllamaQwenLLM
StrongREJECTDeepInceptionattack success rate+1

AI Security· Added 21 Oct 2026, published 19 Oct 2026

arxiv.orgpaper🧠 AI

Concerns in Benchmarking Jailbreaks: An Empirical Study of Attack Success Rates

Concerns in Benchmarking Jailbreaks is an October 2026 arXiv study of eight jailbreak attacks on three open-weight models under three evaluation procedures. Low-resource language attacks score 96.0% ASR by keyword matching but 2.7% under a Qwen3 evaluator using StrongREJECT instructions. Attack rankings flip with attempt budgets, and 100 samples at Ollama's default temperature 0.8 give 100% ASR by keywords, 50% by the evaluator.

OllamaQwen3LLM
StrongREJECTDeepInceptionarXiv

evals, ai-safety, research· Added 21 Oct 2026, published 19 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Privacy with Leakage from Falsifiable Assumptions

Privacy with Leakage from Falsifiable Assumptions is an ASIACRYPT 2026 paper by Francesco Berti and Itamar Levi. It replaces simulatability with "secure refreshing", a key-refreshing assumption that evaluation laboratories can test directly, and adds "strongly protected secure refreshing". Using these, it proves privacy of the PSV encryption scheme without assuming a leak-free component.

PSV encryption schemesecure refreshingstrongly protected secure refreshing+4

Hardware & RF· Added 20 Oct 2026, published 19 Oct 2026

arxiv.orgpaper🛡️ Security

RATION: Towards Quantitative Risk-Based Access Control for AI Agents

RATION is a security framework for AI agents that tracks measurable risks from agent actions and enforces quantitative constraints during task execution, instead of simply restricting actions. It builds a task-specific policy from explicit constraints in the user request plus implicit risks calibrated from historical runs of similar tasks. Experiments on four security benchmarks show strong security with high task utility across models and environments.

LLM
indirect prompt injectionRATION

AI Security· Added 21 Oct 2026, published 16 Oct 2026

arxiv.orgpaper🧠 AI

FlexPart: Text-Controlled Semantics-Aware 3D Part Segmentation at Flexible Granularity

FlexPart is a framework for text-controlled 3D mesh segmentation that assigns discrete part IDs to mesh faces through a view-independent part-identity field. It uses a control prompt of part names with location and shape clauses, trained on a VLM-built multi-granularity dataset. On FlexPartBench it raises average mIoU by 22% over the strongest baseline, and by 15% with planner-completed prompts.

vision-language model
FlexPartFlexPartBench

research, multimodal· Added 20 Oct 2026, published 16 Oct 2026

arxiv.orgpaper🧠 AI

Identify, Classify, Act: Per-Instruction Controlled Compliance for LLMs over External Data

EDIC is a decomposed reward framework that trains LLMs to decide, for each instruction embedded in external data such as documents or tool returns, whether to follow or reject it. A judge initialized with SFT and refined with GRPO attributes compliance per instruction and yields separate rewards for beneficial and harmful compliance. On Qwen3-4B it raises harmful-rejection by up to 7.7% and Arena-Hard-Auto utility by 12.5% over the strongest prior defense.

GRPOQwen3LLM
EDICQwen3-4BArena-Hard-Auto+1

research, training, ai-safety· Added 20 Oct 2026, published 16 Oct 2026

arxiv.orgpaper🧠 AI

Grounding Generative Verification in 3D Content

The paper introduces 3DVerifierBench, a 10-task benchmark for generative verification of 3D content. It scores accept/reject decisions, rejection explanations, and responses to controlled changes in specifications and candidates. A human study shows a 21.6-point gap to the strongest tested model, GPT-6 Astra. The authors also build a pipeline of multi-view fact extraction, controlled 3D editing and native annotations. It yields 14,126 training examples with contradiction explanations and linked counterfactuals. Verification-guided selection raises complete factual success from 26.7% to 90.0% with oracle selection over sixteen candidates, and human-guided recursive refinement satisfies all seven requirements for every input in an eight-input study.

multimodal large language model3D generation
3DVerifierBenchGPT-6 AstraarXiv

research, evals, multimodal· Added 17 Oct 2026, published 15 Oct 2026

arxiv.orgpaper🧠 AI

Private Retrieval Augmented Generation via Random Projection

Proposes protecting the retrieval datastore in RAG systems by applying the same random projection to datastore embeddings and query embeddings. This provably preserves query-item semantic similarity while substantially mitigating data extraction attacks. Across multiple RAG architectures and datasets it beats prior differential-privacy-based methods on retrieval and generation quality, with comparable empirical privacy under strong attacks, making it a practical baseline for privacy-preserving RAG.

RAGLLM
arXiv

research, llm-apps· Added 17 Oct 2026, published 15 Oct 2026

arxiv.orgpaper🛡️ Security

Private Retrieval Augmented Generation via Random Projection

Proposes applying the same random projection to both datastore embeddings and query embeddings in RAG systems. The authors claim this provably preserves query-to-item semantic similarity while substantially mitigating datastore data-extraction attacks. Across several RAG architectures and datasets it reportedly beats prior differential-privacy-based defenses on retrieval and generation quality, with comparable empirical privacy under strong attack models. It is presented as a lightweight baseline for privacy-preserving RAG.

LLM
differential privacydata extraction attacks

AI Security· Added 17 Oct 2026, published 15 Oct 2026

arxiv.orgpaper🧠 AI

Librarian Agents: Training LLMs to Curate Long-Context Workspaces that Anticipate Future Queries

Introduces Librarian Agents, where a builder agent turns raw unstructured documents into a hierarchical filesystem of synthetic files and reference links, forming a workspace for a downstream answering agent. Workspace construction is cast as a Markov decision process and the builder policy is trained with reinforcement learning to maximize downstream answering accuracy. It beats the strongest retrieval and precomputation baselines by 33 points on BrowseComp-Plus, amortizes construction cost over repeated queries, and generalizes zero-shot to BRIGHT with a 31-point average gain.

LLMClaude CodeRAG
Librarian AgentsBrowseComp-PlusBRIGHT+1

research, agents, llm-apps· Added 17 Oct 2026, published 15 Oct 2026

arxiv.orgpaper🧠 AI

Topology-Inspired Fine-Tuning for Wind-Field Super-Resolution

The paper fine-tunes a pretrained CNN wind-field super-resolution model with differentiable topology-inspired auxiliary losses on speed, gradient magnitude, soft high-speed level sets and local maxima. It also uses fixed-pair supervision at ground-truth persistence-pair endpoints located offline with the Topology ToolKit. A 16-configuration loss study on a fixed 168-field benchmark finds that gradient supervision gives the strongest persistence-diagram improvement, while fixed-pair supervision gives the most consistent joint improvement in persistence-diagram and merge-tree distances. The combined objective cuts bottleneck, W2,∞ and W2,2 distances by 31%, 25% and 27% relative to the pretrained CNN, at a cost of about half of standard fine-tuning's PSNR gain. It also shows that pointwise metrics and topological distances rank CNN and GAN models differently.

CNNGANTopology ToolKit
arXiv

research, training· Added 17 Oct 2026, published 15 Oct 2026

arxiv.orgpaper🧠 AI

GraphACM: Graph-based Action Consistency Measurement for Uncertainty Quantification in LLM Agents

GraphACM merges equivalent states from multiple rollouts of the same LLM agent task into a directed, action-labeled graph, so actions can be compared at shared decision states. It defines node-level and global action-consistency measures, and uses the global score as an uncertainty proxy to predict task success or failure. Across three LLMs on ALFWorld, AppWorld and WebShop it reaches an average AUROC of 0.811, above the strongest behavioral-consistency baseline (0.729) and verbalized confidence (0.769). It also shows where in a trajectory agent actions diverge.

LLM
GraphACMALFWorldAppWorld+2

research, agents, evals· Added 17 Oct 2026, published 15 Oct 2026

arxiv.orgpaper🧠 AI

Game2Real-Bench: Do Toy Games Reveal and Transfer to Real-World Visual Reasoning?

Game2Real-Bench tests whether vision-language model performance on procedurally generated toy games predicts real-world visual reasoning, and whether game examples help transfer. It has 1,000 verifiable game samples and 400 real-world samples, matched by shared reasoning requirements (fine-grained perception, spatial reasoning, constraint reasoning, sequential planning). Across 25 VLMs, game and real scores correlate strongly (Pearson/Spearman 0.935). One-shot game-to-real transfer on four models improves constraint reasoning for several but hurts fine-grained perception. The authors also release Game2Real-Dataset, with about 24K verified game samples across 18 tasks and 65 QA families.

vision-language model
Game2Real-BenchGame2Real-DatasetarXiv

evals, multimodal, research· Added 14 Oct 2026, published 13 Oct 2026

arxiv.orgpaper🧠 AI

UniW(A)M: A Unified Mixture-of-Experts Framework for World and World-Action Models

UniW(A)M is a mixture-of-experts model built on diffusion Transformers that unifies action-conditioned world modeling (AC-WM) with several world-action model (WAM) variants. Shared experts capture common physical dynamics, while atomic capability experts are reused across interfaces, each keeping its own conditional pathway. At deployment a plug-in adaptive interface router (PAIR), trained on a small subset of target-task chunk scenarios with the backbone frozen, picks a WAM interface for each execution chunk. It reaches 88.3% average real-world success against 76.7% for the strongest baseline, leads WorldArena on all three action-conditioned world-modeling tasks, and PAIR raises OOD success from 63.3% to 76.7%.

Mixture of Expertsdiffusion modelTransformer
UniW(A)MPAIRLIBERO+3

research, multimodal· Added 14 Oct 2026, published 13 Oct 2026

arxiv.orgpaper🧠 AI

LLM Agents for Automated Post-Training via Structured Recipe Optimization

Introduces Structured Recipe Optimization (SRO), a paradigm for automated LLM post-training that optimizes over a task-adapted recipe space covering data sources, data processing, cross-domain composition and training configuration. It pairs an LLM-based Recipe-Space Designer, which builds the recipe space for the target tasks, with a Multi-Domain Recipe Optimizer that uses structured trial evidence to guide LLM candidate construction and multi-objective Bayesian trial selection. SRO gets the highest average score in all evaluated target-model and agent-LLM combinations; for example, 41.1 vs 15.4 for the strongest baseline on Qwen3-1.7B with GPT-5.4, and 53.8 vs 40.8 on Qwen3-4B with DeepSeek-V4-Flash, in joint post-training across three capability domains and six benchmarks.

Qwen3LLM
Structured Recipe OptimizationGPT-5.4DeepSeek-V4-Flash+1

research, training, agents· Added 14 Oct 2026, published 13 Oct 2026

Showing 30 of 75

Show more