![Page 1: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/1.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Optimization
Pantelis P. Analytis
March 26, 2018
1 / 29
![Page 2: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/2.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
1 Introduction
2 Continuous optimization problems
3 Discrete Problems
4 Collective search for good solutions
2 / 29
![Page 3: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/3.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Convex optimization
The Cobb-Douglas production function (Y = ALβKα)Many of the problems studied across fields are convex innature.Solutions can be calculated analytically, hill climbing isguaranteed to converge to the optimal solution.
3 / 29
![Page 4: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/4.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Local and global extrema
An entire subfield of operations research is dedicated todeveloping optimization algorithm.
They are often evaluated against a testbed of challengingenvironments.
4 / 29
![Page 5: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/5.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Optimizing more challenging functions
5 / 29
![Page 6: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/6.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Optimizing more challenging functions
6 / 29
![Page 7: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/7.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Gradient descent and stochastic gradient descent
xn+1 = xn − γn∇F (xn), n ≥ 0.
F (x0) ≥ F (x1) ≥ F (x2) ≥ · · ·
7 / 29
![Page 8: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/8.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Gradient descent and stochastic gradient descent
F (x , y) = sin(12x
2 − 14y
2 + 3)
cos(2x + 1− ey )
8 / 29
![Page 9: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/9.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Human search in rugged landscapes
Rieskamp, Busemeyer, Laine (2003)
Participants made 100 allocation decision between 3assets.
9 / 29
![Page 10: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/10.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Rieskamp, Busemeyer, Laine (2003)
GLOS model: each allocation has an expectancy andpeople choose probabilistically among them.
LOCAD: probabilistically test another tile in theneighborhood. Move there is that’s better.
10 / 29
![Page 11: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/11.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Rieskamp, Busemeyer, Laine (2003)
GLOS model: each allocation has an expectancy andpeople choose probabilistically among them.LOCAD: probabilistically test another tile in theneighborhood. Move there is that’s better. 11 / 29
![Page 12: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/12.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Optimizing more challenging functions
12 / 29
![Page 13: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/13.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Simulated annealing
Let s = s0
T ← temperature(k/kmax)
Pick a random neighbour, snew ← neighbour(s)
P(s, snew ,T ) :
{1 if snew > s
e(snew−s)/Totherwise
Gradually reduce the temperature T
13 / 29
![Page 14: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/14.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
The shortest path problem
14 / 29
![Page 15: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/15.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
The shortest path problem
15 / 29
![Page 16: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/16.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
How does nature solve the shortest path problem?
At each junction the ants select the way to followprobabilistically.The are more likely to select paths with more pheromone.As pheromone evaporates mediacre paths are much lesslikely to be selected. 16 / 29
![Page 17: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/17.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
How does nature solve the shortest path problem?
17 / 29
![Page 18: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/18.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
The traveling salesman problem
18 / 29
![Page 19: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/19.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
TSP experiment
19 / 29
![Page 20: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/20.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Human performance in the TSP
20 / 29
![Page 21: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/21.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Human performance in the TSP
21 / 29
![Page 22: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/22.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Human performance in the TSP
Numerous experiments. The main paradigm in the humanproblem solving literature.
Humans use an array of heuristics to solve the problem.They often find optimal solutions to small problems, butbehave suboptimaly in larger ones.
22 / 29
![Page 23: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/23.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Evolutionary algorithms
Population of individuals
Mutation (local search)
Crossover (e.g one-point crossover: [0110](1100),(1101)[0111]))
Generations - iterations of improvement
23 / 29
![Page 24: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/24.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
The Knapsack problem
24 / 29
![Page 25: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/25.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Murawski and Bossaerts (2015)
20 participants, solved 8 problems each.
Overall performance came quite close to the optimal,people changed strategies in the course of the experiment.
25 / 29
![Page 26: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/26.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Murawski and Bossaerts (2015)
26 / 29
![Page 27: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/27.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Collective search, innovation and learning (Lazerand Friedman, 2007)
27 / 29
![Page 28: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/28.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Collective search, innovation and learning
Some random search markedly improves performanceLocal search and imitation algorithms get stack to localminima.
28 / 29
![Page 29: Optimization - Cornell University · Introduction Continuous optimization problems Discrete Problems Collective search for good solutions Human performance in the TSP Numerous experiments](https://reader030.vdocuments.us/reader030/viewer/2022041014/5ec535b18b1dc03246646a94/html5/thumbnails/29.jpg)
Optimization
Pantelis P.Analytis
Introduction
Continuousoptimizationproblems
DiscreteProblems
Collectivesearch forgood solutions
Collective search, innovation and learning
In some environments sparser networks lead to betterresults.
29 / 29