Content deleted Content added
No edit summary |
→Out of date: reply |
||
Line 46:
:::: For the above reasons I would like to revert your edits, but I'd prefer to have a discussion about it here first. [[User:PatrickKidger|PatrickKidger]] ([[User talk:PatrickKidger|talk]]) 08:51, 1 July 2020 (UTC)
::::: Thank you for your reply. (i) The fact that your conference paper is now published does not change the fact that it is your own work and so you are biased w.r.t. its importance. Also, being peer-reviewed is only a necessary, but not a sufficient condition to be included. There are several versions of this theorem, so which ones should we present? The general approach of WP is that we present the versions covered by secondary sources (scientific books, university textbooks, survey papers, etc.), even if it means that there is a delay in presenting the latest results. Remember that WP is for a general audience and not only for dedicated researchers of a specific field. (ii) I find Cybenko's proof instructive, but you are welcome to add Pinkus' version, if you think that it is simpler. If it is indeed better for WP readers, then we could remove Cybenko's proof. (iii) The statements of the presented theorems only contain the word "exist" without providing a specific formula for the weights, hence, at least the current formulations of the results are not constructive. Regarding the proofs, some of them are based on variants of the Stone–Weierstrass theorem, which means that they are not constructive. I do not know the proof technique that you used for your theorem, but if it provides an explicit construction for the network (given a target function <math>f</math>), then it would be good to highlight it. Cheers, [[User:Koertefa|''<span style="color:#2F4F4F">'''K'''<span style="color:Teal">œrte</span>'''F'''</span><span style="color:Teal">a</span>'']] [[User talk:Koertefa#top|<span style="color:#2F4F4F">'''{'''<i style="color:Teal">ταλκ</i>'''}'''</span>]] 12:45, 1 July 2020 (UTC)
| |||