This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
papers:gasso-2010 [2011/10/12 20:24] leonb [Batch and online learning algorithms for nonconvex Neyman-Pearson classification] |
papers:gasso-2010 [2011/10/12 20:24] (current) leonb [Notes] |
||
|---|---|---|---|
| Line 28: | Line 28: | ||
| volume = {2}, | volume = {2}, | ||
| number = {3}, | number = {3}, | ||
| - | year = {2011}. | + | year = {2011}, |
| url = {http:// | url = {http:// | ||
| } | } | ||
| Line 39: | Line 39: | ||
| The paper gives two algorithm that perform very well in practice | The paper gives two algorithm that perform very well in practice | ||
| and scale significantly better than the alternatives. | and scale significantly better than the alternatives. | ||
| - | |||
| The appendix gives a number of theoretical results | The appendix gives a number of theoretical results | ||
| about duality in nonconvex optimization problems. | about duality in nonconvex optimization problems. | ||