default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLindon Roberts
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Warren L. Hare, Lindon Roberts, Clément W. Royer:
Expected decrease for derivative-free algorithms using random subspaces. Math. Comput. 94(351): 277-304 (2024)- [j9]Albert S. Berahas, Lindon Roberts, Fred Roosta:
Non-Uniform Smoothness for Gradient Descent. Trans. Mach. Learn. Res. 2024 (2024) - [i8]Mohammad Sadegh Salehi, Subhadip Mukherjee, Lindon Roberts, Matthias J. Ehrhardt:
Bilevel Learning with Inexact Stochastic Gradients. CoRR abs/2412.12049 (2024) - 2023
- [j8]Coralia Cartis, Lindon Roberts
:
Scalable subspace methods for derivative-free nonlinear least-squares optimization. Math. Program. 199(1): 461-524 (2023) - [j7]Lindon Roberts, Clément W. Royer:
Direct Search Based on Probabilistic Descent in Reduced Spaces. SIAM J. Optim. 33(4): 3057-3082 (2023) - [i7]Matthias J. Ehrhardt, Lindon Roberts:
Analyzing Inexact Hypergradients for Bilevel Learning. CoRR abs/2301.04764 (2023) - [i6]Mohammad Sadegh Salehi, Subhadip Mukherjee, Lindon Roberts, Matthias J. Ehrhardt:
Dynamic Bilevel Learning with Inexact Line Search. CoRR abs/2308.10098 (2023) - [i5]Albert S. Berahas, Lindon Roberts, Fred Roosta:
Non-Uniform Smoothness for Gradient Descent. CoRR abs/2311.08615 (2023) - 2022
- [j6]Lindon Roberts, Edward Smyth:
A simplified convergence theory for Byzantine resilient stochastic gradient descent. EURO J. Comput. Optim. 10: 100038 (2022) - [j5]Jaroslav M. Fowkes, Lindon Roberts, Árpád Bürmen:
PyCUTEst: an open source Python package of optimization test problems. J. Open Source Softw. 7(78): 4377 (2022) - [j4]Matthew Hough, Lindon Roberts:
Model-Based Derivative-Free Methods for Convex-Constrained Optimization. SIAM J. Optim. 32(4): 2552-2579 (2022) - [i4]Lindon Roberts, Edward Smyth:
A simplified convergence theory for Byzantine resilient stochastic gradient descent. CoRR abs/2208.11879 (2022) - 2021
- [j3]Matthias J. Ehrhardt, Lindon Roberts:
Inexact Derivative-Free Optimization for Bilevel Learning. J. Math. Imaging Vis. 63(5): 580-600 (2021) - 2020
- [i3]Matthias J. Ehrhardt, Lindon Roberts:
Inexact Derivative-Free Optimization for Bilevel Learning. CoRR abs/2006.12674 (2020) - [i2]Coralia Cartis, Tyler Ferguson, Lindon Roberts:
Scalable Derivative-Free Optimization for Nonlinear Least-Squares Problems. CoRR abs/2007.13243 (2020) - [i1]Matthias J. Ehrhardt, Lindon Roberts:
Efficient Hyperparameter Tuning with Dynamic Accuracy Derivative-Free Optimization. CoRR abs/2011.03151 (2020)
2010 – 2019
- 2019
- [j2]Coralia Cartis, Lindon Roberts:
A derivative-free Gauss-Newton method. Math. Program. Comput. 11(4): 631-674 (2019) - [j1]Coralia Cartis, Jan Fiala, Benjamin Marteau, Lindon Roberts:
Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers. ACM Trans. Math. Softw. 45(3): 32:1-32:41 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
