Quantum Algorithm for Sparse Online Learning with Truncated Gradient Descent
Quantum algorithms;online learning;truncated gradient descent;logistic regression;support vector machine;least squares
Yes
No ethics review needed.
Can you give an intuitive explanation of the dependance between $T$ and $d$?
The article is easy to read and very clear even for someone not very knowledgeable about quantum computations.
I am not up to date in the literature, so I cannot comment on significance or originality.
The authors study a quantum algorithm for online learning with a truncated version of gradient descent. This algorithm is already well studied in its classical form and going to its quantum counterpart one maintains the same regret rate, but with significantly smaller time complexity.
The paper doesn't discuss how feasible it is to implement such an algorithm. Its advantage on the classical counterpart comes into play only for large $d$, which can make it harder to run this algorithm in practice. It also seem to me that running such an algorithm for large $T$ may accumulate a large number of errors.
Yes
No ethics review needed.
1.	Applicability to Nonlinear Models: Please clarify whether the method can be extended to nonlinear models. If not, specify its limitations.

2.	Input and Output of Algorithm 1: Please define the inputs and outputs of Algorithm 1 to facilitate understanding and reproducibility.
The authors provide thorough theoretical analysis for the proposed method, which demonstrates greater practicality compared to the baseline approach. The research is foundational and has the potential to inspire other studies.
This manuscript presents a quantum sparse online learning algorithm for logistic regression, SVM, and least squares, building on the work of Langford et al. (2009). The authors demonstrate that the proposed algorithm achieves a quadratic speedup in time complexity, assuming efficient quantum access to inputs. While the manuscript provides substantial theoretical analysis, it lacks empirical evaluation to validate the conclusions, which makes the proposed method less persuasive.
1. The manuscript lacks essential empirical studies, which reduces the persuasiveness of the proposed approach.

2. The baseline method is somewhat outdated, which could detract from the relevance of the proposed work.

3. The authors should strengthen the explanation of the research motivation to make the study more compelling.

4. The authors should provide an introductory explanation of quantum algorithms at the beginning of the article, and the related work section should cover recent advancements in truncated gradient descent and quantum algorithms.

5. There is discrepency in the notation for transposition and iteration (T), and a typo is present in Assumption 1.
Yes
No ethics review needed.
- What does an exponential improvement in the dependence on $\\|u^\star\\|_2$ refer to on Page 4? The standard algorithm only has a polynomial dependence.
- Why does the gravity parameter $\alpha$ depend on the learning rate $\eta$?
- Does the speedup arise from the assumption that features and weights can be accessed in  $\tilde{O}(1)$ time coherently on a quantum computer, rather than the novelty of the proposed algorithm itself?
- Assumption 1 (ii) assumes $A,B \in \mathbb{R}_{>0}$ but $A$ or $B$ can be zero in the examples below.
The proposed algorithm achieves a reduced time complexity in the case the sample size $T$ is smaller than $\tilde O(d^{1/5})$, while attaining the same regret bound.
This paper developed a quantum sparse online learning algorithm by using truncated gradient descent. The time complexity is improved on the dependence on the data dimension. Applications to logistic regression, SVMs, and least squares are discussed.
The presentation of the paper requires significant improvement. The flow lacks coherence, making it challenging to understand the paper's focus. 

More importantly, it allocates substantial space to well-known models, such as regression and SVM, while providing limited attention to quantum computing and algorithms. The preliminaries on quantum computing are far from sufficient, which severely impacts the paper’s readability. For instance, $O_u|j\rangle|\bar{0}\rangle = |j\rangle |u_j\rangle$ in Section 3 and various notations/definitions in Section 4 are not accessible to readers in the machine learning field who might not have a background in quantum computing. 

As someone who is not an expert in quantum computing, the paper’s lack of readability prevents me from confidently assessing the validity of the results or accurately evaluating its contributions. It is not clear to me whether the theoretical improvement is due to the quantum computing assumptions or the novelty of the proposed algorithm.
Yes
No ethics review needed.
Please see the weakness above.
* The proposed method exhibits better time complexity when $d > O(T^5)$.
* Theoretical guarantees for the achievable regrets are provided.
This paper develops new quantum online learning algorithms for logistic regression, SVM and least square problems. The work is based on the pioneering work of (Langford et al. 2009), utilizing a truncated gradient descent algorithm for sparse online learning. The developed method achieves the same regret bound while improving the time complexity from $O(Td)$ to $O(T^{5/2}\sqrt{d})$, allowing speedup when $d > O(T^5)$.
* I'm not familiar with quantum algorithms, but to the best of my experience the data dimension $d$ and time step $T$ are usually at the same scale of magnitude for traditional deep learning, so I wonder how often will $d > O(T^5)$ actually happen in practice. I'll suggest the authors give some high-dimensional learning examples to motivate this improvement.

* There are no empirical results provided in the current version of the manuscript, which makes it hard for me to understand how much improvement could be brought by the method designed in this paper. I would consider raising my score if the authors could provide some empirical comparison between their method and the one in (Langford et al. 2009).
Yes
No ethics review needed.
This paper uses the same assumption (Assumption 1) as Langford et al. (2009). Besides that, this paper also introduces Assumption 2. Is this assumption also used in Langford et al. (2009)? If not, then will this make the comparison being unfair?
1. This paper gives a very clear presentation of the differences between their results and previous works. It applies the techniques of quantum amplitude estimation and amplification: ``quantum inner product estimation, quantum norm estimation, and quantum state preparation''. The improvement in time complexity is vital in our big data era, so the problem under the high-dimensional learning condition does match with the current focus.

2. Besides that, the three problems studied in this paper, logistic regression, support vector machine (SVM), and least squares, are very popular approaches used in machine learning. It is imperative to develop these as it has the potential to influence various fields.
In this paper, it presents quantum algorithms for studying the sparse online learning, and it can be applied to well-known machine learning problems, like logistic regression, the SVM, and least squares. This paper is built upon the seminal work of Langford et al. (2009), and it achieves a quadratic speedup in the time complexity: they get $\widetilde{O}(T^{5 / 2} \sqrt{d})$, where $T$ is the number of iterations and $d$ is the dimension of the data point. This time complexity improves from $O(Td)$ from Langford et al. (2009), under the assumption that $d > \widetilde{\Omega} (T^5)$ (for high-dimensional learning tasks). This time complexity is fairly compared with Langford et al. (2009) since they have the same regret $O(1 / \sqrt{T})$.
1. However, it is unclear what the unique theoretical novelties of this paper are. While the authors provide a comprehensive overview of techniques adopted from other works, they lack a clear explanation of their own theoretical contributions. It is common for theoretical papers to defer proofs to the appendix. However, instead of merely stating the theorems, it is more important to present a high-level overview (or proof sketch) of how to establish these results, allowing readers to better understand the theoretical innovations of this work.

2. This paper misuses many instances of \citep and \citet.

3. While the size of datasets in practice continues to grow, and the authors cite numerous works (lines 74 to 77) that emphasize the significance of their contributions in the era of big data, it remains unclear under what circumstances, in practice, $d > \widetilde{\Omega}(T^5)$. I suggest that the authors include specific examples (with citations) where $d > \widetilde{\Omega}(T^5)$ is common in practice, as this would make the impact of their work more convincing.
This paper proposes a quantum sparse online learning algorithm via truncated gradient descent, achieving a quadratic speedup in the data dimension for logistic regression, SVMs, and least squares in the online setting.
@inproceedings{
anonymous2024quantum,
title={Quantum Algorithm for Sparse Online Learning with Truncated Gradient Descent},
author={Anonymous},
booktitle={Submitted to The Thirteenth International Conference on Learning Representations},
year={2024},
url={https://openreview.net/forum?id=XABvLUXQ45},
note={under review}
}
Logistic regression, the Support Vector Machine (SVM) and least squares are well-studied methods in the statistical and computer science community, with various practical applications. High-dimensional data arriving on a real-time basis makes the design of online learning algorithms that produce sparse solutions essential. The seminal work of Langford \emph{et al.} developed a method to obtain sparsity via truncated gradient descent, showing a near-optimal online regret bound. Based on this method, we develop a quantum sparse online learning algorithm for logistic regression, the SVM and least squares. Given efficient quantum access to the inputs, we show that a quadratic speedup in the time complexity with respect to the dimension of the problem is achievable, while maintaining a regret of $O(1/\sqrt{T})$, where $T$ is the number of time steps.
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.
Quantum algorithms online learning truncated gradient descent logistic regression support vector machine least squares
I certify that there is no acknowledgement section in this submission for double blind review.
/pdf/d86a7994301957c0e0f843d80d2fb4c80c1346e5.pdf
learning theory
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.
Quantum Algorithm for Sparse Online Learning with Truncated Gradient Descent
ICLR 2025 Conference Submission
ICLR.cc/2025/Conference/Submission