# Manifold regularization based on Nystr{\\"o}m type subsampling

Source: [Manifold regularization based on Nystr{\\"o}m type subsampling](<https://www.sota2.com/research/paper/68fa72d51e209131cea58cd6>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T02:35:49.064Z

Authors: Abhishake Rastogi, Sivananthan Sampath

Published: 2017-10-13T11:13:38.000Z

## Abstract

In this paper, we study the Nystr{\\"o}m type subsampling for large scale kernel methods to reduce the computational complexities of big data. We discuss the multi-penalty regularization scheme based on Nystr{\\"o}m type subsampling which is motivated from well-studied manifold regularization schemes. We develop a theoretical analysis of multi-penalty least-square regularization scheme under the general source condition in vector-valued function setting, therefore the results can also be applied to multi-task learning problems. We achieve the optimal minimax convergence rates of multi-penalty regularization using the concept of effective dimension for the appropriate subsampling size. We discuss an aggregation approach based on linear function strategy to combine various Nystr{\\"o}m approximants. Finally, we demonstrate the performance of multi-penalty regularization based on Nystr{\\"o}m type subsampling on Caltech-101 data set for multi-class image classification and NSL-KDD benchmark data set for intrusion detection problem.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1710.04872>)

[PDF](<https://arxiv.org/pdf/1710.04872.pdf>)
