A reconstruction-driven design density is derived and the posterior mean is used to build a training-free warp that places more measurements where the target function varies rapidly, and a geometric equalizer separately corrects boundary bias.
Sanna Jarl, Jens Sjölund, Jonathan J. S. Scragg et al.· 0 citations
It is proved that the relationship between SPR and calibrated forecasting is bidirectional: not only do lower bounds for SPR translate into lower bounds for calibration, but algorithms for SPR also translate into new algorithms for calibrated forecasting.
Y. Dagan, Constantinos Daskalakis, Maxwell Fishelson et al.· 20 citations· ⚡2
The Sparse Landmark Embedding (SLE) kernel is proposed, and it is demonstrated, using geodesic and Wasserstein distances, that the SLE kernel matches or substantially exceeds domain-specific baselines in both predictive accuracy and uncertainty quantification.
Marcus M. Noack, Maher B. Alghalayini, Mark Risser· 0 citations
This work considers the setting where $D$ is a linear differential operator and analyzes a physics-informed kernel estimator combining value observations and differential observations to derive physically consistent rates in a stronger norm that jointly controls the errors in $\hat u$ and $D\hat u$.
Luc Brogat-Motte, Joachim Bona-Pellissier, G. Meanti et al.· 1 citation
Reach audiences
Advertise in front of researchers, engineers, and readers.
This paper derives explicit Wasserstein stability bounds that quantify the effect of relative graph perturbations on the generated distributions and introduces a principled framework for designing stable graph filters that preserve the smoothing behavior of graph heat diffusion, while boosting structural stability.
This paper provides a self-contained proof of the rank of the pathlifting Jacobian of a DAG ReLU network by performing an induction on the network's number of hidden nodes by considering the skeleton matrix of the network, a sparse matrix encoding the network paths, and transform the representation of one of its hidden...
This paper introduces the technique of "persistence of memory" to greatly extend and improve the random subspace methods, and establishes to the knowledge the first theoretical analysis of classical SSD methods for sparse functions.
Subhroshekhar Ghosh, Clement Z. Q. Ng, Pierre-Louis Poirion et al.· 0 citations
We study the convergence of Wasserstein-Fisher-Rao (WFR) gradient flows for sampling from probability distributions known up to a normalisation constant. By combining Wasserstein transport with Fisher-Rao birth-death dynamics, WFR flows balance exploration and selection. These flows have been recognised as a promising...
Francesca Romana Crucinio, Sahani Pathiraja· 0 citations
A new single-loop algorithmic framework for smooth nonconvex--concave minimax optimization and a lower bound of $\Omega(L^2D_Y\Delta_\phi\varepsilon^{-3})$ for optimization stationarity over projected zero-respecting first-order methods is established.
Manifold-Based Clustering (MBC) is proposed, which returns an explicit bracket interval to quantify the underlying data uncertainty, and suggests that ambiguity in cluster number is often intrinsic, and should be quantified rather than resolved.
Savik Kinger, Luciano Dyballa, Steven W. Zucker· 1 citation
METALICA, which implements Metadynamics on a pretrained diffusion model via Replica Exchange, is introduced, which implements Metadynamics on a pretrained diffusion model via Replica Exchange and accumulates a bias potential along a Collective Variable, repels new samples from previous ones through biased sampling, and...
Alireza Omidi, Jiajun He, Jörg Gsponer et al.· 1 citation
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.
Is your company’s AI sovereign? A practical guide for CIOs on AI vendor lock-in, EU Data Act switching, cloud sovereignty, and testing your exit plan before you need it. The post Sovereignty Is the Option to Leave appeared first on GPT-Lab.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.