nlprmtr retweeted
The problem in AI is that the PhD students we've trained in the last decade are extremely narrow, and will have trouble contributing once the current wave passes.
nlprmtr retweeted
Marine Le Pen is CURRENTLY the front runner to be the next President of France if they held the elections today. So what did the left in France do? They just banned her from running and sentenced her to 4 years in prison on BS charges.
The left did this to Bolsonaro, Trump, Imran Khan, Matteo Salvini, Calin Georgescu and more. Why? Populists beat them and the modern left are criminals who will do ANYTHING to win.
There should be blanket economic sanctions on the elite leftists in France until this stops.
nlprmtr retweeted
Is this normal in your countries? A president that continues to lie even if he has been corrected a hundred times on these numbers.
In Denmark, people dont like being told lies. Voters punish it. Why do Americans accept and vote for it? I dont get it.
nlprmtr retweeted
Begging AI companies to stop using the meaningless term “PhD-level” in their marketing.
nlprmtr retweeted
If your research consists of doing the same hacks that people in industry can do at any time, then it’s not research. Research is solving problems that are too deep, difficult, long-term, diffusely beneficial for industry to focus on.
nlprmtr retweeted
Yet another award for plagiarism. Of all the papers that could have won the #NeurIPS2024 Test of Time Award, it had to be the #NeurIPS 2014 paper on "Generative Adversarial Networks" [GAN1]. This is the notorious paper that republished the 1990 principle of Artificial Curiosity [AC90,AC90b,AC20,AC][R2] under a new name without citing it. See references [AC90,AC90b] (1990-91) that were published when compute was about 100,000 times more expensive than in 2014: two neural nets (NNs) fight each other. A control network with adaptive stochastic Gaussian units (a generative model) generates output data. This output is fed into a predictor NN which learns by gradient descent to predict the effects of the outputs. However, in a minimax game, the first NN maximizes the loss minimized by the second NN. See Section "Implementing Dynamic Curiosity and Boredom" of [AC90,AC90b]: it mentions preliminary experiments where (in absence of external reward) the predictor minimizes a linear function of what the generator maximizes.
Even later surveys by the authors failed to cite the original work [DLP].
One year later, in 1991, there was also another 2-network adversarial system called "Predictability Minimization" [PM0,PM1] for creating disentangled representations. The 2014 GAN paper [GAN1] cites it, but wrongly claims that PM is NOT a minimax game. However, PM experiments from 1991 [PM0,PM1] and 1996 [PM2] (with images) are of the minimax type. The 2014 GAN authors have never corrected their 2014 paper [DLP].
There is a peer-reviewed journal publication on this priority dispute [AC20]. (Other early adversarial machine learning settings since 1959 [S59][H90] were very different - they neither involved self-supervised NNs where one NN sees the output of another generative NN and tries to predict its consequences, nor were about modeling data, nor used gradient descent [AC20].)
Of course, it is well known that plagiarism can be either "unintentional" or "intentional or reckless" [PLAG1-6], and the more innocent of the two may very well be partially the case here [NOB][DLP]. But science has a well-established way of dealing with "multiple discovery" and plagiarism - be it unintentional [PLAG1-6][CONN21] or not [FAKE,FAKE2] - based on facts such as time stamps of publications and patents. The deontology of science requires that unintentional plagiarists correct their publications through errata and then credit the original sources properly in the future. The awardees didn't; instead the awardees kept collecting citations for inventions of other researchers [DLP]. Isn't this behaviour intentional plagiarism as it turns even unintentional plagiarism [PLAG1-6] into an intentional form [FAKE2][NOB][DLP]?
Some people have lost their titles or jobs due to plagiarism. Harvard's former president resigned after some drama [PLAG7][NOB]. But how can advisors from the field of Machine Learning now continue to tell their PhD students that they should avoid plagiarism?
REFERENCES
[GAN1] I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, Y. Bengio. Generative adversarial nets. NIPS 2014, 2672-2680, Dec 2014. A description of GANs that does not cite J. Schmidhuber's original GAN principle of 1990 [AC90,AC90b][AC20][AC][DLP] (also containing wrong claims about J. Schmidhuber's separate adversarial NNs for Predictability Minimization [PM1-2][AC20][DLP]).
[AC90] J. Schmidhuber. Making the world differentiable: On using self-supervised fully recurrent neural networks for dynamic reinforcement learning and planning in non-stationary environments. Technical Report FKI-126-90, TUM, Feb 1990, revised Nov 1990. The first paper on planning with reinforcement learning recurrent neural networks (NNs) and on generative adversarial networks where a generator NN is fighting a predictor NN in a minimax game.
[AC90b] J. Schmidhuber. A possibility for implementing curiosity and boredom in model-building neural controllers. In J. A. Meyer and S. W. Wilson, editors, Proc. of the International Conference on Simulation of Adaptive Behavior: From Animals to Animats, pages 222-227. MIT Press/Bradford Books, 1991. Based on [AC90].
[AC20] J. Schmidhuber. Generative Adversarial Networks are Special Cases of Artificial Curiosity (1990) and also Closely Related to Predictability Minimization (1991). Neural Networks, Volume 127, p 58-66, 2020.
[AC] J. Schmidhuber (AI Blog, 2021). Artificial Curiosity & Creativity Since 1990-91.
[PM0] J. Schmidhuber. Learning factorial codes by predictability minimization. TR CU-CS-565-91, Univ. Colorado at Boulder, 1991.
[PM1] J. Schmidhuber. Learning factorial codes by predictability minimization. Neural Computation, 4(6):863-879, 1992.
[PM2] J. Schmidhuber, M. Eldracher, B. Foltin. Semilinear predictability minimzation produces well-known feature detectors. Neural Computation, 8(4):773-786, 1996.
[R2] Reddit/ML, 2019. J. Schmidhuber really had GANs in 1990.
[S59] A. L. Samuel. Some studies in machine learning using the game of checkers. IBM Journal on Research and Development, 3:210-229, 1959.
[H90] W. D. Hillis. Co-evolving parasites improve simulated evolution as an optimization procedure. Physica D: Nonlinear Phenomena, 42(1-3):228-234, 1990.
[DLP] J. Schmidhuber (2023). How 3 Turing awardees republished key methods and ideas whose creators they failed to credit. Technical Report IDSIA-23-23, Swiss AI Lab IDSIA, 14 Dec 2023.
[NOB] J. Schmidhuber (Dec 2024). A Nobel Prize for Plagiarism. Technical Report IDSIA-24-24. Sadly, the Nobel Prize in Physics 2024 for Hopfield & Hinton is a Nobel Prize for plagiarism. They republished methodologies developed in Ukraine and Japan by Ivakhnenko and Amari in the 1960s & 1970s, as well as other techniques, without citing the original papers. Even in later surveys, they didn't credit the original inventors (thus turning what may have been unintentional plagiarism into a deliberate form). None of the important algorithms for modern Artificial Intelligence were created by Hopfield & Hinton.
[PLAG1] Oxford's guide to types of plagiarism (2021). Quote: "Plagiarism may be intentional or reckless, or unintentional."
[PLAG2] Jackson State Community College (2022). Unintentional Plagiarism.
[PLAG3] R. L. Foster. Avoiding Unintentional Plagiarism. Journal for Specialists in Pediatric Nursing; Hoboken Vol. 12, Iss. 1, 2007.
[PLAG4] N. Das. Intentional or unintentional, it is never alright to plagiarize: A note on how Indian universities are advised to handle plagiarism. Perspect Clin Res 9:56-7, 2018.
[PLAG5] InfoSci-OnDemand (2023). What is Unintentional Plagiarism?
[PLAG6] Copyrighted dot com (2022). How to Avoid Accidental and Unintentional Plagiarism (2023). Quote: "May it be accidental or intentional, plagiarism is still plagiarism."
[PLAG7] Cornell Review, 2024. Harvard president resigns in plagiarism scandal. 6 January 2024.
[FAKE] H. Hopf, A. Krief, G. Mehta, S. A. Matlin. Fake science and the knowledge crisis: ignorance can be fatal. Royal Society Open Science, May 2019. Quote: "Scientists must be willing to speak out when they see false information being presented in social media, traditional print or broadcast press" and "must speak out against false information and fake science in circulation and forcefully contradict public figures who promote it."
[FAKE2] L. Stenflo. Intelligent plagiarists are the most dangerous. Nature, vol. 427, p. 777 (Feb 2004). Quote: "What is worse, in my opinion, ..., are cases where scientists rewrite previous findings in different words, purposely hiding the sources of their ideas, and then during subsequent years forcefully claim that they have discovered new phenomena."
nlprmtr retweeted
I feel bad for all the people working day and night to produce minor tweaks to LLMs that will soon be obsolete.
nlprmtr retweeted
Your brain consumes 20 W of power. A single GPU consumes a kilowatt. A data center has tens of thousands of them, and is still not as powerful as your brain. Chew on that before you say AGI is imminent.
nlprmtr retweeted
There’s so much noise in AI today that even if you solved it it would take a while to get noticed.
People will soon try “Natural Learning” on their data, before any machine learning algorithm. Don’t fall behind. Learn more about it now: natural-learning.cc
#machinelearning
28
natural-learning.cc awards a $10,000 prize to anyone who names a classifier that does the following task.
Download the Dataset: github.com/NaturalLearning/-…
#machinelearning
#deeplearning
#artificialintelligence
#CancerResearch
#Omics
25
Natural learning is the first machine learning algorithm that emulates brain's system 1's quick categorization capacity. #DeepLearning #ArtificiallIntelligence
natural-learning.cc
19
$5000 prize: name a machine learning algorithm that can make prediction with above 99% accuracy on MNIST (0 vs. 1) by just using 3 pixels and 2 samples from train set. #MachineLearning #Artifi natural-learning.cc
24
Revolution in machine learning sparsity: 2 samples and three genes are enough to make 98% accurate predictions. natural-learning.cc
#AI #MachineLearning
32
nlprmtr retweeted
25 algorithms every programmer should know:
Let's start with my top favorite 10. If nothing else, you should read about these algorithms and have a good idea of how they work:
1. Linear search to find an element in a list
2. Binary search to find an element on a sorted list
3. Bubble sort to sort a list
4. Merge sort will also sort lists
5. Quicksort to sort the list and do it fast
6. Dijkstra to find the shortest path in a graph
7. Breadth-first Search (BFS) for trees or graphs
8. Depth-first search (DFS) for trees or graphs
9. Huffman for doing data compression
10. Anything related to dynamic programming
Learning about algorithms is like getting tattoos: you never have enough. Here are another 5 algorithms that will help you go beyond the basics:
11. Kruskal for the finding minimum spanning tree
12. Floyd Warshall, shortest paths in a graph
13. Union Find to detect cycles in a graph
14. Bellman-Ford, shortest path in a graph
15. Lee for finding the shortest path in a maze
If you are serious about this topic, I recommend learning about algorithms' space and time complexity. People usually refer to this topic as "Big O" notation. You should build a good intuition about the performance of different algorithms and learn how to evaluate them.
Machine Learning will rule the next 50 years, so the next 10 algorithms you can't ignore are the following:
16. Linear Regression
17. Logistic Regression
18. Decision Trees
19. Bayes' theorem
20. k-Nearest Neighbors (kNN)
21. Every algorithm related to neural networks
22. K-means
23. Random forest
24. Gradient boosting algorithms
25. Any dimensionality reduction algorithm (PCA, for instance)
There are many more mind-blowing algorithms! I haven't found a better way to understand how computers work from a first-principles point of view than reading about different algorithms.
Take a look at the attached video.
Two sides of World War 3
Green vs. Red/Yellow/Dark
#RussiaUkraine #Ukriane
1
Let's use "Ministry of War" to refer "Russian ministry of defense" from now on. #Ukraine #UkraineRussiaWar














