Pairwise learning problems with regularization networks and Nyström subsampling approach

Wang, Cheng; Hu, Ting; Jiang, Siyang

doi:10.1016/j.neunet.2022.10.007

Search citation statements

Order By: Relevance

Paper Sections

Select...

Lemma Is Proved □1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, in [8,15] was established that such an approach allows to achieve the above mentioned learning rate with subquadratic cost. In addition, the eectiveness of this approach was proven in the works [3,4,9,10,12].…”

Section: Lemma Is Proved □mentioning

confidence: 98%

On learning rates for regularized Nyström subsampling in unsupervised domain adaptation

Myleiko,

Solodky

2023

J. App. Num. Analysis

View full text Add to dashboard Cite

The regularized Nyström subsampling is a popular approach for learning problems that deals with big data. We employ such technique in the context of the unsupervised domain adaptation problems with covariate shift assumption. Within the framework of the Reproducing Kernel Hilbert Space concept, an algorithm is constructed that is a combination of the Nyström subsampling and the two-steps iterated Tikhonov regularization. This approach allows significantly reduce the amount of computing resources involved and at the same time maintains the same learning rates as for the standard machine learning algorithms.

show abstract