HomeVideos

Applications of Optimization

Now Playing

Applications of Optimization

Transcript

656 segments

0:00

Welcome back. So, we are just kicking

0:03

off this boot camp on optimization and

0:06

so I thought I would give a more

0:08

in-depth discussion on some of the many

0:11

many applications of optimization in the

0:13

modern world. Now, this is kind of too

0:16

big of a topic for one lecture or even a

0:18

lecture series. It's like asking you

0:21

know what are the applications of

0:22

calculus or statistics or linear

0:24

algebra. Optimization is everywhere. It

0:28

is ubiquitous in almost every modern

0:31

industrial technology. But I wanted to

0:33

highlight some of the ones that I'm

0:34

going to focus on in particular in this

0:37

lecture series and some of the

0:38

applications that I'm particularly

0:40

motivated by and think are changing the

0:43

fastest and have the biggest

0:45

opportunities in the future. Okay. So uh

0:48

big big categories are going to be

0:50

things like machine learning uh control

0:53

theory and inverse uh inverse problems

0:57

and inverse design. Those are kind of

0:59

the three big areas I'm going to talk

1:01

about. things I'm going to gloss over

1:04

and I'm going to go into, you know,

1:05

specific lectures I might bring these up

1:08

are things like finance, supply chain

1:11

optimization, scheduling, you know, how

1:13

do you make an airline uh have the most

1:16

on-time departures, things like that.

1:18

Those are all really important

1:19

applications of optimization. Making

1:22

sure that you have minimized network

1:24

downtime in, you know, internet traffic

1:27

and things like that. uh optimizing the

1:29

LA traffic network. You know, those are

1:31

all really, really important

1:32

optimization problems. I'm going to

1:34

focus on machine learning, on control

1:36

theory, and on inverse problems and

1:39

design primarily as kind of my

1:41

motivating examples, my lighouses. But

1:44

whatever you're interested in, I can

1:46

almost guarantee optimization has some

1:49

part in it. Okay, so let's start. Um I'm

1:52

going to zoom in to begin with just with

1:54

machine learning. So let's get into to

1:56

machine learning.

1:57

um pretty much any machine learning

2:00

model that you have ever used or that

2:03

you have ever trained used optimization

2:05

under the hood to train that model. So

2:08

generative models uh chatgpt you know

2:11

dolly to uh all the way to really really

2:15

simple models that you would use are um

2:18

all based on optimization. So not all of

2:21

machine learning is neural networks but

2:23

I think this is a nice illustrative uh

2:25

picture that can help us think about how

2:27

optimization applies to machine

2:28

learning. Generally speaking a machine

2:31

learning model is trying to build some

2:33

model between inputs x and outputs y and

2:37

there are some parameters theta you get

2:39

to tune to to tune that function uh to

2:42

capture that input output relationship.

2:45

So this might be you know pictures and

2:47

these might be labels of the pictures or

2:49

something like that. This might be a

2:51

low-res image. This might be a high

2:52

resolution image. Things like that. And

2:56

you know the parameters theta in this

2:58

case would be the parameters of the

3:00

neural network that I get to tune and

3:02

optimize over to get the best model

3:04

approximation possible. Um the weights,

3:07

you know, of all of my uh connections in

3:09

my neural network. This is not an

3:12

optimization problem. This is my

3:13

objective of what I want my machine

3:15

learning model to do. I want to take

3:16

input data X and predict output data Y

3:19

with this function f. I can turn it into

3:22

an optimization problem in the following

3:24

way. So now what I'm going to really try

3:26

to do is I'm going to try to minimize

3:29

the mismatch between my model and actual

3:31

data by minimizing over these free

3:34

parameters data. Now I've turned my

3:36

machine learning training problem into

3:38

an optimization problem. And again under

3:41

the hood all the time anytime you train

3:43

a machine learning model you are doing

3:45

some kind of an optimization probably

3:47

something like stochastic gradient

3:49

ascent using atom in you know pietorch

3:52

or jax or tensorflow. Okay but it is an

3:54

optimization

3:56

problem. Uh the kind of more classic

4:00

historical you know um precursor of

4:04

machine learning is le squares

4:05

regression. So, you know, similarly, I

4:08

might have some model that fits my data

4:10

where I'm trying to to solve for this

4:12

unknown vector of coefficients X in some

4:15

kind of a big linear regression model

4:18

and I'm trying to find that X that

4:19

minimizes the sum of the square of the

4:22

errors over my data. So, this is the

4:24

basis of principal components analysis,

4:26

singular value decomposition,

4:28

dimensionality reduction, factor

4:30

analysis, most of highdimensional

4:32

statistics. And we can do things like

4:35

take highdimensional images either of

4:37

you know physical systems like a fluid

4:39

flow or a person's face and decompose

4:42

them into a minimal number of kind of

4:44

basis features. You could find these

4:47

optimal basis features in some kind of a

4:49

lease squares regression optimization

4:51

procedure. Okay. Again hugely hugely uh

4:55

important in image classification

4:57

reduced order modeling all across the

4:59

board in science and technology. We use

5:01

le squares everywhere. Okay. This is an

5:03

optimization

5:05

problem. Okay, back to to kind of more

5:08

modern machine learning optimizations.

5:10

If I have a neural network, um I have a

5:12

loss function where I'm trying to fit uh

5:15

I'm trying to to build a model that fits

5:17

my data. I've changed my notation a

5:18

little bit here. I could also add

5:21

physics into this neural network

5:23

problem. So that's something I'm very

5:25

concerned about as an engineer is when I

5:27

use machine learning on engineering

5:29

systems, I want to bake in physics that

5:31

I know. You can again do that. You can

5:34

again do that in your optimization

5:36

procedure by adding terms to your loss

5:38

function. This is your loss function,

5:40

your objective function you're you're

5:41

optimizing over. You can add terms that

5:44

says that your um you know your system

5:47

has to be physical. So if you know that

5:49

there's some partial differential

5:50

equation that these variables have to

5:52

adhere to, you can add that in the loss

5:55

function. And with modern machine

5:57

learning training, you can evaluate this

5:59

function. You can compute its gradients.

6:01

you can optimize the weights of your

6:03

neural network um to also minimize this

6:06

loss function as well. Okay, so again um

6:09

really really important in the modern

6:11

era optimization is what allows you to

6:14

encode physics into your machine

6:15

learning

6:17

algorithms. There are other ways. So

6:19

that was by adding a term in the loss

6:21

function and then using classic machine

6:23

learning. There are other approaches

6:24

where you can actually do constrained

6:26

optimization. You can set up constraint

6:28

equations that have to be satisfied for

6:30

your system to be physical. So this is a

6:33

really cool example. I'm going to have a

6:34

whole lecture on this later. Um this was

6:36

inspired by Jean Kristoff Loazo. Um

6:40

trying to model fluid flows using really

6:43

kind of simple generalized linear

6:45

machine learning models. So he's trying

6:47

to get differential equations that

6:48

describe this behavior, this complex

6:51

behavior with a reduced order model. But

6:53

what JC realized is that instead of just

6:56

including this model error, you want

6:58

your machine learning model to have a

6:59

good fit. This is just your fit. Le

7:02

squares fit. He also realized that for

7:05

this to be physical, if you actually

7:07

write down the equations of motion,

7:08

Navier Stokes equations for fluids,

7:11

there are certain constraint equations

7:13

that you can derive on the coefficients

7:15

of this le squares model. So, so we're

7:18

trying to do le squares optimization to

7:20

find these coefficients C. But JC

7:22

pointed out that these coefficients have

7:24

some symmetries that you can encode in

7:27

constraint equations. So now he writes

7:29

this as a

7:31

minimization subject to some

7:33

constraints. In this case, this is the

7:35

lrange multiplier form plus some lrange

7:38

multiplier zrpose times these

7:40

constraints. And that is solvable with

7:44

this KKT constrained le squares

7:46

optimization. So again if you have this

7:49

machine learning problem you're trying

7:50

to build a reduced order model for a

7:52

very very complicated process and you

7:54

have some prior knowledge some

7:56

constraints from physics you can add

7:58

that as a constrained uh optimization

8:01

problem. Okay so again we'll have a

8:02

whole lecture on this but um adding

8:05

physics into machine learning is very

8:07

often done by either adding a loss a

8:09

term in the loss function or adding

8:11

constraint

8:12

equations. Now those constraint

8:14

equations uh very often come up as

8:17

either subspaces or submanifold

8:20

constraints on the feasible set uh of my

8:23

variables x. So what I mean by physics

8:26

and putting physics into machine

8:27

learning usually means symmetry. So we

8:30

are used to seeing this in convolutional

8:33

neural networks. We know that natural

8:34

images have translational symmetry. Um,

8:37

physical systems often have rotational

8:39

symmetries, scale symmetries, and those

8:42

symmetries are uh determined by symmetry

8:45

groups. And those symmetry groups

8:48

determine essentially manifolds that

8:50

constrain the feasible set of X's uh

8:53

that my my machine learning model can be

8:55

optimized over. And so you can again

8:59

either have your minimum error uh term

9:02

in your loss function. You can add terms

9:05

that project onto these manifolds or you

9:08

can actually do a constrained

9:10

optimization where you are minimizing

9:11

the sum of the squares of the error

9:13

subject to your variables being you know

9:16

on this manifold or on this subspace. So

9:20

again um that's kind of this dual notion

9:23

that I can either add penalty terms to

9:25

my loss function or I can add hard

9:27

constraints um in my optimization

9:29

problem. But most of physics is encoded

9:33

in symmetries and invariances like

9:35

rotational symmetry and translational

9:37

symmetry and those are possible to bake

9:40

into your machine learning algorithm

9:42

with uh various optimization techniques

9:45

that we're going to talk about. Good. Um

9:48

okay so machine learning is a huge huge

9:50

category I care about I think about all

9:52

the time in the context of optimization.

9:54

Optimization is the engine that powers

9:57

machine learning. data is the fuel. Um,

10:01

now we're going to zoom into control

10:02

theory. Okay, so control theory is

10:04

another huge category that motivates me

10:06

to study optimization

10:08

theory. So a control problem where you

10:11

have some dynamical system and you have

10:13

you can sense it, you can actuate it.

10:16

Maybe there's disturbances and there's

10:17

some objective or cost function that

10:19

you're trying to optimize over. You're

10:21

trying to design a controller that

10:23

manages all of this that you know uh

10:26

determines the actuators based on the

10:28

sensors to minimize a cost function

10:30

given external disturbances. For

10:32

example, the cruise controller in your

10:34

car or trying to stabilize an inverted

10:36

pendulum or a rocket that's rellanding

10:38

back on Earth. Now, what makes this a

10:41

really really cool optimization problem?

10:43

Almost all control theory can be posed

10:45

as an optimization problem subject to

10:48

the constraints of the dynamics of your

10:50

system. So in the case of a rocket, it's

10:52

like an inverted pendulum. Um the cruise

10:55

controller on your car, your car has

10:57

momentum, you know, inertia, it has

10:58

physics that determine the rules, the

11:01

dynamics that that system has to

11:02

satisfy. So control theory can be

11:05

thought of as a constrained optimization

11:08

problem. You're trying to find the

11:09

control input u maybe the minimum

11:11

control uh to achieve a desired

11:15

objective subject to the constraints of

11:17

the

11:18

dynamics. Reinforcement learning is like

11:22

control theory on steroids where

11:24

nowadays we are using machine learning

11:26

to either learn the controller directly

11:29

or to learn surrogate models of the

11:31

dynamics so that you can speed up uh the

11:34

the reinforcement learning training. But

11:36

again, both of these cases of kind of

11:38

classical control and reinforcement

11:40

learning are under the hood posed as

11:43

optimization problems. So all of the

11:45

robust control toolbox in Python in mat

11:48

lab is basically wrapped around forrren

11:51

codes that were written approximately

11:53

the year I was born that solve linear

11:56

matrix inequality optimization problems.

11:58

Okay, so all of robust and you know

12:01

optimization and control is based on

12:03

these optimization toolboxes.

12:06

And this is changing how we do robotics.

12:09

It's changing how we control fluid

12:11

flows. Lots and lots of systems of

12:14

control systems are advancing because

12:16

our optimization techniques are getting

12:18

much better because we can uh build

12:21

again good surrogate models for the

12:22

forward model or for the controller with

12:25

machine learning and we have powerful

12:27

optimization tools and more data to

12:29

build better controllers. So control

12:32

theory is going to be a huge area again

12:34

a whole chapter and a whole unit in this

12:37

uh this series is going to be on

12:38

optimization for control theory. So

12:41

optimization for machine learning

12:43

optimization for control theory and kind

12:46

of the third big piece I think about all

12:48

the time are inverse problems. So

12:50

inverse problems um and inverse design

12:54

problems. you know, how do I if I have

12:56

some specifications, how do I back out

12:59

the aerodynamic shape and the materials

13:01

and the manufacturing process that will,

13:03

you know, that will satisfy those those

13:05

design criteria? So, in general, inverse

13:08

problems are related to optimization um

13:11

but they're slightly different. So, an

13:13

inverse problem, I would have a forward

13:15

model f ofx and I would have some

13:18

observed data y. I would have some

13:20

observation and I'm trying to back out

13:22

what is the X that is most consistent

13:25

with that forward model and that

13:27

observation Y. You could think of this

13:29

as a Beijian inverse problem. Very often

13:31

we do inverse problems in in statistics

13:33

with B theorem. Uh this is not an

13:37

optimization problem but you can write

13:39

this as an optimization problem by

13:41

trying to find the argument. Again, I

13:43

want to find the X that minimizes the

13:46

mismatch between my model and my

13:48

observations. That's how to turn an

13:50

inverse problem into an optimization

13:52

problem. Okay, inverse problems are

13:55

massive. I'm going to give you just the

13:57

barest hint of some of the applications.

13:59

And again, I'm going to have a whole

14:00

chapter, a whole unit on inverse

14:02

problems and optimization

14:04

later. So, I mean, there's so many it's

14:07

not even uh really fair to have this

14:09

only have a couple of minutes. This is

14:10

going to I'm going to have a whole

14:12

overview video just for inverse problems

14:14

and we're going to have a whole, you

14:15

know, chapter and unit on this. Um, one

14:18

of my favorite examples of this is this

14:21

really cool historical example. So, this

14:24

is a series of four still images from

14:27

the Trinity tests um of the first atomic

14:29

bomb. And these were published in a

14:32

popular science magazine. And the famous

14:36

British physicist GI Taylor took these

14:39

four images. You'll notice here it has,

14:42

you know, what time uh these were

14:45

exposed at. And there's also a little

14:48

distance bar here. It says, you know,

14:49

how large whatever 100 meters is. So, GI

14:53

Taylor took kind of the distance, the

14:55

radius of this uh mushroom cloud over

14:58

time and used dimensional analysis and

15:01

physics to back out the unknown

15:04

quantity, the yield of this bomb just

15:06

from these four images. That's a classic

15:08

example of an inverse problem. I think

15:11

it's a really cool example of

15:13

dimensional analysis, too. But that's

15:15

kind of what we mean. We have observed

15:16

data. How would you back out the yield

15:18

just from this very limited information?

15:20

that's an inverse problem. Um, pretty

15:24

much all of medical imaging is an

15:26

inverse problem. So, um, MRIs and CT

15:30

scans are, you know, there are these 2D

15:33

imaging slices that you take of a

15:35

person's body, usually by shining light

15:38

through an entire section of of flesh

15:41

and bones and integrating over that

15:44

line. And then you have to do some kind

15:46

of an inverse transform, usually like an

15:48

inverse radon transform to get these

15:50

nice clean tomographic images that

15:53

doctors can use to detect cancers or,

15:56

you know, traumatic brain injuries. This

15:58

has revolutionized

16:00

uh the medical profession, medical

16:02

imaging. This is all a massive massive

16:04

inverse problem. The data you have is

16:06

not clean 3D images. It's weird line

16:10

scans through tissue and you have to

16:12

back out the 3D images.

16:15

More recently, one of the most kind of

16:17

exciting examples of this uh we are now

16:20

able to image black holes using

16:23

earthbased satellites or you know

16:25

satellites in earth's orbit. So a

16:28

distributed set of sensors at different

16:30

radio um you know kind of

16:32

electromagnetic frequencies are able to

16:35

stitch together that information and

16:37

piece together these beautiful pictures

16:40

of uh of black holes. And again, that's

16:43

a huge inverse problem. We are not

16:44

measuring this picture. We're measuring

16:47

all kinds of weird direct indirect um

16:49

sorry, we're measuring indirect uh

16:52

pieces of evidence and we have to invert

16:54

that through some model to get the thing

16:56

we want, which is a picture of a black

16:58

hole. So all of these are inverse

17:01

problems. Now, inverse problems uh are

17:05

probably most commonly seen in the

17:07

imaging sciences. So super resolution is

17:10

a great example. If I have a blurry

17:11

image and I want to find what is the

17:13

most likely highresolution image that

17:15

gave that that blurry image, that's

17:17

called super resolution. That's an

17:19

inverse problem. It's ill-posed because

17:21

there are infinitely many high-res

17:23

images that could have given this. And

17:25

so you have to regularize the problem

17:27

with optimization to make this a

17:29

well-posed optimization problem. Now

17:32

inverse problems are, you know, if you

17:35

think about it, actually control theory

17:36

and machine learning are both kind of

17:38

inverse problems. I'm trying to invert

17:40

the model parameters theta or I'm trying

17:43

to invert the control signal you know u.

17:46

And so inverse problems is almost like a

17:48

superset of all of those. But solving

17:51

inverse problems is also improving a lot

17:54

with machine learning. So better forward

17:57

models that you learn with machine

17:58

learning can improve this inverse uh

18:01

problem

18:02

procedure. Okay. So image uh super

18:05

resolution. Another really cool example

18:07

is dnoising or debluring. So if I have

18:10

this movie of a physical flow past a

18:12

cylinder, an inverse problem would be

18:15

could I separate this out into two

18:17

movies? One that has no noise and one

18:19

that just has the noise. This seems too

18:21

good to be true, but modern optimization

18:24

actually makes this possible. This is

18:26

the actual results of an algorithm run

18:28

by Isabelle Shur. Um, and it's

18:31

essentially this is the optimization

18:32

problem you're trying to solve. I'll

18:34

talk more about this. You know, L um is

18:37

low rank, so we're trying to minimize

18:38

the rank of L. S is sparse, so we're

18:41

trying to minimize the zero norm of S.

18:43

This is non-convex, so you actually have

18:46

to convexify it. And then you can solve

18:48

this optimization problem and get this

18:50

kind of amazing uh decomposition. So

18:53

this is an inverse problem. This is the

18:55

power of inverse problems and modern

18:57

optimization. It's all based on

18:58

optimization.

19:01

uh model discovery and physics discovery

19:04

is an ill-posed inverse problem. So I

19:07

have observed data and I want to learn

19:10

what is the best differential equation

19:12

that best describes this and has as few

19:14

terms as possible that's as

19:16

interpretable to a human as possible.

19:18

Again you can write this as an

19:20

optimization problem. You build a

19:21

library. You do le squares regression

19:23

with some regularization terms to make

19:25

your optimization well posed. Now you

19:28

have an optimization problem. model

19:30

discovery is typically posed as an

19:32

optimization problem. This is an inverse

19:34

problem. What model best describes my

19:38

observed time series data? And here's

19:41

kind of a cool movie actually just

19:42

seeing this optimization working. So

19:44

here we're trying to find a simple model

19:47

and a good coordinate system uh for

19:49

model discovery. And you can actually

19:51

see this optimization happening in real

19:53

time. Um this is probably performed in

19:55

like PyTorch or TensorFlow a modern

19:58

machine learning optimization uh

20:00

framework and you can see this kind of

20:02

optimization happening in real

20:06

time. Other really really big categories

20:09

of inverse problems um some inverse

20:11

problems involve really complicated

20:13

physics. So the forward model F might be

20:16

a huge simulation of you know vibrations

20:19

and elastic dynamics in the earth. If

20:22

you're trying to do something like

20:23

seismic inversion, maybe I have

20:25

measurements, uh, you know, seismographs

20:27

at different locations on the earth's

20:29

surface and I want to pinpoint where an

20:31

earthquake occurred and how big it was.

20:34

That is a a constrained inverse problem

20:37

constrained by the partial differential

20:39

equation of, you know, the elastic

20:42

dynamics of Earth and its interior. Very

20:45

very hard problem. Very important

20:47

inverse problem. And again, an inverse

20:49

problem that's being advanced heavily

20:51

with with advanced optimization

20:53

techniques and improved machine learning

20:56

techniques. And all of this culminates

20:59

into better industrial design, better

21:02

industrial processes. You know, those

21:04

are also kind of inverse design

21:06

processes. um you know if I have some

21:08

specifications I want this engine to run

21:10

20% hotter or I want this alloy to be

21:13

20% stronger or have 20% you know higher

21:16

melting point or I want this airplane to

21:18

be 20% more fuel efficient than its

21:21

predecessors those are all really really

21:23

hard opation problems but typically you

21:26

use some kind of inverse design you have

21:28

some forward model either you actually

21:31

build them and test them and iterate

21:32

over your design parameters or you

21:34

simulate them in a computer. Um, but

21:37

that at the end of the day is kind of an

21:39

inverse problem that is heavily rooted

21:41

in optimization. So things like

21:43

aerodynamic shape optimization,

21:44

composite materials or alloys, engine

21:47

performance, all of these are inverse

21:49

design uh,

21:51

optimizations. And again, I've been

21:53

saying that machine learning is helping

21:54

us do better inverse design and better,

21:57

you know, solve these inverse problems

21:58

better. A lot of this culminates in

22:01

what's known as the digital twin where

22:03

you have some device you're trying to

22:04

optimize or control um you know or or

22:08

monitor like an aircraft. You would want

22:10

to have a digital surrogate model that's

22:13

much much cheaper to optimize over much

22:15

cheaper forward model and that's going

22:18

to allow you to use much more powerful

22:20

iterative uh solution techniques to

22:23

solve that inverse problem. If you have

22:24

a cheap digital surrogate model, you can

22:27

do a lot more iterations of that forward

22:29

model to solve this inverse problem of

22:31

for example improving lift or decreasing

22:34

drag or making you know the structure

22:36

stronger or you know more durable things

22:39

like

22:40

that. And so one of the ways I see this

22:42

I'm going to have a whole uh series on

22:45

digital twins and and and this later is

22:48

in the modern world we actually have

22:50

lots of different fidelities of data. If

22:52

I'm trying to design something like an

22:53

aircraft or a race car or really

22:55

anything, I'm going to have different

22:57

fidelities of data both simulations and

23:00

experiments. And what I want to do is I

23:02

want to synthesize that into a better

23:05

forward model. Okay, that is called a

23:07

surrogate model sometimes. Sometimes

23:09

it's called a digital twin. Sometimes

23:11

it's just called a reduced order model.

23:13

This itself requires optimization to

23:16

build this model to synthesize this data

23:18

into the best fit model. That's a

23:20

machine learning problem. And that's an

23:21

optimization problem. But then I would

23:24

want to use this cheap inexpensive

23:26

surrogate model to do my inverse design

23:28

optimization over to to to test in

23:31

simulation what would happen if I

23:32

changed the geometry or I changed the

23:34

material or I made this structure longer

23:36

or shorter. Very expensive to do it here

23:40

very inexpensive to do it here in the

23:41

digital twin. So that's another area

23:44

where optimization uh is really really

23:47

changing how we do engineering is both

23:49

in building these surrogate models with

23:51

machine learning based optimizations and

23:54

then doing actual optimization of real

23:56

physical devices by optimizing over that

23:59

surrogate model. Okay. So um and if you

24:03

are clever sometimes your model will

24:05

have to go get more data. If you're

24:07

optimizing into a region you've never

24:09

seen before you might need more data. So

24:11

that's active learning.

24:12

which is an optimization problem. Okay,

24:15

so that was the mile high view of some

24:17

of my favorite applications of

24:18

optimization. We're going to dig into

24:20

each of these later. Have kind of a

24:22

whole chapter and a whole unit on

24:24

optimization for machine learning,

24:26

optimization for control and

24:28

optimization for inverse problems uh

24:30

more generally. All of that's coming up.

24:33

But that for me is kind of the

24:34

lighthouse set of motivating examples

24:36

when I think of optimization. We're

24:38

going to get pretty into the weeds in

24:39

math, convexity, non-convexity, feasible

24:42

sets, polytopes. You know, we're going

24:43

to do a lot of math so that we can solve

24:46

and understand the structure of these

24:47

optimization problems. But this is why

24:49

we do it. Okay? So that we can solve

24:51

these really important problems. And

24:54

these are all outstanding problems.

24:55

There is room to be improved in every

24:58

single aspect of control theory, of

25:01

machine learning, and of inverse

25:02

problems. So these are going to be

25:04

relevant for decades to come. These

25:06

techniques are going to be valuable. If

25:08

you know how to use optimization in any

25:10

one of these, you're going to be able to

25:12

help, you know, do really, really cool

25:14

things in the future. All right. Thank

25:15

you.

Interactive Summary

This lecture provides an introduction to the vast applications of optimization in the modern world, categorizing them into three core areas: machine learning, control theory, and inverse problems/design. The speaker explains how optimization serves as the underlying engine for training machine learning models, designing control systems for dynamic environments, and solving inverse problems such as medical imaging and model discovery. The presentation highlights that regardless of the field, optimization techniques are essential for encoding physics, handling constraints, and building efficient surrogate models for complex industrial tasks.

Suggested questions

4 ready-made prompts