OPTIMIZATION FOR SPARSE AND ACCURATE CLASSIFIERS

OPTIMIZATION FOR SPARSE AND ACCURATE CLASSIFIERS (2010)

Cached

Download Links

[rutcor.rutgers.edu]

by Noam Goldberg

Citations:

1 - 1 self

BibTeX

@MISC{Goldberg10optimizationfor,
    author = {Noam Goldberg},
    title = {OPTIMIZATION FOR SPARSE AND ACCURATE CLASSIFIERS},
    year = {2010}
}

Bookmark

OpenURL

Abstract

Citations

6696	Statistical Learning Theory - Vapnik - 1998
1714	Schapire R: A decision-theoretic generalization of online learning and an application to boosting - Freund - 1997
1493	Vapnik V: Support vector networks - Cortes - 1995
1326	Schapire R: Experiments with a new boosting algorithm - Freund
649	Approximation Algorithms - Vazirani - 2001
607	W: Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statisics - Schapire, Freund, et al. - 1998
554	The strenght of weak learnability - Schapire - 1990
402	Learning with Kernels. Support Vector Machines, Regularization, Optimization, and Beyond - Schölkopf, Smola - 2002
358	Boosting a weak learning algorithm by majority - Freund - 1995
349	UCI Machine Learning Repository - Asuncion, Newman
332	Reducing multiclass to binary: A unifying approach for margin classifiers - Allwein, Schapire, et al. - 2000
296	What size net gives valid generalization - Baum, Haussler - 1989
279	Cryptographic limitations on learning boolean formulae and finite automata - Kearns, Valiant - 1994
242	The boosting approach to machine learning: an overview - Schapire - 2001
230	PL: New Support Vector Algorithms - Schölkopf, AJ, et al.
221	Structural risk minimization over data-dependent hierarchies - Shawe-Taylor, Bartlett, et al. - 1940
207	Sparse approximate solutions to linear systems - Natarajan - 1995
199	Soft margins for AdaBoost - Ratsch, Onoda, et al. - 1998
185	Rademacher and gaussian complexities: Risk bounds and structural - Bartlett, Mendelson - 2002
184	Robust linear programming discrimination of two linearly inseparable sets - Bennett, Mangasarian - 1992
182	Computational limitations on learning from examples - Pitt, Valiant - 1988
171	Y.: Logistic regression, AdaBoost and Bregman distances - Collins, Schapire, et al. - 2002
169	Toward efficient agnostic learning - KEARNS, SCHAPIRE, et al. - 1994
163	Branch-and-price: Column generation for solving huge integer programs - Barnhart, Johnson, et al. - 1998
158	Learning in the presence of malicious errors - Kearns, Li - 1993
156	The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network - Bartlett
146	DR: The analysis of Binary data - Cox - 1970
137	The hardness of approximate optima in lattices, codes, and systems of linear equations - Arora, Babai, et al. - 1993
95	From sparse solutions of systems of equations to sparse modeling of signals and images - Bruckstein, Donoho, et al.
80	Y.: A simple, fast and effective rule learner - Cohen, Singer - 1999
76	The Minimum Description Length Principle - Grünwald - 2007
75	Robust trainability of single neurons - Höffgen, Simon - 1992
69	Linear programming boosting via column generation - Demiriz, Bennett, et al.
67	A linear programming approach to the cutting-stock problem. Operations research - Gilmore, Gomory - 1961
60	Schapire and Yoram Singer. “Improved boosting algorithms using confidence-rated predictions - Robert - 1998
49	Boosting as a regularized path to a maximum margin classifier - Rosset, Zhu, et al. - 2004
45	Linear and nonlinear separation of patterns by linear programming - Mangasarian - 1965
39	Selected topics in column generation - Lübbecke, Desrosiers
38	Misclassification minimization - Mangasarian, L - 1994
36	Logical analysis of numerical data - Boros, Hammer, et al. - 1997
35	Predictive Learning via Rule Ensembles - Friedman, Popescu
34	R.: Classification on proximity data with lp-machines - Graepel, Herbrich, et al. - 1999
33	Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning - Dobkin, Gunopulos, et al. - 1996
31	Smooth boosting and learning with malicious noise - Servedio
28	Boosting with early stopping: convergence and consistency, Annals of Statistics 33 - Zhang, Yu - 2005
26	Combinatorial optimization - Korte, Vygen - 2000
25	Learning boolean formulae or finite automata is as hard as factoring - Kearns, Valiant - 1988
20	A Geometric Framework for Machine Learning - Heath - 1992
18	The Maximum Box Problem and its Application to Data Analysis - Eckstein, Hammer, et al.
17	PAC-MDL bounds - Blum, Langford