Standard Chartered said it would cut 15% of its corporate function roles by 2030. Standard Chartered said it would cut 15% of its corporate function roles by 2030. Standard Chartered plans to cut more than 7,000 jobs over the next four years as it increasingly uses artificial intelligence. The London-headquartered lender is one of the first major global banks to lay out plans to cut thousands of jobs, citing AI as a driver to make its operations slimmer as it seeks to increase its profitability and tackle competition. StanChart said on Tuesday it would cut 15% of its back-office roles by 2030, which would result in about 7,800 redundancies out of its more than 52,000 staff in such roles.

Nintendo shares climbed as much as 6.8% in Tokyo Tuesday to mark a third straight day of gains -- their longest winning streak since mid-March. Embattled Switch 2 maker Nintendo enjoyed its biggest stock gain in two months on Tuesday as concerns about overvaluation in the AI sector sent investors on the hunt for bargains elsewhere. Nintendo shares climbed as much as 6.8% in Tokyo to mark a third straight day of gains -- their longest winning streak since mid-March. The advance is part of a broad rally in Japanese video game stocks that saw Bandai Namco Holdings and Konami Group rise more than 9% on Tuesday. The revival in Japanese gaming shares comes after months of headwinds brought on by a memory chips supply crunch and worries it will hit hardware sales.

What are Russia's gains from the Iran war? 'We are not losers; we are winners' A Russian attack has damaged port infrastructure in Ukraine's Danube River port city of Izmail, a vital grain-export hub, while Russian authorities said they had downed four Ukrainian drones headed towards Moscow, as peace efforts remain stalled and both sides continue reciprocal attacks. Izmail, in the Odesa region, is a frequently targeted logistical centre and was hit in the early hours of Tuesday. It is Ukraine's largest port on the Danube. The attack lasted from about 1am to 3am (22:00 to 00:00 GMT), with firefighters battling a blaze in a building with blown-out windows. This followed another Russian attack on port infrastructure in Izmail on the night of May 2. In Kharkiv, two people were rescued, and one may remain trapped under the rubble after a Russian drone attack, Mayor Ihor Terekhov said on Telegram.

Banking giant Standard Chartered has become the latest major company to announce job cuts as it increases its adoption of artificial intelligence (AI). The firm, which has its headquarters in the UK, said it will cut more than 15%, or around 7,800, back-office roles by 2030. The BBC understands that Standard Chartered aims to move some of the effected workers to other roles in the business. Companies around the world have announced major job cuts in recent months as they increasingly use AI tools for roles currently carried out by humans. The company did not give details of where the roles would be cut.

Elon Musk loses case against Sam Altman over OpenAI's overhaul Elon Musk arrives at the Ronald V. Dellums Federal Building for court in Oakland, California on April 30. A jury rejected Elon Musk's claims that OpenAI under Sam Altman's leadership betrayed its mission to benefit the public by morphing into a for-profit business, finding that he waited too long to sue the company. The verdict reached Monday in federal court in Oakland, California, follows a trial over the bitter feud between the entrepreneurs who worked together to launch the startup in 2015. OpenAI has since evolved into one of the world's most valuable and powerful artificial intelligence companies. "I think there is a substantial amount of evidence to support the jury's findings," U.S. District Judge Yvonne Gonzalez Rogers said when she accepted the nine-member jury's unanimous conclusion after about two hours of deliberations.

Self-supervised learning (SSL) excels at finding general-purpose latent representations from complex data, yet lacks a unifying theoretical framework that explains the diverse existing methods and guides the design of new ones. We cast SSL as latent distribution matching (LDM): learning representations that maximize their log-probability under an assumed latent model (alignment), while maximizing latent entropy to prevent collapse (uniformity). This view unifies independent component analysis with contrastive, non-contrastive, and predictive SSL methods, including stop gradient approaches. Leveraging LDM, we derive a nonlinear, sampling-free Bayesian filtering model with a Kalman-based predictor for high-dimensional timeseries. We further prove that predictive LDM yields identifiable latent representations under mild assumptions, even with nonlinear predictors. Overall, LDM clarifies the assumptions behind established SSL methods and provides principled guidance for developing new approaches.

The population dynamics of molecules, cells, and organisms are governed by a number of unknown forces. In the last decade, population dynamics have predominantly been modeled with Wasserstein gradient flows. However, since gradient flows minimize free energy, they fail to capture important dynamical properties, such as periodicity. In this work, we propose a change in perspective by considering dynamics that minimize a population-level action under a damped Wasserstein Lagrangian. By deriving the corresponding Hamiltonian equations of motion, we formalize Wasserstein Lagrangian Mechanics, a structured class of second-order dynamics that encompasses classical mechanics, quantum mechanics, and gradient flows. We then propose WLM as the first algorithm that learns these second-order dynamics from observed marginals, without specifying the Lagrangian. By directly learning the population mechanics, WLM can both forecast and interpolate unseen marginals, and outperforms existing gradient flow and flow matching methods across a wide range of dynamics, including vortex dynamics, embryonic development, and flocking.

Automated systems built on artificial intelligence (AI) are increasingly deployed across high-stakes domains, raising critical concerns about fairness and the perpetuation of demographic disparities that exist in the world. In this context, causal inference provides a principled framework for reasoning about fairness, as it links observed disparities to underlying mechanisms and aligns naturally with human intuition and legal notions of discrimination. Prior work on causal fairness primarily focuses on the standard machine learning setting, where a decision-maker constructs a single predictive mechanism $f_{\widehat Y}$ for an outcome variable $Y$, while inheriting the causal mechanisms of all other covariates from the real world. The generative AI setting, however, is markedly more complex: generative models can sample from arbitrary conditionals over any set of variables, implicitly constructing their own beliefs about all causal mechanisms rather than learning a single predictive function. This fundamental difference requires new developments in causal fairness methodology. We formalize the problem of causal fairness in generative AI and unify it with the standard ML setting under a common theoretical framework. We then derive new causal decomposition results that enable granular quantification of fairness impacts along both (a) different causal pathways and (b) the replacement of real-world mechanisms by the generative model's mechanisms. We establish identification conditions and introduce efficient estimators for causal quantities of interest, and demonstrate the value of our methodology by analyzing race and gender bias in large language models across different datasets.

Medium-horizon Alzheimer's disease progression prediction is difficult because future clinical scores can remain tied to baseline severity, while biomarker histories are irregular and incompletely observed. We develop an anchor-based analysis of 24-month Clinical Dementia Rating Sum of Boxes (CDR-SB) change using harmonized Alzheimer's Disease Neuroimaging Initiative (ADNI) tables. Each labeled sample is anchored at a mild cognitive impairment visit, uses only clinical and biomarker history observed at or before that anchor, and defines the response as CDR-SB at the future visit closest to 24 months within an 18--30 month window minus anchor CDR-SB. The analytic cohort contains 2,600 labeled anchors from 858 participants and 7,276 longitudinal rows. We propose a residual gap-aware transformer that combines a mixed-effects statistical reference with transformer-based residual learning from pre-anchor clinical and biomarker histories. The model uses participant-level random intercepts in the mixed-effects reference, observation-level triplet tokenization for irregular histories, and a learned nonnegative time-gap penalty inside self-attention. We compare the proposed model with a Bayesian-information-criterion-selected linear mixed-effects baseline, GRU-D, and STraTS under repeated participant-level train--test splits. Across five participant-level random seeds, the proposed model achieves the best mean test performance across all reported metrics, reducing MSE by 13.1% and increasing prediction--observation correlation by 26.4% relative to the mixed-effects baseline. It also improves over both GRU-D and STraTS in mean error and correlation. These results show that statistical anchoring and gap-aware residual learning provide a useful structure for medium-horizon Alzheimer's disease progression prediction.

We present TailedTS, a large-scale benchmark dataset derived from Wikipedia hourly page view observations throughout 2024, specifically designed to test time series forecasting models under heavy-tailed, zero-inflated, and non-Gaussian conditions. The dataset comprises approximately 24.69 billion data points spanning roughly 3 million unique Wikipedia pages per month, stored in high-efficiency Apache Parquet format. Wikipedia traffic follows a pronounced power-law distribution where roughly 5% of pages account for over 70% of total page views, creating a natural and rigorous testbed for model robustness against extreme volatility that are absent from or underrepresented in existing benchmarks such as M4, M5, and UCI electricity datasets. TailedTS enables several research tasks. First, we introduce a periodicity quantification framework based on sparse autoregression with sparsity and non-negativity constraints, revealing that frequently-viewed pages exhibit significantly weaker periodic structure than their less-viewed counterparts, showing direct implications for server allocation and traffic forecasting on large digital platforms. Second, we provide standardized prediction benchmarks evaluated under a suite of non-Gaussian loss functions, including $\ell_1$-norm, Huber, quantile, and $\ell_p$-norm losses, demonstrating that standard Gaussian-based estimators degrade substantially on high-volume page categories, while robust alternatives provide consistent gains across all traffic scales. TailedTS is publicly available at https://doi.org/10.5281/zenodo.17070469.