PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Steinwart, Ingo"

Author of the publication

copydeleteadd this publication to your clipboard
An Oracle Inequality for Clipped Regularized Risk Minimizers.

, , and . NIPS, page 1321-1328. MIT Press, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. Ingo Steinwart University of Stuttgart

I. Steinwart

Ingo Tischler University of Stuttgart

Ingo Dalcolmo University of Stuttgart

PD Dr. Ingo Hartenbach University of Stuttgart

 

Other publications of authors with the same name

Best-scored Random Forest Classification., , and . CoRR, (2019)Representation of quasi-monotone functionals by families of separating hyperplanes. Mathematische Nachrichten, 290 (11/12): 1859-1883 (2017)A Framework and Benchmark for Deep Batch Active Learning for Regression, , , and . J. Mach. Learn. Res., 24 (164): 1–81 (2023)Which Minimizer Does My Neural Network Converge To?, , and . Machine Learning and Knowledge Discovery in Databases : Research Track, volume 3 of Lecture Notes in Computer Science, page 87-102. Berlin, Springer, (2021)Code for: Fast and Sample-Efficient Interatomic Neural Network Potentials for Molecules and Materials Based on Gaussian Moments, , , and . Software, (2021)Related to: V. Zaverkin, D. Holzmüller, I. Steinwart, and J. Kästner, “Fast and Sample-Efficient Interatomic Neural Network Potentials for Molecules and Materials Based on Gaussian Moments,” J. Chem. Theory Comput. 17, 6658–6670 (2021). doi: 10.1021/acs.jctc.1c00527.Optimal regression rates for SVMs using Gaussian kernels, and . Electronic journal of statistics, (2013)liquidSVM : a fast and versatile SVM package, and . Preprint, (2017)Oracle inequalities for support vector machines that are based on random entropy numbers. Journal of complexity, 25 (5): 437-454 (2009)QP algorithms with guaranteed accuracy and run time for support vector machine, , , and . Journal of machine learning research, 7 (May): 733-769 (2006)On robustness properties of convex risk minimization methods for pattern recognition, and . Journal of machine learning research, 5 (August): 1007-1034 (2004)