This material may not be published, broadcast, rewritten, or redistributed. Quotes displayed in real-time or delayed by at least 15 minutes. Market data provided by Factset . Powered and implemented by FactSet Digital Solutions . Mutual Fund and ETF data provided by LSEG .

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.

We develop a geometric theory of projection heads in self-supervised learning by modeling the head as a trainable Riemannian metric on the backbone representation manifold. We show that linear heads perform implicit subspace whitening, while nonlinear heads adapt local metrics to satisfy the specific topological constraints of the loss, with head depth empirically dictating this capacity. Analyzing dimensional collapse, we prove that smooth nonlinear heads natively induce negative eigenvalues in the Hessian at collapsed equilibria, making them unstable. We empirically validate this by continuously tracking the optimization geometry during training, which reveals that smooth activations like Swish can generate explicit negative curvature to escape collapse, whereas linear and ReLU heads under continuous-time gradient flow cannot, relying instead on discrete-time optimization dynamics and BatchNorm. Finally, we geometrically characterize how metric degeneracy governs the information-invariance trade-off, explaining why the head must be discarded. Evaluated across contrastive and decorrelation-based objectives on foundation models, our results demonstrate that the projection head acts as a universal geometric buffer, decoupling the semantic backbone from the rigid, destructive constraints of the pretraining objective.

We develop a unified theoretical framework for data-free one-step sampling from unnormalized target distributions based on Wasserstein gradient flows. For a broad class of standard f-divergence objectives, we show that the induced velocity field admits the universal form $\mathbf{V}(x)=w(r(x))\,β(x)$, where $β(x)=\nabla \log (p(x)/q(x))$ is shared across objectives and $w$ is determined solely by the choice of divergence. This decomposition shows that standard f-divergence drifts share the same asymptotic target distribution $p$ and differ primarily in how they redistribute transient repair effort across under-covered regions. To formalize this distinction, we derive a one-step regional-response theory for a soft under-coverage functional and obtain a compression--elasticity identity that links divergence choice to the geometry of mass transport into under-covered regions. We further extend the framework beyond the f-divergence family to the Log-Variance (LV) divergence, analyze how the reference distribution alters the resulting drift structure, and motivate a practical LV-inspired surrogate for data-free training. Based on this theory, we instantiate the framework with a KDE-based implementation and describe a complementary normalizing-flow route, enabling one-step inference after training. Experiments on multimodal Gaussian-mixture benchmarks are consistent with the theoretical predictions and demonstrate effective one-step sampling on these targets.

Modern generative models have emerged as a powerful Diffusion-based generative models increasingly paradigm for learning complex, high-dimensional data distributions. In particular, diffusion models (Ho et al., 2020; rely on inference-time guidance, adding a drift Sohl-Dickstein et al., 2015; Song and Ermon, 2019; Song term or reweighting mixture of experts, to imet al., 2020) and flow-based methods (Zhang et al., 2018a; prove sample quality on task-specific objectives. However, most existing techniques reLipman et al., 2022; Albergo and Vanden-Eijnden, 2022; Liu quire repeated score or gradient evaluations, inet al., 2022) provide a principled and scalable framework for generative modeling, achieving state-of-the-art performance troducing bias, high computational overhead, or across diverse applications, including video generation (Ho both. We introduce URGE, approximation-free et al., 2022), protein design (Gruver et al., 2023), and largeResampling via Girsanov Estimation, a derivativefree inference-time scaling algorithm that perscale text generation (Li et al., 2022; Nie et al., 2025). A forms pathwise importance reweighting via a Girunifying perspective underlying these approaches is their formulation in terms of stochastic differential equations sanov change of measure.

We study the minimization of non-convex functionals over the Wasserstein space. While recent work has showed that perturbed Wasserstein gradient methods can avoid saddle points for benign landscapes, existing approaches remain essentially first-order and do not provide fast local convergence once the iterates enter a neighborhood of a global minimizer. We propose Wasserstein Saddle-Free Newton (WSFN), a second-order method that preconditions the Wasserstein gradient by a regularized square root of the squared Wasserstein Hessian. This construction preserves attraction toward directions of positive curvature while inducing repulsion along directions of negative curvature, thereby overcoming the tendency of standard Wasserstein Newton dynamics to be attracted to saddles. We also establish second-order sufficient optimality conditions on Wasserstein space for strict local minimality. Under regularity and benign landscape assumptions, we prove that WSFN escapes saddle regions and reaches an $α$-neighborhood of a global minimizer in polynomial time, with improved dependence on saddle parameters compared with prior perturbed first-order methods. Once inside this neighborhood, we show that WSFN converges linearly in $L^2$-Wasserstein distance to a non-degenerate global minimizer. Finally, we present a particle-based implementation of the method.