IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-030-66515-9_8.html
   My bibliography  Save this book chapter

Optimization Under Uncertainty Explains Empirical Success of Deep Learning Heuristics

In: Black Box Optimization, Machine Learning, and No-Free Lunch Theorems

Author

Listed:
  • Vladik Kreinovich

    (University of Texas at El Paso)

  • Olga Kosheleva

    (University of Texas at El Paso)

Abstract

One of the main objectives of science and engineering is to predict the future state of the world and come up with devices and strategies that would make this future state better. In some practical situations, we know how the state changes with time—e.g., in meteorology, we know the partial differential equations that describe the atmospheric processes. In such situations, prediction becomes a purely computational problem. In many other situations, however, we do not know the equation describing the system’s dynamics. In such situations, we need to learn this dynamics from data. At present, the most efficient way of such learning is to use deep learning—training a neural network with a large number of layers. To make this idea truly efficient, several trial-and-error-based heuristics were discovered, such as the use of rectified linear neurons, softmax, etc. In this chapter, we show that the empirical success of many of these heuristics can be explained by optimization-under-uncertainty techniques.

Suggested Citation

  • Vladik Kreinovich & Olga Kosheleva, 2021. "Optimization Under Uncertainty Explains Empirical Success of Deep Learning Heuristics," Springer Optimization and Its Applications, in: Panos M. Pardalos & Varvara Rasskazova & Michael N. Vrahatis (ed.), Black Box Optimization, Machine Learning, and No-Free Lunch Theorems, pages 195-220, Springer.
  • Handle: RePEc:spr:spochp:978-3-030-66515-9_8
    DOI: 10.1007/978-3-030-66515-9_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-030-66515-9_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.