TagGoodhart’s Law
A Case Study in Why Peer Review May Be Unreformable
McIntosh and Hudson Vitale illustrate, by their very zeal to eliminate pro-life researchers, the built-in corruption of the peer review process
The Challenge of Teaching Machines to Generalize
Teaching students simply to pass tests provides a good illustration of the problemsWe want the machine learning algorithms to learn general principles from the data, and not merely little tricks and trivia that that score high but ignore problems.
Read More ›
How You Can Really Know You’re Talking to a Computer
In a lively exchange, computer science experts offer some savvy adviceClaims that a given program has “passed the Turing test” should be treated skeptically because a program can be optimized to pass the Turing test without demonstrating any particular intelligence.
Read More ›
Can Machines Think?
What do computer scientists say about the ability of machines to think? Alan Turing, the father of modern computer science, tackled the question in 1950 and proposed the Turing test as an answer. Is the Turing test important today? Robert J. Marks discusses the Turing test with Dr. George Montañez. Show Notes 00:55 | Introducing Dr. George Montañez, Iris and Read More ›
Why It’s So Hard To Reform Peer Review
Robert J. Marks: Reformers are battling numerical laws that govern how incentives work. Know your enemy!Measurement creates a temptation to achieve a measurable goal by less than totally honest means. As in physics, the simple act of measuring invariably disturbs what you are trying to measure.
Read More ›