Ask HN: 什么时候“笨”办法胜过了你用过的复杂方法？
3 分•作者: amadeuswoo•6 个月前
最近构建了一个东西，结果简单的领域特定启发式方法完胜了我原本认为会赢的 fancy 机器学习方法。这让我开始思考，我们是不是经常在更简单的工具就能解决问题的时候，却选择了复杂的工具。这真是奥卡姆剃刀时刻啊。<p>有没有人有类似的经历？很好奇那些“了解你的领域”胜过“堆算力”的案例。
查看原文
Recently built something where simple domain-specific heuristics crushed a fancy ML approach I assumed would win. This has me thinking about how often we reach for complex tools when simpler ones would work better. Occam's razor moments.<p>Anyone have similar stories? Curious about cases where knowing your domain beat throwing compute at the problem.