Results 31 to 40 of about 859,071 (262)
Gradient-only line searches: An Alternative to Probabilistic Line Searches
CoRR, 2019 Step sizes in neural network training are largely determined using predetermined rules such as fixed learning rates and learning rate schedules. These require user input or expensive global optimization strategies to determine their functional form and associated hyperparameters. Line searches are capable of adaptively resolving learning rate schedules.
Dominic Kafka, Daniel N. Wilke
openaire +2 more sources
Real-Time Detection Method for Center and Attitude Precise Positioning of Cross Laser-Pattern
Applied Sciences, 2021 Optical metrology has experienced a fast development in recent years—cross laser-pattern has become a common cooperative measuring marker in optical metrology equipment, such as infrared imaging equipment or visual 3D measurement system.
Haopeng Li, Zurong Qiu, Haodan Jiang
doaj +1 more source
A general framework for searching on a line
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose, Jean-Lou De Carufel
openaire +1 more source
Mathematics, 2021 For the past few decades, various algorithms have been proposed to solve convex minimization problems in the form of the sum of two lower semicontinuous and convex functions.
Dawan Chumpungam +2 more
doaj +1 more source
Revisiting the Problem of Searching on a Line [PDF]
, 2013 We revisit the problem of searching for a target at an unknown location on a line when given upper and lower bounds on the distance D that separates the initial position of the searcher from the target. Prior to this work, only asymptotic bounds were known for the optimal competitive ratio achievable by any search strategy in the worst case. We present
Prosenjit Bose +2 more
openaire +2 more sources
Competitive Searching for a Line on a Line Arrangement.
, 2018 We discuss the problem of searching for an unknown line on a known or unknown line arrangement by a searcher S, and show that a search strategy exists that finds the line competitively, that is, with detour factor at most a constant when compared to the situation where S has all knowledge. In the case where S knows all lines but not which one is sought,
Quirijn W. Bouts +4 more
openaire +6 more sources
Mathematics, 2022 The paper presents a multi-fidelity extension of a local line-search-based derivative-free algorithm for nonsmooth constrained optimization (MF-CS-DFN).
Riccardo Pellegrini +5 more
doaj +1 more source
On-line learning from search failures [PDF]
Machine Learning, 1994 Learning by explaining failures and avoiding similar ones thereafter is an attractive way to speed up problem solving. However, previous methods for explanation-based learning from failure can take too long to detect failures, explain them, or test the learned rules.
Neeraj Bhatnagar, Jack Mostow
openaire +2 more sources
Croatian Operational Research Review, 2022 In this paper, it is aimed to computationally conduct a performance benchmarking for the steepest descent and the three well-known conjugate gradient methods (i.e., Fletcher-Reeves, Polak- Ribiere and Hestenes-Stiefel) along with six different step ...
Kadir Kiran
doaj
An Improved Modification of Accelerated Double Direction and Double Step-Size Optimization Schemes
Mathematics, 2022 We propose an improved variant of the accelerated gradient optimization models for solving unconstrained minimization problems. Merging the positive features of either double direction, as well as double step size accelerated gradient models, we define ...
Milena J. Petrović +4 more
doaj +1 more source