Goto

Collaborating Authors

 Industry


Microsoft is retiring Copilot Mode on Edge, because everything is Copilot Mode now

Engadget

Microsoft is retiring Copilot Mode on Edge, because its features are now built directly into the browser for both desktop and mobile. If you'll recall, Microsoft started testing Copilot Mode on Edge in July last year, allowing you to use it to search for information across multiple open browser tabs and to analyze the details on each page. Now, the feature is available not just on desktop, but also on Edge for mobile. Just ask Copilot a question or give it a command, such as Compare the smart TVs across all my open tabs, and it will pull info from your tabs to give you a structured, side-by-side comparison analysis. After the initial testing of Copilot Mode, Microsoft rolled out Journeys, which you can use to save projects you can revisit in the future. It's now also available for free on mobile, so you can pick up planning trips or making purchases from where you left off days or weeks ago.


Japan megabanks set to win Mythos access after Bessent visit

The Japan Times

MUFG Bank, Mizuho Bank and Sumitomo Mitsui Banking are all likely to gain access to Anthropic's artificial intelligence model, Mythos. Japan's three megabanks are set to secure access to Anthropic's artificial intelligence model, Mythos, according to a person familiar with the matter, after its limited release last month sparked fears of a new age of cybersecurity risks. MUFG Bank, Sumitomo Mitsui Banking Corp. and Mizuho Bank are all likely to gain access to the artificial intelligence model developed by the U.S. firm, the person said, asking not to be identified because the information is private. The planned access was earlier reported by Nikkei. The move comes as financial institutions around the world grow alarmed about the risks created by Mythos, which has an unprecedented ability to detect software vulnerabilities. That has raised concerns that hackers could use Mythos to disrupt critical infrastructure, and access has so far been limited to a small number of U.S. companies and organizations.


Musk's xAI races to get Wall Street firms to use Grok chatbot

The Japan Times

Musk's xAI races to get Wall Street firms to use Grok chatbot A chat window for chatbot Grok. Musk's artificial intelligence venture, xAI, is moving with urgency to boost revenue by selling chatbot subscriptions and access to its computing resources before SpaceX's expected IPO next month. Billionaire Elon Musk's xAI has recruited multiple Wall Street firms with ties to his business empire to test its Grok chatbot, according to people familiar with the matter, part of a push to bolster revenue ahead of parent company SpaceX's initial public offering. Apollo Global Management and Morgan Stanley have begun using Grok internally alongside software from other AI model makers, said the people, who spoke on condition of anonymity as the information is not public. Valor Equity Partners is also using Grok, the people said. Despite some banks signing up for Grok, financiers are rarely using the chatbot for work, some of the people said.


Tech entrepreneur flees Washington due to companies being 'villainized'

FOX News

Tech founder Jesse Proudman is leaving Washington as the stateโ€™s new 9.9% millionaire tax takes hold, warning of a looming "tax flight" to states like Texas.


Population Risk Bounds for Kolmogorov-Arnold Networks Trained by DP-SGD with Correlated Noise

arXiv.org Machine Learning

We establish the first population risk bounds for Kolmogorov-Arnold Networks (KANs) trained by mini-batch SGD with gradient clipping, covering non-private SGD as well as differentially private SGD (DP-SGD) with Gaussian perturbations that interpolate between independent and temporally correlated noise. This setting is substantially closer to practice than prior KAN theory along two axes: training is by mini-batch SGD, the standard recipe for modern networks, rather than full-batch gradient descent (GD); and correlated-noise mechanisms have empirically shown a more favorable privacy-utility tradeoff than independent-noise mechanisms. Our results cover the corresponding full-batch GD and independent-noise DP-GD results for KANs by Wang et al. (2026), while yielding sharper fixed-second-layer specializations. The technical core is a new analysis route for correlated-noise DP training in the non-convex regime. Temporal dependence breaks the conditional-centering structure underlying standard one-step SGD arguments, and the projection step obstructs the exact cancellation structure of correlated perturbations. We address these difficulties through an auxiliary unprojected dynamics, a shifted iterate that absorbs the current noise perturbation, and a high-probability bootstrap certifying projection inactivity. Combining this optimization analysis with a stability-based generalization argument yields the stated population risk bounds. To the best of our knowledge, this is the first optimization and population risk analysis of a correlated-noise mechanism for DP training beyond convex learning, in particular for neural networks.


Plan Before You Trade: Inference-Time Optimization for RL Trading Agents

arXiv.org Machine Learning

Reinforcement learning agents for portfolio management are typically trained and deployed as static policies, with no mechanism for using price forecasts at inference time. We propose $\text{FPILOT}$ (**Fin**ancial **P**lugin **I**nference-time **L**earning for **O**ptimal **T**rading), a plugin inference-time optimization framework inspired by Model Predictive Control (MPC). Our key structural insight is that future prices mostly do not depend on one agent's portfolio allocation, so a suitable predictive model can produce a multi-step price trajectory without iterative action-conditioned rollouts as in typical reinforcement learning. At each decision step, we use the forecaster's predicted price trajectory to construct an allocation-based imagined return objective, and optimize the policy at inference-time before executing one step of the trade. Our framework is compatible with any pre-trained agent and adapts the policy to the forecaster's predictions without any retraining. Evaluated across five policy learning algorithms on the TradeMaster DJ30 benchmark, $\text{FPILOT}$ produces consistent improvements in total return and return-based risk-adjusted metrics (Sharpe, Sortino, Calmar), with stochastic policies benefiting more than deterministic ones. Further, using synthetic forecasts at calibrated quality levels, we show that gains consistently improve with forecaster quality, suggesting that our performance will improve based on advances in financial forecasting.


Online Conformal Prediction: Enforcing monotonicity via Online Optimization

arXiv.org Machine Learning

Conformal prediction provides a principled framework for uncertainty quantification with finite-sample coverage guarantees. While recent work has extended conformal prediction to online and sequential settings, existing methods typically focus on a single coverage level and do not ensure consistency across multiple confidence levels. In many real-world applications, such as weather forecasting, macroeconomic prediction, and risk management, different users operate under heterogeneous risk tolerances and require calibrated uncertainty estimates across a range of coverage levels. In such settings, it is desirable to produce prediction sets corresponding to different coverage levels that are nested and valid simultaneously. In this paper, we propose two novel online conformal prediction methods that output \emph{nested prediction sets} across a range of coverage levels, enabling simultaneous uncertainty quantification across the entire risk spectrum. Beyond interpretability, jointly estimating multiple coverage levels is known to improve statistical efficiency in classical quantile regression by enforcing non-crossing constraints and sharing information across quantiles. Our approaches leverage an online optimization perspective with small regret that translates to quantile estimation error control while enforcing nestedness of prediction sets. Empirical results on synthetic and real-world datasets, including applications in forecasting tasks with heterogeneous risk requirements, demonstrate that our method achieves stable coverage across all levels, strictly nested prediction sets, and improved efficiency compared to existing online conformal baselines.


ISOMORPH: A Supply Chain Digital Twin for Simulation, Dataset Generation, and Forecasting Benchmarks

arXiv.org Machine Learning

Open time-series forecasting (TSF) benchmarks cover retail, energy, weather, and traffic, but supply-chain logistics remains underserved. We introduce ISOMORPH, the first public digital twin of a multi-echelon logistics network with fully interpretable, user-configurable parameters and modular topology, demand process, and control rules. The simulator advances a directed routing graph in discrete time: demand arrives at the destination, is served from stock or recorded as backlog, and triggers replenishment through the network. The state vector tracks per-node on-hand inventory with outstanding orders, in-transit shipments, and a smoothed demand estimate, so the dynamics close as a Markov chain on a tractable state space whose transition kernel acts linearly on the empirical distribution of the state. The released data reproduces the bullwhip effect at empirically consistent magnitudes, and three conservation laws encoded in the Markov chain serve as verification tools when users extend the simulator. We release datasets at two catalogue scales ($C=50$ and $C=200$) with six scenario sweeps producing 30 additional rollouts and 20 Latin-hypercube perturbations, exhibiting dynamics absent from fixed TSF benchmarks: variance amplification, cascading bottlenecks, regime shifts, and cross-channel coupling through shared macro shocks. Zero-shot evaluation of four foundation models (Chronos, Moirai, TimesFM, Lag-Llama) shows MASE values exceeding public GIFT-Eval references at low-to-moderate horizons, supporting incorporation into existing benchmarks. The same pairing produces forecast confidence bands via Latin-hypercube perturbation of demand-side knobs, forward UQ from parameter uncertainty unavailable on standard TSF datasets, demonstrating that foundation models can serve as fast surrogates for the digital twin's forward UQ. Code (MIT): https://github.com/tuhinsahai/ISOMORPH.


Digital Twins as Synthetic Controls in Single-Arm Trials

arXiv.org Machine Learning

Single-arm trials are an important study design for evaluating drug efficacy and safety without enrolling patients into a control arm. Although they do not provide the gold-standard evidence of randomized controlled trials, they are increasingly used in clinical development as they offer an efficient, ethical, and practical alternative. A wide variety of approaches can be used to construct control comparators and estimate treatment effects, from fixed comparators informed by clinical knowledge to data-based and model-based patient-level comparators, also known as synthetic controls. Powerful and flexible machine learning models can allow outcome-model-based synthetic controls to overcome key limitations of direct data-based approaches, yield more robust estimates of treatment effects, and provide a principled way to incorporate corrections or encode additional assumptions when external data are not directly comparable. In this work, we argue that outcome-model-based synthetic control arms are an important tool for single-arm trials. We focus on digital twins, personalized predictions of disease progression generated from machine learning models trained on historical datasets, which naturally leverage these flexible approaches. We review doubly robust estimators, present power and sample size formulas, and discuss trade-offs in selecting historical data for training and analysis. We also outline practical considerations for deploying digital twins within the framework of recent FDA draft guidance on the use of artificial intelligence in drug development. Finally, we reanalyze data from trials in amyotrophic lateral sclerosis and Huntington's disease to demonstrate the proposed methods.


Robust Sequential Experimental Design for A/B Testing

arXiv.org Machine Learning

Experimental design has emerged as a powerful approach for improving the sample efficiency of A/B testing, yet existing designs rely critically on correctly specified models. We study robust sequential experimental design under model misspecification and develop a unified framework that covers both contextual bandit and dynamic settings. Theoretically, we prove that our design bounds the worst-case mean squared error of the estimated treatment effect. Empirically, we demonstrate the effectiveness of the proposed approach using synthetic and real-world datasets from a leading technology company.