Solving ℓp!-norm regularization with tensor kernels
Not on the map. Why?
Abstract (arXiv)
In this paper, we discuss how a suitable family of tensor kernels can be used to efficiently solve nonparametric extensions of ℓp regularized learning methods. Our main contribution is proposing a fast dual algorithm, and showing that it allows to solve the problem efficiently. Our results contrast recent findings suggesting kernel methods cannot be extended beyond Hilbert setting. Numerical experiments confirm the effectiveness of the method.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Jul 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 1.
3 papers.
- 2024When big data actually are low-rank, or entrywise approximation of certain function-generated matricescited by 3
- 2026Locality Sensitive Hashing for p-Exponential Kernels with Applications to Density Estimationcited by 1
- 2024A Kernelizable Primal-Dual Formulation of the Multilinear Singular Value Decompositioncited by 0
- 2026Locality Sensitive Hashing for p-Exponential Kernels with Applications to Density Estimation4 Oct 2026
- 2024A Kernelizable Primal-Dual Formulation of the Multilinear Singular Value Decomposition14 Oct 2024
- 2024When big data actually are low-rank, or entrywise approximation of certain function-generated matrices3 Jul 2024