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

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

Read the original on arXiv Statistics ML →

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.

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 Statistics ML.

arXiv Machine Learning
Jul 7

Efficient Cross-Validation for Sparse Linear Regression

arXiv:2306. 14851v5 Announce Type: replace-cross Abstract: Given a high-dimensional covariate matrix and a response vector, ridge-regularized sparse linear regression selects a subset of features that explains the relationship between covariates and the response in an interpretable manner.

By Ryan Cory-Wright, Andr\'es G\'omez
arXiv Machine Learning
Jun 29

Mosaic: A Benchmark Suite for Differentiable Physics Solvers

arXiv:2606. 27895v1 Announce Type: cross Abstract: Differentiable partial differential equation (PDE) solvers underpin solver-in-the-loop ML training, gradient-based optimal control, and inverse problems, yet the practical cost of obtaining correct, usable gradients from a given solver on a given problem is largely undocumented.

By Andrin Rehmann, Heiko Zimmermann, Dion H\"afner