이 팟캐스트 소개 🔗

진행자:
업데이트 빈도:
monthly
평균 오디오 길이:
48 minutes
영어
미국
에피소드 34 개
2024년 7월 7일부터
episodic

최신 에피소드 🔗

On the 34th episode, we review the 1986 paper, "Learning representations by back-propagating errors" , which was pivotal because it provided a clear, generalized framework for training neural networks with internal 'hidden' units. The core of the procedure, back-propagation, repeatedly adjusts the …

과거 에피소드 검색

Data Science Decoded의 과거 에피소드를 검색하세요.

이전 에피소드

On the 33rd episdoe we review Paul Werbos’s “Applications of Advances in Nonlinear Sensitivity Analysis” which presents efficient methods for computing derivatives in nonlinear systems, drastically reducing computational costs for large-scale models. Werbos, Paul J. "Applications of advances…
We reviewed Richard Bellman’s “A Markovian Decision Process” (1957), which introduced a mathematical framework for sequential decision-making under uncertainty. By connecting recurrence relations to Markov processes, Bellman showed how current choices shape future outcomes and formalized the prin…
On the 31st episode of the podcast, we add Liron to the team, we review a gem from 1921, where Sewall Wright introduced path analysis, mapping hypothesized causal arrows into simple diagrams and proving that any sample correlation can be written as the sum of products of “path coefficients.” By t…
In the 30th episode we review the the bootstrap, method which was introduced by Bradley Efron in 1979, is a non-parametric resampling technique that approximates a statistic’s sampling distribution by repeatedly drawing with replacement from the observed data, allowing estimation of standard errors…
In the 29th episode, we go over the 1979 paper by Gordon Vivian Kass that introduced the CHAID algorithm.CHAID (Chi-squared Automatic Interaction Detection) is a tree-based partitioning method introduced by G. V. Kass for exploring large categorical data sets by iteratively splitting records into m…
In the 28th episode, we go over Burton Bloom's Bloom filter from 1970, a groundbreaking data structure that enables fast, space-efficient set membership checks by allowing a small, controllable rate of false positives.Unlike traditional methods that store full data, Bloom filters use a compact bit …
Mansfield Merriman's 1877 paper traces the historical development of the Method of Least Squares, crediting Legendre (1805) for introducing the method, Adrain (1808) for the first formal probabilistic proof, and Gauss (1809) for linking it to the normal distribution. He evaluates multiple proofs,…
In this episode, we review Cauchy’s 1847 paper, which introduced an iterative method for solving simultaneous equations by minimizing a function using its partial derivatives. Instead of elimination, he proposed progressively reducing the function’s value through small updates, forming an early ver…
At the 24th episode we go over the paper titled:Dempster, Arthur P., Nan M. Laird, and Donald B. Rubin. "Maximum likelihood from incomplete data via the EM algorithm." Journal of the royal statistical society: series B (methodological) 39.1 (1977): 1-22.The Expectation-Maximization (EM) algorithm i…
면책 조항: 이 페이지에 포함된 팟캐스트와 작품은 Mike E에서 가져온 것입니다. 이 팟캐스트는 소유자의 재산이며 Listen Notes, Inc.와 제휴하거나 보증하지 않습니다.