ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “dataset”

23 stories in the last 3d

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllAI research 25AI safety & security 8Research 8AI industry 6Data breach 5Exploit / PoC 3Model release 3Threat actor 3AI tools & infra 2Vulnerability 1Tools 1Industry 1
SeverityAllcritical 0high 7medium 11low 0info 48

EventEgoHands++: Event-based Egocentric 3D Hand Mesh Reconstruction with Real Dataset

EventEgoHands++ reconstructs egocentric 3D hand meshes from event cameras using instance-level detection and a 1M-frame real dataset.

EventEgoHands++ adds a Hand Detector estimating instance-level bounding boxes and masks for both hands, plus Adaptive Attention that dynamically gates attention based on detection results to learn inter-hand relationships. The authors extend the synthetic N-HOT3D dataset and construct EEH-R, the largest real-world event-based egocentric hand dataset to date, with roughly 1 million annotated frames including low-light conditions. Experiments on synthetic and real datasets show consistent improvements over baselines.

Hugging Face daily papers · 2d agoAI research

Why don't machine learning research agents overfit?

Amazon researchers explain why ML research agents avoid benchmark overfitting, attributing generalization to compressibility of successful strategies.

Amazon Science summarizes the paper "What fits (into few tokens) doesn't overfit: Compression and generalization in ML research agents," which investigates why benchmark hill-climbing loops, whether run by human communities or LLM research agents, do not produce rampant overfitting. The explanation formalizes Occam's razor via a counting argument: successful ML strategies are highly compressible, so short descriptions lack room to memorize benchmark data and must capture real structure. LLM-based agents, being resettable and controllable, allow this hypothesis to be tested empirically.

Hacker News · security · 2d agoAI researchHN 21↑ · 3 comments

Stanford Researchers Release Paper2Agent: Turning Research Papers Into AI Agents That Reproduce Results and Run on New Data

Stanford researchers released Paper2Agent, a Nature-published pipeline that turns research papers into MCP servers agents can execute.

A Stanford team led by Jiacheng Miao and James Zou published Paper2Agent in Nature on 16 September 2026. Built on Claude Code's agent SDK, it converts a paper and its codebase into a Model Context Protocol server with validated tools, resources, and prompts. In benchmarks, the AlphaGenome agent built 22 tools in about 45 minutes for US$14, scored 100% on 15 novel queries versus 78.7% for Claude Code with repository access, and cut median runtime 1.9x. In scale tests, 74 of 100 bioRxiv papers were converted and 593 of 599 proposed tools passed validation.

MarkTechPost · 15h agoAI research1

Reporting Practice Matters: The Impact of Reference Choice on Chest X-ray Report Evaluation

Study shows radiology reporting-style variations in reference reports can flip rankings of chest X-ray report generation models; releases MIMIC-CXR-Ext-ReRef dataset.

The paper quantifies how variations in radiologists' reporting practices distort evaluation of radiology report generation (RRG) models, introducing a radiologist-informed taxonomy and the ReRef method for rewriting reference reports while preserving clinical meaning. On MIMIC-CXR with RadCliQ-v1, condensing normal-findings discussion caused Libra to drop from first to second while CheXOne rose from third to first among nine models. The authors release MIMIC-CXR-Ext-ReRef, a radiologist-validated dataset of 120 original/alternative reference pairs, arguing metrics conflate clinical correctness with stylistic conformity.

arXiv cs.AI / cs.LG / cs.CL · 20h agoAI research

Google Research Introduces Retrieve-for-Train (R4T): An RL-Compiled Diffusion Retriever for 12× to 20× Faster Query Fan-Out

Google Research introduced R4T, an RL-trained fan-out pipeline distilled into a 53.9M-parameter diffusion retriever achieving 12x-20x faster query fan-out.

Google Research introduced Retrieve-for-Train (R4T), which trains a fan-out language model with GRPO plus soft PPO regularization, then distills query fan-out into a 53.9M-parameter diffusion transformer that generates all retrieval embeddings in a single non-autoregressive pass. A three-term reward (groundedness 0.6, diversity 0.2 via Vendi Score, alignment 0.2) prevents paraphrastic collapse and reward hacking during training. On the Polyvore dataset, Gemma3-4B R4T-FOLM averaged 49.1 versus 40.9 for Best-of-N, and the diffusion retriever cut fan-out latency from 1.46s to 0.07s at batch size 8, a consistent 12x-20x speedup over autoregressive methods.

MarkTechPost · 7h agoAI research1

Tracking the Unseen: An Occlusion-Robust Framework for Target Tracking Under Full and Long-Term Occlusion

Occlusion-robust tracker combining YOLOv11n, Kalman filtering, and appearance Re-ID cuts identity switches and beats OccluTrack by 18.1% MOTA on OVIS.

The framework integrates YOLOv11n object detection, Kalman Filter motion prediction, and occlusion-aware appearance-based re-identification to maintain target identity through full and long-term occlusion. Six Re-ID architectures were evaluated under identical conditions, with the Occlusion-Aware Mask Network (OAMN) performing best. On the public OVIS dataset it improves MOTA by 18.1% and IDF1 by 25.1% over OccluTrack while reducing identity switches by 12.8%; on a custom military surveillance dataset it achieves MOTA 0.734 and IDF1 0.729.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Reward AI Releases OM-1: A Robot Policy Trained on Human Demonstrations Only, With No Teleoperation or On-Robot Data

Reward AI released OM-1, a general-purpose manipulation policy trained solely on human demonstrations from a sensorized glove, with no teleoperation or robot data.

Reward AI announced OM-1 (Omnibody Model 1), a general-purpose robot manipulation policy trained only on human demonstrations captured via Omnibody Hand, a 7-DoF wearable glove with tactile, proximity, and in-hand camera sensing. The system uses electromagnetic hand-pose tracking, cutting mean overshoot error to 9.5 mm versus 24.9 mm for visual-inertial at 67 cm/s (a 60% reduction), and reportedly learns brand-new tasks from under 30 minutes of human data. A separate RL-trained control layer runs on its own clock so policy inference latency never stalls motion, and the policy spans industrial arms, legged humanoids, and wheeled mobile manipulators. No weights, code, dataset, API, paper, or benchmark comparisons have been released, so claims are demonstration-backed only.

MarkTechPost · 2d agoAI research

LimiX-2: A Contextual Mechanism Network Towards General Structured-Data Intelligence

LimiX-2, a tabular foundation model built on Contextual Mechanism Networks, outperforms existing tabular models on TabArena, TALENT, and BCCO.

Researchers introduced LimiX-2, a new model in the LimiX family that adopts the Contextual Mechanism Networks (CMNs) paradigm and is pretrained with Context-Conditional Masked Modeling (CCMM) on synthetic datasets generated by structural causal models. Unlike tabular PFNs centered on p(y | x, D_context), CMNs learn mechanism-oriented joint modeling of p(x, y | D_context). Evaluations on TabArena, TALENT, and BCCO show LimiX-2 outperforms current dataset-specific models and tabular foundation models. Its feature attention also encodes direct causal relationships, enabling accurate causal skeleton recovery.

Hugging Face daily papersupdated · 1d agofirst · 2d agoAI research 2 sources

Learning Multimodal One-step Flow Policy via Value-weighted Optimal Transport

OptiFlow learns one-step multimodal flow policies for offline RL via state-wise entropic optimal transport, avoiding critic overestimation and mode collapse.

The paper introduces OptiFlow, a framework that frames one-step flow policy learning as a structured sample-allocation problem in offline reinforcement learning. It jointly trains a value-aware reference flow policy and a one-step policy, coupling action samples through state-wise entropic optimal transport where critic values set distillation priority and action-distance cost ensures geometrically compatible pairings. By avoiding direct critic maximization, it anchors the policy to high-value dataset-supported modes without out-of-distribution divergence. Code is released on GitHub and the method performs strongly across diverse offline RL benchmarks.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research1

LongAgent: History-Guided Agentic Search for Longitudinal Outcome Prediction

LongAgent autonomously searches variable sets and temporal windows to predict longitudinal medical outcomes, beating the strongest non-agent baseline on synthetic data.

The paper proposes LongAgent, an agent-based method that searches over combinations of variable sets, temporal windows and aggregation functions for outcome prediction on heterogeneous medical longitudinal data. It uses a history memory of previous searches and numerical evidence to guide exploration. On synthetic data it achieves mean RMSE 1.7376, improving over the best non-agent baseline by 0.0151 (95% CI [0.0045, 0.0260]; p=0.0273), and performs comparably to the best baseline on a real clinical dataset.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

Dreaming the Sound of Contact: Leveraging Video and Audio Generation for Zero-Shot Force-Aware Manipulation and Data Generation

Pipeline pairs generated video with audio-derived force profiles to enable zero-shot, force-aware robot manipulation on Franka Panda for contact-rich tasks.

The paper leverages generated video and audio jointly: loudness of generated contact sounds shapes a bounded, time-varying desired-force profile from a natural-language task prompt. Trajectories execute on a Franka Panda robot with a closed-loop force regulator tracking the audio-shaped profile, succeeding where a kinematic-only baseline fails. The pipeline also serves as a data generation engine to train closed-loop manipulation policies.

arXiv cs.AI / cs.LG / cs.CL · 19h agoAI research

Exponential Hardness of Off-Policy Evaluation under History-Dependent Logging

Researchers prove off-policy evaluation under history-dependent logging requires exponentially many episodes, resolving a hardness question for model-based POMDP evaluation.

The paper constructs POMDPs with at most two latent states per stage, three actions, and a three-memory-state logger where evaluating a known deterministic target policy to accuracy 1/8 requires Θ((3/2)^H log(1/δ)) episodes for any horizon H≥3. Coverage and outcome-revealing conditions hold with constants independent of H, yet a reset erases the unknown transition that determines the target value. The authors characterize the resulting statistical experiment exactly, derive a matching optimal estimator, and validate predictions on a two-lane gridworld. This settles the history-dependent-logging, model-based case posed by Zhang and Jiang (arXiv:2503.01134).

arXiv cs.AI / cs.LG / cs.CL · 19h agoAI research

Beyond Outcomes: Dual-View Relational Learning for Efficient Agent Benchmarking

DualViewEval compresses agent benchmarks by jointly modeling outcome and process signals, achieving 24x-40x compression with only 20 tasks on APEX-Agents and BFCL.

DualViewEval is an agent benchmark compression method that jointly exploits outcome and process relations from trajectories to learn exact-size minisets predicting full-benchmark scores. The authors analyze large-scale trajectories and identify six process signals systematically associated with final agent performance. Across five agent benchmarks and five baselines, it achieves the best results on all datasets: with only 20 tasks it reaches 24x-40x compression on APEX-Agents and BFCL, reduces MAE by 14.5%-28.2% over the strongest competitors, and improves Kendall's tau by up to 7.2% relative to EssenceBench on SWE-bench Verified.

arXiv cs.AI / cs.LG / cs.CL · 20h agoAI research1

PANORAMA: Panoptic Grounded Captioning via Mask Proposal Selection

Researchers introduce PANORAMA, a vision-language model grounding caption phrases in pixel masks, alongside the PanoCaps benchmark and gPQ metric.

The paper studies panoptic grounded captioning, requiring VLMs to describe foreground and background regions while grounding each phrase with pixel-level masks. The authors release PanoCaps, a human-annotated benchmark built from panoptic segmentation datasets, plus a phrase-mask matching protocol and a generalized Panoptic Quality (gPQ) metric. PANORAMA formulates grounding as selection from phrase-conditioned mask proposals generated by a pretrained segmenter, achieving the best overall grounding on PanoCaps and matching or exceeding specialized models. Code, data, and models are publicly available.

Hugging Face daily papersupdated · 19h agofirst · 1d agoAI research 2 sources

What Breaks Under Pruning in Smart Homes, and When? Evaluating LLM Degradation Across Architectures and Task Complexity

Pruning study across four LLM architectures finds dense models degrade sharply on smart-home tool calling while MoE models tolerate far more.

Researchers systematically study pruning-induced degradation in smart-home tool calling across four LLMs spanning dense Transformer, dense hybrid, and mixture-of-experts architectures, combining depth, width, hybrid, and expert pruning methods, and evaluate over 19,500 instances from three datasets after post-pruning supervised fine-tuning. Dense models show narrow safe pruning regions followed by sharp degradation, while MoE models tolerate substantially more pruning. Pruning degrades grounded specificity (operation, device, argument, value) before schema-level intent, and aggressive dense pruning can induce systematic over-refusal.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

ENCP: Episode-Normalized Conformal Prediction for Vision-and-Language Navigation

ENCP calibrates conformal prediction per navigation episode, giving step-level coverage guarantees for vision-language navigation agents despite within-episode dependence.

Episode-Normalized Conformal Prediction (ENCP) rescales a nonconformity score by a VLN policy's residual confidence and calibrates one maximum score per episode, preserving step-level coverage of at least 1−α despite dependence among steps within an episode. Across four VLN policies and three nonconformity scores on R2R and REVERIE, ENCP meets all reported empirical step-coverage targets in seen-to-unseen evaluation. The model-agnostic uncertainty estimates can signal when an agent should defer to a stronger predictor or human assistance.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Verifiable Social Reasoning for LLM Assistants

Fuse, a multi-agent simulation with hidden motives, evaluates LLM social reasoning, revealing compounding difficulty from user mediation and bias sensitivity.

Fuse is a multi-agent simulation framework in which a target agent with a hidden motive interacts with other agents including one representing the user, who consults the evaluated assistant to infer the motive, providing verifiable ground truth by construction. Simulation faithfulness is validated through a human study with 24k annotations. Applied to 12 LLMs, it shows user mediation compounds social reasoning difficulty, models are systematically sensitive to biased user framing, models may need more details than humans, and longer conversations do not always improve performance. The framework and a 21k-example dataset are open-sourced.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Bridging the Confidence Gap: Temperature Scaling for Calibrating Test-Time Prompt Tuning

CoTS temperature scaling cuts test-time prompt tuning's expected calibration error from 11.90% to 5.38% on ImageNet variants while raising accuracy.

The paper proposes CoTS, a post-hoc calibration method that applies temperature scaling to minimize the confidence gap between test-time-adapted and zero-shot predictions. A weak-strong ensemble variant, E-CoTS, further exploits multiple test-time augmentations to boost accuracy while maintaining calibration. E-CoTS reduces average expected calibration error from 11.90% to 5.38% on ImageNet variants while increasing accuracy from 60.74% to 62.95%.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

OPEN-1B: A Fully Auditable Training Run

Open-1B releases a 1B-parameter model with bitwise-reproducible training, letting independent auditors verify every step of the run on commodity hardware.

The paper introduces a 'fully auditable' tier of model transparency: every training operation is reproducible with bitwise certainty on heterogeneous commodity hardware by imposing definite ordering on GPU kernel reductions, data batch ordering, and collective communication. Because replaying a full run on one machine is infeasible, a collective verification scheme lets many independent auditors certify individual steps covering the whole run. The authors release Open-1B with its full pretraining dataset, every intermediate checkpoint, the training codebase, and an audit harness. This rules out undisclosed data, injected biases, or backdoors that proof-of-learning or proof-of-training-data techniques cannot exclude.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Mind2Dialogue: Training Human-Aware Language Models by Simulating User Mental States

Mind2Dialogue simulates users' mental states to create privileged supervision, boosting personalization metrics of Qwen, Llama, and OLMo assistants by up to 40.9 points.

The paper proposes a psychology-guided simulator that preserves personal characteristics while evolving shared mental states to generate coherent conversations, with an Oracle assistant grounded in those states. Privileged distillation then trains models on Oracle responses so deployed assistants help users without direct mental-state access. Training on the full corpus improves every personalization metric over Qwen, Llama, and OLMo instruction-tuned baselines, including 26.6 to 40.9 percentage point gains in preference-following generation and improved belief/action reasoning.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research 2 sources1

SlipSense: Multimodal Tactile Learning for Low-Latency and Generalized Slip Detection

SlipSense fuses a 32x32 piezoresistive array and MEMS accelerometer to detect robotic grip slips within 23.1 ms, generalizing zero-shot across platforms.

SlipSense is a multimodal tactile slip-detection framework built on TacV5, a sensor combining a 32x32 piezoresistive array at 240 Hz and a 3-axis MEMS accelerometer at 8 kHz. It performs modality-specific encoding, intra-sensor fusion, and cross-modal attention with causal temporal prediction at 240 Hz. On a 1.4-million-frame dataset spanning 37 objects it achieves 96.7% Macro F1 with a false-positive rate below 1.6%, detecting 76% of slip events within 23.1 ms. Trained solely on UMI data, it transfers zero-shot to a Tesollo dexterous hand across unseen objects, sensor units, and platforms.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

Privacy-enhanced federated learning via asynchronous aggregation and local differential perturbation

Federated learning framework combining dynamic differential privacy, homomorphic encryption, and local DP retains 82.6% accuracy at epsilon 0.1 while cutting communication 21.3%.

The paper proposes a privacy-enhanced federated learning framework integrating Dynamic Differential Privacy, lightweight Homomorphic Encryption, and Local Differential Privacy during training. An asynchronous aggregation strategy with version control supports distributed training in asynchronous environments. On CIFAR-10 and Purchase-100, the method maintains up to 82.6% classification accuracy under stringent privacy constraints (epsilon = 0.1) and reduces communication overhead by 21.3% versus FedAvg.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

LLM-Based Schema-Aware Split Learning for Privacy-Preserving Mental Distress Prediction Across Heterogeneous Surveys

Schema-aware split learning uses LLaMA-3.2-3B-Instruct as shared semantic encoder to harmonize heterogeneous mental-health surveys while raw data stays local.

The paper proposes a schema-aware split learning framework where an LLM serializes heterogeneous mental health survey records into natural language and is fine-tuned via LoRA, partitioned across client and server. Clients keep raw survey responses local and run only a lightweight front-end while the resource-intensive backbone runs server-side. Using LLaMA-3.2-3B-Instruct, the framework attains an average ANLS of 0.708 with 2,000 training samples, beats federated learning in eight of nine settings, and cuts per-client computation by three orders of magnitude while generalizing to unseen datasets.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research