talk-data.com talk-data.com

Event

Data Skeptic

2014-05-23 – 2025-11-23 Podcasts Visit website ↗

Activities tracked

384

The Data Skeptic Podcast features interviews and discussion of topics related to data science, statistics, machine learning, artificial intelligence and the like, all from the perspective of applying critical thinking and the scientific method to evaluate the veracity of claims and efficacy of approaches.

Filtering by: Kyle Polich ×

Sessions & talks

Showing 26–50 of 384 · Newest first

Search within this event →

Do We Need Deep Learning in Time Series

2021-06-16 Listen
podcast_episode
Kyle Polich , Daniela Thyssens (Hildesheim University) , Shereen Elsayed (Hildesheim University)

Shereen Elsayed and Daniela Thyssens, both are PhD Student at Hildesheim University in Germany, come on today to talk about the work "Do We Really Need Deep Learning Models for Time Series Forecasting?"

Detecting Drift

2021-06-11 Listen
podcast_episode
Kyle Polich , Sam Ackerman (IBM Research Labs)

Sam Ackerman, Research Data Scientist at IBM Research Labs in Haifa, Israel, joins us today to talk about his work Detection of Data Drift and Outliers Affecting Machine Learning Model Performance Over Time. Check out Sam's IBM statistics/ML blog at: http://www.research.ibm.com/haifa/dept/vst/ML-QA.shtml  

Darts Library for Time Series

2021-05-31 Listen
podcast_episode

Julien Herzen, PhD graduate from EPFL in Switzerland, comes on today to talk about his work with Unit 8 and the development of the Python Library: Darts. 

Forecasting Principles and Practice

2021-05-24 Listen
podcast_episode
Rob Hyndman (Monash University) , Kyle Polich

Welcome to Timeseries! Today's episode is an interview with Rob Hyndman, Professor of Statistics at Monash University in Australia, and author of Forecasting: Principles and Practices.

Orders of Magnitude

2021-05-07 Listen
podcast_episode

Today's show in two parts. First, Linhda joins us to review the episodes from Data Skeptic: Pilot Season and give her feedback on each of the topics. Second, we introduce our new segment "Orders of Magnitude". It's a statistical game show in which participants must identify the true statistic hidden in a list of statistics which are off by at least an order of magnitude. Claudia and Vanessa join as our first contestants.  Below are the sources of our questions. Heights https://en.wikipedia.org/wiki/Willis_Tower https://en.wikipedia.org/wiki/Eiffel_Tower https://en.wikipedia.org/wiki/GreatPyramidof_Giza https://en.wikipedia.org/wiki/InternationalSpaceStation Bird Statistics Birds in the US since 2000 Causes of Bird Mortality Amounts of Data Our statistics come from this post

They're Coming for Our Jobs

2021-05-03 Listen
podcast_episode

AI has, is, and will continue to facilitate the automation of work done by humans. Sometimes this may be an entire role. Other times it may automate a particular part of their role, scaling their effectiveness. Unless progress in AI inexplicably halts, the tasks done by humans vs. machines will continue to evolve. Today's episode is a speculative conversation about what the future may hold. Co-Host of Squaring the Strange Podcast, Caricature Artist, and an Academic Editor, Celestia Ward joins us today! Kyle and Celestia discuss whether or not her jobs as a caricature artist or as an academic editor are under threat from AI automation. Mentions https://squaringthestrange.wordpress.com/ https://twitter.com/celestiaward The legendary Dr. Jorge Pérez and his work studying unicorns Supernormal stimulus International Society of Caricature Artists Two Heads Studios

Pandemic Machine Learning Pitfalls

2021-04-26 Listen
podcast_episode
Kyle Polich , Derek Driggs (University of Cambridge)

Today on the show Derek Driggs, a PhD Student at the University of Cambridge. He comes on to discuss the work Common Pitfalls and Recommendations for Using Machine Learning to Detect and Prognosticate for COVID-19 Using Chest Radiographs and CT Scans. Help us vote for the next theme of Data Skeptic! Vote here: https://dataskeptic.com/vote

Flesch Kincaid Readability Tests

2021-04-19 Listen
podcast_episode

Given a document in English, how can you estimate the ease with which someone will find they can read it?  Does it require a college-level of reading comprehension or is it something a much younger student could read and understand? While these questions are useful to ask, they don't admit a simple answer.  One option is to use one of the (essentially identical) two Flesch Kincaid Readability Tests.  These are simple calculations which provide you with a rough estimate of the reading ease. In this episode, Kyle shares his thoughts on this tool and when it could be appropriate to use as part of your feature engineering pipeline towards a machine learning objective. For empirical validation of these metrics, the plot below compares English language Wikipedia pages with "Simple English" Wikipedia pages.  The analysis Kyle describes in this episode yields the intuitively pleasing histogram below.  It summarizes the distribution of Flesch reading ease scores for 1000 pages examined from both Wikipedias.  

Fairness Aware Outlier Detection

2021-04-09 Listen
podcast_episode
Kyle Polich , Shubhranshu Shekar (Carnegie Mellon University)

Today on the show we have Shubhranshu Shekar, a Ph. D Student at Carnegie Mellon University, who joins us to talk about his work, FAIROD: Fairness-aware Outlier Detection.

Life May be Rare

2021-04-05 Listen
podcast_episode
Kyle Polich , Dr. Anders Sandburg (Future of Humanity Institute, Oxford University)

Today on the show Dr. Anders Sandburg, Senior Research Fellow at the Future of Humanity Institute at Oxford University, comes on to share his work "The Timing of Evolutionary Transitions Suggest Intelligent Life is Rare." Works Mentioned: Paper: "The Timing of Evolutionary Transitions Suggest Intelligent Life is Rare."by Andrew E Snyder-Beattie, Anders Sandberg, K Eric Drexler, Michael B Bonsall  Twitter: @anderssandburg

Social Networks

2021-03-29 Listen
podcast_episode
Kyle Polich , Mayank Kejriwal (University of Southern California; Information Sciences Institute)

Mayank Kejriwal, Research Professor at the University of Southern California and Researcher at the Information Sciences Institute, joins us today to discuss his work and his new book Knowledge, Graphs, Fundamentals, Techniques and Applications by Mayank Kejriwal, Craig A. Knoblock, and Pedro Szekley. Works Mentioned "Knowledge, Graphs, Fundamentals, Techniques and Applications"by Mayank Kejriwal, Craig A. Knoblock, and Pedro Szekley

The QAnon Conspiracy

2021-03-22 Listen
podcast_episode

QAnon is a conspiracy theory born in the underbelly of the internet.  While easy to disprove, these cryptic ideas captured the minds of many people and (in part) paved the way to the 2021 storming of the US Capital. This is a contemporary conspiracy which came into existence and grew in a very digital way.  This makes it possible for researchers to study this phenomenon in a way not accessible in previous conspiracy theories of similar popularity. This episode is not so much a debunking of this debunked theory, but rather an exploration of the metadata and origins of this conspiracy. This episode is also the first in our 2021 Pilot Season in which we are going to test out a few formats for Data Skeptic to see what our next season should be.  This is the first installment.  In a few weeks, we're going to ask everyone to vote for their favorite theme for our next season.  

Benchmarking Vision on Edge vs Cloud

2021-03-15 Listen
podcast_episode
Somali Chaterji (Purdue University) , Kyle Polich , Karthick Shankar (Carnegie Mellon University)

Karthick Shankar, Masters Student at Carnegie Mellon University, and Somali Chaterji, Assistant Professor at Purdue University, join us today to discuss the paper "JANUS: Benchmarking Commercial and Open-Source Cloud and Edge Platforms for Object and Anomaly Detection Workloads" Works Mentioned: https://ieeexplore.ieee.org/abstract/document/9284314 "JANUS: Benchmarking Commercial and Open-Source Cloud and Edge Platforms for Object and Anomaly Detection Workloads." by: Karthick Shankar, Pengcheng Wang, Ran Xu, Ashraf Mahgoub, Somali ChaterjiSocial Media Karthick Shankar https://twitter.com/karthick_sh Somali Chaterji https://twitter.com/somalichaterji?lang=en https://schaterji.io/

Goodhart's Law in Reinforcement Learning

2021-03-05 Listen
podcast_episode
Hal Ashton (University College London) , Kyle Polich

Hal Ashton, a PhD student from the University College of London, joins us today to discuss a recent work Causal Campbell-Goodhart's law and Reinforcement Learning. "Only buy honey from a local producer." - Hal Ashton   Works Mentioned: "Causal Campbell-Goodhart's law and Reinforcement Learning"by Hal AshtonBook 

"The Book of Why"by Judea PearlPaper

Thanks to our sponsor!  When your business is ready to make that next hire, find the right person with LinkedIn Jobs. Just visit LinkedIn.com/DATASKEPTIC to post a job for free! Terms and conditions apply

Video Anomaly Detection

2021-03-01 Listen
podcast_episode
Kyle Polich , Yuqi Ouyang (University of Warwick)

Yuqi Ouyang, in his second year of PhD study at the University of Warwick in England, joins us today to discuss his work "Video Anomaly Detection by Estimating Likelihood of Representations."Works Mentioned:

Video Anomaly Detection by Estimating Likelihood of Representations https://arxiv.org/abs/2012.01468 by: Yuqi Ouyang, Victor Sanchez

Fault Tolerant Distributed Gradient Descent

2021-02-22 Listen
podcast_episode
Kyle Polich , Nirupam Gupta (EDFL University)

Nirupam Gupta, a Computer Science Post Doctoral Researcher at EDFL University in Switzerland, joins us today to discuss his work "Byzantine Fault-Tolerance in Peer-to-Peer Distributed Gradient-Descent."   Works Mentioned:  https://arxiv.org/abs/2101.12316 Byzantine Fault-Tolerance in Peer-to-Peer Distributed Gradient-Descent by Nirupam Gupta and Nitin H. Vaidya   Conference Details: https://georgetown.zoom.us/meeting/register/tJ0sc-2grDwjEtfnLI0zPnN-GwkDvJdaOxXF

Decentralized Information Gathering

2021-02-15 Listen
podcast_episode
Kyle Polich , Mikko Lauri (University of Hamburg)

Mikko Lauri, Post Doctoral researcher at the University of Hamburg, Germany, comes on the show today to discuss the work Information Gathering in Decentralized POMDPs by Policy Graph Improvements. Follow Mikko: @mikko_lauri

Github https://laurimi.github.io/

Leaderless Consensus

2021-02-05 Listen
podcast_episode
Kyle Polich , Balaji Arun (Virginia Tech)

Balaji Arun, a PhD Student in the Systems of Software Research Group at Virginia Tech, joins us today to discuss his research of distributed systems through the paper "Taming the Contention in Consensus-based Distributed Systems."  Works Mentioned "Taming the Contention in Consensus-based Distributed Systems"  by Balaji Arun, Sebastiano Peluso, Roberto Palmieri, Giuliano Losa, and Binoy Ravindran https://www.ssrg.ece.vt.edu/papers/tdsc20-author-version.pdf "Fast Paxos" by Leslie Lamport  https://link.springer.com/article/10.1007/s00446-006-0005-x

Automatic Summarization

2021-01-29 Listen
podcast_episode
Kyle Polich , Maartje ter Hoeve (University of Amsterdam)

Maartje ter Hoeve, PhD Student at the University of Amsterdam, joins us today to discuss her research in automated summarization through the paper "What Makes a Good Summary? Reconsidering the Focus of Automatic Summarization."  Works Mentioned  "What Makes a Good Summary? Reconsidering the Focus of Automatic Summarization." by Maartje der Hoeve, Juilia Kiseleva, and Maarten de Rijke Contact Email: [email protected] Twitter: https://twitter.com/maartjeterhoeve Website: https://maartjeth.github.io/#get-in-touch

Gerrymandering

2021-01-22 Listen
podcast_episode
Kyle Polich , Brian Brubach (Wellesley College)

Brian Brubach, Assistant Professor in the Computer Science Department at Wellesley College, joins us today to discuss his work "Meddling Metrics: the Effects of Measuring and Constraining Partisan Gerrymandering on Voter Incentives". WORKS MENTIONED: Meddling Metrics: the Effects of Measuring and Constraining Partisan Gerrymandering on Voter Incentives by Brian Brubach, Aravind Srinivasan, and Shawn Zhao

Even Cooperative Chess is Hard

2021-01-15 Listen
podcast_episode

Aside from victory questions like "can black force a checkmate on white in 5 moves?" many novel questions can be asked about a game of chess. Some questions are trivial (e.g. "How many pieces does white have?") while more computationally challenging questions can contribute interesting results in computational complexity theory. In this episode, Josh Brunner, Master's student in Theoretical Computer Science at MIT, joins us to discuss his recent paper Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard. Works Mentioned Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard by Josh Brunner, Erik D. Demaine, Dylan Hendrickson, and Juilian Wellman 1x1 Rush Hour With Fixed Blocks is PSPACE Complete by Josh Brunner, Lily Chung, Erik D. Demaine, Dylan Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff

Consecutive Votes in Paxos

2021-01-11 Listen
podcast_episode
Kyle Polich , Eil Goldweber (University of Michigan)

Eil Goldweber, a graduate student at the University of Michigan, comes on today to share his work in applying formal verification to systems and a modification to the Paxos protocol discussed in the paper Significance on Consecutive Ballots in Paxos. Works Mentioned : Previous Episode on Paxos  https://dataskeptic.com/blog/episodes/2020/distributed-consensus Paper: On the Significance on Consecutive Ballots in Paxos by: Eli Goldweber, Nuda Zhang, and Manos Kapritsos Thanks to our sponsor: Nord VPN : 68% off a 2-year plan and one month free! With NordVPN, all the data you send and receive online travels through an encrypted tunnel. This way, no one can get their hands on your private information. Nord VPN is quick and easy to use to protect the privacy and security of your data. Check them out at nordvpn.com/dataskeptic

Visual Illusions Deceiving Neural Networks

2021-01-01 Listen
podcast_episode
Adrian Martin (University of Pompeu Fabra) , Kyle Polich

Today on the show we have Adrian Martin, a Post-doctoral researcher from the University of Pompeu Fabra in Barcelona, Spain. He comes on the show today to discuss his research from the paper "Convolutional Neural Networks can be Deceived by Visual Illusions." Works Mentioned in Paper: "Convolutional Neural Networks can be Decieved by Visual Illusions." by Alexander Gomez-Villa, Adrian Martin, Javier Vazquez-Corral, and Marcelo Bertalmio Examples: Snake Illusions https://www.illusionsindex.org/i/rotating-snakes Twitter: Alex: @alviur Adrian: @adriMartin13 Thanks to our sponsor! Keep your home internet connection safe with Nord VPN! Get 68% off plus a free month at nordvpn.com/dataskeptic  (30-day money-back guarantee!)

Earthquake Detection with Crowd-sourced Data

2020-12-25 Listen
podcast_episode
Kyle Polich , Suzan van der Lee (Northwestern University) , Omkar Ranadive (NorthWestern University)

Have you ever wanted to hear what an earthquake sounds like? Today on the show we have Omkar Ranadive, Computer Science Masters student at NorthWestern University, who collaborates with Suzan van der Lee, an Earth and Planetary Sciences professor at Northwestern University, on the crowd-sourcing project Earthquake Detective.  Email Links: Suzan: [email protected]  Omkar: [email protected] Works Mentioned:  Paper: Applying Machine Learning to Crowd-sourced Data from Earthquake Detective https://arxiv.org/abs/2011.04740 by Omkar Ranadive, Suzan van der Lee, Vivan Tang, and Kevin Chao Github: https://github.com/Omkar-Ranadive/Earthquake-Detective Earthquake Detective: https://www.zooniverse.org/projects/vivitang/earthquake-detective Thanks to our sponsors! Brilliant.org Is an awesome platform with interesting courses, like Quantum Computing! There is something for you and surely something for the whole family! Get 20% off Brilliant Premium at http://brilliant.com/dataskeptic

Byzantine Fault Tolerant Consensus

2020-12-22 Listen
podcast_episode

Byzantine fault tolerance (BFT) is a desirable property in a distributed computing environment. BFT means the system can survive the loss of nodes and nodes becoming unreliable. There are many different protocols for achieving BFT, though not all options can scale to large network sizes. Ted Yin joins us to explain BFT, survey the wide variety of protocols, and share details about HotStuff.