arXiv Machine Learning By Marek Gagolewski

Deep R Programming

Read the original on arXiv Machine Learning →

arXiv:2301. 01188v5 Announce Type: replace-cross Abstract: Deep R Programming is a comprehensive and in-depth introductory course on one of the most popular languages for data science.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Sep 17

RLLBC-Lib: An Educational Code Library for Reinforcement Learning and Learning-Based Control

RLLBC-Lib is an educational code library designed to lower the entry barrier for students learning reinforcement learning (RL) in the context of learning-based control. It offers a comprehensive collection of tabular RL methods to reinforce theoretical foundations, followed by a deep RL library that mirrors the same design principles to highlight parallels between simple and state‑of‑the‑art approaches. The library also includes implementations that illustrate core RL principles, contrast RL with other learning‑based control methods, and serve as a foundation for programming assignments with automated grading.

By Bernd Frauenknecht, Emma Cramer, Artur Eisele, Paul Kruse, Lukas Kesper, Jonas Hertrampf, Ramil Sabirov, Jyotirmaya Patra, Johannes Berger, Paul Brunzema, Friedrich Solowjow, Sebastian Trimpe
arXiv Statistics ML
4d ago

Efficient Solvers for SLOPE in R, Python, Julia, and C++

The paper introduces a set of software packages in R, Python, Julia, and C++ that solve the Sorted L-One Penalized Estimation (SLOPE) problem efficiently. The packages employ a hybrid coordinate descent algorithm capable of fitting generalized linear models with various loss functions such as Gaussian, binomial, Poisson, and multinomial logistic regression. They support dense, sparse, and out‑of‑memory data structures, can compute the full SLOPE path, perform cross‑validation (including relaxed SLOPE), and are shown to outperform existing SLOPE implementations in speed on both real and simulated data.

By Johan Larsson, Malgorzata Bogdan, Krystyna Grzesiak, Mathurin Massias, Jonas Wallin