Data Skeptic

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:
m.a.terhoeve@uva.nl

Twitter:
https://twitter.com/maartjeterhoeve

Website:
https://maartjeth.github.io/#get-in-touch

Direct download: automatic-summarization.mp3
Category:general -- posted at: 8:00am PDT

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

Direct download: gerrymandering.mp3
Category:general -- posted at: 8:00am PDT

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

Direct download: even-cooperative-chess-is-hard.mp3
Category:general -- posted at: 10:02am PDT

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

Direct download: consecutive-votes-in-paxos.mp3
Category:general -- posted at: 6:00am PDT

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!)

Direct download: visual-illusions-deceiving-neural-networks.mp3
Category:general -- posted at: 6:00am PDT

1