Competing with the Empirical Risk Minimizer in a Single Pass

author: Roy Frostig, Computer Science Department, Stanford University
published: Aug. 20, 2015,   recorded: July 2015,   views: 2064
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

Many optimization problems that arise in science and engineering are those in which we only have a stochastic approximation to the underlying objective (e.g. estimation problems such as linear regression). That is, given some distribution $\mathcal{D}$ over functions $\psi$, we wish to minimize $P(x) = \mathbb{E}_{\psi \sim \mathcal{D}}[\psi(x)]$, using as few samples from $\mathcal{D}$ as possible. In the absence of computational constraints, the empirical risk minimizer (ERM) -- the minimizer on a sample average of observed data -- is widely regarded as the estimation strategy of choice due to its desirable statistical convergence properties. Our goal is to do as well as the empirical risk minimizer, on every problem, while minimizing the use of computational resources such as running time and space usage.

See Also:

Download slides icon Download slides: colt2015_frostig_risk_minimizer_01.pdf (618.9 KB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: