Search: “ground-truth”

The Verifiable Action Card: Trustworthy Human-in-the-Loop Control for Secure Autonomous Agentsnew

Verifiable Action Card architecture blocks indirect prompt injection in agentic browsers, cutting attack success from 68-100% to 0%.

Researchers propose VAC, a browser-architecture defense that reconstructs approval prompts from the ground-truth pending action and trusted intent provenance, rendering them out-of-band in trusted browser chrome. On a 24-scenario benchmark covering confused-deputy attacks, dialog forging, and indirect prompt injection, attack success fell from 68-100% to 0% across evaluated LLMs, with 78% legitimate-task completion and a 0% false-block rate. Approval is bound to the exact action re-verified at dispatch.

arXiv cs.CR·Sep 16, 10:06 UTC · 18h agoAI safety & security

Hierarchical NeRF with JAX3D for Volumetric Rendering, Novel-View Synthesis, and 3D Reconstruction

MarkTechPost tutorial implements a hierarchical NeRF in JAX using jax3d volume-rendering primitives for novel-view synthesis and 3D reconstruction.

The tutorial builds an end-to-end hierarchical Neural Radiance Field using JAX, Flax, Optax, and jax3d's volume-rendering functions (sample_along_rays, volume_rendering, sample_piecewise_constant_pdf). It implements positional encoding, skip connections, separate coarse and fine networks, and view-direction conditioning with hierarchical importance sampling. Training uses JAX JIT compilation, Adam optimization, exponential learning-rate decay, and gradient clipping. Evaluation covers PSNR, depth and opacity visualization, 360-degree rendering, and marching-cubes geometry extraction.

MarkTechPost·Sep 13, 19:46 UTC · 3d agoAI research

Implementation of Machine Learning Workflows with NVIDIA cuML, RAPIDS, GPU Benchmarking, Explainability, Clustering, and Model Inference

Hands-on tutorial implements NVIDIA cuML and RAPIDS to GPU-accelerate scikit-learn-style ML workflows with benchmarking, clustering, and inference.

The tutorial demonstrates NVIDIA cuML as a GPU-accelerated machine learning framework, using cuml.accel to speed up unmodified scikit-learn scripts with zero code changes and the native cuML API for CuPy/cuDF interoperability. It benchmarks CPU versus GPU implementations of PCA, K-Means, nearest-neighbor search, logistic regression, random forests, and DBSCAN on datasets up to 200,000 samples with 64 features. It also builds GPU pipelines with UMAP, t-SNE, and HDBSCAN, validates GPU-generated SHAP explanations, uses the FIL library for forest inference, and covers model serialization and GPU/CPU portability.

MarkTechPost·Sep 13, 01:42 UTC · 4d agoAI tools & infra

Label-Guided Knowledge Distillation for 3D-CNNs in Action Recognition

LGKD uses ground-truth labels to guide feature distillation for 3D-CNNs, combining sample-wise and class-wise distillation for action recognition.

The paper proposes Label-Guided Knowledge Distillation (LGKD) for 3D-CNNs, noting that most video feature distillation methods are simple adaptations of image techniques that neglect temporal-dimension differences. LGKD combines sample-wise distillation, which uses label information and the teacher's probability distribution to guide features impacting temporal accuracy, with class-wise distillation employing a prototype network to capture relational knowledge among same-category samples. Experiments on the UCF101 and HMDB51 action recognition benchmarks achieve competitive results.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:21 UTC · 5d agoAI research

Google Research Releases ToolGrad: Answer-First Framework Hits 99.8% Pass Rate for Tool-Use Data Generation

Google Research and partners introduce ToolGrad, a verified tool-chain-first data generation framework reaching 99.8% pass rate and boosting Gemma-3-12B to 83.1 on BFCL.

Researchers from Google, the University of Tokyo, RIKEN AIP, and Tohoku University released ToolGrad, which inverts query-first tool-use data generation by executing and verifying API chains before annotating them with user queries. On the ToolBench database of 16,000+ APIs, ToolGrad raised generation pass rate from 63.8% to 99.8% while increasing tool uses per sample from 2.1 to 3.4 and cutting tool-use steps from 34.3 to 20.0. Fine-tuning Gemma-3 at 1B, 4B, and 12B parameters on the 500-sample ToolGrad-500 dataset lifted ToolGrad-12B to 83.1 on the Berkeley Function Calling Leaderboard, near Gemini 2.5 Pro at 83.2 and ahead of GPT-5 at 74.4. Code is Apache-2.0, with the dataset, PyPI package, and models available on Hugging Face.

MarkTechPost·Sep 11, 06:01 UTC · 5d agoAI research1

Negative Self-Distillation: Learning to Reason by Avoiding Flaws

Researchers propose Negative Self-Distillation (NSD), a label-free LLM self-improvement method that diverges from self-generated flawed reasoning rather than imitating privileged solutions.

The authors show On-Policy Self-Distillation can degrade complex reasoning by forcing imitation of artificially confident traces built on privileged information, suppressing uncertainty and self-correction. NSD instead generates a question-specific negative condition — such as acting as a 'careless reasoner' — and pushes the model's distribution away from it without ground-truth labels. A dynamic gating mechanism isolates reasoning-critical tokens so gradient updates fix behavioral flaws without damaging foundational linguistic capabilities. NSD consistently outperforms OPSD and other label-free, self-bootstrapping reinforcement learning baselines.

Hugging Face daily papers·Sep 9, 20:00 UTC · 7d agoAI research1

Echo: Learning-based Matching Decompilation using Trusted Back Translationnew

Researchers introduce Echo, a matching decompiler using trusted back-translation that roughly doubles exact-match rates and outperforms GPT-5.6 and Codex on Mirai.

Echo performs matching decompilation by using compilation as trusted feedback for iterative search: a domain-specific model generates candidate code and compilation configurations, which are recompiled, compared at assembly level, and repaired via rule-based rewriting, neural refinement, and reasoning-based refinement. On function-level benchmarks, Echo produces 2.43x more exact matches than the strongest baseline and the highest structural similarity to ground truth. On the Mirai malware binary, it matches 2.75x and 7.4x as many functions as GPT-5.6 and Codex, respectively.

arXiv cs.CR·Sep 16, 14:14 UTC · 13h agoResearch

Cross-Domain Inference for Human Localization: Applying Wi-Fi RSSI Data to CSI-Trained Models

Researchers show CSI-trained Wi-Fi models can localize people from RSSI data at ~80% confidence, enabling privacy attacks from ordinary IoT devices.

The paper investigates cross-domain inference, feeding RSSI data into an existing CSI-based Wi-Fi pose prediction model. RSSI is accessible on IoT devices without elevated OS permissions or specialized drivers, unlike CSI. Using an RSSI dataset synchronized with video ground truth, the model predicted human locations with approximately 80% confidence when movement was present. The results imply a wide range of commodity IoT devices could be used for privacy invasion in Wi-Fi-dense environments.

arXiv cs.CR·Sep 15, 13:56 UTC · 1d agoResearch

The Model Proposes, the Code Disposes: A Pre-Registered Ablation of a Verifier-and-Acceptance Stage in an LLM-Orchestrated Offensive-Security Agent

Pre-registered ablation finds a model verifier stage in an LLM offensive-security agent suppresses findings; removing it eliminated suppression with precision tradeoff.

The paper evaluates a verifier-and-acceptance stage in an LLM-orchestrated offensive-security agent via a pre-registered 20-run confirmatory ablation and a 2x2 factorial study with 40 runs on vulnerable lab targets. Removing the stage eliminated pre-report suppression (median 2 vs 0 findings, p = 0.00003) but reduced model-blinded shipped precision (0.471 vs 0.353, p = 0.0087). Suppression was attributed to the model verifier rather than deterministic acceptance rules, and an instrumented canary recorded zero external contacts in all 60 runs. The full design retained 93.8% of model-adjudicated true candidates but failed its pre-registered non-inferiority floor of 0.90.

arXiv cs.CR·Sep 14, 17:13 UTC · 2d agoResearch

Automating Attack Graph Construction for Agentic Pentesting. Towards Neuro-Symbolic Vulnerability Hunting

Semi-automated pipeline converts Trivy, Semgrep, Nmap output into MulVAL attack graphs for agentic pentesting, 53.7% mean vulnerability coverage in CyBench.

The paper presents a semi-automated pipeline that parses Trivy, Semgrep, and Nmap findings into MulVAL predicates and uses an LLM-assisted process to build domain-specific Datalog rules linking scanner evidence to attack techniques. MulVAL/XSB then performs symbolic inference to generate structured, auditable attack paths for agentic pentesting. Evaluated on 54 web CTF tasks from CyBench, every task produced at least one goal-reaching graph with 53.7% mean ground-truth vulnerability coverage, 51.9% full coverage, and an 83.9% noise-path rate. Median end-to-end runtime was 24.9 seconds, making the pipeline runtime-practical for agentic workflows.

arXiv cs.CR·Sep 14, 13:13 UTC · 2d agoResearch

DynSHAP: Towards Explainable Dynamic Survival Analysis

DynSHAP extends SHAP explainability to dynamic survival analysis, treating time-feature pairs as Shapley players for longitudinal clinical predictions.

DynSHAP adapts marginal SHAP estimators to dynamic survival analysis by treating time-feature pairs as players in the Shapley game, handling longitudinal irregular inputs and functional survival outputs. Temporal DynSHAP learns linear feature dependencies over time and addresses them with conditional sampling. On synthetic data with ground-truth attributions it recovers temporally dependent features more accurately than marginal estimators, and it produces faithful attributions on two real-world clinical datasets across two DSA architectures.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:39 UTC · 5d agoAI research

CoRA-NAS: Coarse Ranking and Anchor-Residual Refinement for Neural Architecture Search

CoRA-NAS combines zero-cost proxy ranking with low-cost learning-curve refinement, achieving the best worst-space Spearman correlation across NAS benchmarks.

The paper proposes CoRA-NAS, a two-stage neural architecture search framework pairing a static ranking prior (CoRA-Rank) with learning-curve refinement (CoRA-Refine) that extrapolates early validation curves for sampled anchors and propagates residual corrections with an ExtraTrees model at about 1% of full training cost. Across NAS-Bench-201, NAS-Bench-101, TransNAS-Bench-101, and NATS-SSS it achieves mean Spearman correlations of 0.946, 0.715, 0.786, and 0.894 respectively, with the best worst-space correlation of 0.715 among compared methods. On NAS-Bench-201/CIFAR-100 its selected architecture reaches 73.32% accuracy versus a 73.37% ground-truth best.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:49 UTC · 6d agoAI research

How a researcher uses Codex and ChatGPT to search for new antimicrobial molecules

OpenAI profiles César de la Fuente's lab using ChatGPT and Codex alongside deep-learning models to accelerate antimicrobial molecule discovery.

OpenAI published a case study on bioengineer César de la Fuente's lab, which uses ChatGPT and Codex for hypothesis brainstorming, code writing, dataset processing, and bridging knowledge gaps across biology, chemistry, and computer science. The lab's deep-learning models scan genome and protein databases for antimicrobial peptide candidates, potentially cutting initial searches from years to hours. Bacterial antimicrobial resistance was associated with about five million deaths in 2021, a toll projected to roughly double by 2050.

OpenAI News·Sep 10, 16:00 UTC · 6d agoAI industry1

Cross-Model Agreement as a Deployment-Time Reliability Signal for Automatic Polyp Segmentation

Referee-Based Quality Estimation flags unreliable polyp segmentations at inference without ground truth, reaching ROC-AUC 0.960 with SegFormer-B0 referees.

RBQE measures agreement between a primary segmentation model and an independently trained referee on a 1,223-image external benchmark drawn from four public datasets. A cross-architecture SegFormer-B0 referee achieves the strongest signal (ROC-AUC 0.960), beating a Test-Time Augmentation baseline by 0.055 ROC-AUC under an identical protocol. Excluding trivially separable empty-mask cases, ROC-AUC falls to 0.876 (SegFormer-B0) and 0.783 (same-architecture control), but RBQE's margin over baselines widens. Progressive rejection of low-agreement predictions increases mean Dice of retained outputs, supporting selective prediction at the cost of one extra forward pass.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 17:32 UTC · 7d agoAI research

Cascading Gradient Inversion via LT-Code Inspired Peeling in Federated Learning

New gradient inversion attacks tied to erasure-coding theory recover 94–100% of ImageNet batches, showing federated learning privacy leakage is underestimated.

The paper connects gradient inversion in federated learning to erasure-correcting code theory, constructing analytic attacks that exceed previously known recovery bounds. The attacks recover batches exactly, with every sample's label, from a single FedSGD round, and certify each recovery without ground-truth data. On eight image and tabular benchmarks, even a passive attacker observing an honestly trained network recovers 94–100% of ImageNet batches up to size 128, and more than 90% actively at batch sizes of several hundred. The authors conclude that federated learning's privacy leakage has been underestimated.

arXiv cs.CR·Sep 9, 03:17 UTC · 8d agoResearch

The Surprising Effectiveness of Approximate Value Iteration in Self-Play

Minimal approximate value iteration self-play learns more accurate value functions than AlphaZero in Connect Four and Hex while cutting training and inference costs.

The paper trains a minimal self-play implementation of Approximate Value Iteration (AVI) without MCTS and uses ground-truth oracles for exact evaluation in Connect Four, 7x7 Hex, and synthetic games. AVI learns more accurate value functions than AlphaZero, and its one-step-lookahead greedy policies remain competitive with MCTS-based policies at substantially lower training and inference cost. Preliminary experiments on Othello and 9x9 Go show AVI trains stably on larger games, suggesting simpler approaches have become increasingly practical with modern deep-learning tools.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:37 UTC · 8d agoAI research

Multi-Task Learning for Sparsely-Labeled Time Series: A Case Study on Cold-Hardiness Modeling

Multi-task RNN architectures pooling sparse cultivar data improve grape cold-hardiness and budbreak prediction over single-task and scientific baselines.

Researchers apply recurrent neural networks to daily grape cold-hardiness prediction from weather time series, where per-cultivar labels are temporally sparse and limited. They design multiple multi-task learning architectures that treat cultivars as tasks and evaluate them in both MTL and transfer learning settings. Certain architectures consistently outperform single-task learning and state-of-the-art scientific models, and a single MTL model jointly learning cold hardiness and budbreak improves accuracy on both tasks.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:17 UTC · 8d agoAI research

nex-agi/Nex-N2.5-Pro — new model trending #30 on Hugging Face

Nex-AGI launches Nex-N2.5 agentic model family (mini/Pro/Max), with Max built on a 1.6-trillion-parameter MoE foundation.

Nex-AGI introduced Nex-N2.5, a next-generation family of agentic models in three sizes (mini, Pro, Max) focused on long-horizon agentic tasks including computer use, web browsing, and autonomous program execution. Nex-N2.5-Max is built on a 1.6-trillion-parameter text-only Mixture-of-Experts foundation, marking the company's first complete post-training effort at trillion-parameter scale. Weights will be released open-source on Hugging Face and ModelScope, with hosted access via OpenRouter. Benchmark comparisons against Claude Opus 5, GPT-5.6 Sol, Kimi-K3, GLM-5.3, DeepSeek-V4-Pro-0813, and Qwen3.8-Max show competitive scores on Terminal-Bench 2.1 and SWE-Bench Pro, though weights were listed as "coming soon" at publication.

Hugging Face trending models·Sep 8, 11:01 UTC · 8d agoModel release1

nex-agi/Nex-N2.5-mini — new model trending #30 on Hugging Face

Nex-AGI releases Nex-N2.5 agentic model family (mini, Pro, Max) with a 1.6-trillion-parameter MoE Max, open weights, and hosted access via OpenRouter.

Nex-AGI launched Nex-N2.5, a family of agentic models in mini, Pro, and Max sizes, with the Max version built on a 1.6-trillion-parameter text-only Mixture-of-Experts foundation and the company's first complete post-training effort at trillion-parameter scale. The models target long-horizon computer use, web browsing, and visually grounded agentic tasks, with expanded agent training environments. Reported benchmarks include Max scoring 86.1 on Terminal-Bench 2.1 and 65.7 on SWE-Bench Pro, trailing Claude Opus 5. Weights are being released openly on Hugging Face and ModelScope, with hosted access through OpenRouter.

Hugging Face trending models·Sep 8, 05:08 UTC · 8d agoModel release1

"Shut Up and Let Me Enjoy My Otome": Understanding and Measuring the Toxicity in Otome Game Communities

First large-scale study finds 22.20% of Weibo otome game posts toxic versus 3.71% on Reddit, with LLM detectors reaching 0.82 F1.

Researchers present the first large-scale measurement of toxicity in otome game communities, introducing OtomeSCAN, which collected and analyzed 620,045 posts from Weibo and Reddit over 18 months. They manually annotated 4,308 posts, identified eight target groups, and evaluated seven toxicity detectors, with their best LLM-based model reaching F1-scores of 0.82 on Weibo and 0.78 on Reddit. The study found 22.20% of Weibo posts were toxic versus 3.71% on Reddit, and toxicity rose to 37.09% within 72 hours during an external attack on Weibo. The authors also flagged 191 potential-coordination clusters, 64.40% of which targeted game developers.

arXiv cs.CR·Sep 7, 21:44 UTC · 9d agoResearch

Marigold V2: Revisiting Diffusion Transformers for Monocular Depth Estimation

Marigold V2 adapts diffusion transformers for monocular depth estimation, improving AbsRel 16-26% over the previous best on KITTI and ETH3D.

Huawei's Bayer lab revisits the Marigold approach to repurpose image generation and editing models built on the diffusion transformer (DiT) architecture into monocular depth estimators. The recipes target single-step inference from pretrained multi-step flow-matching models, with remedies including alignment to ground-truth semantic features and a two-stage fine-tuning protocol using a Sinkhorn-based loss. The resulting model produces crisper depth maps that generalize out-of-distribution and also achieves state-of-the-art results on surface normals estimation and intrinsic image decomposition.

Hugging Face daily papers·Sep 7, 20:00 UTC · 9d agoAI research

TransNormal-2: Geometry-Grounded Rectified Flow with Edge-Aware Decoding for Precise Normal Estimation

TransNormal-2 improves monocular surface-normal estimation by fixing VAE edge degradation with geometry-aware losses and refinement, matching MoGe-2 with 1.4% of annotations.

TransNormal-2 is a FLUX.2-based rectified-flow framework for monocular surface-normal estimation with single-step deterministic inference. The authors quantify that VAE 8x spatial compression introduces 1.3-8.5 degrees of mean angular error even on ground-truth normals, with edge error up to 2.8x the global error. The method adds geometry-aware pixel-space losses and an RGB-guided Geometric Refinement Module to correct boundary-localized decoding errors. It matches or exceeds MoGe-2 on all eight reported metrics using only 1.4% as many task-specific annotations, and cuts transparent-object MAE by 4.2 degrees on ClearGrasp and 3.1 degrees on ClearPose.

Hugging Face daily papers·Sep 5, 20:00 UTC · 11d agoAI research

OracleZoom: On-Policy Self-Distillation Inspired Reference-Constrained Recursive Image Super Resolution

OracleZoom enables recursive extreme-scale image super-resolution via reference-constrained on-policy distillation, reducing hallucinations at deep zoom scales.

OracleZoom tackles recursive super-resolution, where repeated feeding of predictions back into the same model leaves deeper-scale outputs unsupervised as required source resolution grows geometrically. The framework trains on its own trajectory while carrying the last ground-truth evidence beyond the supervision boundary, combining direct and cross-scale supervision, a no-reference quality objective, a KL-constrained pretrained latent prior, and EMA consistency. Across seven datasets it achieves state-of-the-art SR quality across zoom scales, averaging 0.713 CLIPIQA with larger gains at deeper scales and significantly reduced hallucinations. Code, data, and models are publicly released.

Hugging Face daily papers·Sep 5, 20:00 UTC · 11d agoAI research

Same Trajectory, Contradictory Rewards (ROBORMBENCH): Paraphrase Fragility in Vision Language Reward Models

New ROBORMBENCH benchmark shows vision-language reward models can flip robot success/failure judgments when goal instructions are paraphrased.

The authors show that paraphrasing the instruction alone can substantially change progress scores from VLM reward models, even flipping identical robot trajectories between failure and success. ROBORMBENCH comprises 2,390 real-robot trajectories with ground-truth progress labels and 21,673 verified paraphrases covering lexical, syntactic, and action-goal rewrites. Instability is widespread across proprietary and open-source VLMs, grows with more divergent rewrites, and is not reliably reduced by scale or explicit reasoning, while trajectory-grounded dedicated reward models are markedly more stable.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:47 UTC · 12d agoAI research1

Learning 3D Editing without Paired Supervision via Generative Prior Distillation

New framework distills 2D editing and VLM priors into a feed-forward 3D editing model without paired 3D training data.

The method, PriorEdit3D, learns feed-forward instruction-guided 3D editing by distilling knowledge from foundation models instead of using ground-truth 3D pairs. Through a differentiable rendering pipeline it supervises a 2D visual prior from an image editing model at the main view and a Vision-Language Model semantic prior at novel views for instruction fidelity and identity preservation. A 3D-aware Distribution Matching regularization constrains outputs to the manifold of realistic 3D assets defined by a pretrained image-to-3D teacher. Experiments report superior instruction fidelity and cross-view consistency over state-of-the-art baselines, with code released on GitHub.

Hugging Face daily papers·Sep 3, 20:00 UTC · 13d agoAI research

OpenAI, Anthropic, Google API Flaw Let Weaker AI Models Decode Stronger Models' Reasoning

Researchers show encrypted reasoning blocks in OpenAI, Anthropic, and Google APIs can be replayed to recover hidden reasoning and secrets like API keys.

Researchers demonstrated that encrypted reasoning objects from OpenAI, Anthropic, and Google reasoning APIs could be replayed across sessions, users, and models, letting weaker same-family models act as decoders of hidden reasoning. Across 6,708 public agent trajectories they decoded 315,320 thinking blocks and found 704 privacy artifacts from real user sessions, including 62 API keys, 33 passwords, 24 access tokens, and seven private keys. The replayable blocks also enabled invisible prompt-injection proof-of-concepts; the main extraction attack is no longer reproducible as of August 2026 following mitigations, though no vendor has publicly acknowledged the flaw.

The Hacker News·Aug 12, 11:47 UTC · Aug 12, 2026AI safety & security1

GitHub releases an open dataset for multilingual developer content

Help Net Security·Jun 16, 00:00 UTC · Jun 16, 2026AI research1

Open-source benchmark EVMbench tests how well AI agents handle smart contract exploits

Help Net Security·Feb 19, 00:00 UTC · Feb 19, 2026AI research1