Search Results

Documents authored by Smale, Steve


Document
Mathematical and Computational Foundations of Learning Theory (Dagstuhl Seminar 11291)

Authors: Matthias Hein, Gabor Lugosi, Lorenzo Rosasco, and Steve Smale

Published in: Dagstuhl Reports, Volume 1, Issue 7 (2011)


Abstract
The main goal of the seminar ``Mathematical and Computational Foundations of Learning Theory'' was to bring together experts from computer science, mathematics and statistics to discuss the state of the art in machine learning broadly construed and identify and formulate the key challenges in learning which have to be addressed in the future. This Dagstuhl seminar was one of the first meetings to cover the full broad range of facets of modern learning theory. The meeting was very successful and all participants agreed that such a meeting should take place on a regular basis.

Cite as

Matthias Hein, Gabor Lugosi, Lorenzo Rosasco, and Steve Smale. Mathematical and Computational Foundations of Learning Theory (Dagstuhl Seminar 11291). In Dagstuhl Reports, Volume 1, Issue 7, pp. 53-69, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@Article{hein_et_al:DagRep.1.7.53,
  author =	{Hein, Matthias and Lugosi, Gabor and Rosasco, Lorenzo and Smale, Steve},
  title =	{{Mathematical and Computational Foundations of Learning Theory (Dagstuhl Seminar 11291)}},
  pages =	{53--69},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{7},
  editor =	{Hein, Matthias and Lugosi, Gabor and Rosasco, Lorenzo and Smale, Steve},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.7.53},
  URN =		{urn:nbn:de:0030-drops-33093},
  doi =		{10.4230/DagRep.1.7.53},
  annote =	{Keywords: learning theory, machine learning, sparsity, high-dimensional geometry, manifold learning, online learning}
}
Document
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242)

Authors: Erich Novak, Steve Smale, and Joseph F. Traub

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)


Abstract

Cite as

Erich Novak, Steve Smale, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242). Dagstuhl Seminar Report 50, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1992)


Copy BibTex To Clipboard

@TechReport{novak_et_al:DagSemRep.50,
  author =	{Novak, Erich and Smale, Steve and Traub, Joseph F.},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9242)}},
  pages =	{1--24},
  ISSN =	{1619-0203},
  year =	{1992},
  type = 	{Dagstuhl Seminar Report},
  number =	{50},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.50},
  URN =		{urn:nbn:de:0030-drops-149383},
  doi =		{10.4230/DagSemRep.50},
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail