The Cambridge Constitutional History of the United Kingdom 2023
DOI: 10.1017/9781009277105.003
|View full text |Cite
|
Sign up to set email alerts
|

England after the Conquest

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…The performance of RGPE‐TAF relative to RGPE‐NEI is contrary to what has been observed by Feurer et al., where RGPE‐TAF outperformed RGPE‐NEI by a small margin. [ 23 ] We hypothesize that the performance of a BO algorithm varies according to the domain it is applied to, which is expected as the behavior of defined acquisition functions and statistical models differs, [ 19 ] this aspect is further discussed later in the text.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The performance of RGPE‐TAF relative to RGPE‐NEI is contrary to what has been observed by Feurer et al., where RGPE‐TAF outperformed RGPE‐NEI by a small margin. [ 23 ] We hypothesize that the performance of a BO algorithm varies according to the domain it is applied to, which is expected as the behavior of defined acquisition functions and statistical models differs, [ 19 ] this aspect is further discussed later in the text.…”
Section: Resultsmentioning
confidence: 99%
“…[ 17,18 ] The BO algorithms are distinguished by the choice of the statistical model and acquisition function, and the performance depends on how these two components are implemented, the main challenge in BO research. An extensive discussion of BO, from its basic implementation to its application across various domains, can be found in the text by Garnett R. [ 19 ] Some other sources providing overviews and advances in BO can be found in the works by Frazier, Shahriari et al., and Binois et al. [ 18,20–22 ] Of particular interest is the work of Feurer et al., [ 23 ] where authors introduce a method for improving the efficiency of BO algorithms by building base models from the information of previous similar tasks (prior knowledge) and incorporating them into optimizing new (target) task.…”
Section: Introductionmentioning
confidence: 99%