paper-with-me

Papers

Online Orthogonal Dictionary Learning Based on Frank-Wolfe Method

2021-03-02 · Ye Xue, Vincent Lau

Dictionary learning is a widely used unsupervised learning method in signal processing and machine learning. Most existing works of dictionary learning are in an offline manner. There are mainly two offline ways for dictionary learning. One is to do an alternative optimization of both the dictionary and the sparse code; the other way is to optimize the dictionary by restricting it over the orthogonal group. The latter one is called orthogonal dictionary learning which has a lower complexity implementation, hence, it is more favorable for lowcost devices. However, existing schemes on orthogonal dictionary learning only work with batch data and can not be implemented online, which is not applicable for real-time applications. This paper proposes a novel online orthogonal dictionary scheme to dynamically learn the dictionary from streaming data without storing the historical data. The proposed scheme includes a novel problem formulation and an efficient online algorithm design with convergence analysis. In the problem formulation, we relax the orthogonal constraint to enable an efficient online algorithm. In the algorithm design, we propose a new Frank-Wolfe-based online algorithm with a convergence rate of O(ln t/t^(1/4)). The convergence rate in terms of key system parameters is also derived. Experiments with synthetic data and real-world sensor readings demonstrate the effectiveness and efficiency of the proposed online orthogonal dictionary learning scheme.

📄 PDF Abstract BibTeX arXiv:2103.01484

Code (0)

등록된 구현이 없습니다.

Tasks

Dictionary Learning

Similar Papers 제목 키워드 기반

Frank-Wolfe Algorithm for the Exact Sparse Problem

2018-12-18 · Farah Cherfaoui, Valentin Emiya, Liva Ralaivola, Sandrine Anthoine

In this paper, we study the properties of the Frank-Wolfe algorithm to solve the \ExactSparse reconstruction problem. We prove that when the dictionary is quasi-incoherent, at each iteration, the Frank-Wolfe algorithm pi…

Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback

2019-10-28 · NeurIPS 2019 12 · Mingrui Zhang, Lin Chen, Hamed Hassani, Amin Karbasi

In this paper, we propose three online algorithms for submodular maximisation. The first one, Mono-Frank-Wolfe, reduces the number of per-function gradient evaluations from $T^{1/2}$ [Chen2018Online] and $T^{3/2}$ [chen2…

Optimized projection-free algorithms for online learning: construction and worst-case analysis

2025-06-06 · Julien Weibel, Pierre Gaillard, Wouter M. Koolen, Adrien Taylor

This work studies and develop projection-free algorithms for online learning with linear optimization oracles (a.k.a. Frank-Wolfe) for handling the constraint set. More precisely, this work (i) provides an improved (opti…

Faster Projection-free Online Learning

2020-01-30 · Elad Hazan, Edgar Minasyan

In many online learning problems the computational bottleneck for gradient-based methods is the projection operation. For this reason, in many problems the most efficient algorithms are based on the Frank-Wolfe method, w…

On the Online Frank-Wolfe Algorithms for Convex and Non-convex Optimizations

2015-10-05 · Jean Lafond, Hoi-To Wai, Eric Moulines

In this paper, the online variants of the classical Frank-Wolfe algorithm are considered. We consider minimizing the regret with a stochastic cost. The online algorithms only require simple iterative updates and a non-ad…