Talk:Sample complexity
--ManuelRodriguez (talk) 16:19, 25 March 2020 (UTC)Reply
| This is the talk page for discussing improvements to the Sample complexity article. This is not a forum for general discussion of the subject of the article. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Some keypoints for updating the article
- Metric Learning Sample Complexity [3]
- "low Sample Complexity" is more efficient [1]
- Model based Reinforcement learning has a lower sample complexity [2]
- sample complexity of Monte-Carlo Tree Search [4]
- Literature
- [1] Fidelman, Peggy, and Peter Stone. "The chin pinch: A case study in skill learning on a legged robot." Robot Soccer World Cup. Springer, Berlin, Heidelberg, 2006.
- [2] Kurutach, Thanard, et al. "Model-ensemble trust-region policy optimization." arXiv preprint arXiv:1802.10592 (2018).
- [3] Verma, Nakul, and Kristin Branson. "Sample complexity of learning mahalanobis distance metrics." Advances in neural information processing systems. 2015.
- [4] Kaufmann, Emilie, and Wouter M. Koolen. "Monte-carlo tree search by best arm identification." Advances in Neural Information Processing Systems. 2017.
--ManuelRodriguez (talk) 16:19, 25 March 2020 (UTC)
Sample efficiency in Reinforcement learning
Not sure this is the same. It is discissed here as well: https://ai.stackexchange.com/questions/38775/do-the-terms-sample-complexity-and-sample-efficiency-mean-the-same-thing-in I would love to know more. Could somebody add information from a reputable source? Biggerj1 (talk) 19:13, 22 January 2024 (UTC)
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.