A panther, a leopard and a Canadian lynx are among the reported sightings of big cats in Wales, according to a Freedom of Information (FOI) request. Fifteen big cats were reported to authorities in Wales between January 2020 and July 2025, the FOI to the Welsh government found. The apparent spottings were made in areas ranging from Pembrokeshire to Ceredigion, Powys, Swansea, Denbighshire and Carmarthenshire. One reporter described seeing what they believed was a panther jumping over a hedge onto the road in front of them while they were driving. A leopard sighting was reported to Dyfed-Powys Police in Cwmtwrch, Swansea, on 16 January 2023, when the reporter saw a leopard with spots walking around the garden when their dog was let out.

The UK government is introducing a ban on social media for children and a minimum age for some chatbots in an attempt to shield young people from dangerous corners of the web. UK prime minister Keir Starmer has been leading the charge on under-16 social media regulation. Children under the age of 16 will be banned from social media platforms in the UK, under new measures announced by prime minister Keir Starmer on Monday. "The need for action could not be clearer. Social media is making our children unhappy and unsafe," said Starmer, in an X post .

Rank One, whose board includes a former CIA deputy director and a former FBI science chief, supplied face recognition to Meta for internal development of its smart glasses app. Meta is testing face-recognition software built by a company that sells surveillance tools to police departments and the United States military, as it explores bringing the technology to its smart glasses, WIRED has learned. The arrangement is documented in a software license, obtained by WIRED, that was issued by Rank One Computing--a Denver-based company that derives roughly 80 percent of its revenue from government clients--and is tied to a test version of the Meta AI app that powers Meta's Ray-Ban and Oakley smart glasses . Rank One's face recognition has been bought by the US Marshals Service, which uses it to confirm prisoners' identities without fingerprinting them during transport, and by the Naval Criminal Investigative Service--the Navy's police force--which purchased the company's video tool, ROC Watch. Rank One developed long-range face recognition for US Special Operations Command under a government research contract, saying its software could identify a face from as far as a kilometer away.

Causality in time series can be challenging to determine, especially in the presence of non-linear dependencies. Granger causality helps analyze potential relationships between variables, thereby offering a method to determine whether one time series can predict--Granger cause--future values of another.

Large language models (LLMs) demonstrate impressive generalization abilities, yet adapting them effectively across multiple heterogeneous domains remains challenging due to inter-domain interference. To overcome this challenge, we propose a partition-based multi-stage fine-tuning framework designed to exploit inter-domain synergies while minimizing negative transfer.

In this paper, we investigate the adversarial robustness of nonparametric regression, a fundamental problem in machine learning, under the setting where an adversary can arbitrarily corrupt a subset of the input data. While the robustness of parametric regression has been extensively studied, its nonparametric counterpart remains largely unexplored. We characterize the adversarial robustness in nonparametric regression, assuming the regression function belongs to the second-order Sobolev space (i.e., it is square integrable up to its second derivative). The contribution of this paper is two-fold: (i) we establish a minimax lower bound on the estimation error, revealing a fundamental limit that no estimator can overcome, and (ii) we show that, perhaps surprisingly, the classical smoothing spline estimator, when properly regularized, exhibits robustness against adversarial corruption. These results imply that if o(n) out of n samples are corrupted, the estimation error of the smoothing spline vanishes as n . On the other hand, when a constant fraction of the data is corrupted, no estimator can guarantee vanishing estimation error, implying the optimality of the smoothing spline in terms of maximum tolerable number of corrupted samples.

SHAP (SHapley Additive exPlanations) values are a widely used method for local feature attribution in interpretable and explainable AI. We propose an efficient two-stage algorithm for computing SHAP values in both black-box setting and tree-based models. We assume the black-box predictor or tree model accepts binary (zero-one) features.

Large language models (LLMs) raise concerns about content authenticity and integrity because they can generate human-like text at scale. Text watermarks, which embed detectable statistical signals into generated text, offer a provable way to verify content origin. Many detection methods rely on pivotal statistics that are i.i.d.

Federated Learning is a promising technique that enables collaborative machine learning while preserving participant privacy.

We consider a decentralized setup in which the participants collaboratively train and serve a large neural network, and where each participant only processes a subset of the model. In this setup, we explore the possibility of unmaterializable weights, where a full weight set is never available to any one participant. We introduce Unextractable Protocol Models (UPMs): a training and inference framework that leverages the sharded model setup to ensure model shards (i.e., subsets) held by participants are incompatible at different time steps. UPMs periodically inject timevarying, random, invertible transforms at participant boundaries; preserving the overall network function yet rendering cross-time assemblies incoherent. On Qwen2.5-0.5B and Llama-3.2-1B, 10 000 transforms leave FP32 perplexity unchanged ( PPL< 0.01; Jensen-Shannon drift < 4 10 5), and we show how to control growth for lower precision datatypes. Applying a transform every 30s adds 3% latency, 0.1% bandwidth, and 10% GPU-memory overhead at inference, while training overhead falls to 1.6% time and < 1% memory. We consider several attacks, showing that the requirements of direct attacks are impractical and easy to defend against, and that gradient-based fine-tuning of stitched partitions consumes 60% of the tokens required to train from scratch. By enabling models to be collaboratively trained yet not extracted, UPMs make it practical to embed programmatic incentive mechanisms in community-driven decentralized training.