If You Have $650,000 and Don't Buy This Giant Mecha Robot You're a Fool China's Unitree, famous for making low-cost dancing robots, will now sell you a giant, wall-smashing mecha. Unitree is a Chinese company known for making adorable, relatively affordable robots that dance and shuffle and such. Last night, it revealed its latest creation, which is something of a departure: a giant, walking, crawling, transforming, wall-smashing "mecha" called the GD01. An introductory video for the GD01--set to a thundering rock guitar soundtrack--shows the company's founder and CEO, Xingxing Wang, holding hands with the robot before climbing into its prodigious, open-air belly. A disclaimer added to Unitree's social media post reads: "Please everyone be sure to use the robot in a Friendly and Safe manner."

Get ready for summer with discounts on robot pool cleaners from Beatbot. National Pool Opening Day is tomorrow, April 25, and summer is almost here, which means pool owners everywhere are getting ready to unveil the horrors of whatever happened during the off-season. Most of the Beatbot lineup is on sale at Amazon and Beatbot's own storefront, with prices starting at $499. Beatbot makes many of the best pool-cleaning robots we've tested, and we've highlighted our top picks below. Note that the discounts are scheduled to end on April 26, though items may sell out sooner.

This study deals with neural networks in the sense of geometric transformations acting on the coordinate representation of the underlying data manifold which the data is sampled from. It forms part of an attempt to construct a formalized general theory of neural networks in the setting of Riemannian geometry. From this perspective, the following theoretical results are developed and proven for feedforward networks. First it is shown that residual neural networks are nite dierence approximations to dynamical systems of rst order dierential equations, as opposed to ordinary networks that are static. This implies that the network is learning systems of dierential equations governing the coordinate transformations that represent the data. Second it is shown that a closed form solution of the metric tensor on the underlying data manifold can be found by backpropagating the coordinate representations learned by the neural network itself. This is formulated in a formal abstract sense as a sequence of Lie group actions on the metric bre space in the principal and associated bundles on the data manifold. Toy experiments were run to conrm parts of the proposed theory, as well as to provide intuitions as to how neural networks operate on data.

The design of revenue-maximizing combinatorial auctions, i.e. multi-item auctions over bundles of goods, is one of the most fundamental problems in computational economics, unsolved even for two bidders and two items for sale. In the traditional economic models, it is assumed that the bidders' valuations are drawn from an underlying distribution and that the auction designer has perfect knowledge of this distribution. Despite this strong and oftentimes unrealistic assumption, it is remarkable that the revenue-maximizing combinatorial auction remains unknown. In recent years, automated mechanism design has emerged as one of the most practical and promising approaches to designing high-revenue combinatorial auctions. The most scalable automated mechanism design algorithms take as input samples from the bidders' valuation distribution and then search for a high-revenue auction in a rich auction class. In this work, we provide the first sample complexity analysis for the standard hierarchy of deterministic combinatorial auction classes used in automated mechanism design. In particular, we provide tight sample complexity bounds on the number of samples needed to guarantee that the empirical revenue of the designed mechanism on the samples is close to its expected revenue on the underlying, unknown distribution over bidder valuations, for each of the auction classes in the hierarchy. In addition to helping set automated mechanism design on firm foundations, our results also push the boundaries of learning theory. In particular, the hypothesis functions used in our contexts are defined through multi-stage combinatorial optimization procedures, rather than simple decision boundaries, as are common in machine learning.

We propose a landmark-constrained algorithm, LA-VDM (Landmark Accelerated Vector Diffusion Maps), to accelerate the Vector Diffusion Maps (VDM) framework built upon the Graph Connection Laplacian (GCL), which captures pairwise connection relationships within complex datasets. LA-VDM introduces a novel two-stage normalization that effectively address nonuniform sampling densities in both the data and the landmark sets. Under a manifold model with the frame bundle structure, we show that we can accurately recover the parallel transport with landmark-constrained diffusion from a point cloud, and hence asymptotically LA-VDM converges to the connection Laplacian. The performance and accuracy of LA-VDM are demonstrated through experiments on simulated datasets and an application to nonlocal image denoising.

The theory enables a systematicclassification of all existing G-CNNs in terms of their symmetry group, base space,andfieldtype.