Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rui Wang 0096

dblp:06/2293-96 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Theory of computation · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Mathematical optimization · 100%
Artificial intelligence
1 paper
Kernel, tree and ensemble methods · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
regularization
1.322024
Sparse Representer Theorems for Learning in Reproducing Kernel Banach Spaces · J. Mach. Learn. Res. 2024
Representer Theorems in Banach Spaces: Minimum Norm Interpolation, Regularized Learning and Semi-Discrete Inverse Problems · J. Mach. Learn. Res. 2021
Machine learning › Kernel, tree and ensemble methods
kernel methods
0.812024
Sparse Representer Theorems for Learning in Reproducing Kernel Banach Spaces · J. Mach. Learn. Res. 2024
Machine learning › Kernel, tree and ensemble methods › kernel methods › kernel theory
reproducing kernel banach space
0.812024
Sparse Representer Theorems for Learning in Reproducing Kernel Banach Spaces · J. Mach. Learn. Res. 2024
Mathematical optimization
sparsity
0.812024
Sparse Representer Theorems for Learning in Reproducing Kernel Banach Spaces · J. Mach. Learn. Res. 2024

Methods — techniques the papers use, named apart from their topics

subdifferential · 1.5representer theorem · 1.5minimum-norm interpolation · 0.5fixed-point iteration · 0.5
YearPublicationVenuePosition
2024 A duality approach to regularized learning problems in Banach spaces
Rui Wang 0096, Yuesheng Xu
J. Complex.2
2024 Sparse Representer Theorems for Learning in Reproducing Kernel Banach Spaces
abstract
Sparsity of a learning solution is a desirable feature in machine learning. Certain reproducing kernel Banach spaces (RKBSs) are appropriate hypothesis spaces for sparse learning methods. The goal of this paper is to understand what kind of RKBSs can promote sparsity for learning solutions. We consider two typical learning models in an RKBS: the minimum norm interpolation (MNI) problem and the regularization problem. We first establish an explicit representer theorem for solutions of these problems, which represents the extreme points of the solution set by a linear combination of the extreme points of the subdifferential set, of the norm function, which is data-dependent. We then propose sufficient conditions on the RKBS that can transform the explicit representation of the solutions to a sparse kernel representation having fewer terms than the number of the observed data. Under the proposed sufficient conditions, we investigate the role of the regularization parameter on sparsity of the regularized solutions. We further show that two specific RKBSs, the sequence space $\ell_1(\mathbb{N})$ and the measure space, can have sparse representer theorems for both MNI and regularization models.
Rui Wang 0096, Yuesheng Xu, Mingsong Yan
J. Mach. Learn. Res.1
2021 Regularization in a functional reproducing kernel Hilbert space
Rui Wang 0096, Yuesheng Xu
J. Complex.1
2021 Representer Theorems in Banach Spaces: Minimum Norm Interpolation, Regularized Learning and Semi-Discrete Inverse Problems
abstract
Learning a function from a finite number of sampled data points (measurements) is a fundamental problem in science and engineering. This is often formulated as a minimum norm interpolation (MNI) problem, a regularized learning problem or, in general, a semi-discrete inverse problem (SDIP), in either Hilbert spaces or Banach spaces. The goal of this paper is to systematically study solutions of these problems in Banach spaces. We aim at obtaining explicit representer theorems for their solutions, on which convenient solution methods can then be developed. For the MNI problem, the explicit representer theorems enable us to express the infimum in terms of the norm of the linear combination of the interpolation functionals. For the purpose of developing efficient computational algorithms, we establish the fixed-point equation formulation of solutions of these problems. We reveal that unlike in a Hilbert space, in general, solutions of these problems in a Banach space may not be able to be reduced to truly finite dimensional problems (with certain infinite dimensional components hidden). We demonstrate how this obstacle can be removed, reducing the original problem to a truly finite dimensional one, in the special case when the Banach space is $\ell_1(\mathbb{N})$.
Rui Wang 0096, Yuesheng Xu
J. Mach. Learn. Res.1