Podcast Index
Browse podcasts by category, open recent episodes, and download audio to listen offline.
AI News Daily - Your Daily AI Briefing in 5 Minutes
Pickert GmbH
The Bitcoin Podcast
Corey Petty, Demetrick Ferguson, Jessie Santiago
M365.FM - Modern work, security, and productivity with Microsoft 365
Mirko Peters - Founder of m365.fm, m365.show and m365con.net
Cybersecurity Today
Jim Love
Geek Forever’s Podcast
tharadhol
c’t uplink - der IT-Podcast aus Nerdistan
c’t Magazin
Research Saturday
N2K Networks
Monde Numérique | Actualité Tech & IA
Jerome Colombain
Alt vi kan
TRY
Dad Reviews with @LaneVids
LaneVids
Cybercrime Magazine Podcast
Cybercrime Magazine
AI for Beginners (300 episodes)
A.I. For Beginners
Bitcoin Train Podcast
Federico Rivi
Best AI papers explained
Enoch H. Kang
The AI in Business Podcast
Daniel Faggella
CuriosITy
George Buhnici, Radu Neagu
Les podcasts du Club iGen
MacGeneration
CyberCode Academy
CyberCode Academy
Caffe 2.0
Valentino Spataro
Sospechosos habituales
Sospechosos Habituales
Scientific Insight
Dr. Neetu Prasad
Reflex Podcast
Carlos Castillo
Reflex Podcast
Carlos Castillo y Pistón
Reflections
Livewire Labs
CyberWire Daily
N2K Networks
Offline with Jon Favreau
Crooked Media
TED-Ed
TED-Ed
Superkraft KI News | by Jörg Schieb
Jörg Schieb
Apple Actus 🍏 - Les Actus de la Pomme
Le6lindre
Coach8 教练吧（播客）
Coach8
PC Games Podcast
PC Games
Podcast Patapoe
0d0a
La Tech Made in Italy
Max Brigida
AI Fire Daily
AIFire.co
Runcas180_保管庫 – GEEK_12
Runcas180_保管庫 – GEEK_12
ColdFusion
Dagogo
Technology
Enoch H. Kang
This paper discusses a statistical framework for offline reinforcement learning using trajectory-level supervision, where only final outcomes or preferences are observed rather than step-by-step rewards. The authors intr...
SuperThoughts is a novel framework designed to accelerate the Chain-of-Thought (CoT) reasoning process in large language models by processing tokens in superposition. Unlike traditional models that generate tokens sequen...
This research paper introduces First-Explore Proximal Policy Optimization (FE-PPO), a new reinforcement learning algorithm designed to improve how agents discover rewards in complex, deceptive environments. While standar...
This research paper investigates self-distillation as a powerful regularization technique for pretraining language models when high-quality data is in short supply. By comparing various training strategies across differe...
eta-Harness is an advanced optimization system designed to improve how language-model agents process and compress long interaction histories into useful states. Unlike traditional methods that rely on manual engineering ...
Exploratory RL (ExpRL) is an automated mid-training method designed to enhance the reasoning capabilities of large language models before they undergo standard reinforcement learning. While traditional reinforcement lear...
This paper introduces a statistical framework for making valid scientific discoveries using synthetic data, specifically addressing concerns that artificially generated data can be biased or noisy. The authors propose a ...
This paper establishs that Group Relative Policy Optimization (GRPO), while appearing to use only final outcome rewards, inherently functions as a Process Reward Model (PRM) through its implicit sub-trajectory credit ass...
This paper explores how AI agents inherit and potentially amplify human heterogeneity when tasked with negotiating on behalf of individuals. By comparing agentic interactions to a human-to-human benchmark, the study reve...
This research investigates the nature of attention sinks, which are specific tokens in Transformer models that attract disproportionate attention. The authors reveal that these identical visual patterns actually facilita...
This report from Google DeepMind explores the hypothetical transition from Artificial General Intelligence (AGI), which matches human capability, to Artificial Superintelligence (ASI), which far exceeds it. The authors o...
This research explores whether pairwise comparisons used to rank generative models actually reflect ground-truth accuracy. By converting multiple benchmarks into free-form formats, the authors found that Elo-style rankin...
This paper investigates the critical batch size (CBS) for Large Language Model (LLM) policy optimization, specifically focusing on the GRPO algorithm. The researchers break down gradient noise into inter-prompt and intra...
This paper describes a self-supervised framework called BUMP, which is designed to improve how large language models deliver personalized content. Traditionally, creating user profiles for search and recommendation tasks...
This paper explores the evolution of artificial intelligence through a three-stage framework of augmentation, automation, and reconstruction. The authors argue that while AI currently improves individual tasks, the most ...
The research paper introduces SDAR (Self-Distilled Agentic Reinforcement Learning), a new framework designed to improve the training of large language model agents in complex, multi-turn environments. While standard rein...
This research explores subliminal learning, a phenomenon where a student language model inherits behavioral traits from a teacher model even when trained on semantically unrelated data. The authors demonstrate that this ...
This paper explores a market model where competing firms use subsidies to reduce the cost of product inspection for consumers. Through a subsidy-sorting principle, the authors demonstrate that higher-quality firms natura...
This paper introduces Meta-Harness, an innovative system designed to automate harness engineering for large language models. Unlike traditional methods that rely on manual coding or compressed feedback, this system uses ...
Researchers have developed Bidirectional Evolutionary Search (BES) to overcome the limitations of standard language model sampling, which often struggles with sparse feedback and predictable outputs. While traditional me...
Fill in the form below. Make sure to select both Country and Genres.
Send us a message below. We will get back to you within 24 hours.