8.4. CONTROL WITH FUNCTION APPROXIMATION 219 Initialize θ! arbitrarily Repeat (for each episode):

Source URL: webdocs.cs.ualberta.ca

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d

Source URL: people.mpi-inf.mpg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• NP-hard problems
• Approximation algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• Nearest neighbour algorithm
• Shortest path problem
• Maximal independent set

The Variational Cluster Approximation R. Eder Karlsruhe Institute of Technology, Institut f¨ur Festk¨orperphysik

Source URL: www.cond-mat.de

• Constructible universe
• Mathematics
• Generalised Whitehead product
• Mathematical analysis
• Differential forms on a Riemann surface

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Source URL: users.eecs.northwestern.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• NP-complete problems
• Operations research
• Approximation algorithms
• Combinatorial optimization
• Set cover problem
• Linear programming relaxation
• Greedy algorithm
• Facility location problem
• Reduction

Convergent Temporal-Difference Learning with Arbitrary Smooth Function Approximation Hamid R. Maei University of Alberta Edmonton, AB, Canada

Source URL: webdocs.cs.ualberta.ca

• Mathematical analysis
• Statistical theory
• Smooth functions
• Loss function
• Sine
• Distribution
• Bearing pressure

External approximation of nonlinear operator equations Etienne Emmricha a TU Berlin, Institut f¨ ur Mathematik, Straße des 17. Juni 136, 10623 Berlin

Source URL: www.math.tu-berlin.de

The Logarithmic Hypervolume Indicator Tobias Friedrich Karl Bringmann Max-Planck-Institut für Informatik

Source URL: people.mpi-inf.mpg.de

• Mathematics
• Mathematical analysis
• Computational complexity theory
• Approximation algorithm
• Multiplicative inverse
• Logarithm
• Expected value
• Multi-objective optimization

The ratio between the Toeplitz and the unstructured condition number Siegfried M. Rump and H. Sekigawa Abstract. Recently it was shown that the ratio between the normwise Toeplitz structured condition number of a linear

Source URL: www.ti3.tu-harburg.de

• Mathematical analysis
• Mathematics
• Approximation theory
• Chebyshev polynomials
• Normal distribution
• Exponentiation
• Bernoulli polynomials
• Proof that is irrational