Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1803.11521 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912070209896448 |
|---|---|
| author | Sun, Lizhe Wang, Mingyuan Zhu, Siquan Barbu, Adrian |
| author_facet | Sun, Lizhe Wang, Mingyuan Zhu, Siquan Barbu, Adrian |
| contents | Current online learning methods suffer issues such as lower convergence rates and limited capability to select important features compared to their offline counterparts. In this paper, a novel framework for online learning based on running averages is proposed. Many popular offline regularized methods such as Lasso, Elastic Net, Minimax Concave Penalty (MCP), and Feature Selection with Annealing (FSA) have their online versions introduced in this framework. The equivalence between the proposed online methods and their offline counterparts is proved, and then novel theoretical true support recovery and convergence guarantees are provided for some of the methods in this framework. Numerical experiments indicate that the proposed methods enjoy high true support recovery accuracy and a faster convergence rate compared with conventional online and offline algorithms. Finally, applications to large datasets are presented, where again the proposed framework shows competitive results compared to popular online and offline algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1803_11521 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | A Novel Framework for Online Supervised Learning with Feature Selection Sun, Lizhe Wang, Mingyuan Zhu, Siquan Barbu, Adrian Machine Learning Current online learning methods suffer issues such as lower convergence rates and limited capability to select important features compared to their offline counterparts. In this paper, a novel framework for online learning based on running averages is proposed. Many popular offline regularized methods such as Lasso, Elastic Net, Minimax Concave Penalty (MCP), and Feature Selection with Annealing (FSA) have their online versions introduced in this framework. The equivalence between the proposed online methods and their offline counterparts is proved, and then novel theoretical true support recovery and convergence guarantees are provided for some of the methods in this framework. Numerical experiments indicate that the proposed methods enjoy high true support recovery accuracy and a faster convergence rate compared with conventional online and offline algorithms. Finally, applications to large datasets are presented, where again the proposed framework shows competitive results compared to popular online and offline algorithms. |
| title | A Novel Framework for Online Supervised Learning with Feature Selection |
| topic | Machine Learning |
| url | https://arxiv.org/abs/1803.11521 |