This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
papers:gasso-2010 [2010/12/28 12:03] leonb |
papers:gasso-2010 [2011/10/12 20:24] (current) leonb [Notes] |
||
|---|---|---|---|
| Line 13: | Line 13: | ||
| <box 99% orange> | <box 99% orange> | ||
| - | Gilles Gasso, Aristidis Pappaioannou, | + | Gilles Gasso, Aristidis Pappaioannou, |
| Preprint: | Preprint: | ||
| Line 26: | Line 26: | ||
| title = {Batch and online learning algorithms for nonconvex {Neyman-Pearson} classification}, | title = {Batch and online learning algorithms for nonconvex {Neyman-Pearson} classification}, | ||
| journal = {ACM Transaction on Intelligent System and Technologies}, | journal = {ACM Transaction on Intelligent System and Technologies}, | ||
| - | | + | |
| + | number = {3}, | ||
| + | year = {2011}, | ||
| url = {http:// | url = {http:// | ||
| } | } | ||
| Line 37: | 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. | ||