default search action
Albert S. Berahas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Liyuan Cao
, Albert S. Berahas
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles. Math. Program. 207(1): 55-106 (2024) - [j13]Albert S. Berahas, Lindon Roberts, Fred Roosta:
Non-Uniform Smoothness for Gradient Descent. Trans. Mach. Learn. Res. 2024 (2024) - [i10]Sachin Garg, Albert S. Berahas, Michal Derezinski
Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients. CoRR abs/2404.14758 (2024) - 2023
- [j12]Albert S. Berahas
Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction. Comput. Optim. Appl. 86(1): 79-116 (2023) - [j11]Albert S. Berahas
Full-low evaluation methods for derivative-free optimization. Optim. Methods Softw. 38(2): 386-411 (2023) - [i9]Xubo Yue, Raed Al Kontar
Collaborative and Distributed Bayesian Optimization via Consensus: Showcasing the Power of Collaboration for Optimal Design. CoRR abs/2306.14348 (2023) - [i8]Albert S. Berahas, Lindon Roberts, Fred Roosta:
Non-Uniform Smoothness for Gradient Descent. CoRR abs/2311.08615 (2023) - 2022
- [j10]Albert S. Berahas
A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimization. Found. Comput. Math. 22(2): 507-560 (2022) - [j9]Albert S. Berahas
Limited-memory BFGS with displacement aggregation. Math. Program. 194(1): 121-157 (2022) - [j8]Albert S. Berahas
Quasi-Newton methods for machine learning: forget the past, just sample. Optim. Methods Softw. 37(5): 1668-1704 (2022) - 2021
- [j7]Albert S. Berahas
Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization. SIAM J. Optim. 31(2): 1352-1379 (2021) - [j6]Albert S. Berahas
Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise. SIAM J. Optim. 31(2): 1489-1518 (2021) - [j5]Albert S. Berahas
On the Convergence of Nested Decentralized Gradient Methods With Multiple Consensus and Gradient Steps. IEEE Trans. Signal Process. 69: 4192-4203 (2021) - [c8]Majid Jahani, MohammadReza Nazari, Rachael Tappenden, Albert S. Berahas, Martin Takác:
SONIA: A Symmetric Blockwise Truncated Optimization Algorithm. AISTATS 2021: 487-495 - 2020
- [j4]Albert S. Berahas
A robust multi-batch L-BFGS method for machine learning. Optim. Methods Softw. 35(1): 191-219 (2020) - [j3]Albert S. Berahas
An investigation of Newton-Sketch and subsampled Newton methods. Optim. Methods Softw. 35(4): 661-680 (2020) - [c7]Zheng Shi, Nur Sila Gulgec, Albert S. Berahas, Shamim N. Pakzad
Finite Difference Neural Networks: Fast Prediction of Partial Differential Equations. ICMLA 2020: 130-135 - [c6]Majid Jahani, MohammadReza Nazari, Sergey Rusakov, Albert S. Berahas, Martin Takác
Scaling Up Quasi-newton Algorithms: Communication Efficient Distributed SR1. LOD (1) 2020: 41-54 - [i7]Zheng Shi, Nur Sila Gulgec, Albert S. Berahas, Shamim N. Pakzad, Martin Takác:
Finite Difference Neural Networks: Fast Prediction of Partial Differential Equations. CoRR abs/2006.01892 (2020) - [i6]Albert S. Berahas, Frank E. Curtis
Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization. CoRR abs/2007.10525 (2020)
2010 – 2019
- 2019
- [j2]Albert S. Berahas
Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods. SIAM J. Optim. 29(2): 965-993 (2019) - [j1]Albert S. Berahas
Balancing Communication and Computation in Distributed Optimization. IEEE Trans. Autom. Control. 64(8): 3141-3155 (2019) - [c5]Albert S. Berahas
Nested Distributed Gradient Methods with Adaptive Quantized Communication. CDC 2019: 1519-1525 - [i5]Albert S. Berahas, Majid Jahani, Martin Takác:
Quasi-Newton Methods for Deep Learning: Forget the Past, Just Sample. CoRR abs/1901.09997 (2019) - 2017
- [i4]Albert S. Berahas, Raghu Bollapragada, Jorge Nocedal:
An Investigation of Newton-Sketch and Subsampled Newton Methods. CoRR abs/1705.06211 (2017) - [i3]Albert S. Berahas, Martin Takác:
A Robust Multi-Batch L-BFGS Method for Machine Learning. CoRR abs/1707.08552 (2017) - 2016
- [c4]Michael Iliadis, Leonidas Spinoulas, Albert S. Berahas
Multi-model robust error correction for face recognition. ICIP 2016: 3229-3233 - [c3]Albert S. Berahas, Jorge Nocedal, Martin Takác:
A Multi-Batch L-BFGS Method for Machine Learning. NIPS 2016: 1055-1063 - [c2]Nitish Shirish Keskar, Albert S. Berahas
adaQN: An Adaptive Quasi-Newton Algorithm for Training RNNs. ECML/PKDD (1) 2016: 1-16 - [i2]Albert S. Berahas, Jorge Nocedal, Martin Takác:
A Multi-Batch L-BFGS Method for Machine Learning. CoRR abs/1605.06049 (2016) - 2015
- [i1]Nitish Shirish Keskar, Albert S. Berahas:
adaQN: An Adaptive Quasi-Newton Algorithm for Training RNNs. CoRR abs/1511.01169 (2015) - 2014
- [c1]Michael Iliadis, Leonidas Spinoulas, Albert S. Berahas, Haohong Wang, Aggelos K. Katsaggelos:
Sparse representation and least squares-based classification in face recognition. EUSIPCO 2014: 526-530
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 2024-10-07 21:11 CEST 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: