Fetching the paper…
Reading the bibliography…
We consider the Adaptive Regularization with Cubics approach for solving nonconvex optimization problems and propose a new variant based on inexact Hessian information chosen dynamically.
1902
Earlier work this paper cites.
J.E. Dennis, J.J. Moré (1974) A characterization of superlinear convergence and its application to quasi-Newton methods. Math. Comput
1974
Earlier work this paper cites.
A. Griewank (1981) The modification of Newton’s method for unconstrained optimization by bounding cubic terms. Technical Report NA/12
1981
Earlier work this paper cites.
J.J. Moré, D.C. Sorensen. (1983) Computing a trust region step. SIAM J. Sci. Statist. Comput
1983
Earlier work this paper cites.
J. Barzilai, J. M. Borwein (1988), Two-Point Step Size Gradient Methods, IMA Journal of Numerical Analysis
1988
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, P. Haffner (1998) Gradient-based learning applied to document recognition. Proceedings of the IEEE, 8
1998
Earlier work this paper cites.
A.R. Conn, N.I.M. Gould, and Ph.L. Toint. (2000) Trust-Region Methods
2000
Earlier work this paper cites.
E. D. Dolan, J. J. Moré (2002). Benchmarking optimization software with performance profiles. Math. Program
2002
Earlier work this paper cites.
Y. Nesterov and B.T. Polyak (2006) Cubic regularization of Newton’s method and its global performance. Math. Progr., Ser. A
2006
Earlier work this paper cites.
M. Weiser, P. Deuflhard, B. Erdmann (2007) Affine conjugate adaptive Newton methods for nonlinear elastomechanics. Optim. Methods Softw
2007
Earlier work this paper cites.
(2008) Causality workbench team, A marketing dataset, http://www.causality.inf.ethz.ch/data/CINA.html
2008
Earlier work this paper cites.
C. Cartis, N.I.M. Gould and Ph.L. Toint (2010) On the complexity of steepest descent, Newton’s and regularized Newton’s method for nonconvex unconstrained optimization. SIAM J. Optim
2010
Earlier work this paper cites.
C. Cartis, N.I.M. Gould, Ph.L. Toint (2011) Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Progr., Ser. A
2011
Earlier work this paper cites.
C. Cartis, N.I.M. Gould, Ph.L. Toint (2011) Adaptive cubic overestimation methods for unconstrained optimization. Part II: worst-case function and derivative-evaluation complexity. Math. Progr., Ser. A
2011
Cited alongside, same era.
C.C. Chang, C.J. Lin (2011) LIBSVM : a library for support vector machines. ACM Transactions on Intelligent Systems and Technology, 2
2011
Cited alongside, same era.
C. Cartis, N.I.M. Gould, Ph.L. Toint (2012) Complexity bounds for second-order optimality in unconstrained optimization. J. Complex
2012
Cited alongside, same era.
C. Cartis, N.I.M. Gould and Ph.L. Toint (2012) An adaptive cubic regularisation algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA J. Numer. Anal
2012
Cited alongside, same era.
M. Lichman(2013) UCI machine learning repository, https://archive.ics.uci.edu/ml/index.php
M. Pilanci and M. J. Wainwright. (2017) Newton sketch: A near linear-time optimization algorithm with linear-quadratic convergence. SIAM J. Optim
2017
Later among the works it cites.
2017
Later among the works it cites.
S. Bellavia, N. Krejic, N. Krklec Jerinkic (2018) Subsampled Inexact Newton methods for minimizing large sums of convex functions. http://www.optimization-online.org/DB_HTML/2018/01/6432.html
2018
Closest in time.
L. Bottou, F.E. Curtis, J. Nocedal (2018) Optimization Methods for Large-Scale Machine Learning, SIAM Review
2018
Closest in time.
R.H. Byrd, G.M. Chin, W. Neveitt, J. Nocedal (2018) On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning. SIAM J. Optim
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
I. Mukherjee, K. Canini, R. Frongillo, Y. Singer (2013). Joint European Conference on Machine Learning and Knowledge Discovery in Databases
2013
Cited alongside, same era.
T. Bianconcini, G. Liuzzi, B. Morini, M. Sciandrone (2015) On the use of iterative methods in cubic regularization for unconstrained optimization. Comp. Optim. Appl
2015
Cited alongside, same era.
2016
Cited alongside, same era.
J.D. Lee, M. Simchowitz, M.I. Jordan, B. Recht (2016) Gradient Descent Only Converges to Minimizers. JMRL: Workshop and Conference Proceedings
2016
Cited alongside, same era.
2017
Cited alongside, same era.
E.G. Birgin, J.L. Gardenghi, J.M. Martínez, S.A. Santos and Ph.L. Toint (2017) Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Progr., Ser. A
2017
Cited alongside, same era.
J.M. Kohler, A. Lucchi (2017) Subsampled cubic regularization for non-convex optimization 34th International Conference on Machine Learning, ICML 2017
2017
Cited alongside, same era.
2018
Closest in time.
C. Cartis, K. Scheinberg (2018) Global convergence rate analysis of unconstrained optimization methods based on probabilistic models Math. Progr., Ser. A
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2019
Closest in time.
F. Roosta-Khorasani, M.W. Mahoney. (2019) Sub-Sampled Newton Methods, Math. Prog
2019
Closest in time.
P. Xu, F. Roosta-Khorasani, M.W. Mahoney (2019) Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Information, Math. Prog
2019
Closest in time.