After a Zelda-focused Nintendo Direct on Tuesday -- where we got an in-depth look at the Ocarina of Time remake and news of a Zelda-themed Nintendo Switch 2 -- a second stream gave us a peek at what else is in store from the company and its partners. Wednesday's Direct was mainly about games that are coming to Switch 2 this winter, but it also included titles for Switch and others that are further out. The Direct got underway with news of a Monster Hunter Wilds port for Switch 2. It's coming to the console on December 4. Final Fantasy 7 Revelation is confirmed for the system as well. The third part of the Final Fantasy 7 remake trilogy will hit Switch 2 on April 8, 2027, the same day it arrives on other platforms. You can get warmed up for that with Crisis Core: Final Fantasy 7 Reunion -- a prequel to Final Fantasy 7 -- which is out on Switch 2 today.

Look Up Mashable Selects Mashable Voices Mashable's Best: E-readers, robovacs, laptops, earbuds, smart home and more Say More Safety Net Creator Hub Versus Gift Ideas For Everyone On Your List Switch Off Trending Now In My Bag All Series The Pokémon TCG's Pitch Black Booster Bundle is now under $40: Here's how to get the best price Ben Williams is a freelance writer at Mashable, having joined the team in June 2025. With over 10 years experience in gaming, tech, TV, anime, and film, there's nothing he hasn't covered. Alongside Ben's other work at IGN, Radio Times, Eurogamer, UNILAD Tech, and Rock Paper Shotgun, he also has bylines at sites like GamesRadar+, PCGamesN, ScreenSphere, Twinfinite, ScreenRant, GGRecon, and more. All products featured here are independently selected by our editors and writers. If you buy something through links on our site, Mashable may earn an affiliate commission.

Look Up Safety Net Mashable's Best: E-readers, robovacs, laptops, earbuds, smart home and more Creator Hub Versus Say More Gift Ideas For Everyone On Your List Mashable Selects Switch Off Trending Now In My Bag VidCon with Mashable All Series Everything you need to know to beat the scalpers. Ben Williams is a freelance writer at Mashable, having joined the team in June 2025. With over 10 years experience in gaming, tech, TV, anime, and film, there's nothing he hasn't covered. Alongside Ben's other work at IGN, Radio Times, Eurogamer, UNILAD Tech, and Rock Paper Shotgun, he also has bylines at sites like GamesRadar+, PCGamesN, ScreenSphere, Twinfinite, ScreenRant, GGRecon, and more. All products featured here are independently selected by our editors and writers.

When you purchase through links in our articles, we may earn a small commission. Quake: Dawn of the Machine, a free 30th anniversary expansion, adds 19 new missions. In commemoration, id Software and MachineGames have put out a free expansion for the 2021 re-release of . The expansion is called and is already available as of August 6th, 2026. Note, however, that is not yet available on the Epic Games Store or GOG at the time of this article.

Trump's 50 percent Canada tariffs: What to know US President Donald Trump's administration has said it will expand a voluntary pledge seeking to shield consumers from the energy costs of the rapid expansion of data centres, mostly used by artificial intelligence companies. The White House announced on Thursday that it would add state governors and electricity companies to the agreement, first announced with tech and AI firms in March. But the US administration stopped short of any enforceable protections. The pledge is a "public commitment that hyperscalers, AI companies, and the utilities and data-center developers behind them will build, bring, or buy every kilowatt their facilities need -- and cover every dollar of the infrastructure that delivers it". It says consumers would not foot the bill for AI's energy needs.

Shuffle order can be a larger source of fine-tuning noise than a memoryless analysis predicts: fixed-clock optimizer memory makes local equal-multiset contrasts first order in the learning rate rather than second order, and the resulting order channel can be large enough for a single seed to flip a close A/B comparison. We isolate this mechanism and derive a fit-free way to size the noise it produces. For a memoryless optimizer, reordering an equal multiset has no first-order endpoint term; the leading local contrast is the $O(η^2)$ gradient bracket. Fixed-clock optimizers such as AdamW are different. Their moment buffers, preconditioner state, and de-biasing counters advance with the step index rather than with the learning-rate-scaled time $τ=ηk$, so the same gradient can receive a position-dependent endpoint weight. For any fixed finite measurement window, a lifted-state expansion gives an $O(η)$ equal-multiset contrast whenever the first-order replay coefficient is nonzero, while regular and clock-matched controls remain $O(η^2)$; a bare fixed-$β$ momentum buffer is already enough. A bitwise-deterministic replay from one warmed optimizer state isolates the mechanism, giving order-variance slopes 1.83 for AdamW, 2.00 for fixed-$β$ momentum, and 4.00 for SGD; matching the memory clock to $τ$ restores the regular exponent. For AdamW with a frozen preconditioner, the same impulse-weight kernel gives a closed-form asymptotic order-variance floor after the local potentials are measured, with no fitted coefficients. The result is local to the measurement window (independent reshuffling can average the channel across windows), but it yields order-noise error bars, positional attribution weights, and a seed-budget criterion for fine-tuning comparisons.

Bogomolny, Bohigas and Schmit (BBS) found that the spectrum of the pairwise distance matrix on N points sampled from a smooth d-dimensional manifold encodes a signature of the underlying geometry. We develop I-BBS (Inference-BBS), a coordinate-free method that identifies a low-dimensional latent sub-manifold embedded in a high-dimensional ambient distance matrix alone, without accessing an ambient high-dimensional vector space. It therefore applies even when that space is only partly observable or undefined. We model the ambient embedding by two classes of generative noise, model-based and model-free. The noise mixes the latent signal with off-manifold components, so the eigenvalues reorganise collectively and the latent geometry cannot be read off eigenvalue by eigenvalue. We recover it instead from two integer-stable signatures that survive the noise: the multiplicity of the top non-Perron multiplet, which fixes $d$, and a parameter-free law for how the multiplet positions shrink as the noise grows. On synthetic spheres $S^1$, $S^2$ and $S^3$ these integer signatures are far more stable under noise than the continuous spectral slope, and a blind test recovers both the manifold and the noise model from a single distance matrix. Applications to neural-network representations and to the dynamic training regime are developed in two companion papers.

The m-out-of-n bootstrap--proposed by Bickel et al. [1992]--approximates the distribution of a statistic by repeatedly drawing msubsamples (m n) without replacement from an original sample of size n; it is now routinely used for robust inference with heavy-tailed data, bandwidth selection, and other large-sample applications. Despite this broad applicability across econometrics, biostatistics, and machine-learning workflows, rigorous parameter-free guarantees for the soundness of the m-out-of-n bootstrap when estimating sample quantiles have remained elusive. This paper establishes such guarantees by analysing the estimator of sample quantiles obtained from m-out-of-n resampling of a dataset of length n. We first prove a central limit theorem for a fully data-driven version of the estimator that holds under a mild moment condition and involves no unknown nuisance parameters. We then show that the moment assumption is essentially tight by constructing a counter-example in which the CLT fails. Strengthening the assumptions slightly, we derive an Edgeworth expansion that delivers exact convergence rates and, as a corollary, a Berry-Esséen bound on the bootstrap approximation error. Finally, we illustrate the scope of our results by obtaining parameter-free asymptotic distributions for practical statistics, including the quantiles for random walk MH, and rewards of ergodic MDP's, thereby demonstrating the usefulness of our theory in modern estimation and learning tasks.

Recent progress in text-video retrieval has been largely driven by contrastive learning. However, existing methods often overlook the effect of the modality gap, which causes anchor representations to undergo in-place optimization (i.e., optimization tension) that limits their alignment capacity. Moreover, noisy hard negatives further distort the semantics of anchors. To address these issues, we propose GARE, a Gap-Aware Retrieval framework that introduces a learnable, pair-specific increment ij between text ti and video vj, redistributing gradients to relieve optimization tension and absorb noise. We derive ij via a multivariate first-order Taylor expansion of the InfoNCE loss under a trust-region constraint, showing that it guides updates along locally consistent descent directions. A lightweight neural module conditioned on the semantic gap couples increments across batches for structure-aware correction. Furthermore, we regularize through a variational information bottleneck with relaxed compression, enhancing stability and semantic consistency. Experiments on four benchmarks demonstrate that GARE consistently improves alignment accuracy and robustness, validating the effectiveness of gap-aware tension mitigation.

We study the ability of language models to reason about appropriate information disclosure--a central aspect of the evolving field of agentic privacy. Whereas previous works have focused on evaluating a model's ability to align with human decisions, we examine the role of ambiguity and missing context on model performance when making information-sharing decisions. We identify context ambiguity as a crucial barrier for high performance in privacy assessments. By designing Camber, a framework for context disambiguation, we show that model-generated decision rationales can reveal ambiguities and that systematically disambiguating context based on these rationales leads to significant accuracy improvements (up to 13.3% in precision and up to 22.3% in recall) as well as reductions in prompt sensitivity. Overall, our results indicate that approaches for context disambiguation are a promising way forward to enhance agentic privacy reasoning.