Proximal gradient methods for learning (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Proximal gradient methods for learning" in English language version.

refsWebsite

Global rank English rank

13doi.org

2^nd place

11semanticscholar.org

11^th place

8^th place

10arxiv.org

69^th place

59^th place

5harvard.edu

18^th place

17^th place

2psu.edu

207^th place

136^th place

1ams.org

451^st place

277^th place

1zbmath.org

1,923^rd place

1,068^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Moreau, J.-J. (1962). "Fonctions convexes duales et points proximaux dans un espace hilbertien". Comptes Rendus de l'Académie des Sciences, Série A. 255: 2897–2899. MR 0144188. Zbl 0118.10502.

arxiv.org (Global: 69^th place; English: 59^th place)

Daubechies, I.; Defrise, M.; De Mol, C. (2004). "An iterative thresholding algorithm for linear inverse problem with a sparsity constraint". Comm. Pure Appl. Math. 57 (11): 1413–1457. arXiv:math/0307152. doi:10.1002/cpa.20042. S2CID 1438417.
Bach, F.; Jenatton, R.; Mairal, J.; Obozinski, Gl. (2011). "Optimization with sparsity-inducing penalties". Foundations and Trends in Machine Learning. 4 (1): 1–106. arXiv:1108.0775. Bibcode:2011arXiv1108.0775B. doi:10.1561/2200000015. S2CID 56356708.
Loris, I.; Bertero, M.; De Mol, C.; Zanella, R.; Zanni, L. (2009). "Accelerating gradient projection methods for $\ell _{1}$ -constrained signal recovery by steplength selection rules". Applied & Comp. Harmonic Analysis. 27 (2): 247–254. arXiv:0902.4424. doi:10.1016/j.acha.2009.02.003. S2CID 18093882.
Loris, Ignace (2009). "On the performance of algorithms for the minimization of $\ell _{1}$ -penalized functionals". Inverse Problems. 25 (3) 035008. arXiv:0710.4082. Bibcode:2009InvPr..25c5008L. doi:10.1088/0266-5611/25/3/035008. S2CID 14213443.
De Mol, C.; De Vito, E.; Rosasco, L. (2009). "Elastic-net regularization in learning theory". J. Complexity. 25 (2): 201–230. arXiv:0807.3423. doi:10.1016/j.jco.2009.01.002. S2CID 7167292.
Chen, X.; Lin, Q.; Kim, S.; Carbonell, J.G.; Xing, E.P. (2012). "Smoothing proximal gradient method for general structured sparse regression". Ann. Appl. Stat. 6 (2): 719–752. arXiv:1005.4717. doi:10.1214/11-AOAS514. S2CID 870800.
Jenatton, R.; Audibert, J.-Y.; Bach, F. (2011). "Structured variable selection with sparsity-inducing norms". J. Mach. Learn. Res. 12: 2777–2824. arXiv:0904.3523. Bibcode:2009arXiv0904.3523J.
Zhao, P.; Rocha, G.; Yu, B. (2009). "The composite absolute penalties family for grouped and hierarchical variable selection". Ann. Stat. 37 (6A): 3468–3497. arXiv:0909.0411. Bibcode:2009arXiv0909.0411Z. doi:10.1214/07-AOS584. S2CID 9319285.
Obozinski, Guillaume; Jacob, Laurent; Vert, Jean-Philippe (2011). "Group Lasso with Overlaps: The Latent Group Lasso approach". arXiv:1110.0413 [stat.ML].
Villa, Silvia; Rosasco, Lorenzo; Mosci, Sofia; Verri, Alessandro (2012). "Proximal methods for the latent group lasso penalty". arXiv:1209.0368 [math.OC].

doi.org (Global: 2^nd place; English: 2^nd place)

Combettes, Patrick L.; Wajs, Valérie R. (2005). "Signal Recovering by Proximal Forward-Backward Splitting". Multiscale Model. Simul. 4 (4): 1168–1200. doi:10.1137/050626090. S2CID 15064954.
Mosci, S.; Rosasco, L.; Matteo, S.; Verri, A.; Villa, S. (2010). "Solving Structured Sparsity Regularization with Proximal Methods". Machine Learning and Knowledge Discovery in Databases. Lecture Notes in Computer Science. Vol. 6322. pp. 418–433. doi:10.1007/978-3-642-15883-4_27. ISBN 978-3-642-15882-7.
Tibshirani, R. (1996). "Regression shrinkage and selection via the lasso". J. R. Stat. Soc. Ser. B. 1. 58 (1): 267–288. doi:10.1111/j.2517-6161.1996.tb02080.x.
Daubechies, I.; Defrise, M.; De Mol, C. (2004). "An iterative thresholding algorithm for linear inverse problem with a sparsity constraint". Comm. Pure Appl. Math. 57 (11): 1413–1457. arXiv:math/0307152. doi:10.1002/cpa.20042. S2CID 1438417.
Villa, S.; Salzo, S.; Baldassarre, L.; Verri, A. (2013). "Accelerated and inexact forward-backward algorithms". SIAM J. Optim. 23 (3): 1607–1633. CiteSeerX 10.1.1.416.3633. doi:10.1137/110844805. S2CID 11379846.
Bach, F.; Jenatton, R.; Mairal, J.; Obozinski, Gl. (2011). "Optimization with sparsity-inducing penalties". Foundations and Trends in Machine Learning. 4 (1): 1–106. arXiv:1108.0775. Bibcode:2011arXiv1108.0775B. doi:10.1561/2200000015. S2CID 56356708.
Loris, I.; Bertero, M.; De Mol, C.; Zanella, R.; Zanni, L. (2009). "Accelerating gradient projection methods for $\ell _{1}$ -constrained signal recovery by steplength selection rules". Applied & Comp. Harmonic Analysis. 27 (2): 247–254. arXiv:0902.4424. doi:10.1016/j.acha.2009.02.003. S2CID 18093882.
Wright, S.J.; Nowak, R.D.; Figueiredo, M.A.T. (2009). "Sparse reconstruction by separable approximation". IEEE Trans. Image Process. 57 (7): 2479–2493. Bibcode:2009ITSP...57.2479W. CiteSeerX 10.1.1.115.9334. doi:10.1109/TSP.2009.2016892. S2CID 7399917.
Loris, Ignace (2009). "On the performance of algorithms for the minimization of $\ell _{1}$ -penalized functionals". Inverse Problems. 25 (3) 035008. arXiv:0710.4082. Bibcode:2009InvPr..25c5008L. doi:10.1088/0266-5611/25/3/035008. S2CID 14213443.
De Mol, C.; De Vito, E.; Rosasco, L. (2009). "Elastic-net regularization in learning theory". J. Complexity. 25 (2): 201–230. arXiv:0807.3423. doi:10.1016/j.jco.2009.01.002. S2CID 7167292.
Yuan, M.; Lin, Y. (2006). "Model selection and estimation in regression with grouped variables". J. R. Stat. Soc. B. 68 (1): 49–67. doi:10.1111/j.1467-9868.2005.00532.x. S2CID 6162124.
Chen, X.; Lin, Q.; Kim, S.; Carbonell, J.G.; Xing, E.P. (2012). "Smoothing proximal gradient method for general structured sparse regression". Ann. Appl. Stat. 6 (2): 719–752. arXiv:1005.4717. doi:10.1214/11-AOAS514. S2CID 870800.
Zhao, P.; Rocha, G.; Yu, B. (2009). "The composite absolute penalties family for grouped and hierarchical variable selection". Ann. Stat. 37 (6A): 3468–3497. arXiv:0909.0411. Bibcode:2009arXiv0909.0411Z. doi:10.1214/07-AOS584. S2CID 9319285.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Bach, F.; Jenatton, R.; Mairal, J.; Obozinski, Gl. (2011). "Optimization with sparsity-inducing penalties". Foundations and Trends in Machine Learning. 4 (1): 1–106. arXiv:1108.0775. Bibcode:2011arXiv1108.0775B. doi:10.1561/2200000015. S2CID 56356708.
Wright, S.J.; Nowak, R.D.; Figueiredo, M.A.T. (2009). "Sparse reconstruction by separable approximation". IEEE Trans. Image Process. 57 (7): 2479–2493. Bibcode:2009ITSP...57.2479W. CiteSeerX 10.1.1.115.9334. doi:10.1109/TSP.2009.2016892. S2CID 7399917.
Loris, Ignace (2009). "On the performance of algorithms for the minimization of $\ell _{1}$ -penalized functionals". Inverse Problems. 25 (3) 035008. arXiv:0710.4082. Bibcode:2009InvPr..25c5008L. doi:10.1088/0266-5611/25/3/035008. S2CID 14213443.
Jenatton, R.; Audibert, J.-Y.; Bach, F. (2011). "Structured variable selection with sparsity-inducing norms". J. Mach. Learn. Res. 12: 2777–2824. arXiv:0904.3523. Bibcode:2009arXiv0904.3523J.
Zhao, P.; Rocha, G.; Yu, B. (2009). "The composite absolute penalties family for grouped and hierarchical variable selection". Ann. Stat. 37 (6A): 3468–3497. arXiv:0909.0411. Bibcode:2009arXiv0909.0411Z. doi:10.1214/07-AOS584. S2CID 9319285.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Villa, S.; Salzo, S.; Baldassarre, L.; Verri, A. (2013). "Accelerated and inexact forward-backward algorithms". SIAM J. Optim. 23 (3): 1607–1633. CiteSeerX 10.1.1.416.3633. doi:10.1137/110844805. S2CID 11379846.
Wright, S.J.; Nowak, R.D.; Figueiredo, M.A.T. (2009). "Sparse reconstruction by separable approximation". IEEE Trans. Image Process. 57 (7): 2479–2493. Bibcode:2009ITSP...57.2479W. CiteSeerX 10.1.1.115.9334. doi:10.1109/TSP.2009.2016892. S2CID 7399917.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Combettes, Patrick L.; Wajs, Valérie R. (2005). "Signal Recovering by Proximal Forward-Backward Splitting". Multiscale Model. Simul. 4 (4): 1168–1200. doi:10.1137/050626090. S2CID 15064954.
Daubechies, I.; Defrise, M.; De Mol, C. (2004). "An iterative thresholding algorithm for linear inverse problem with a sparsity constraint". Comm. Pure Appl. Math. 57 (11): 1413–1457. arXiv:math/0307152. doi:10.1002/cpa.20042. S2CID 1438417.
Villa, S.; Salzo, S.; Baldassarre, L.; Verri, A. (2013). "Accelerated and inexact forward-backward algorithms". SIAM J. Optim. 23 (3): 1607–1633. CiteSeerX 10.1.1.416.3633. doi:10.1137/110844805. S2CID 11379846.
Bach, F.; Jenatton, R.; Mairal, J.; Obozinski, Gl. (2011). "Optimization with sparsity-inducing penalties". Foundations and Trends in Machine Learning. 4 (1): 1–106. arXiv:1108.0775. Bibcode:2011arXiv1108.0775B. doi:10.1561/2200000015. S2CID 56356708.
Loris, I.; Bertero, M.; De Mol, C.; Zanella, R.; Zanni, L. (2009). "Accelerating gradient projection methods for $\ell _{1}$ -constrained signal recovery by steplength selection rules". Applied & Comp. Harmonic Analysis. 27 (2): 247–254. arXiv:0902.4424. doi:10.1016/j.acha.2009.02.003. S2CID 18093882.
Wright, S.J.; Nowak, R.D.; Figueiredo, M.A.T. (2009). "Sparse reconstruction by separable approximation". IEEE Trans. Image Process. 57 (7): 2479–2493. Bibcode:2009ITSP...57.2479W. CiteSeerX 10.1.1.115.9334. doi:10.1109/TSP.2009.2016892. S2CID 7399917.
Loris, Ignace (2009). "On the performance of algorithms for the minimization of $\ell _{1}$ -penalized functionals". Inverse Problems. 25 (3) 035008. arXiv:0710.4082. Bibcode:2009InvPr..25c5008L. doi:10.1088/0266-5611/25/3/035008. S2CID 14213443.
De Mol, C.; De Vito, E.; Rosasco, L. (2009). "Elastic-net regularization in learning theory". J. Complexity. 25 (2): 201–230. arXiv:0807.3423. doi:10.1016/j.jco.2009.01.002. S2CID 7167292.
Yuan, M.; Lin, Y. (2006). "Model selection and estimation in regression with grouped variables". J. R. Stat. Soc. B. 68 (1): 49–67. doi:10.1111/j.1467-9868.2005.00532.x. S2CID 6162124.
Chen, X.; Lin, Q.; Kim, S.; Carbonell, J.G.; Xing, E.P. (2012). "Smoothing proximal gradient method for general structured sparse regression". Ann. Appl. Stat. 6 (2): 719–752. arXiv:1005.4717. doi:10.1214/11-AOAS514. S2CID 870800.
Zhao, P.; Rocha, G.; Yu, B. (2009). "The composite absolute penalties family for grouped and hierarchical variable selection". Ann. Stat. 37 (6A): 3468–3497. arXiv:0909.0411. Bibcode:2009arXiv0909.0411Z. doi:10.1214/07-AOS584. S2CID 9319285.

zbmath.org (Global: 1,923^rd place; English: 1,068^th place)

Moreau, J.-J. (1962). "Fonctions convexes duales et points proximaux dans un espace hilbertien". Comptes Rendus de l'Académie des Sciences, Série A. 255: 2897–2899. MR 0144188. Zbl 0118.10502.

Proximal gradient methods for learning (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

harvard.edu (Global: 18th place; English: 17th place)