An evolutionary psychologist is challenging the popular understanding of kids and technology. W hen the 82-year-old psychologist Peter Gray describes the way he grew up, he punctuates the anecdotes by saying that modern parents would be arrested for letting a child have such fun. When he was 4 years old, he would walk to a store in Minneapolis to buy cigarettes for his grandmother. When he was 11, he would sometimes stay home from school in Hill City, Minnesota, to operate a newspaper printing press owned by his mother and stepfather. His parents were not arrested, and that's because the childhood they permitted him to have was basically normal at the time, even if his family did have a newspaper printing press in the house. As a boy, Peter was obsessed with fishing and baseball; neighborhood friends taught him how to ride his bike and catch grasshoppers. Although Gray's career as a scientist would begin with laboratory studies of rat hormones, he eventually found his way to writing about his childhood, in a fashion.

Occam's razor has lost its edge. Can we sharpen our search for truth? Seeking out the simplest, most elegant explanations has served scientists well for centuries, but cognitive scientist Marina Dubova's experiments are revealing better ways to uncover reality Limited by the knowledge of his time, the ancient Greek astronomer Ptolemy imagined that the planets and sun of our solar system orbited Earth. Every new observation that pushed against this image required a slight tweak to that theory, until centuries later Nicolaus Copernicus's reimagining toppled it once and for all. A more elegant explanation proposed that all the planets orbited the sun, kicking off a scientific revolution that changed our understanding of the entire universe.

The lab will beam back data to train AI models to predict how proteins behind age-related diseases like Alzheimer's and certain cancers behave. Space is becoming the next frontier in longevity research. A British startup just launched self-run chemical experiments into orbit, in the hopes zero-gravity data might shine a light on a group of disease-causing proteins too difficult to study on Earth. But first they need to check their autonomous laboratory will work in space. Mass Balance's grapefruit-sized apparatus containing chemicals, sensors and control elements to keep the chemicals functioning launched on a SpaceX transporter on Tuesday morning.

Bees seem to show when they are pleased and like something, rather than just needing it, in one of the strongest signs yet that insects have subjective experiences. In recent decades, it has become clear that bees are capable of more complex behaviours than we previously thought, such as counting and demonstrating a sense of rhythm . But discerning whether they have inner states akin to our emotions is more difficult. For one thing, insects don't have the flexible facial musculature of mammals, which we use to communicate our feelings. "How can we get any behavioural readout of these insects with a hard body and their mask of a face," asks Andrew Barron at Macquarie University in Sydney, Australia.

Benjamin Franklin and other citizen scientists are core parts of the American experiment. 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. Benjamin Franklin's kite experiment in 1752 was a pivotal scientific event, which demonstrated the connection between lightning and electricity. Breakthroughs, discoveries, and DIY tips sent six days a week. By signing up, you confirm you are 16+, will receive newsletters and promotional content and agree to our Terms of Use and acknowledge the data practices in our Privacy Policy .

We deploy a simple into our everyday lives as search engines (Jin et al., 2025; statistical framework based on risk control (Angelopoulos Xiong et al., 2024), coding assistants (Zhao et al., 2023), et al., 2022) that converts any safety signal into a binary and companions (Zhang et al., 2025a). As their applicability grows, so does the potential harm caused by malicious decision rule, and offers statistical guarantees on the false LLM outputs. Despite remarkable performance across a alarm or missed detection rate. The framework is universally applicable to different monitoring purposes and can leverage wide range of tasks, LLMs remain prone to generating halarbitrary proxy signals. Through experiments on mathematlucinated, factually incorrect (Ravichander et al., 2025), or ical problem solving and red teaming conversations, we harmful output (Yu et al., 2025) when deployed.

We investigate a forecasting framework based on a simple discrete-time dynamic model with coefficients varying in time. The parameters of the model are recovered within a deep learning framework, which makes it possible to retain a transparent parametric structure while simultaneously accounting for complex and nonstationary patterns in the observed phenomenon. Our analysis covers two specifications of the noise process. Besides the standard Gaussian setting, we also consider Laplace-distributed noise, which can offer a more adequate description in the presence of heavier tails and sharper local fluctuations. For both cases, we formulate the predictive scheme of the model and analyze the associated uncertainty quantification, including the construction of prediction intervals. The results illustrate that a relatively simple model, when combined with time-dependent parameter estimation, can serve as a mathematically tractable and practically flexible tool for forecasting complex dynamics under different noise assumptions. The general model is stated for TVAR($p$), while the prediction-interval formulas and the numerical experiments are developed for the TVAR(1) case.

Protein engineering is a field primed for artificial intelligence research. Each protein is made up of amino acids; to optimize a protein function, researchers modify proteins by switching out one of 20 different amino acids for another. For a protein that is just 50 amino acids in length, this leads to approximately 1.13 10 potential combinations to test. This number of potential combinations, impossible to test in the lab, makes protein engineering an ideal challenge for AI. Modeling which of these combinations will give the best results is a perfect problem for the technology's massive computing power.

We study the Bayesian fixed-budget best-arm identification problem in which a learner can abstain from making a terminal recommendation. Subject to an abstention budget $α$, we analyze the probability of undetected error--the risk of recommending a suboptimal arm without abstaining. Our central finding is that abstention induces a phase transition: without abstention, the error probability decays polynomially in the sampling budget $T$; in contrast, introducing any small positive abstention budget shifts this to an exponential decay. For Gaussian priors and rewards, in the regime $T\to\infty$ followed by $α\downarrow0$, we establish exact matching information-theoretic lower bounds and algorithmic upper bounds on the optimal error exponent, which takes the form $\exp(-\frac{α^{2}T}{8κ_ν^{2}})$. The hardness parameter $κ_ν$ represents the prior density of the top-two gap at zero, highlighting that nearly tied instances drive the fundamental error. We introduce an adaptive algorithm, PGWS, that successfully achieves this optimal exponent by expending its abstention budget on statistically ambiguous instances. We further demonstrate that this polynomial-to-exponential improvement is exclusively a Bayesian phenomenon--in the frequentist setting, abstention only affects lower-order exponent terms. We also extend our results beyond the Gaussian model.

The Sliced Wasserstein (SW) distance has emerged as a computationally attractive alternative to the Wasserstein distance by leveraging one-dimensional optimal transport along random projections. Standard estimators of the SW distance rely on Monte Carlo averages of one-dimensional Wasserstein distances computed via quantile functions, which require sorting projected samples and access to full datasets. In this work, we introduce a new class of estimators for the Sliced Wasserstein distance based on cumulative distribution functions (CDFs) of projected measures, that avoid sorting and scale via massive dataset parallelism. This class includes several estimators, some of them being indexed by hyperparameters controlling their variance or smoothness. We show that they are especially well suited to scenarios in which CDFs are more tractable than quantile functions, such as mixtures of Gaussians, and moreover that they are also naturally compatible with federated learning, since CDFs of projected data can be computed and aggregated locally without requiring the exchange of raw samples.