\begin{thebibliography}{18}
\expandafter\ifx\csname natexlab\endcsname\relax\def\natexlab#1{#1}\fi
\expandafter\ifx\csname url\endcsname\relax
  \def\url#1{{\tt #1}}\fi

\bibitem[Blake and Merz(1998)]{ML}
C.~L. Blake and C.~J. Merz.
\newblock Repository of machine learning databases.
\newblock [http://www.ics.uci.edu/~mlearn/MLRepository.html]. Irvine, CA:
  University of California, Department of Information and Computer Science.,
  1998.

\bibitem[Breiman(1999)]{bre}
L.~Breiman.
\newblock Prediction games and arcing algorithms.
\newblock {\em Neural Computation}, 11\penalty0 (7):\penalty0 1493--1517, 1999.

\bibitem[Collins et~al.(2000)Collins, Schapire, and Singer]{col}
M.~Collins, R.~E. Schapire, and Y.~Singer.
\newblock Logistic regression, adaboost and bregman distances.
\newblock In {\em Computational Learing Theory}, pages 158--169, 2000.

\bibitem[Donoho et~al.(1995)Donoho, Johnstone, Kerkyacharian, and Picard]{don}
D.~L. Donoho, I.~M. Johnstone, G.~Kerkyacharian, and D.~Picard.
\newblock Wavelet shrinkage: Asymptopia?
\newblock {\em J. R. Statist. Soc. B.}, 57\penalty0 (2):\penalty0 301--337,
  1995.

\bibitem[Efron et~al.(2004)Efron, Hastie, Johnstone, and Tibshirani]{LARS}
B.~Efron, T.~Hastie, I.~M. Johnstone, and R.~Tibshirani.
\newblock Least angle regression.
\newblock {\em Annals of Statistics}, 32\penalty0 (2), 2004.

\bibitem[Freund and Schapire(1995)]{fre}
Y.~Freund and R.~E. Schapire.
\newblock A decision-theoretic generalization of on-line learning and an
  application to boosting.
\newblock In {\em European Conference on Computational Learning Theory}, pages
  23--37, 1995.

\bibitem[Friedman(2001)]{fri}
J.~H. Friedman.
\newblock Greedy function approximation: A gradient boosting machine.
\newblock {\em Annals of Statistics}, 29\penalty0 (5), 2001.

\bibitem[Friedman et~al.(2000)Friedman, Hastie, and Tibshirani]{FHT}
J.~H. Friedman, T.~Hastie, and R.~Tibshirani.
\newblock Additive logistic regression: a statistical view of boosting.
\newblock {\em Annals of Statistics}, 28:\penalty0 337--407, 2000.

\bibitem[Hastie et~al.(2001)Hastie, Tibshirani, and Friedman]{HTF}
T.~Hastie, T.~Tibshirani, and J.~H. Friedman.
\newblock {\em Elements of Statistical Learning}.
\newblock Springer-Verlag, New York, 2001.

\bibitem[Mangasarian(1999)]{MAN}
O.~Mangasarian.
\newblock Arbitrary-norm separating plane.
\newblock {\em Operations Research Letters}, 24(1--2):\penalty0 15--23, 1999.

\bibitem[Mason et~al.(1999)Mason, Baxter, Bartlett, and Frean]{ANY}
L.~Mason, J.~Baxter, P.~Bartlett, and M.~Frean.
\newblock Boosting algorithms as gradient descent.
\newblock In {\em Neural Information Processing Systems}, volume~12, 1999.

\bibitem[R{\"a}tsch et~al.(2001{\natexlab{a}})R{\"a}tsch, Mika, and
  Warmuth]{rat1}
G.~R{\"a}tsch, S.~Mika, and M.~K. Warmuth.
\newblock On the convergence of leveraging.
\newblock NeuroCOLT2 Technical Report~98, Royal Holloway College, London,
  2001{\natexlab{a}}.

\bibitem[R{\"a}tsch et~al.(2001{\natexlab{b}})R{\"a}tsch, Onoda, and
  M{\"u}ller]{rat2}
G.~R{\"a}tsch, T.~Onoda, and K.-R. M{\"u}ller.
\newblock Soft margins for {A}da{B}oost.
\newblock {\em Machine Learning}, 42\penalty0 (3):\penalty0 287--320, March
  2001{\natexlab{b}}.

\bibitem[R\"atsch and Warmuth(2002)]{rat3}
G.~R\"atsch and M.~W. Warmuth.
\newblock Efficient margin maximization with boosting.
\newblock submitted to JMLR, December 2002.

\bibitem[Rosset and Segal(2003)]{ros}
S.~Rosset and E.~Segal.
\newblock Boosting density estimation.
\newblock NIPS-02, 2003.

\bibitem[Schapire et~al.(1998)Schapire, Freund, Bartlett, and Lee]{sch}
R.~E. Schapire, Y.~Freund, P.~Bartlett, and W.~S. Lee.
\newblock Boosting the margin: a new explanation for the effectiveness of
  voting methods.
\newblock {\em Annals of Statistics}, 26:\penalty0 1651--1686, 1998.

\bibitem[Zhang(2003)]{zhang}
T.~Zhang.
\newblock Sequential greedy approximation for certain convex optimization
  problems.
\newblock {\em IEEE Transactions on Information Theory}, 49, 2003.

\bibitem[Zhang and Yu(2003)]{bin}
T.~Zhang and B.~Yu.
\newblock Boosting with early stopping: Convergence and results.
\newblock Techincal report, Dept. of Statistics, Univ. of California, Berkeley,
  2003.

\end{thebibliography}
