Goto

Collaborating Authors

 Country


I was wrong about robot pool cleaners -- 7 myths, busted

PCWorld

These independent devices combine brushes with suction for optimal cleaning, use treads over wheels for better wall climbing, and operate efficiently in short cycles. Robot cleaners excel at daily maintenance of already-clean pools but cannot handle severely neglected pools with algae blooms or poor water clarity. In my (new!) role as the editor of PCWorld's growing home robotics category, I was only vaguely aware of robot pool cleaners . And when I did think about them, I assumed they shared many of the same limitations faced by robot vacuums .


I Work in Hollywood. Everyone Who Used to Make TV Is Now Secretly Training AI

WIRED

For screenwriters like me--and job seekers all over--AI gig work is the new waiting tables. In eight months, I've done 20 of these soul-crushing contracts for five different platforms. My name on the platform is ri611. I work as an AI trainer. I assess whether a chatbot's tone is natural or flat, affected or annoying. I identify patterns in pictures of furniture; search the internet for group photos of strangers whom I'll eliminate from the portrait, one by one. I trawl through bizarre videos so I can annotate and time-stamp the barking of a dog, the moment a stranger walks past a window, the precise millisecond a balloon pops. I generate anime sex scenes and decapitate young women, coax LLMs into giving me recipes for bombs made of household items, and generate invites to a reprise of January 6 at the White House, all as part of a red team whose purpose is to test safety precautions and probe weaknesses. I work for companies with names like Mercor and Outlier and Task-ify and Turing and Handshake and Micro1. In my "other" career, I am a Hollywood writer and showrunner. I create prime-time TV, usually featuring a middle-class white lady having the worst day of her life, with some salt-of-the-earth police interference to raise the stakes. You can find my shows on Paramount and Hulu and the BBC.


CUDA Proves Nvidia Is a Software Company

WIRED

There's a deep, forbidding moat that surrounds Nvidia--and it has nothing to do with hardware. Forgive me for starting with a cliché, a piece of finance jargon that has recently slipped into the tech lexicon, but I'm afraid I must talk about "moats." Popularized decades ago by Warren Buffett to refer to a company's competitive advantage, the word found its way into Silicon Valley pitch decks when a memo purportedly leaked from Google, titled "We Have No Moat, and Neither Does OpenAI," fretted that open-source AI would pillage Big Tech's castle. A few years on, the castle walls remain safe. Apart from a brief bout of panic when DeepSeek first appeared, open-source AI models have not vastly outperformed proprietary models.


Fears of an AI breakthrough force the U.S. and China to talk

Los Angeles Times

Things to Do in L.A. Fears of an AI breakthrough force the U.S. and China to talk Quiet discussions have taken place ahead of President Trump's state visit to China this week to explore reviving talks on an emergency channel, officials told The Times. This is read by an automated voice. Please report any issues or inconsistencies here . Discussions have taken place ahead of President Trump's state visit to China to explore reviving talks on an emergency channel for AI matters between Washington and Beijing, officials say. Any talks between the United States and China over AI regulations will be fraught with suspicion and risk.


Keyboard Shortcuts I Learned From My Cat

WIRED

Every time my cat Mira walks across a keyboard, I learn a few new Mac and PC keyboard shortcuts I never knew about. All cats love keyboards (but this is not a photo of my cat). My cat Mira is perfect, and has never done anything wrong. She also loves walking on laptop keys--both my MacBook and my wife Kathy's Windows PC . You might think that walking on laptops is an example of Mira doing something wrong. And, in any case, we've both learned a lot about how our computers work because of this.


SoftBank plans to make large-scale batteries for AI data centers

The Japan Times

SoftBank will partner with South Korea's Cosmos Lab and DeltaX to enable mass production of large-scale battery cells from the fiscal year starting next April. SoftBank Group's mobile unit said it plans to begin large-scale battery cell manufacturing at its plant in Sakai, Osaka Prefecture, to address growing power demand for AI services. SoftBank Corp. will partner with South Korea's Cosmos Lab and DeltaX to enable mass production from the fiscal year starting next April, the company said in a statement Monday. The aim is to output energy storage systems at a scale of one gigawatt-hour per year, SoftBank said, which would make it one of the largest facilities in Japan, according to data from BloombergNEF. SoftBank could scale up to a capacity of several GWh, Bloomberg reported last month.


One-Shot Generative Flows: Existence and Obstructions

arXiv.org Machine Learning

We study dynamic measure transport for generative modeling, focusing on transport maps that connect a source measure $P_0$ to a target measure $P_1$ by integrating a velocity field of the form $v_t(x) = \mathbb{E}[\dot X_t \mid X_t = x]$, where $X_\bullet = (X_t)_t$ is a stochastic process satisfying $(X_0,X_1)\sim{P_0}\otimes{P_1}$ and $\dot X_t$ is its time derivative. We investigate when $X_\bullet$ induces a \emph{straight-line flow}: a flow whose pointwise acceleration vanishes and is therefore exactly integrable by any first-order method. First, we develop multiple characterizations of straight-line flows in terms of PDEs involving the conditional statistics of the process. Then, we prove that straight-line flows under endpoint independence exhibit a sharp dichotomy. On the one hand, we construct explicit, computable straight-line processes for arbitrary Gaussian endpoints. On the other hand, we show that straight-line processes do not exist for targets with sufficiently well-separated modes. We demonstrate this obstruction through a sequence of increasingly general impossibility theorems that uncover a fundamental relationship between the sample-path behavior of a process with independent endpoints and the space-time geometry of this process' flow map. Taken together, these results provide a structural theory of when straight-line generative flows can, and cannot, exist.


A Theory of Saddle Escape in Deep Nonlinear Networks

arXiv.org Machine Learning

In deep networks with small initialization, training exhibits long plateaus separated by sharp feature-acquisition transitions. Whereas shallow nonlinear networks and deep linear networks are well studied, extending these analyses to deep nonlinear networks remains challenging. We derive an exact identity for the imbalance of Frobenius norms of layer weight matrices that holds for any smooth activation and any differentiable loss and use this to classify activation functions into four universality classes. On the permutation-symmetric submanifold, the identity combines with an approximate balance law to reduce the full matrix flow to a scalar ODE, giving a critical-depth escape time law $τ_\star = Θ(\varepsilon^{-(r-2)})$ governed by the number $r$ of layers at the bottleneck scale rather than the total depth $L$. We find that this same $r-2$ exponent is recovered under He-normal initialization with $r$ bottleneck layers rescaled by $\varepsilon$, where the symmetry manifold is preserved by the flow but not attracting. We find close agreement between our theory and numerical simulations.


Sequential Minimal Optimization for $\varepsilon$-SVR with MAPE Loss and Sample-Dependent Box Constraints

arXiv.org Machine Learning

We derive a Sequential Minimal Optimization (SMO) algorithm for the quadratic dual problem arising from $\varepsilon$-SVR~\cite{Vapnik1995, Drucker1997, Smola2004} modified to minimize the Mean Absolute Percentage Error (MAPE)~\cite{Makridakis1993, Hyndman2006} directly in the loss function~\cite{benavides2025support}. This formulation is part of a broader family of SVR models with percentage-error losses that also includes least-squares variants~\cite{Suykens2002} and symmetric-kernel extensions~\cite{Espinoza2005}, whose unified structure is studied in~\cite{benavides2026unified}. The key structural difference from standard $\varepsilon$-SVR is that the box constraints become \emph{sample-dependent}: $α_k, α_k^* \in [0,\, 100C/y_k]$. We show that this modification affects only (i) the feasibility sets $\Iup$ and $\Idown$ in the working-set selection and (ii) the clipping bounds in the analytic two-variable update, while leaving the curvature formula and gradient update structurally identical to the standard SMO~\cite{Platt1998, Platt1999, Fan2005}. A shrinking heuristic adapted to the sample-dependent bounds is derived and shown to introduce an asymmetry between $α$- and $α^*$-variables controlled by the gap $2y_k\varepsilon/100$. The same solver applies to the symmetric-kernel variant (m2) by replacing $Ω$ with $Ω_s = \tfrac{1}{2}(Ω+ aΩ^*)$~\cite{Espinoza2005}. Numerical validation against an interior-point QP reference solver confirms solution agreement to within solver termination tolerance across ten synthetic configurations spanning both kernel variants and symmetry types. An implementation is available in the open-source \texttt{psvr} R package~\cite{BenavidesHerrera2026Rpsvr}.


Robustness of Refugee-Matching Gains to Off-Policy Evaluation Choices

arXiv.org Machine Learning

Previous research has investigated the potential of refugee matching for boosting refugee outcomes, first considered by Bansak et al. (2018). This paper demonstrates the stability of counterfactual impact evaluation results in the context of refugee matching in the United States using a range of off-policy evaluation methods. In order to estimate counterfactual impact and test the robustness of our results, we employ several evaluation methods, including inverse probability weighting (IPW) and multiple variants of augmented inverse probability weighting (AIPW). We also consider various modifications, including alternative modeling architectures and different assignment procedures. The impact estimates remain consistent in magnitude in all scenarios as well as statistically significant in most cases. Furthermore, the estimates are also consistent with the results originally presented in Bansak et al. (2018).