The cut norm and Sampling Lemmas for unbounded kernels: The cut norm and sampling lemmas for unbounded kernels

Συγγραφείς: Fekete, Panna Tímea, Kunszenti-Kovács, Dávid

Πηγή: Analysis Mathematica. 51:477-514

Θεματικοί όροι: QA Mathematics / matematika, Strong limit theorems, cut norm, Probability (math.PR), Random graphs (graph-theoretic aspects), 0102 computer and information sciences, 01 natural sciences, sampling lemma, Functional Analysis (math.FA), Mathematics - Functional Analysis, Random matrices (probabilistic aspects), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, Inequalities in approximation (Bernstein, Jackson, Nikol'skiĭ-type inequalities), Primary: 60F15, 41A17, 05C80, Secondary: 60B20, unbounded kernel, Mathematics - Probability

Περιγραφή αρχείου: application/xml; text

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2203.07581
https://zbmath.org/8079192
https://doi.org/10.1007/s10476-025-00090-9

A fast training method for OC-SVM based on the random sampling lemma

Συγγραφείς: Wang, Hongbo, Zhao, Guangzhou, Gu, Hong

Πηγή: 2010 Sixth International Conference on Natural Computation Natural Computation (ICNC), 2010 Sixth International Conference on. 2:824-827 Aug, 2010

Relation: 2010 Sixth International Conference on Natural Computation (ICNC)

A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization: A simple sampling lemma: Analysis and applications in geometric optimization

Συγγραφείς: Bernd Gärtner, Emo Welzl

Πηγή: Discrete & Computational Geometry. 25:569-590

Θεματικοί όροι: Computer graphics, computational geometry (digital and algorithmic aspects), random sampling, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, sampling lemma

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://link.springer.com/content/pdf/10.1007%2Fs00454-001-0006-2.pdf
https://zbmath.org/1625935
https://doi.org/10.1007/s00454-001-0006-2