This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
research:largescale [2012/12/24 11:55] leonb [Approximate Optimization] |
research:largescale [2013/02/25 09:55] leonb [Related] |
||
|---|---|---|---|
| Line 70: | Line 70: | ||
| complexity of the underlying optimization | complexity of the underlying optimization | ||
| algorithms in non-trivial ways. | algorithms in non-trivial ways. | ||
| + | For instance, [[: | ||
| + | appear to be mediocre optimization algorithms and yet are shown to | ||
| + | [[: | ||
| - | |||
| - | For instance, [[: | ||
| - | appear to be mediocre optimization algorithms | ||
| - | and yet are shown to perform extremely well on large-scale learning problems. | ||
| Line 81: | Line 80: | ||
| * NIPS 2007 tutorial " | * NIPS 2007 tutorial " | ||
| + | ===== Related ===== | ||
| + | |||
| + | * [[: | ||
| ===== Papers ===== | ===== Papers ===== | ||
| Line 90: | Line 92: | ||
| [[: | [[: | ||
| </ | </ | ||
| - | |||
| - | ===== See also ===== | ||
| - | |||
| - | * [[stochastic|Learning with Stochastic Gradient Descent]]. | ||
| - | |||