Non-Uniform Stochastic Average Gradient Method for Training Conditional Random Fields
Not on the map. Why?
Abstract (arXiv)
We apply stochastic average gradient (SAG) algorithms for training conditional random fields (CRFs). We describe a practical implementation that uses structure in the CRF gradient to reduce the memory requirement of this linearly-convergent stochastic gradient method, propose a non-uniform sampling scheme that substantially improves practical performance, and analyze the rate of convergence of the SAGA variant under non-uniform sampling. Our experimental results reveal that our method often significantly outperforms existing methods in terms of the training objective, and performs as well or better than optimally-tuned stochastic gradient methods in terms of test error.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Apr 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 1; 2023: 0; 2024: 1.
6 papers.
- 2021SVRG Meets AdaGrad: Painless Variance Reductioncited by 13
- 2021Stochastic Reweighted Gradient Descentcited by 7
- 2021Structured Convolutional Kernel Networks for Airline Crew Schedulingcited by 2
- 2021Safe Screening for Sparse Conditional Random Fieldscited by 0
- 2022Preferential Subsampling for Stochastic Gradient Langevin Dynamicscited by 0
- 2024Stochastic optimization with arbitrary recurrent data samplingcited by 0
- 2024Stochastic optimization with arbitrary recurrent data sampling15 Jan 2024
- 2022Preferential Subsampling for Stochastic Gradient Langevin Dynamics28 Oct 2022
- 2021Safe Screening for Sparse Conditional Random Fields27 Nov 2021
- 2021Structured Convolutional Kernel Networks for Airline Crew Scheduling25 May 2021
- 2021Stochastic Reweighted Gradient Descent23 Mar 2021
- 2021SVRG Meets AdaGrad: Painless Variance Reduction18 Feb 2021