Search: “training dynamics”

A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay

Theoretical framework bounds generalization for gradient descent with weight decay, deriving conditions that explain delayed generalization and grokking.

The paper proves convergence of gradient descent with weight decay to a neighborhood of global minimizers of the empirical l2 loss for a broad class of neural networks. It decomposes population error into data, optimization, and prediction variation errors, deriving cellwise and layerwise approximate-homogeneity bounds on prediction variation along the training trajectory. The resulting necessary and sufficient conditions explain layerwise generalization differences and provide a theoretical characterization of grokking.

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

Expert-Space Exploration in MoE Reinforcement Learning

ESRL explores MoE expert-routing space during RL post-training, improving Qwen3-30B-A3B Pass@1 by 3.2 points over GRPO without extra compute.

The paper shows perturbing expert routing increases rollout diversity similarly to higher decoding temperature, but naive perturbation degrades quality. ESRL anchors high-confidence experts, restricts stochastic routing to a plausible candidate pool, adapts perturbation strength via router entropy, and replays recorded expert paths during policy optimization. It achieves the best results across top-K, top-1, and shared-expert MoE backbones on math, science, and code tasks; on Qwen3-30B-A3B it improves average Pass@1 and Pass@8 over GRPO by 3.2 and 4.5 percentage points.

Hugging Face daily papers·updated Sep 11, 16:58 UTC · 5d ago·first Sep 10, 20:00 UTC · 6d agoAI research 2 sources

When Does Scale-Invariant Optimization Become Unstable? An Exact Schedule Law with Weight Decay

Researchers derive an exact law linking learning-rate schedules and weight decay in normalized networks, pinpointing when scale-invariant optimization destabilizes.

The paper shows that normalization makes large parts of neural networks scale-invariant, creating a hidden feedback loop where learning-rate schedules and weight decay interact through the parameter norm to control the effective optimizer step. An exact discrete-time law with a single scalar quantity separates contraction- and expansion-dominated effective learning-rate regimes, and the balance point is intrinsically unstable, so constant learning rate with weight decay produces recurrent behavior instead of a stable equilibrium. A unified homogeneous-optimizer framework explains why adaptive methods stabilize more weakly under normalization. The law is validated with high precision on MLPs, CNNs, and GPT-2 across MNIST, CIFAR, WikiText, and OpenWebText, with code released on GitHub.

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

Environments as Scaffold: Enriching Feedback to Bootstrap Self-Evolving Agents in Long-Horizon Tasks

Researchers propose Feedback-Enriched Environments (FEEs) that reduce reward sparsity and improve RL training of Qwen3-based agents on SciWorld and BFCL.

The paper proposes shifting from agent-side warmup (SFT) to environment-side adaptation via Feedback-Enriched Environments to address severe reward sparsity in RL training of long-horizon LLM agents. A pilot study defines a feedback strategy that transitions from action guidance to observation enrichment in later training stages. Large-scale experiments on SciWorld and BFCL across Qwen3 model scales and GRPO, GSPO, and DAPO show consistent gains, plus stabilized training dynamics and proactive exploration.

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

Not All Prompts Are Equal: Exploration-Guided Prompt Scaffolding for Multimodal Reinforcement Post-Training

Exploration-guided prompt scaffolding rewrites training prompts by Exploration Potential Score, boosting multimodal RL post-training accuracy up to 11.5%.

The paper proposes dynamically adapting the training prompt distribution during online RL post-training of multimodal LLMs using the Exploration Potential Score (EPS), a lightweight rollout-based proxy for prompt utility computed from on-policy statistics with no additional overhead. Rather than discarding low-utility prompts, a teacher model generates scaffolded rewrites that preserve task intent while making training more informative. Integrated with GRPO on Geo3K and MMK12, the method achieves up to 9.7% relative in-domain improvement plus 11.5% on MathVision and 11.1% on MMMU-Pro.

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

PhysStream: Streaming Physics-Grounded Video Generation with Structured Scene Memory and Fine-Grained Motion Control

PhysStream enables mid-generation interactive control of physics-grounded video via structured scene memory and velocity-increment signals, reducing motion distribution distance 33%.

PhysStream is an autoregressive physics-grounded image-to-video model that maintains structured scene memory—positional maps and object tracking maps derived online from previously generated frames—and accepts fine-grained motion control via sparse velocity-increment signals encoding physical quantities. Training runs in two stages: a bidirectional model finetuned with motion-control conditioning, then a causal autoregressive model with structured scene memory. It supports interactive mid-generation control over multi-object tabletop rigid-body scenes, reducing motion distribution distance (FVMD) by 33% and trajectory error by 12% over the strongest baselines. Human evaluators preferred it in over 85% of in-the-wild comparisons.

Hugging Face daily papers·updated Sep 15, 17:55 UTC · 1d ago·first Sep 14, 20:00 UTC · 2d agoAI research 2 sources

Training a 3.8B LLM to 0.384 CORE for $998 – Hugo Vergnes

Independent developer Hugo Vergnes trained a 3.8B-parameter Llama-style model to 0.384 CORE on 65B tokens for $998 in 43 hours on rented B200s.

Hugo Vergnes trained little-lm, a 3.848B-parameter decoder-only LLM, on 65.3B tokens in 43 hours for $998 using rented NVIDIA B200s, scoring 0.384 on the CORE benchmark and beating nanochat d32 (0.310) at similar cost. The Llama-style architecture uses RMSNorm, RoPE, GQA with 24 query and 8 KV heads, relu-squared MLPs, QK-norm, and ResFormer-style value embeddings that account for 19% of parameters. Key wins included the Muon optimizer for matrix parameters, a trapezoidal learning-rate schedule with linear cooldown, FP8 training plus vocabulary padding for roughly 33% throughput gains, and the ClimMix dataset over FineWeb-Edu. The project, inspired by Karpathy's nanochat, was built as a config-driven YAML framework for small LLM training.

Hacker News · security·Sep 10, 02:04 UTC · 7d agoAI researchHN 28↑ · 2 comments1

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·Sep 14, 17:12 UTC · 2d agoAI research

FLAT: Resampling Image and Text into 1D Flexible-Length Aligned Transmodal Tokens for Retrieval and Generation

FLAT jointly trains a multimodal encoder with text-to-image and image-to-text decoders, producing flexible-length tokens that hit 83.1 GenEval on T2I after fine-tuning.

FLAT (Flexible-Length Aligned Transmodal representations) is a pre-training framework that jointly optimizes a shared multimodal encoder with T2I and I2T decoders, combining contrastive alignment with bidirectional cross-modal generative objectives. It maps visual and textual inputs into a unified continuous 1D sequence space and uses nested dropout over prefix-K tokens for dynamic output lengths. A single pre-training stage supports cross-modal retrieval and generation (71.1 GenEval), with task-specific fine-tuning reaching 83.1 GenEval on T2I, 40.5 BLEU-4 and 138.6 CIDEr on MS-COCO captioning, and strong Recall@5 on MS-COCO and Flickr30K.

Hugging Face daily papers·Sep 14, 20:00 UTC · 2d agoAI research1

Semigroup-JEPA: Latent Dynamics Consistency for Zero-Shot Physics Generalization

SG-JEPA world model conditions latent prediction on physical parameters, halving open-loop prediction error versus DINO-WM and boosting robotic control success.

SG-JEPA extends the LeWorldModel JEPA framework by supplying the governing physics parameter to the temporal model via action-conditioning and jointly training an encoder and predictor through autoregressive latent rollout. On out-of-distribution gravitational-field tasks it reduces open-loop prediction error by up to 2x versus DINO-WM on 2D datasets and increases 3D robotic control success rate up to 2.5x using independently trained diffusion policies. A linear feature analysis attributes most of the gain to the encoder learning features that the predictor can carry forward through rollout.

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

GE-Act 2.0: Pretraining and Scaling a World-Action Model for Robotic Manipulation

GE-Act 2.0 is a from-scratch pretrained world-action model for robotic manipulation, with success rising from 17.1% to 44.1% as co-training data scales to 30,000 hours.

Genie Envisioner Act 2.0 (GE-Act 2.0) is a world-action model whose generative and action components are all initialized from scratch on manipulation data, combining a control-oriented autoencoder (CoAE), single-step visual planner (SVP), and inverse dynamics model (IDM) trained jointly via knowledge-aligned selective optimization (KASO). Scaling co-training data from 300 to 30,000 hours raises zero-shot success from 17.1% to 44.1% on G1-OP and 13.4% to 31.1% on G2-90D, despite the latter comprising under 2% of data, suggesting cross-embodiment transfer. Gains span 19/20 and 18/20 skill groups, and skill-specific coverage correlates with zero-shot OOD success (Pearson r=0.80).

Hugging Face daily papers·Sep 3, 20:00 UTC · 13d 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·Sep 14, 21:08 UTC · 2d agoAI research

ToolLoop: Closed-Loop Tool-Use Data Synthesis via Decomposed Generation and Dynamic Self-Feedback

ToolLoop introduces a closed-loop synthetic data framework whose 11K examples lift a 4B model to 86.40% on BFCL tool-use evaluation.

ToolLoop decomposes tool-use data synthesis into function-name sampling, backward derivation of user queries, and forward derivation of tool calls, with dynamic self-feedback at each stage. This shifts the paradigm from generate-then-filter to generate-verify-refine, reducing inefficient and imbalanced synthetic data. A 4B model trained on 11K synthetic examples reaches 86.40% accuracy on BFCL non-reasoning mode (86.07% in an Isolate variant excluding BFCL-overlapping functions) and 72.1% on ACEBench using only 18.3% of baseline training data.

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

AdaptVPR: Route-Aware Hard Positive Generation for Robust Visual Place Recognition

AdaptVPR generates route-aware synthetic hard positives for visual place recognition, releasing the 160K-image AdaptCities dataset with R@1 gains up to 9.2% under domain shift.

AdaptVPR is a generative augmentation framework that creates same-place hard positives under illumination, weather, seasonal, and dynamic-occlusion shifts for robust visual place recognition training. A vision-language model parses scene attributes and estimates editability, while a rule-based scheduler routes generation through global appearance, local occlusion, or dual perturbation routes with geometric-consistency verification. The resulting AdaptCities dataset contains 160K verified synthetic hard positives, and experiments show R@1 gains up to 9.2% across VPR baselines and backbones. Code and data are publicly released on GitHub.

Hugging Face daily papers·Sep 2, 20:00 UTC · 14d agoAI research

Learning Length-Extrapolatable Recurrent Models

Researchers propose Credit Stabilization through Time, a training method letting recurrent models extrapolate up to 128x their training length.

The paper argues that length extrapolation failure in BPTT-trained recurrent models is better explained through state credit, the signal through which future losses reach earlier recurrent states. It introduces Credit Stabilization through Time (CST), which locally rescales the state-credit signal during backpropagation without rotating the corrected component or changing forward computation. Controlled experiments show improved performance beyond the training horizon, with gains at up to 128x the training length.

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

5 useful things you'll learn in my new post-training textbook (shipping now!)

Nathan Lambert's new RLHF and post-training LLM textbook covers PPO, GRPO, GSPO, CISPO and related techniques, freely available online.

Nathan Lambert's book 'Reinforcement Learning from Human Feedback: Aligning and Post-training LLMs' is now shipping from Manning. It covers policy-gradient algorithms including PPO, GRPO, GSPO, CISPO, and RLOO, plus loss aggregation, truncated importance sampling, asynchronous RL systems, and post-training topics like rejection sampling, outcome reward models, and on-policy distillation. The book is freely available online with a 12-hour course, codebase, and exercises.

Interconnects·Aug 10, 13:02 UTC · Aug 10, 2026AI research

RetroThinker: Enabling Retrospective Thinking in Speech LLMs

RetroThinker is a post-training framework letting the Moshi speech LLM self-correct reasoning mid-stream, adding 11% GSM8K accuracy at similar latency.

Researchers introduce RetroThinker, a multi-stage post-training framework that equips the Moshi speech LLM to verify and forward-correct chain-of-thought steps during streaming inference. It combines supervised fine-tuning on curated retrospective thinking data with length-based direct preference optimization (DPO). On GSM8K it achieves an 11% absolute accuracy gain over non-retrospective baselines at comparable latency.

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

Think Before You Link: Rarity, Reasoning, and Retrieval in Multilingual Entity Linking

Training-free reasoning-plus-retrieval framework lifts multilingual multimodal entity linking accuracy by 6.9% overall and up to 23.3% on rare entities.

The paper broadens rarity measurement in multimodal entity linking using knowledge-graph structural metrics beyond popularity-based pageview metrics, identifying many rare entities that popularity metrics miss. Across these rare-entity slices, state-of-the-art accuracy drops by 15.4-39.9%, exposing distinct failure modes under different rarity definitions. The proposed training-free framework iteratively searches and reasons over Wikipedia with a reasoning-capable vision-language model; experiments show reasoning and retrieval are complementary. On the MERLIN benchmark covering Hindi, Indonesian, Japanese, Tamil, and Vietnamese, the system improves overall accuracy by 6.9% and up to 23.3% on rare entities, with MERLIN-Rare test slices released.

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

RelightFormer: Feed-forward Generative Transformer for Multiview Object Relighting

RelightFormer is a feed-forward generative transformer for photorealistic single- and multi-view object relighting, trained on a 90K-object dataset.

Researchers introduce RelightFormer, a feed-forward generative transformer adapted from a video foundation model that performs direct image relighting without explicit intrinsic property estimation. The architecture injects target environment maps via a latent illumination module with cross-attention and uses permutation-invariant positional encodings for unordered multi-view inputs. Training relies on the newly constructed Laval Objaverse Dataset (LOD) with 90K objects and 39K unique illuminations, and the model shows state-of-the-art quality with strong zero-shot generalization across single-view, multi-view, and novel-view relighting.

Hugging Face daily papers·Sep 6, 20:00 UTC · 10d agoAI research

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·Sep 14, 20:00 UTC · 2d agoAI research

TANGO: Humanoid Navigation in Cluttered Environments with a Whole-Body Vision-Language-Action Model

Researchers present TANGO, a whole-body vision-language-action model enabling humanoid robots to traverse cluttered spaces from language instructions.

TANGO predicts 29-DoF joint-space actions from egocentric RGB observations and natural-language instructions for whole-body humanoid navigation, going beyond 2D path planning. It is trained entirely in simulation using global path planning, kinematic whole-body motion generation, obstacle-aware motion editing, and RL-based tracking. The model reports state-of-the-art simulation performance and was deployed zero-shot on a Unitree G1 humanoid without any real-world navigation training data.

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

TANGO: Humanoid Navigation in Cluttered Environments with a Whole-Body Vision-Language-Action Model

Researchers introduce TANGO, a whole-body vision-language-action model enabling zero-shot language-guided humanoid navigation on the Unitree G1 robot.

TANGO addresses humanoid navigation in cluttered indoor environments by predicting 29-DoF joint-space actions directly from natural-language instructions and egocentric RGB, rather than 2D path planning. It is trained entirely in simulation via a pipeline combining global path planning, kinematic whole-body motion generation, obstacle-aware motion editing, and RL-based tracking. In simulation it achieves state-of-the-art vision-language navigation performance and transfers zero-shot to a Unitree G1 humanoid without any real-world navigation data.

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

Learning-Guided Planning in Large Dynamic Action Spaces: Budgeted Tree Search for One-to-Many Mobile Charging

LP-BTS uses graph proposal policies, learned critics, and budgeted PUCT search to plan mobile charging across dynamic action spaces up to 2,813 stops.

LP-BTS is a learning-guided planning architecture for one-to-many mobile charging, where N=250 sensors induce roughly 1,125 initial candidate charging stops. A graph proposal policy concentrates candidate support, a learned value critic evaluates leaves, and edge-budgeted PUCT compares simulated futures, letting a single frozen checkpoint cover action universes from 736 to 2,813 stops. On a sealed 30-scenario confirmatory bank it attains the highest observed survival (0.4545) and alive-AUC (0.8031), though its +0.0066 survival edge over the strongest engineered comparator is statistically unresolved.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 16:42 UTC · 1d agoAI research

Coaching AI agents: Why your next security hire might be an algorithm

Help Net Security·Sep 9, 09:54 UTC · Sep 9, 2025AI research

A*-Thought-V2: Efficient Latent Reasoning via Geometric Dynamics of LLM

A*-Thought-V2 compresses redundant chain-of-thought steps into latent tokens guided by hidden-state geometry, improving accuracy up to 2.6% while halving response length.

A*-Thought-V2 models chain-of-thought as a hidden-state trajectory projected into a 3D PCA space and compresses steps whose transitions deviate from the question-to-solution direction into continuous latent tokens, keeping aligned steps explicit. Training uses stepwise embedding forcing and label forcing with soft multi-modal vocabulary supervision. On Qwen3.5-9B and Qwen3.6-27B across six in-domain and out-of-domain benchmarks it improves average accuracy by up to 2.6%, cuts response length by up to half, and raises Accuracy per Computation Unit 2.29x while reducing preprocessing and training time by 94.6% and up to 80.3%.

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

A*-Thought-V2: Efficient Latent Reasoning via Geometric Dynamics of LLM

A*-Thought-V2 compresses chain-of-thought into latent tokens using geometric hidden-state dynamics, cutting computation while improving accuracy on Qwen models.

A*-Thought-V2 models chain-of-thought as a hidden-state trajectory and interleaves explicit text with continuous latent tokens, compressing steps whose transitions deviate from the question-to-solution direction. Trained via stepwise embedding forcing and label forcing with soft multi-modal supervision, it was evaluated on Qwen3.5-9B and Qwen3.6-27B across six benchmarks. Reported results include up to 2.6% average accuracy gain, up to 50% shorter responses, 2.29x higher Accuracy per Computation Unit, 94.6% faster preprocessing, and up to 80.3% faster training.

Hugging Face daily papers·Sep 7, 13:56 UTC · 9d agoAI research

Local gradient neural operator

Researchers propose LGNO, a lightweight interpretable neural operator using learnable local stencils, matching global-operator accuracy on PDE benchmarks with fewer parameters.

LGNO builds on nonlinear gradient discretization priors and uses multilayer perceptron convolutional layers to learn translation-invariant local kernels resembling discrete stencils. A zero consistent stencil factorization separates coefficient learning from field reconstruction, and network folding shares equivalent components to cut parameter counts for symmetric problems. Evaluations on linear and nonlinear, static and dynamic, and low- and high-dimensional PDE benchmarks show maintained accuracy, parameter efficiency, and rollout stability, with applicability to diffusion, flow, and quantum problems.

arXiv cs.AI / cs.LG / cs.CL·Sep 7, 16:53 UTC · 9d agoAI research1

A Hybrid LSTM-XGBoost Framework for Multi-Horizon Stock Return Prediction Across Diversified Equity Portfolios

Hybrid LSTM-XGBoost model predicts multi-horizon returns for 14 US equities, cutting 30-day RMSE to about one-third of a standalone LSTM baseline.

The paper combines a two-layer LSTM (64 hidden units) processing 60-day windows of five market features with an XGBoost regressor over a 78-dimensional hybrid feature vector including 14 technical indicators. It is trained on pooled data for 14 US equities across six sectors using chronological splits and per-stock MinMaxScaling to prevent look-ahead bias, and evaluated at 30, 90, 252, and 365 trading-day horizons. The hybrid achieves test RMSE of 0.0949 at 30 days, roughly one-third of the standalone LSTM, while 97.6% directional accuracy at 365 days largely tracks the base rate of positive returns.

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

NOAH: Learning the Full Patient Journey. A Longitudinal Multimodal Time-Aware Model for Representation and Forecasting

Researchers introduce NOAH, a time-aware generative transformer trained on 559 million MIMIC clinical events to forecast multimodal patient trajectories.

NOAH is a task-agnostic, time-aware generative transformer trained on over 559 million clinical events from 431,000 hospital visits by 299,000 patients across the MIMIC dataset family. It uses bidirectional time integration and a variational latent space to model the stochastic evolution of patient states, natively processing medical images, time-series signals, categorical events, and structured or unstructured clinical records. The model supports autoregressive forecasting with optional time control, zero-shot classification, and counterfactual intervention simulation, with strong probing performance across clinical outcomes, 15 ICD chapters, and 29 comorbidities.

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

Building cyber talent through competition, residency, and real-world immersion

Help Net Security·Dec 22, 00:00 UTC · Dec 22, 2025AI research

NOAH: Learning the Full Patient Journey. A Longitudinal Multimodal Time-Aware Model for Representation and Forecasting

Researchers introduce NOAH, a generative time-aware transformer trained on 559 million MIMIC clinical events to model and forecast patient trajectories.

NOAH is a task-agnostic, time-aware generative transformer designed to represent and forecast the full multimodal patient journey across medical images, time-series signals, categorical events, and clinical text. It was trained on over 559 million clinical events from 431,000 hospital visits covering 299,000 patients in the MIMIC dataset family. The architecture combines bidirectional time integration with a variational latent space to capture continuous patient state evolution and clinical stochasticity. NOAH supports autoregressive forecasting with time control, zero-shot classification, and counterfactual intervention simulation, with evaluations on 15 ICD chapters, 29 comorbidities, and time-to-event prediction.

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

Pelican-Sim 1.0: A General World Model Simulator for Embodied Intelligence

Pelican-Sim 1.0 predicts future observations from visual context and robot actions; four-step autoregressive rollouts yield 5.67x speedup and raise policy success from 70% to 93%.

Pelican-Sim 1.0 is a general world model simulator for embodied intelligence that predicts future observations from visual context and robot actions using a 28-dimensional unified action space valid across heterogeneous embodiments. Sparse mixture-of-experts layers reduce FVD by 6.530 versus the dense backbone, and causal adaptation with few-step distillation yields a four-step autoregressive simulator achieving a 5.67-fold speedup over the 35-step model. Trained on roughly one million real-world and simulated trajectories, PSNR improves over the strongest baselines by 4.636 on AgiBotWorld Beta, 2.080 on RoboMIND, and 10.343 on RoboTwin. Downstream on RoboTwin, adding 500 generated trajectories to 50 demonstrations per task raises policy success from 70% to 93%, and policy evaluation reaches a Pearson correlation of 0.994.

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

Recreating Minecraft Is Not a Benchmark

Opinion piece argues viral demos like one-prompt Minecraft recreations are overfit 'demo-benchmarks' measuring preparation, not true model capability.

The author argues that fixed, famous demo tasks (Minecraft builds, SVG pelicans) are trivially optimizable by labs each release cycle, so they no longer differentiate model capability. The piece cites Thinking Machines' Inkling Small scoring within a point of its flagship on the Artificial Analysis Intelligence Index with less than a third of the parameters, and beating it on Humanity's Last Exam, GPQA Diamond, and SciCode. The proposed alternative is rotating or holdout evals such as LiveBench, ARC-AGI's private set, and held-back portions of Humanity's Last Exam.

Hacker News · AI·Sep 6, 14:52 UTC · 10d agoAI researchHN 73↑ · 71 comments

Agent as Policy for Robotic Manipulation

Agent as Policy lets a general-purpose agent drive a physical robot via runtime reasoning and program generation, reaching 100% success on manipulation tasks.

The paper introduces Agent as Policy (AGP), which puts task planning and execution for a physical robot under a general-purpose agent's control with no task-specific or environment-specific training. The agent interprets visual evidence, writes executable programs, issues motion commands, and revises actions based on physical outcomes. AGP was evaluated on real-world manipulation tasks including assembly from human videos, block construction from goal images, die reorientation, targeted throwing, and bimanual towel folding. It achieved success rates of 100%, 100%, and 80% on three block construction configurations.

Hugging Face daily papers·Sep 10, 20:00 UTC · 6d agoAI research

Discovery Foundation Models: Toward Open-Ended Discovery Intelligence

Proposes Discovery Foundation Models that participate in creating new problems and knowledge, instantiated in Zetema and the GALILEO therapeutic-discovery system.

The paper formulates Discovery Foundation Models (DFMs) as general-purpose systems for open-ended discovery, supporting seven coupled capabilities from problem discovery through evidence-grounded revision and continual improvement. It instantiates the framework with Zetema, combining explicit research-state dynamics, verification gating, external grounding, and cross-task Discovery Skill evolution. GALILEO, a real therapeutic-discovery system, closes the loop between Dry-Lab reasoning, robotic and hands-on Wet-Lab experimentation, and iterative hypothesis revision. The authors also define process-centered evaluation so discovery behavior can be trained and measured beyond final answers.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:56 UTC · 2d agoAI research 2 sources

Learning to Solve Hard Problems in RL for LLMs by Never Giving Up

Paper introduces Never Give Up adaptive sampling, fixing RL's 'Matthew Effect' where compute is wasted on easy problems and hard problems see little improvement.

Researchers identify a 'Matthew Effect' in reinforcement learning for LLMs, where RL yields large gains on easy problems but minimal improvement on hard ones because compute is misallocated. They propose Never Give Up (NGU), an adaptive sampling method that keeps generating samples for a problem until one is correct, using asynchronous RL to filter easy problems cheaply and concentrate compute on hard ones. NGU improves performance per compute on the Deepscaler math benchmark and iteratively solves the Manufactoria coding task where standard GRPO with per-test reward fails.

Hugging Face daily papers·Sep 10, 20:00 UTC · 6d agoAI research

AI for Games in the Foundation Model Era

Survey organizes foundation-model AI for games into six roles and analyzes which capabilities transfer across playing, design, building, runtime adaptation, and testing.

A survey maps foundation-model and learned world-model research across the game lifecycle into six roles: playing/acting, modeling players and games, designing games, building/maintaining games, runtime generation/adaptation, and testing/evaluation. The authors identify cross-role connections such as trajectories training world models and design specifications driving executable implementations. Control schemes, rules, engine interfaces, state representations, and player contexts often remain setting-specific, so downstream claims require validation in the target setting. Evaluation is most standardized for bounded game playing, while persistent state, repeated revision, validated player modeling, and automated testing remain less established.

Hugging Face daily papers·Sep 14, 20:00 UTC · 2d agoAI research

BT Inflame uses epidemiological modeling to help combat cyberattacks

Help Net Security·Nov 15, 00:00 UTC · Nov 15, 2021AI research

CUA-Universe: A Scalable and Dynamic Environment for Hybrid GUI+CLI Agents

Researchers introduce CUA-Universe, a pipeline turning real desktop software into hybrid GUI+CLI agent environments, lifting a 9B model's OSWorld success rate.

CUA-Universe is an environment-to-data pipeline that converts real desktop applications into hybrid GUI+CLI environments, scaling to 16 applications via App-Forge, Task-Weave, and Path-Steer. Training on its harvested trajectories shifted a 9B model toward effective GUI+CLI orchestration, yielding +39.3 points on CUA-Verse, +16.8 points success rate on OSWorld, and +7.84 points on OSWorld-MCP while cutting steps and tokens by up to 57% and 60%. The work addresses the scarcity of scalable hybrid environments for computer-use agents.

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

Dynin-Robotics: Omnimodal Unified Diffusion Vision-Language-Action Model

Dynin-Robotics unifies action, goal, and dynamics prediction in one omnimodal masked-diffusion VLA model, reaching 78.4% success on Franka Research 3 manipulation tasks.

Built on the Dynin-Omni masked-diffusion backbone, the model represents language, observations, goals, and actions as discrete tokens and is continually pretrained on roughly 1.33 million trajectories from 48 Open X-Embodiment datasets. The shared trajectory interface enables test-time scaling via goal prediction, action-candidate evaluation, and joint action/future-state refinement. It achieves competitive results on LIBERO and zero-shot LIBERO-Plus, 78.4% average success across four Franka Research 3 conditions, and up to 29.2x faster model-side action decoding from a block-parallel implementation.

Hugging Face daily papers·updated Sep 11, 16:49 UTC · 5d ago·first Sep 10, 20:00 UTC · 6d agoAI research 2 sources1