名称:
描述:
公开/私有: 公开 私有
标签: 用空格间隔多个标签,如:小说 文学 余秋雨
保存至书单:
封面仅供参考

Black box optimization, machine learning, and no-free lunch theorems /

ISBN/ISSN:
9783030665142 价格: CNY795.44
ISBN/ISSN:
3030665143
科图分类法:
TP181
题名:
Black box optimization, machine learning, and no-free lunch theorems /
出版发行:
Cham : Springer, 2021.
载体形态:
398 pages ; ; 24 cm.
内容提要:
This edited volume illustrates the connections between machine learning techniques, black box optimization, and no-free lunch theorems. Each of the thirteen contributions focuses on the commonality and interdisciplinary concepts as well as the fundamentals needed to fully comprehend the impact of individual applications and problems. Current theoretical, algorithmic, and practical methods used are provided to stimulate a new effort towards innovative and efficient solutions. The book is intended for beginners who wish to achieve a broad overview of optimization methods and also for more experienced researchers as well as researchers in mathematics, optimization, operations research, quantitative logistics, data analysis, and statistics, who will benefit from access to a quick reference to key topics and methods. The coverage ranges from mathematically rigorous methods to heuristic and evolutionary approaches in an attempt to equip the reader with different viewpoints of the same problem.
主题词:
Machine learning Mathematics.
主题词:
Mathematical optimization.
主题词:
Computer algorithms.
主要责任者:
Pardalos, P. M. 1954- (Panos M.),
主要责任者:
Rasskazova, Varvara,
主要责任者:
Vrahatis, Michael N., 1955-
标签:
相关资源:
限定所在馆: 限定所在馆藏地点: 限定馆藏状态:   预约:可预约已外借图书,在馆图书不可预约 >>
HEA|  |03288cam  2200313   450 
001|  |022022007179
008|  |210601s2021    sz            000 0 eng d
020|  |▼a9783030665142▼cCNY795.44▼qhardcover
020|  |▼a3030665143▼qhardcover
020|  |▼z9783030665159▼qelectronic bk.
020|  |▼z3030665151▼qelectronic bk.
040|  |▼aYDX▼beng▼erda▼cYDX▼dGW5XE▼dO-
   |  |CLCO▼dEBLCP
082|04|▼a006.3/10151▼223
090|  |▼aTP181▼b227430
245|00|▼aBlack box optimization, mach-
   |  |ine learning, and no-free lunc-
   |  |h theorems /▼cPanos M. Pardalo-
   |  |s, Varvara Rasskazova, Michael-
   |  | N. Vrahatis, editors.
260| 1|▼aCham :▼bSpringer,▼c2021.
300|  |▼a398 pages ;▼c24 cm.
336|  |▼atext▼btxt▼2rdacontent
337|  |▼aunmediated▼bn▼2rdamedia
338|  |▼avolume▼bnc▼2rdacarrier
490|0 |▼aSpringer optimization and it-
   |  |s applications,▼x1931-6828 ;▼vvolume 170
505|0 |▼aLearning enabled constrained-
   |  | black box optimization (Arche-
   |  |tti) -- Black-box optimization-
   |  |: Methods and applications (Ha-
   |  |san) -- Tuning algorithms for -
   |  |stochastic black-box optimizat-
   |  |ion: State of the art and futu-
   |  |re perspectives (Bartz-Beielst-
   |  |ein) -- Quality diversity opti-
   |  |mization: A novel branch of st-
   |  |ochastic optimization (Chatzil-
   |  |ygeroudis) -- Multi-objective -
   |  |evolutionary algorithms: Past,-
   |  | present and future (Coello C.-
   |  |A) -- Black-box and data drive-
   |  |n computation (Du) -- Mathemat-
   |  |ically rigorous global optimiz-
   |  |ation and fuzzy optimization: -
   |  |A brief comparison of paradigm-
   |  |s, methods, similarities and d-
   |  |ifferences (Kearfott) -- Optim-
   |  |ization under Uncertainty Expl-
   |  |ains Empirical Success of Deep-
   |  | Learning Heuristics (Kreinovi-
   |  |ch) -- Variable neighborhood p-
   |  |rogramming as a tool of machin-
   |  |e learning (Mladenovic) -- Non-
   |  |-lattice covering and quanitiz-
   |  |ation of high dimensional sets-
   |  | (Zhigljavsky) -- Finding effe-
   |  |ctive SAT partitionings via bl-
   |  |ack-box optimization (Semenov)-
   |  | -- The No Free Lunch Theorem:-
   |  | What are its main implication-
   |  |s for the optimization practic-
   |  |e? ( Serafino) -- What is impo-
   |  |rtant about the No Free Lunch -
   |  |theorems? (Wolpert)
520|  |▼aThis edited volume illustrat-
   |  |es the connections between mac-
   |  |hine learning techniques, blac-
   |  |k box optimization, and no-fre-
   |  |e lunch theorems. Each of the -
   |  |thirteen contributions focuses-
   |  | on the commonality and interd-
   |  |isciplinary concepts as well a-
   |  |s the fundamentals needed to f-
   |  |ully comprehend the impact of -
   |  |individual applications and pr-
   |  |oblems. Current theoretical, a-
   |  |lgorithmic, and practical meth-
   |  |ods used are provided to stimu-
   |  |late a new effort towards inno-
   |  |vative and efficient solutions-
   |  |. The book is intended for beg-
   |  |inners who wish to achieve a b-
   |  |road overview of optimization -
   |  |methods and also for more expe-
   |  |rienced researchers as well as-
   |  | researchers in mathematics, o-
   |  |ptimization, operations resear-
   |  |ch, quantitative logistics, da-
   |  |ta analysis, and statistics, w-
   |  |ho will benefit from access to-
   |  | a quick reference to key topi-
   |  |cs and methods. The coverage r-
   |  |anges from mathematically rigo-
   |  |rous methods to heuristic and -
   |  |evolutionary approaches in an -
   |  |attempt to equip the reader wi-
   |  |th different viewpoints of the-
   |  | same problem.
650| 0|▼aMachine learning▼xMathematics.
650| 0|▼aMathematical optimization.
650| 0|▼aComputer algorithms.
700|1 |▼aPardalos, P. M.▼q(Panos M.),-
   |  |▼d1954-▼eeditor.
700|1 |▼aRasskazova, Varvara,▼eeditor.
700|1 |▼aVrahatis, Michael N.,▼d1955-▼eeditor.