Large margin vs. large volume in transductive learning
From MaRDI portal
Publication:2036258
DOI10.1007/s10994-008-5071-9zbMath1464.68309OpenAlexW2156925633MaRDI QIDQ2036258
Dmitry Pechyony, Vladimir Vapnik, Ran El-Yaniv
Publication date: 28 June 2021
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-008-5071-9
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- A constrained eigenvalue problem
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- 10.1162/153244302760185243
- 10.1162/153244302760200704
- Transductive Rademacher Complexity and Its Applications
- On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
This page was built for publication: Large margin vs. large volume in transductive learning