ICE agents detain a suspect during a targeted enforcement operation in Lyons, Illinois, on 26 January. ICE agents detain a suspect during a targeted enforcement operation in Lyons, Illinois, on 26 January. 'We should be worried': report sheds light on ICE's booming arsenal of hi-tech surveillance tools Spending on government contracts with tech firms that use AI-powered tools to track immigrants has soared to record levels under Trump 2.0, report says A new report sheds light on the unprecedented growth of the US government's immigration surveillance arsenal, revealing fresh details about how spending on technology and AI tools to find and track migrants has soared to record levels during Donald Trump's second term. They found the money awarded to these firms doubled from 2024 to 2025, to just over $310m - and in 2026, that number soared to a record $513m. Researchers traced these contracts as far back as 2013, when they hovered under $50m, and found a steady increase over time - with a bigger jump over the last two years.

The AI arms race between China and the US has researchers on both sides worried about a "Chernobyl moment." Just over a week ago, I attended a major artificial intelligence conference in Zhongguancun, Beijing's bustling high-tech district. It was packed with fascinating sessions touching on everything from recursive self-improvement--the idea that models can tweak their own code and advance indefinitely--to humanoid robots. And it featured a few legends of computing, including Whitfield Diffie, co-inventor of public-key cryptography, and Andrew Barto, who won the Turing Award with Rich Sutton for his pioneering work on reinforcement learning. But I left with one takeaway above all else: The US and China should put their fierce AI rivalry to the side.

Modular, one of the most promising chip software startups of the AI era, heads for a multibillion-dollar exit. Qualcomm will acquire the Silicon Valley chip startup Modular for nearly $4 billion. The companies announced the acquisition on Wednesday; Qualcomm said it expects to issue up to 19.2 million shares of common stock in the deal, which works out to just under $4 billion based on the company's last closing share price. The deal, which includes $300 million for Modular employees, comes nine months after the chip startup raised $250 million at a $1.6 billion valuation . It's expected to close in the second half of this year.

Automated diabetic retinopathy (DR) grading from colour fundus photographs can achieve strong predictive performance, but clinical interpretation requires more than an image-level label. It requires understanding how lesion evidence is distributed around retinal vessels and how this evidence relates to quantitative vascular biomarkers. We present a dual-edge spatial-Jacobian image graph for interpretable DR grading. Each fundus image is represented as a graph node with four aligned evidence streams: AutoMorph vessel information ($X_1$), DR-XAI-style lesion evidence maps ($X_2$), a 128-dimensional lesion-based contrastive image embedding ($X_3$), and AutoMorph morphometric biomarkers ($X_4$). The spatial edge branch ($X_{12}$) encodes vessel-lesion geometry, while the Jacobian branch ($X_{34}$) models embedding-biomarker sensitivity. Lightweight two-token attention fuses both edge families into a final image graph. On 2,910 matched non-augmented APTOS images, the full graph achieves 0.8076 accuracy, 0.8312 quadratic weighted kappa, 0.5915 macro-F1, and 0.9330 adjacent-grade accuracy; referable DR reaches 0.9055 accuracy and 0.9711 AUROC. The framework is positioned as an explainable representation-learning tool for lesion-biomarker hypothesis generation, rather than as a deployment-ready clinical classifier. The code is available at https://github.com/Inamullah-Colab/dual-edge-dr-graph-xai.

State-space models provide a powerful framework for describing the evolution of hidden states in dynamical systems [3], [4], [1]. Conventionally, state-space models assume Gaussian measurement and state noise, owing to their tractability and well-characterized statistical properties. However, many real-world phenomena are subject to perturbations that deviate from the conventional Gaussian noise assumption. In radio interferometry, for instance, observational data are frequently corrupted by non-Gaussian noise sources such as radio-frequency interference (RFI) [5], [2], which originates from man-made signals and introduces significant distortions into astronomical measurements [6], [30]. Such interference produces sporadic high-power spikes in the measured visibilities, leading to heavy-tailed statistics. Many radio-interferometric reconstruction methods assume Gaussian additive noise [7], [31], [33], [35], an approximation that can lead to inaccurate reconstructions when the heavy-tailed nature of real-world measurement noise is not properly accounted for. In the realm of state-space modeling, addressing non-Gaussian noise has led to the development of various methodological approaches, notably particle filtering and non-conventional Kalman filters. Particle filters [8], or Sequential Monte Carlo methods, are designed to handle non-linear and non-Gaussian state-space models by representing the posterior distribution with a set of weighted samples [9], [10], [32].

Survival analysis is central to clinical decision-making, yet reliable time-to-event models require large, diverse cohorts that are rarely available at a single institution, while privacy regulations restrict the centralization of patient data. Federated learning (FL) offers a privacy-preserving alternative by training shared models without exchanging raw data, but its effectiveness for survival modeling under realistic, heterogeneous conditions remains insufficiently understood. This paper presents a systematic, multi-model evaluation of federated survival analysis on a cross-institutional breast cancer cohort with naturally heterogeneous distributed clients. Three representative survival models, the Cox Proportional Hazards model, DeepSurv, and Random Survival Forest (RSF), are compared across centralized, local, and federated training, and three federated optimization strategies (FedAvg, FedProx, and FedAdam) are assessed for the gradient-based models. Results show that FL consistently outperforms local training and approaches, and occasionally exceeds, centralized performance, while RSF offers the best overall balance of discrimination, calibration, and robustness across heterogeneous clients. We further find that performance depends on the diversity of client distributions, and that FedAvg and FedProx are stronger and more stable than FedAdam. Based on these findings, we derive practical, decision-oriented guidelines mapping data, privacy, interpretability, and resource constraints to recommended model and training-paradigm choices for federated survival modeling in healthcare.

Causal discovery seeks to uncover the causal dependencies among variables. For this purpose, we propose an algorithm called Tensor-based Second-order Causal Discovery (TSCD). Its input is a tensor obtained from the covariance matrices of observational and interventional data. Assuming the causal dependencies follow a linear structural equation model on a directed acyclic graph (DAG), TSCD outputs the DAG and the functions on its edges, requiring only that the noise variables are uncorrelated. We also implement a version of the approach for nonlinear models. Our focus on second-order statistics (via the covariance matrices) is motivated by their statistical and computational efficiency relative to higher-order moments, their identifiability relative to first-order statistics, and that they work regardless of whether the variables are Gaussian. We show that TSCD has identifiable causal order and parameters from a number of interventions that is logarithmic in the number of variables. Experiments show that TSCD is robust to noise, competitive with existing methods, and scales to hundreds of variables.

We study the problem of estimating the arrival times of vertices in a uniform random recursive tree from its unlabeled structure. We adopt a pointwise perspective and analyze the distribution of the relative estimation error, and derive tail bounds that are uniform in both the vertex and the tree size. For the ranking induced by Jordan centrality, the probability that the estimate exceeds the true arrival time by a factor $S$ decays on the order of $1/S$, while the probability of underestimating the arrival time by a factor $1/S$ decays exponentially in $S$. We introduce a refined centrality measure whose overestimation tail decays on the order of $(\log S)/S^{2}$, at the cost of a heavier lower tail of order $1/S^{2}$. These results reveal a tradeoff between upper- and lower-tail performance in arrival-time estimation that is invisible to the previously studied risk functional. Nevertheless, the refined centrality measure attains the optimal order of the risk for all its parameter values.

The growing reliance on machine learning for decisions across sectors underscores the importance of model transparency and interpretability. Existing post-hoc explainability methods and inherently interpretable approaches shed light on model behavior, yet they primarily reveal how models exploit correlations to maximize performance in prediction tasks. However, many decisions require causal insights and the possibility of using models for what-if scenario evaluation. To address this, we propose the integration of causal machine learning with inherently interpretable models for cross-sectional data. We evaluate these methods in terms of predictive accuracy and interpretability. Our findings show that the proposed approach achieves competitive performance in prediction and what-if analysis while offering transparency on the system structure, causal relationships among variables, and the functional forms that connect them. This work contributes to research on causality, machine learning interpretability, and data-driven decision support by offering informed, transparent, and causally grounded decisions.

Attention mechanisms have demonstrated remarkable empirical success in identifying relevant information from large collections of tokens, yet the theoretical principles underlying this behavior remain poorly understood. We study a stylized softmax-attention model in which a query vector is learned by stochastic gradient ascent from a collection of informative and nuisance tokens. Exploiting the symmetry of the model, we derive a population objective and characterize the limiting ordinary differential equation governing the learning dynamics. Using tools from stochastic approximation and dynamical systems theory, we establish a rigorous connection between the stochastic learning algorithm and its deterministic limit. Our main result shows that, under suitable high-dimensional scaling assumptions and standard step-size conditions, the learned query converges almost surely to the one-dimensional signal subspace spanned by the latent informative direction. Equivalently, the query asymptotically recovers the latent signal up to the intrinsic sign ambiguity. These results provide a rigorous theoretical foundation for understanding attention mechanisms as signal extraction procedures in high-dimensional noisy environments and offer a dynamical-systems perspective on how attention discovers relevant information in the presence of substantial noise.