Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

This paper introduces an exact recursive method for computing gradients in warped Gaussian processes, enabling efficient online optimization of both latent moments and warping parameters without sacrificing analytical tractability. By addressing limitations in existing streaming variants that either rely on periodic updates or compromise model capacity, this advancement offers a robust framework for handling non-Gaussian observations in dynamic environments.
Surse care acoperăarXiv, Quantum Zeitgeist, LessWrong, Latent Space
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Online Gradient Computation for Warping Gaussian Process Transformations

arXiv1 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2609.16472v1 Announce Type: new Abstract: Warped Gaussian processes (GPs) handle non-Gaussian observations by mapping them into a latent standard GP via a parametric transformation called warping. Existing streaming variants, however, either optimize the warping parameters periodically or sacrifice analytical tractability for a higher model capacity. To bridge this gap, we show that the gradient of the instantaneous negative log-likelihood of a warped GP admits an exact recursive computation. Based on this result, we propose a novel online method for warped GPs that jointly updates the latent GP moments and optimizes the warping parameters.

Abstract:Warped Gaussian processes (GPs) handle non-Gaussian observations by mapping them into a latent standard GP via a parametric transformation called warping. Existing streaming variants, however, either optimize the warping parameters periodically or sacrifice analytical tractability for a higher model capacity. To bridge this gap, we show that the gradient of the instantaneous negative log-likelihood of a warped GP admits an exact recursive computation. Based on this result, we propose a novel online method for warped GPs that jointly updates the latent GP moments and optimizes the warping parameters.

Machine Learning (cs.LG); Signal Processing (eess.SP)

arXiv:2609.16472 [cs.LG]

(or arXiv:2609.16472v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2609.16472 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 185 cuvinte

Subiecte conexe