By linearly lifting the domain into one higher dimension, a universal approximation result is obtained for Lipschitz functions compactly supported on $(0,1)^d$ with rate $\mathcal{O}(P^{-1/(d+1)})$ with $P$ parameters.
This paper demonstrates that aggregating labels from sub-sampled disjoint $k$-sized bags using i.i.d. weights allows for similar label-DP guarantees when aggregating labels over random disjoint bags, while preserving the utility of Lipschitz-bounded neural mse-regression tasks.
This work develops Generative Marketing Mix Modeling (GMMM) to estimate the causal effects of Generative Engine Optimization and Generative Engine Marketing and investigates the empirical performance of the proposed method using simulated answers to product recommendation in English and Japanese.
Findings show that foundation models require CGM-specific adaptation for reliable forecasting and that dietary context provides clinically meaningful signals beyond CGM alone, especially during postprandial periods.
Bo-Wen Zhang, Hsiu-Wen Cheng, Hong-Yu Yang et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
The problem remains hard for every discount factor, and for every fixed discount factor, exact planning remains NP-hard, and a randomized polynomial-time approximation scheme is introduced for every fixed look-ahead depth.
Corentin Pla, Hugo Richard, Marc Abeille et al.· 0 citations
We investigate mean-variance portfolio selection with an $\ell_0$-penalty to promote sparsity in asset allocations. Uncertainty in the mean return vector is incorporated through an ellipsoidal uncertainty set, yielding a robust sparse optimization framework. We characterize the structure of both local and global minimi...
Deniz Akkaya, Emre Can Yayla, Buse Sen et al.· 0 citations
In this paper, we investigate the generalization performance of distributed gradient descent algorithms in a reproducing kernel Hilbert space under a robust loss function $l_{\sigma}$. By exploiting the spectral characterization of gradient descent together with the intrinsic properties of robust loss functions, we est...
Identifiability of tensor decompositions is often established through linear-algebraic conditions on the factor families. For nonnegative decompositions, however, positivity provides additional information that is not captured by dimension and independence alone: nonnegative terms cannot cancel, and their supports cons...
Crash-severity models inform screening, dispatch and site prioritization, yet are deployed without a finite-sample statement of what one prediction means. Off-the-shelf guarantees fail here, because the features that make crash severity distinctive defeat them: the KABCO outcome is ordinal, the recorded label is a fiel...
Many applications in engineering, including wireless broadcasting, require designs that provide performance certificates at different target outage levels. This paper studies the problem of maximizing the weighted average of such certificates in the presence of uncertainty about the true system state. The problem is sh...
In the last decade, kilometre-scale interferometric gravitational-wave detectors have observed hundreds of compact binary mergers, the majority of which are binary black holes. However, the data are noise-dominated, and multiple independent search algorithms (pipelines) are used to enhance sensitivity and improve robus...
We address few-shot object detection with vision-language models (VLMs) in out-of-domain settings such as aerial, industrial, and medical imagery, using only ten annotated images for supervision. Existing adaptation methods are discrete prompt optimization and LoRA fine-tuning. We revisit a third option: soft prompting...
Gautam Rajendrakumar Gare, Si-Ying Li, He-Wei Wang et al.· 1 citation
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