Iterative Optimizers:
Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of t...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Körperschaft: | |
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
[Erscheinungsort nicht ermittelbar]
Wiley-ISTE
2019
|
| Ausgabe: | 1st edition. |
| Links: | https://learning.oreilly.com/library/view/-/9781786304094/?ar |
| Zusammenfassung: | Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life. This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties. The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios. |
| Beschreibung: | Online resource; Title from title page (viewed April 30, 2019) |
| Umfang: | 1 Online-Ressource (186 Seiten) |
| ISBN: | 9781786304094 |
Internformat
MARC
| LEADER | 00000cam a22000002 4500 | ||
|---|---|---|---|
| 001 | ZDB-30-ORH-053533283 | ||
| 003 | DE-627-1 | ||
| 005 | 20240228121111.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 200625s2019 xx |||||o 00| ||eng c | ||
| 020 | |a 9781786304094 |9 978-1-78630-409-4 | ||
| 035 | |a (DE-627-1)053533283 | ||
| 035 | |a (DE-599)KEP053533283 | ||
| 035 | |a (ORHE)9781786304094 | ||
| 035 | |a (DE-627-1)053533283 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 082 | 0 | |a 519.6 |2 23/eng/20230216 | |
| 100 | 1 | |a Clerc, Maurice |e VerfasserIn |4 aut | |
| 245 | 1 | 0 | |a Iterative Optimizers |c Clerc, Maurice |
| 250 | |a 1st edition. | ||
| 264 | 1 | |a [Erscheinungsort nicht ermittelbar] |b Wiley-ISTE |c 2019 | |
| 300 | |a 1 Online-Ressource (186 Seiten) | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Online resource; Title from title page (viewed April 30, 2019) | ||
| 520 | |a Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life. This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties. The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios. | ||
| 710 | 2 | |a Safari, an O'Reilly Media Company. |e MitwirkendeR |4 ctb | |
| 966 | 4 | 0 | |l DE-91 |p ZDB-30-ORH |q TUM_PDA_ORH |u https://learning.oreilly.com/library/view/-/9781786304094/?ar |m X:ORHE |x Aggregator |z lizenzpflichtig |3 Volltext |
| 912 | |a ZDB-30-ORH | ||
| 912 | |a ZDB-30-ORH | ||
| 951 | |a BO | ||
| 912 | |a ZDB-30-ORH | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-30-ORH-053533283 |
|---|---|
| _version_ | 1821494839909285888 |
| adam_text | |
| any_adam_object | |
| author | Clerc, Maurice |
| author_corporate | Safari, an O'Reilly Media Company |
| author_corporate_role | ctb |
| author_facet | Clerc, Maurice Safari, an O'Reilly Media Company |
| author_role | aut |
| author_sort | Clerc, Maurice |
| author_variant | m c mc |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-30-ORH |
| ctrlnum | (DE-627-1)053533283 (DE-599)KEP053533283 (ORHE)9781786304094 |
| dewey-full | 519.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.6 |
| dewey-search | 519.6 |
| dewey-sort | 3519.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 1st edition. |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02142cam a22003612 4500</leader><controlfield tag="001">ZDB-30-ORH-053533283</controlfield><controlfield tag="003">DE-627-1</controlfield><controlfield tag="005">20240228121111.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">200625s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781786304094</subfield><subfield code="9">978-1-78630-409-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)053533283</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP053533283</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ORHE)9781786304094</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)053533283</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.6</subfield><subfield code="2">23/eng/20230216</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clerc, Maurice</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Iterative Optimizers</subfield><subfield code="c">Clerc, Maurice</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st edition.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[Erscheinungsort nicht ermittelbar]</subfield><subfield code="b">Wiley-ISTE</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (186 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Online resource; Title from title page (viewed April 30, 2019)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life. This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties. The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios.</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Safari, an O'Reilly Media Company.</subfield><subfield code="e">MitwirkendeR</subfield><subfield code="4">ctb</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-30-ORH</subfield><subfield code="q">TUM_PDA_ORH</subfield><subfield code="u">https://learning.oreilly.com/library/view/-/9781786304094/?ar</subfield><subfield code="m">X:ORHE</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-30-ORH-053533283 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-17T11:20:46Z |
| institution | BVB |
| isbn | 9781786304094 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (186 Seiten) |
| psigel | ZDB-30-ORH TUM_PDA_ORH ZDB-30-ORH |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Wiley-ISTE |
| record_format | marc |
| spelling | Clerc, Maurice VerfasserIn aut Iterative Optimizers Clerc, Maurice 1st edition. [Erscheinungsort nicht ermittelbar] Wiley-ISTE 2019 1 Online-Ressource (186 Seiten) Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Online resource; Title from title page (viewed April 30, 2019) Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life. This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties. The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios. Safari, an O'Reilly Media Company. MitwirkendeR ctb |
| spellingShingle | Clerc, Maurice Iterative Optimizers |
| title | Iterative Optimizers |
| title_auth | Iterative Optimizers |
| title_exact_search | Iterative Optimizers |
| title_full | Iterative Optimizers Clerc, Maurice |
| title_fullStr | Iterative Optimizers Clerc, Maurice |
| title_full_unstemmed | Iterative Optimizers Clerc, Maurice |
| title_short | Iterative Optimizers |
| title_sort | iterative optimizers |
| work_keys_str_mv | AT clercmaurice iterativeoptimizers AT safarianoreillymediacompany iterativeoptimizers |