The computation of Black-Scholes implied volatility is a fundamental task in quantitative finance, underpinning option valuation, model calibration and risk management. Although implied volatility is routinely used in practice, the inversion of the Black-Scholes pricing formula remains a challenging numerical problem,...
A spherical-cap construction proves the latter claim without assuming sparsity merely on the sampling support without assuming sparsity merely on the sampling support, and obtains agnostic minimax excess-risk bounds of order up to logarithms.
Xiao-Yu Li, Zhizhou Sha, Jiao-Jiao Jiang et al.· 0 citations
Reward-Jump Memory, an event-driven latent state that remains fixed during token construction and updates only at terminal evaluation events using the realized pool reward and evaluation outcome, and an action-conditioned SDE return critic that represents future discounted discovery returns with stochastic particles ar...
This paper introduces rlaopt, a PyTorch-based package for large-scale optimization and scientific computing using randomized numerical linear algebra (RandNLA). Despite substantial progress in RandNLA-based algorithms, few implementations combine GPU acceleration with a simple interface for specifying optimization prob...
Pratik Rathore, Zachary Frangella, P. Nobel et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
InfluenceField, an intervention-aware latent field inserted between the visual encoder and language decoder, is introduced, an intervention-aware latent field inserted between the visual encoder and language decoder that lifts patch features into a continuous spatial representation, propagates directed influence over m...
Statistical post-processing improves ensemble weather forecasts, but generating calibrated predictions at locations without observations remains challenging. This study compares statistical and machine-learning-based methods for post-processing ECMWF 2-m temperature and 10-m wind speed forecasts at observed and unobser...
Inference energy per token drives the cost and carbon footprint of deployed transformers. It is dominated by dense matrix products that incur fused multiply-accumulate (FMA) operations and memory traffic. To reduce these computations while retaining dense tensors for high GPU throughput, we develop a methodology from f...
Jed A. Duersch, Na\"im Es-Sebbani, Nathana\"el Haas et al.· 0 citations
This paper presents the first polynomial-time algorithm for learning with exact group invariances that applies uniformly to finite and infinite groups, and shows that exact symmetries can be identified from data and exploited for learning in polynomial time.
Ashkan Soleymani, B. Tahmasebi, Patrick Jaillet et al.· Annual Conference Computatio...· 2 citations
An exact distance identity for two coupled updates is derived and approximate non-expansiveness of the common-example map is proved, with a quadratic defect only when the two latent margins straddle zero.
This work introduces ERASE, Erasure via Reconstructive Adversarial Signal Editing, a framework for on-the-go forgetting that suppresses the observable influence of private data without modifying model weights, establishing a scalable, regulation-aligned pathway for continual, privacy-conscious learning.
This work introduces Selective Posterior Margin Regularization (SPMR), which preserves the Forward objective and converts this disagreement into a graded update on the clean classifier and transfers to estimated transitions, human annotations, architectural changes, and stronger Forward recipes.
Ze-Xing Zhang, Ji-Chao Li, Tian-Yang Lei et al.· 0 citations
We study adaptive routing of prompts to large language model (LLM) experts to maximize response quality in an online setting with limited feedback. We formulate it as a bandit problem with $K$ actions that represent experts and $d$ features that encode prompts, over a horizon of $T$ rounds. We propose algorithms that s...
Wei Wang, Soumyabrata Pal, Koyel Mukherjee et al.· 0 citations
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026