22 citations · 41 across the 16 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LG2019★ 7 cited
Dual Averaging Method for Online Graph-structured Sparsity
Baojian Zhou, Feng Chen, Yiming Ying
Online learning algorithms update models via one sample per iteration, thus efficient to process large-scale datasets and useful to detect malicious events for social benefits, suc…
cs.LG2019★ 6 cited
Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization
Baojian Zhou, Feng Chen, Yiming Ying
Stochastic optimization algorithms update models with cheap per-iteration costs sequentially, which makes them amenable for large-scale data analysis. Such algorithms have been wid…