Felix Neutatz

dblp:195/4990 · DBLP profile ↗
← Back
5ranked-venue papers in the field
4as first author
4since 2021 · last 2025
0000-0001-8698-8010ORCID · verified

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 4 (3 first)Information Retrieval & Web Search · 1 (1 first)
YearPublicationVenuePosition
2025 How Green is AutoML for Tabular Data?
Felix Neutatz, Marius Lindauer, Ziawasch Abedjan
EDBT1
2024 AutoML in heavily constrained applications
abstract
Abstract Optimizing a machine learning pipeline for a task at hand requires careful configuration of various hyperparameters, typically supported by an AutoML system that optimizes the hyperparameters for the given training dataset. Yet, depending on the AutoML system’s own second-order meta-configuration, the performance of the AutoML process can vary significantly. Current AutoML systems cannot automatically adapt their own configuration to a specific use case. Further, they cannot compile user-defined application constraints on the effectiveness and efficiency of the pipeline and its generation. In this paper, we proposeCaml, which uses meta-learning to automatically adapt its own AutoML parameters, such as the search strategy, the validation strategy, and the search space, for a task at hand. The dynamic AutoML strategy ofCamltakes user-defined constraints into account and obtains constraint-satisfying pipelines with high predictive performance.
Felix Neutatz, Marius Lindauer, Ziawasch Abedjan
VLDB J.1
2021 Enforcing Constraints for Machine Learning Systems via Declarative Feature Selection: An Experimental Study
abstract
Responsible usage of Machine Learning (ML) systems in practice does not only require enforcing high prediction quality, but also accounting for other constraints, such as fairness, privacy, or execution time. One way to address multiple user-specified constraints on ML systems is feature selection. Yet, optimizing feature selection strategies for multiple metrics is difficult to implement and has been underrepresented in previous experimental studies. Here, we propose Declarative Feature Selection (DFS) to simplify the design and validation of ML systems satisfying diverse user-specified constraints. We benchmark and evaluate a representative series of feature selection algorithms. From our extensive experimental results, we derive concrete suggestions on when to use which strategy and show that a meta-learning-driven optimizer can accurately predict the right strategy for an ML task at hand. These results demonstrate that feature selection can help to build ML systems that meet combinations of user-specified constraints, independent of the ML methods used.
Felix Neutatz, Felix Bießmann, Ziawasch Abedjan
SIGMOD Conference1
2021 Automated Feature Engineering for Algorithmic Fairness
abstract
One of the fundamental problems of machine ethics is to avoid the perpetuation and amplification of discrimination through machine learning applications. In particular, it is desired to exclude the influence of attributes with sensitive information, such as gender or race, and other causally related attributes on the machine learning task. The state-of-the-art bias reduction algorithm Capuchin breaks the causality chain of such attributes by adding and removing tuples. However, this horizontal approach can be considered invasive because it changes the data distribution. A vertical approach would be to prune sensitive features entirely. While this would ensure fairness without tampering with the data, it could also hurt the machine learning accuracy. Therefore, we propose a novel multi-objective feature selection strategy that leverages feature construction to generate more features that lead to both high accuracy and fairness. On three well-known datasets, our system achieves higher accuracy than other fairness-aware approaches while maintaining similar or higher fairness.
Ricardo Salazar, Felix Neutatz, Ziawasch Abedjan
Proc. VLDB Endow.2
2019 ED2: A Case for Active Learning in Error Detection
abstract
State-of-the-art approaches formulate error detection as a semi-supervised classification problem. Recent research suggests that active learning is insufficiently effective for error detection and proposes the usage of neural networks and data augmentation to reduce the number of these user-provided labels. However, we can show that using the appropriate active learning strategy, it is possible to outperform the more complex models that rely on data augmentation. To this end, we propose a multi-classifier approach with two-stage sampling for active learning. This intuitive and neat sampling method chooses the most promising cells across rows and columns for labeling. On three datasets, ED2 achieves state-of-the-art detection accuracy while for large datasets, the required number of user labels is lower by one order of magnitude compared to the state of the art.
Felix Neutatz, Mohammad Mahdavi, Ziawasch Abedjan
CIKM1