Home | News

07.07.2026

Teaser image to Michael Hedderich Featured in the Deutschlandfunk

Michael Hedderich Featured in the Deutschlandfunk

The Interview Highlights the Potential of Small Language Models for a More Efficient and Sustainable AI Future

MCML PI Michael Hedderich was featured in the Deutschlandfunk programme Computer und Kommunikation. In the interview, he discusses how Small Language Models (SLMs) offer an efficient and sustainable alternative to today's increasingly large AI systems.

He explains how smaller models can deliver strong performance while requiring significantly fewer computational resources, making AI more accessible, energy-efficient, and less dependent on large technology providers. The feature also explores the growing role of SLMs in strengthening Europe's technological sovereignty and shaping the future of artificial intelligence.

#media #research #hedderich

Related

Tiny logo
Link to MCML at CIKM 2026

06.11.2026

MCML at CIKM 2026

MCML researchers are represented with 1 paper at CIKM 2026.

Read more
Link to Teaching Language Models to Express Uncertainty

29.10.2026

Teaching Language Models to Express Uncertainty

An ICLR 2026 paper shows how reinforcement learning improves confidence estimates from language models.

Read more
Link to Runner-Up Prize at AutoML 2026 for Tabular-DC-Bench

27.10.2026

Runner-Up Prize at AutoML 2026 for Tabular-DC-Bench

Tabular-DC-Bench, by MCML Junior Member Mamdouh Aljoud and MCML Director Thomas Seidl, among others, won a runner-up prize at AutoML 2026.

Read more
Link to Welcoming Ewa Szczurek to MCML

27.10.2026

Welcoming Ewa Szczurek to MCML

Ewa Szczurek joins MCML as Professor of AI in Life Sciences at LMU, focusing on probabilistic and generative models for medicine.

Read more
Link to Best Paper Award at AIES 2026 for Work on Algorithmic Contestability

26.10.2026

Best Paper Award at AIES 2026 for Work on Algorithmic Contestability

MCML Junior Member Timo Freiesleben received the Best Paper Award at AIES 2026 for his work on algorithmic contestability.

Read more
Back to Top