AI News

Treatment funds in proposed South Carolina online betting plan (readwrite.com)

BeyondTrust patches zero-day exploited in attacks since August (www.bleepingcomputer.com)

Beyond the Glass (longreads.com)

Lean Now Ships with Verified Kernels (leodemoura.github.io)

DraftKings Gets Conditional Louisiana Sports-Betting Extension (readwrite.com)

Lazy AWS (www.producthunt.com)

Houston homeowners beware: Extreme weather swings could cause costly foundation problems (www.khou.com)

The Folders Programming Language (danieltemkin.com)

Skechers Coupon Codes 20% Off (www.wired.com)

PEERSTITCH Malware Deployed via FortiOS Flaw Bypasses Checks on Tagged VPN Sessions (thehackernews.com)

Proposed Dalby data centre to 'air-cool' operations and harvest rainwater from roof (www.abc.net.au)

Draper (www.producthunt.com)

Chirp Pong – uses microphones and audio for networked game play (simonwillison.net)

Gemma 4 E2B in Pure JAX on a Colab TPU: Google's 4-Bit Export Against an Exact Repack (medium.com)

Scaling Detection-as-Code Across Multiple Google SecOps Tenants (medium.com)

DuckLess: serverless DuckDB on Google Cloud, in your own project (medium.com)

Architecting Autonomous Lakehouse Agents: Governed Iceberg Analytics with Gemini 2.5 (medium.com)

Beyond Chatbots: How to Schedule Autonomous ADK Agents on GCP with Cloud Scheduler (medium.com)

From Vibe-Coded to Trusted: One Agent Through Build, Scale, Govern and Optimize on Gemini… (medium.com)

Routing 160 Telco Intents in GECX: Can we Use SystemOne Thinking Models? (medium.com)

Gemini 4 Argon Long Decode (Part 2): Handling Empty “Thinking-Only” Hops and 5K Stream Checkpoints (medium.com)

Stop Exporting Service Account Keys: Workload Identity Federation for Least-Privilege CI/CD on GCP (medium.com)

Comité de Pilotage - Minerve 2026 | Université d'Orléans (www.univ-orleans.fr)

A Closed Form Depth-Width Law for Neural Collapse in Deep Linear Networks (arxiv.org)

Rethinking Successive Rejects Algorithms (arxiv.org)

Learning Changes the World and Then What Was Learned has Changed: Training and Deploying Neural Networks in the Control Loop (arxiv.org)

SurvICL: a Foundation Model for in-context Survival Analysis (arxiv.org)

Spectral Indistinguishability and Learning-Curve Identifiability in Quadratic Networks (arxiv.org)

Regret Lower Bound for Online Learning of Quantum States with Logarithmic Loss, with Applications to Quantum State Tomography and Confidence Sequences for Matrix Means (arxiv.org)

Market Incentives for AI Safety Investment (arxiv.org)

Why Shallow Neural Networks Learn Sinusoidal Components First: An Orthogonal Polynomial Dynamics Framework (arxiv.org)

Query-Efficient Rejection Sampling for Parallel Masked Diffusion (arxiv.org)

Explore Once, Evaluate Many: Multiple Policy Evaluation for Stochastic Linear Bandits (arxiv.org)

Distributionally Robust Regularization of Sparse Integer Programming Trained Learning Models (arxiv.org)

PAC-Causal Learnability: From Identification to Finite-Sample Guarantees (arxiv.org)

A polylogarithmic bound for list replicability (arxiv.org)

Latent Annealed Posterior Sampling with a Variance-Preserving Bridge for Sparsely Observed Random Fields (arxiv.org)

Time-partitioning Gaussian Process Mixture Model (arxiv.org)

Flexible Doubly Robust Proximal Causal Inference for Censored Outcomes (arxiv.org)

Halve-Then-Greedy: Adaptive Sampling for Posterior Success with Near-Optimal Instance Dependence (arxiv.org)

Acceleration and its Limits in Gaussian Variational Inference (arxiv.org)

Efficient Agnostic Learning of Univariate Densities Under Local Differential Privacy (arxiv.org)

Score Mismatch and Set-Constrained Sampling in Zero-Shot Conditional Discrete Diffusion (arxiv.org)

Dimension-Free PAC-Bayes Generalization for Deep Neural Networks via Dirichlet Processes (arxiv.org)

Failure Is the Mother of Success: Recovering Supervision with Grounding Hindsight (arxiv.org)

On the Last-Iterate Convergence of Clipped Gradient Methods (arxiv.org)

StochLOB: Heavy-Tailed Score Matching for Robust Limit Order Book Trend Prediction (arxiv.org)

A One-Sided McDiarmid-Type Inequality for Heavy Tails via Reverse KL Tensorization (arxiv.org)

Controlling the False Discovery Rate via Model-Agnostic Importance Measures (arxiv.org)

Two Sample Sizes in Test-Time LLM Ensembling: Buffered ERM and Minimax Theory (arxiv.org)