Corpus ID: 226307095

Non-local Optimization: Imposing Structure on Optimization Problems by Relaxation

  title={Non-local Optimization: Imposing Structure on Optimization Problems by Relaxation},
  author={Nils M{\"u}ller and T. Glasmachers},
  • Nils Müller, T. Glasmachers
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • In stochastic optimization, particularly in evolutionary computation and reinforcement learning, the optimization of a function $f: \Omega \to \mathbb{R}$ is often addressed through optimizing a so-called relaxation $\theta \in \Theta \mapsto \mathbb{E}_\theta(f)$ of $f$, where $\Theta$ resembles the parameters of a family of probability measures on $\Omega$. We investigate the structure of such relaxations by means of measure theory and Fourier analysis, enabling us to shed light on the… CONTINUE READING

    Figures from this paper


    Convex Optimization: Algorithms and Complexity
    • 843
    • PDF
    Convergence Analysis of Evolutionary Algorithms That Are Based on the Paradigm of Information Geometry
    • H. Beyer
    • Mathematics, Computer Science
    • Evolutionary Computation
    • 2014
    • 30
    • PDF
    Random Gradient-Free Minimization of Convex Functions
    • 392
    • PDF
    Gaussian Smoothing and Asymptotic Convexity
    • 3
    • PDF
    Large Scale Black-Box Optimization by Limited-Memory Matrix Adaptation
    • 18
    • PDF
    Information-Geometric Optimization Algorithms: A Unifying Picture via Invariance Principles
    • 136
    • PDF
    On the Link between Gaussian Homotopy Continuation and Convex Envelopes
    • 48
    • PDF
    Natural Evolution Strategies
    • 467
    • PDF