A Novel Kernel Sparse Coding Method with A Two-stage Acceleration Strategy
Sparse Coding;Kernel Trick;Acceleration Strategy
Yes
no
No ethics review needed.
Is the kernel sparse coding is new idea?
why use subgradient?
The paper is well written
The authors claim that they proposed a kernel-based sparse coding method and proposed a fast solver for that.
The Kernel-based sparse coding and subspace sparse clustering exist in the literature. Also using the subgradient method for the solution of the problems with  l1 norm is the primary method. So only contribution of the paper seems to be section 4, which in my belief is not an important contribution.
Yes
No ethics review needed.
1. It is recommended to add a paragraph in the introduction summarizing previous RBF-based KSC approaches like KSR, KFSS, and FOSO, rather than put them just in the appendix. Also, please clearly state how the proposed method differs from or improves upon the existing methods.
2. Please add additional experimental results in Table 2 showing the performance of the proposed method compared with KFSS and FOSO. Also, please give some discussions about the comparison results.
3. How about the time cost in real-world data? Please add the corresponding running times for Table 2.
3. Please revise the main contributions of the proposed method. It is needed to demonstrate that this work has enough novelty compared with existing RBF-based KSC approaches like KFSS and FOSO.
The problem formulation, theoretical analysis, and acceleration strategies are technically sound.
This paper proposes a kernel sparse coding method using the Radial Basis Function (RBF) kernel to handle nonlinear data. The proposed approach employs l1-norm regularization and coordinate descent to guarantee convergence. Two acceleration strategies are developed to improve computational efficiency. However, the contribution is not very clear, with not enough evidence showing that the proposed method performs better than existing KSC methods.
My main concern is that KSC using RBF has already been studied, such as KSR, KFSS, and FOSO (the author has mentioned these works ).  However, the author doesn't mention them in the introduction, making it confusing that using RBF for KSC is a new method. Further, there are not enough comparisons between the proposed method and existing KSC methods (such as KFSS and FOSO) in the experimental results. So it is quite unclear what the main contribution of the proposed method is. (The acceleration strategies might be the contribution but the overall contribution should not be focused on using RBF for KSC.)
Yes
NA
No ethics review needed.
1. In Line 411, it claims that the CR is determined by FKSC. Why this setting is fair to other algorithms? 
2. On what criteria were the comparison algorithms selected?
3. In Line 160, you have $|q| = 0$, can you explain more. If all entries $q_i$ are non-negative, we have all entries to be identically zero. Otherwise, we have some entries being negative. This leads to questions regarding the definition of $q_i!$. I understand there is still definition on the factorial of negative numbers but am still a little confused.
This paper is easy to understand.  The extension from the linear scheme to non-linear scheme is quite natural.
This paper focuses on the sparse coding setting and extends the linear setting to non-linear setting with the Radial Basis Function kernel (c.f. Equation (3)).
To solve the problem, they propose to use the alternative minimization method, that is, decompose the problem into two sub-questions, i.e., Kernel Sparse Coding (KSC) subproblem and Kernel Dictionary Learning (KDL) sub-problem. Then, they propose two acceleration scheme, which is safely skipping update for zero elements and prioritizing updates for initially predicted nonzero elements.
1. The novelty is limited. Basically, the proposed method is to replace the original $Y$ and $X$ with $\phi(Y)$ and $\phi(X)$. The alternative minimization method to update $X$ and $W$ is quite standard. For example, minimizing $W$ (c.f. Eq (7)) is the same as the Lasso estimator. The solution in (8) and (9) is called the soft-thresholding estimator, which is standard in solving the Lasso algorithm. The solution of $X$ is found by gradient descent algorithm. Although the acceleration scheme is proposed, no theoretical analysis, say the convergence is provided. 
2. The baseline to prove the acceleration is their own algorithm, which is not well accepted and may lead to question of the comparison fairness.
Yes
No ethics review needed.
No questions.
maybe
The paper addresses sparse coding and dictionary learning with a kernel-based model, with a focus on the RBF kernel. A two-stage acceleration strategy is also proposed.
There are many major issues in the paper, making the paper not suitable for publication. I provide in the following some of the major issues.

A major issue is the low novelty of this work. The authors present their kernel-based model as if it is the first time that sparse coding and dictionary learning is considered in the nonlinear kernel-based model. This is a pity, as the kernel-based embedding for nonlinear sparse coding and dictionary learning has been largely investigated in the literature in the 15 or even 20 years. 

The authors fail to position their contributions in such a literature.

Moreover, the first stated contribution of this paper is, as described by the authors, the fact that an RBF kernel maps the data into an infinite dimension space. This has been known since the end of last century, and is central in kernel-based models and the much old support vector machines. Expressions as (2) and following discussions have been well known in the literature.

There are many issues with the notations, as described in the following:

phi(.) is defined on what space ? if defined on the vector space (which should be the case in this paper), then phi(y) is relevant, but not phi(Y) because Y is a matrix. For the same reasons, phi(X) is not correct.

What is the dimension of phi(.) ? In this end of section 2, it is argued that it is an infinite dimension because of the RBF kernel. Therefore, the Frobenius norm in (3) is not correct, as it is not correct that phi(X) is multiplied by a matrix W of infinite dimension !
Moreover, this norm is transformed to the L2-norm in (4), which is also not correct. Furthermore, all the following Frobenius and L2-norms are not correct. This means that the computation of the Trace given in (10) is not correct.
@inproceedings{
anonymous2024a,
title={A Novel Kernel Sparse Coding Method with A Two-stage Acceleration Strategy},
author={Anonymous},
booktitle={Submitted to The Thirteenth International Conference on Learning Representations},
year={2024},
url={https://openreview.net/forum?id=U2s5hBE1I9},
note={under review}
}
Sparse coding aims to exploit the latent linear structure of the input data, transforming dense data into sparse data, thereby improving data processing efficiency. However, many real-word signals cannot be expressed linearly, rendering the traditional sparse coding algorithms ineffective. One potential solution is to expand the dimensions of data. In this paper, we verify that the feature mapping of Radial Basis Function (RBF) kernel contains infinite dimensional information, and it does not significantly increase the computational complexity. Based on this, we propose to explore the $l_1$-norm regularization sparse coding method with RBF kernel, and provides a solution with convergence guarantees by leveraging the principle of coordinate descent. Additionally, to accelerate the optimization process, we introduce a novel two-stage acceleration strategy, based on theoretical analysis and empirical observations. Experimental results demonstrate that the two-stage acceleration strategy can reduce processing time by up to 90\%. Furthermore, when the data size is compressed to about 2\% of its original scale, the NMAE metric of the proposed method reaches as low as 0.0824 to 0.2195, achieving a significant improvement of up to 47\% compared to traditional linear sparse coding methods and 36\% compared to other kernel sparse coding techniques.
I certify that there is no URL (e.g., github page) that could be used to find authors’ identity.
I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
Sparse Coding Kernel Trick Acceleration Strategy
I certify that there is no acknowledgement section in this submission for double blind review.
/pdf/68bffb7dacd6e5387866d6e41ca5cbf126a6e6eb.pdf
optimization
I understand the reciprocal reviewing requirement as described on https://iclr.cc/Conferences/2025/CallForPapers. If none of the authors are registered as a reviewer, it may result in a desk rejection at the discretion of the program chairs. To request an exception, please complete this form at https://forms.gle/Huojr6VjkFxiQsUp6.
I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2025/AuthorGuide.
A Novel Kernel Sparse Coding Method with A Two-stage Acceleration Strategy
ICLR 2025 Conference Submission
ICLR.cc/2025/Conference/Submission