2 citations · 2 across the 9 of their papers we have counts for
21 papers · 1 filter
Smoothing the Edges: Smooth Optimization for Sparse Regularization using Hadamard Overparametrization
Chris Kolb, Christian L. Müller, Bernd Bischl +1
We present a framework for smooth optimization of explicitly regularized objectives for (structured) sparsity. These non-smooth and possibly non-convex problems typically rely on s…
CASHomon Sets: Efficient Rashomon Sets Across Multiple Model Classes and their Hyperparameters
Fiona Katharina Ewald, Martin Binder, Matthias Feurer +2
Rashomon sets are model sets within one model class that perform nearly as well as a reference model from the same model class. They reveal the existence of alternative well-perfor…
xplainfi: Feature Importance and Statistical Inference for Machine Learning in R
Lukas Burk, Fiona Katharina Ewald, Giuseppe Casalicchio +2
We introduce xplainfi, an R package built on top of the mlr3 ecosystem for global, loss-based feature importance methods for machine learning models. Various feature importance met…
Optimal Transport Group Counterfactual Explanations
Enrique Valero-Leal, Bernd Bischl, Pedro Larrañaga +2
Group counterfactual explanations find a set of counterfactual instances to explain a group of input instances contrastively. However, existing methods either (i) optimize counterf…
Differentiable Sparsity via -Gating: Simple and Versatile Structured Penalization
Chris Kolb, Laetitia Frost, Bernd Bischl +1
Structured sparsity regularization offers a principled way to compact neural networks, but its non-differentiability breaks compatibility with conventional stochastic gradient desc…
TABFAIRGDT: A Fast Fair Tabular Data Generator using Autoregressive Decision Trees
Emmanouil Panagiotou, Benoît Ronval, Arjun Roy +4
Ensuring fairness in machine learning remains a significant challenge, as models often inherit biases from their training data. Generative models have recently emerged as a promisi…