|
|
|
|
| LEADER |
01000caa a22002652c 4500 |
| 001 |
NLM337860041 |
| 003 |
DE-627 |
| 005 |
20250303031612.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2023 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2022.3157197
|2 doi
|
| 028 |
5 |
2 |
|a pubmed25n1125.xml
|
| 035 |
|
|
|a (DE-627)NLM337860041
|
| 035 |
|
|
|a (NLM)35254977
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Lu, Qin
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Incremental Ensemble Gaussian Processes
|
| 264 |
|
1 |
|c 2023
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 06.04.2023
|
| 500 |
|
|
|a Date Revised 06.04.2023
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Belonging to the family of Bayesian nonparametrics, Gaussian process (GP) based approaches have well-documented merits not only in learning over a rich class of nonlinear functions, but also in quantifying the associated uncertainty. However, most GP methods rely on a single preselected kernel function, which may fall short in characterizing data samples that arrive sequentially in time-critical applications. To enable online kernel adaptation, the present work advocates an incremental ensemble (IE-) GP framework, where an EGP assembler employs an ensemble of GP learners, each having a unique kernel belonging to a prescribed kernel dictionary. With each GP expert leveraging the random feature-based approximation to perform online prediction and model update with scalability, the EGP assembler capitalizes on data-adaptive weights to synthesize the per-expert predictions. Further, the novel IE-GP is generalized to accommodate time-varying functions by modeling structured dynamics at the EGP assembler and within each GP learner. To benchmark the performance of IE-GP and its dynamic variant in the adversarial setting where the modeling assumptions are violated, rigorous performance analysis has been conducted via the notion of regret, as the norm in online convex optimization. Last but not the least, online unsupervised learning for dimensionality reduction is explored under the novel IE-GP framework. Synthetic and real data tests demonstrate the effectiveness of the proposed schemes
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Karanikolas, Georgios V
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Giannakis, Georgios B
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 45(2023), 2 vom: 02. Feb., Seite 1876-1893
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnas
|
| 773 |
1 |
8 |
|g volume:45
|g year:2023
|g number:2
|g day:02
|g month:02
|g pages:1876-1893
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2022.3157197
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 45
|j 2023
|e 2
|b 02
|c 02
|h 1876-1893
|