ZeroHour

Search: “logistics”

9 stories in the last 30d

Quantum Feature Engineering for Credit Default Prediction: When and Why IQP Circuits Help Linear Classifiers

Quantum IQP circuit features lift logistic-regression credit-default F1 from 0.462 to 0.517, beating Kernel PCA at an equal feature budget.

Using the UCI Default of Credit Card Clients dataset and five-fold cross-validation, an 8-qubit IQP circuit adds 16 features that raise Logistic Regression F1 from 0.462 to 0.517 (+0.055, p < 0.0001). Kernel PCA, the best classical non-linear alternative, reaches only 0.493 at the same feature count, with the gap surviving Benjamini-Hochberg correction across 12 tests (p = 0.00007). Only the linear classifier benefits, pointing to a linear-expressivity mechanism. Feature selection matters: Random Forest importance-guided selection reaches F1 = 0.523 while maximally uncorrelated features drop to 0.496.

arXiv cs.AI / cs.LG / cs.CL · 7d 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 · 4d agoAI tools & infra

Optimal Rates for Agentic Networked Information Aggregation

Researchers close the Kearns–Roth–Ryu gap for agentic networked information aggregation, proving excess error is constant up to depth M^2 then Θ(M^2/D).

The paper studies a networked learning model where agents in a DAG each see only a subset of features and pass only their predictions forward. It sharpens the earlier lower bound to Ω(√(M/D)) for depth below M^2 and constructs M-covered paths of depth D ≥ M^2 achieving Ω(M^2/D) excess error, establishing the correct rate for both regression and logistic classification. It also shows excess error contracts geometrically along the path for any fixed distribution, ruling out a single instance that witnesses polynomial lower bounds at every depth.

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

Can Skills Learned in Games Transfer to Real-World Work?

Good Start Labs trains models in strategy games like 1830 and Diplomacy, showing terminal-agent training transfers to financial research benchmarks.

Good Start Labs, spun out of Every with $3.6M from General Catalyst and Inovia, trains AI models in verifiable strategy games. A 30B model trained as a multi-turn terminal agent in 1830: The Game of Railroads and Robber Barons improved Finance-Agent benchmark performance, while single-turn QA training did not transfer. The founders also co-authored COS-PLAY, a paper on co-evolving LLM decision and skill-bank agents for long-horizon tasks.

Latent Space · 1d agoAI research

Quantile-based Loss Filtering for Outlier-Robust Stochastic Gradient Descent

Quantile-k-Loss SGD filters corrupted component losses by quantile sampling, proving linear convergence while outperforming standard and min-k-loss SGD.

The paper proposes Quantile-k-Loss SGD (Q(k)L-SGD), a loss-filtering framework for finite-sum optimization with corrupted components that samples k losses per iteration and updates using an index from the lower empirical q-quantile. The authors prove linear convergence under standard convexity, requiring sample size to scale with the number of corruptions, plus a complementary small-sample probabilistic analysis. Experiments on polynomial regression, regularized logistic regression, and hinge loss show intermediate quantiles often outperform both standard SGD and min-k-loss SGD.

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

OpenAI Launches the Agents API in Public Beta, Putting the Codex Harness Behind One API Call

OpenAI released its Agents API in public beta, exposing the managed Codex harness with hosted or self-hosted sandboxes, MCP tools, and subagents.

The Agents API is a managed service built on the open-source Codex harness, handling context compaction, tool search, programmatic tool calling, and multi-agent orchestration. Agents run in OpenAI-hosted sandboxes, self-hosted environments, or partner sandboxes from Blaxel, Cloudflare, Daytona, DigitalOcean, E2B, Modal, Oracle, Runloop, and Vercel. Data residency is US-only and Zero Data Retention is unsupported. Examples use model gpt-6-astra; vendor-reported results include SafetyKit cutting case review cost 60% and Ciridae achieving 4x lower subagent latency.

MarkTechPostupdated · 6d agofirst · 6d agoAI tools & infra 3 sources1

Panic builds over bankrupt Spirit’s looming data sale to Google

Startups object to Google's bankruptcy-auction purchase of Spirit Airlines operational data, claiming proprietary IP is being sold without consent.

Google won an auction to acquire a large enterprise dataset from bankrupt Spirit Airlines, which it says will help improve its products and AI models, with no personal information included. Springshot, whose airline logistics platform powered Spirit's stack, filed a limited objection arguing the vaguely defined data categories could transfer third-party IP and trade secrets it owns; International Aero Engines filed a similar objection. The EFF called it the first public bankruptcy proceeding over selling company and employee data as an asset, and objectors warn of a precedent letting large companies acquire startup IP through bankruptcy courts.

Ars Technica · AI · 6d agoAI industry

Skild AI Taps NVIDIA Physical AI to Teach Robots New Tasks From a Single Video

Skild AI launched its S1 robot foundation model, built on NVIDIA infrastructure, that learns long-horizon industrial tasks from a single video.

Skild AI's S1 model uses in-context learning from one video demonstration to execute unfamiliar multistep tasks lasting up to 10 minutes without weight updates or task-specific post-training. In tests on new tasks it achieved about 66% per-step success versus 9% for a comparable AI system, and one video demonstration was estimated to match roughly 380 hands-on training examples. The company reached a $100 million annual revenue run rate with more than 60 deployment partnerships, and with NVIDIA and Foxconn deploys the Skild Brain on dual-arm manipulators assembling NVIDIA Blackwell systems. Training and validation rely on NVIDIA Isaac Lab, Isaac Sim, Omniverse, Cosmos and the Newton physics engine.

NVIDIA Blog · 6d agoModel release

Maven Robotics wants to steal your robot deployment deal

Warehouse robotics startup Maven Robotics emerges from stealth with $100 million to build 250 third-generation palletizing robots.

Maven Robotics, founded in 2024 by former Apple special projects engineer Hamza Derbas and his brother Khalid, emerged from stealth after raising $100 million from RoboStrategy, LocalGlobe, Vine Ventures, and XTX Markets Ventures. Its wheeled dual-arm robots, moving 10 mph and lifting up to 30 kg, perform mixed palletizing in distribution centers, with up to eight units reportedly running 16 hours a day at 99%+ uptime. The company plans to build 250 third-generation robots, start design on a fourth-generation platform, and expand toward material handling and fabrication, positioning itself against rivals like Agility, which is going public via a $2.4 billion SPAC deal.

TechCrunch · AI · 6d agoAI industry