Science The Weirdest Thing I Learned This Week Why do female reindeer have antlers? Plus wild neutrinos and other weird things we learned this week. More information Adding us as a Preferred Source in Google by using this link indicates that you would like to see more of our content in Google News results. Breakthroughs, discoveries, and DIY tips sent six days a week. What's the weirdest thing you learned this week?

'She had big googly eyes and was wearing a red hat knitted by one of the careworkers' Emma the Social Robot by Paula Hornickel. 'She had big googly eyes and was wearing a red hat knitted by one of the careworkers' Emma the Social Robot by Paula Hornickel. 'The first resident that Emma - a social robot - was introduced to was called Peter. After that, Emma assumed they were all called Peter, which everyone found hilarious. O ne morning in July 2025, I arrived in the small, quiet town of Albershausen in south-west Germany.

Neural Information Processing Systems http://nips.cc/

Neural Information Processing Systems http://nips.cc/

Neural Information Processing Systems http://nips.cc/

Neural Information Processing Systems http://nips.cc/

Tensor CANDECOMP/PARAFAC (CP) decomposition is a powerful but computationally challenging tool in modern data analytics. In this paper, we show ways of sampling intermediate steps of alternating minimization algorithms for computing low rank tensor CP decompositions, leading to the sparse alternating least squares (SPALS) method. Specifically, we sample the Khatri-Rao product, which arises as an intermediate object during the iterations of alternating least squares. This product captures the interactions between different tensor modes, and form the main computational bottleneck for solving many tensor related tasks. By exploiting the spectral structures of the matrix Khatri-Rao product, we provide efficient access to its statistical leverage scores. When applied to the tensor CP decomposition, our method leads to the first algorithm that runs in sublinear time per-iteration and approximates the output of deterministic alternating least squares algorithms.

Neural Information Processing Systems http://nips.cc/

Previous studies have proposed image-based clutter measures that correlate with human search times and/or eye movements. However, most models do not take into account the fact that the effects of clutter interact with the foveated nature of the human visual system: visual clutter further from the fovea has an increasing detrimental influence on perception. Here, we introduce a new foveated clutter model to predict the detrimental effects in target search utilizing a forced fixation search task. We use Feature Congestion (Rosenholtz et al.) as our non foveated clutter model, and we stack a peripheral architecture on top of Feature Congestion for our foveated model. We introduce the Peripheral Integration Feature Congestion (PIFC) coefficient, as a fundamental ingredient of our model that modulates clutter as a non-linear gain contingent on eccentricity. We show that Foveated Feature Congestion (FFC) clutter scores (r(44) = 0.82 0.04,p < 0.0001) correlate better with target detection (hit rate) than regular Feature Congestion (r(44) = 0.19 0.13,p= 0.0774) in forced fixation search; and we extend foveation to other clutter models showing stronger correlations in all cases. Thus, our model allows us to enrich clutter perception research by computing fixation specific clutter maps. Code for building peripheral representations is available1.

The goal of noisy high-dimensional phase retrieval is to estimate an s-sparse parameter β Rd from n realizations of the model Y = (X>β)2 + ε. Based on this model, we propose a significant semi-parametric generalization called misspecified phase retrieval (MPR), in which Y = f(X>β,ε) with unknown f and Cov(Y,(X>β)2) > 0. For example, MPR encompasses Y = h(|X>β |) + ε with increasing h as a special case.