When you purchase through links in our articles, we may earn a small commission. All four of Aiper's new robotic pool cleaners are packing powerful AI Aiper's CES 2026 launches include three new underwater robots and one of the most powerful surface skimmers we've seen to date. Aiper, best known for its sleek and hard-working robotic pool cleaners, has brought four new devices to CES 2026. The Aiper Scuba V3 line includes three underwater scrubbers of increasing sophistication -- the Scuba V3, V3 Pro, and V3 Ultra. Meanwhile, the all-new Aiper EcoSurfer Senti is a new surface-only skimmer that adds some surprising new tricks in what has become a fairly sleepy category in the last year.

When you purchase through links in our articles, we may earn a small commission. The Luba 3 AWD leads the new lineup, featuring LiDAR, RTK, and AI vision navigation, The more compact Luba and Yuka models target smaller yards. Mammotion is expanding its robotic lawn mower lineup for 2026, introducing three new models at CES that aim to simplify autonomous yard care for a broader range of homeowners. The company unveiled a new flagship model, the Luba 3 AWD, alongside smaller offerings in the Luba Mini 2 AWD and the Yuka Mini 2 series. The standout among them is the Luba 3 AWD, a high-end mower designed for large and complex lawns.

When you purchase through links in our articles, we may earn a small commission. The new smart lock series boasts dual batteries and support for Matter-over-Wi-Fi. A higher-end model also supports palm vein and fingerprint recognition. SwitchBot introduced its SwitchBot Lock Vision Series of smart deadbolts at CES today. The new locks use facial recognition as a primary unlock method, which the company positions as a more foolproof and hands-free means of securing your home's front door.

Gradient-based optimization with categorical variables typically relies on score-function estimators, which are unbiased but noisy, or on continuous relaxations that replace the discrete distribution with a smooth surrogate admitting a pathwise (reparameterized) gradient, at the cost of optimizing a biased, temperature-dependent objective. In this paper, we extend this family of relaxations by introducing a diffusion-based soft reparameterization for categorical distributions. For these distributions, the denoiser under a Gaussian noising process admits a closed form and can be computed efficiently, yielding a training-free diffusion sampler through which we can backpropagate. Our experiments show that the proposed reparameterization trick yields competitive or improved optimization performance on various benchmarks.

A large and rapidly expanding literature demonstrates that machine learning (ML) methods substantially improve out-of-sample asset return prediction relative to conventional linear benchmarks, and that these statistical gains often translate into economically meaningful portfolio performance. Seminal contributions such as Gu et al. (2020) document large Sharpe ratio improvements from nonlinear learners in U.S. equities, while subsequent work extends these findings to stochastic discount factor estimation (Chen et al. 2024), international equity markets (Leippold et al. 2022), and bond return forecasting (Kelly et al. 2019, Bianchi et al. 2020). Collectively, this literature establishes ML as a powerful tool for extracting conditional expected returns in environments characterized by noisy signals, nonlinear interactions, and pervasive multicollinearity.

In this study, we introduce a sophisticated generative conditional strategy designed to impute missing values within datasets, an area of considerable importance in statistical analysis. Specifically, we initially elucidate the theoretical underpinnings of the Generative Conditional Missing Imputation Networks (GCMI), demonstrating its robust properties in the context of the Missing Completely at Random (MCAR) and the Missing at Random (MAR) mechanisms. Subsequently, we enhance the robustness and accuracy of GCMI by integrating a multiple imputation framework using a chained equations approach. This innovation serves to bolster model stability and improve imputation performance significantly. Finally, through a series of meticulous simulations and empirical assessments utilizing benchmark datasets, we establish the superior efficacy of our proposed methods when juxtaposed with other leading imputation techniques currently available. This comprehensive evaluation not only underscores the practicality of GCMI but also affirms its potential as a leading-edge tool in the field of statistical data analysis.

Identification and Estimation under Multiple Versions of Treatment: Mixture-of-Experts Approach Kohei Y oshikawa Shuichi Kawano January 5, 2026 Abstract The Stable Unit Treatment Value Assumption (SUTV A) includes the condition that there are no multiple versions of treatment in causal inference. Though we could not control the implementation of treatment in observational studies, multiple versions may exist in the treatment. It has been pointed out that ignoring such multiple versions of treatment can lead to biased estimates of causal effects, but a causal inference framework that explicitly deals with the unbiased identification and estimation of version-specific causal effects has not been fully developed yet. Thus, obtaining a deeper understanding for mechanisms of the complex treatments is difficult. In this paper, we introduce the Mixture-of-Experts framework into causal inference and develop a methodology for estimating the causal effects of latent versions. This approach enables explicit estimation of version-specific causal effects even if the versions are not observed. Numerical experiments demonstrate the effectiveness of the proposed method. Keywords causal inference multiple versions of treatment compound treatments mixture-of-experts EM algorithm 1 Introduction In the theory of causal inference, a fundamental starting point is the potential outcomes framework since Rubin (1980), whose core assumption is the Stable Unit Treatment Value Assumption (SUTV A).

We derive an estimator of the spectral density of a functional time series that is the output of a multilayer perceptron neural network. The estimator is motivated by difficulties with the computation of existing spectral density estimators for time series of functions defined on very large grids that arise, for example, in climate compute models and medical scans. Existing estimators use autocovariance kernels represented as large $G \times G$ matrices, where $G$ is the number of grid points on which the functions are evaluated. In many recent applications, functions are defined on 2D and 3D domains, and $G$ can be of the order $G \sim 10^5$, making the evaluation of the autocovariance kernels computationally intensive or even impossible. We use the theory of spectral functional principal components to derive our deep learning estimator and prove that it is a universal approximator to the spectral density under general assumptions. Our estimator can be trained without computing the autocovariance kernels and it can be parallelized to provide the estimates much faster than existing approaches. We validate its performance by simulations and an application to fMRI images.

Detecting unobserved confounders is crucial for reliable causal inference in observational studies. Existing methods require either linearity assumptions or multiple heterogeneous environments, limiting applicability to nonlinear single-environment settings. To bridge this gap, we propose Kernel Regression Confounder Detection (KRCD), a novel method for detecting unobserved confounding in nonlinear observational data under single-environment conditions. KRCD leverages reproducing kernel Hilbert spaces to model complex dependencies. By comparing standard and higherorder kernel regressions, we derive a test statistic whose significant deviation from zero indicates unobserved confounding. Theoretically, we prove two key results: First, in infinite samples, regression coefficients coincide if and only if no unobserved confounders exist. Second, finite-sample differences converge to zero-mean Gaussian distributions with tractable variance. Extensive experiments on synthetic benchmarks and the Twins dataset demonstrate that KRCD not only outperforms existing baselines but also achieves superior computational efficiency.

Numerical simulation of complex physical phenomena is a core enabling technology for digital twins, which are comprised of physical and virtual assets with a two-way flow of information: data from the physical asset is used to construct and/or calibrate the virtual asset (a numerical model), while numerical predictions from the virtual asset are used for control or decision-making for the physical asset [42]. To be viable for practical application, the virtual asset must be able to produce predictions rapidly and reliably; however, the underlying physics that are of interest for digital twin applications can typically only be accurately simulated using a large number of degrees of freedom, leading to computationally expensive numerical simulations. The explainability and computational efficiency of decisions made by the digital twin play a key role in safety-critical applications, making explainable artificial intelligence an essential ingredient [24]. Model reduction techniques are one such explainable scientific machine learning technique that construct low-dimensional systems, called reduced-order models (ROMs), to serve as computationally inexpensive surrogates for a high-dimensional physics simulation [4, 20]. This paper introduces a technique for adaptively constructing ROMs to emulate systems with parametric dependence, that is, systems whose behavior varies with some set of parameters, usually representing physical properties. We focus on systems where the parametric dependence manifests in the operators defining the model, not merely in initial conditions or external inputs.