Sascha Mücke

Sascha Mücke

Auto-generated profile, based on publicly available information

Sascha Mücke

Lamarr Institute TU Dortmund University Dortmund Germany

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 February 2023 in Quantum Machine Intelligence
Verified
Journal Article
Open access
PDF file
SMSascha Mücke
Sascha Mücke
RHRaoul Heese
Raoul Heese
SMSabine Müller
Sabine Müller
MWMoritz Wolter
Moritz Wolter
NPNico Piatkowski
Nico Piatkowski
In machine learning, fewer features reduce model complexity. Carefully assessing the influence of each input feature on the model quality is therefore a crucial preprocessing step. We propose a novel feature selection algorithm based on a quadratic unconstrained binary optimization (QUBO) problem, which allows to select a specified number of features based on their importance and redundancy. In contrast to iterative or greedy methods, our direct approach yields higher-quality solutions. QUBO problems are particularly interesting because they can be solved on quantum hardware. To evaluate our proposed algorithm, we conduct a series of numerical experiments using a classical computer, a quantum gate computer, and a quantum annealer. Our evaluation compares our method to a range of standard methods on various benchmark data sets. We observe competitive performance.

17 December 2024 in Quantum Machine Intelligence
Verified
Journal Article
Open access
PDF file
SMSascha Mücke
Sascha Mücke
TGThore Gerlach
Thore Gerlach
NPNico Piatkowski
Nico Piatkowski
Quadratic unconstrained binary optimization (QUBO) problems are well-studied, not least because they can be approached using contemporary quantum annealing or classical hardware acceleration. However, due to limited precision and hardware noise, the effective set of feasible parameter values is severely restricted. As a result, otherwise solvable problems become harder or even intractable. In this work, we study the implications of solving QUBO problems under limited precision. Specifically, it is shown that the problem’s dynamic range has a crucial impact on the problem’s robustness against distortions. We show this by formalizing the notion of preserving optima between QUBO instances and explore to which extend parameters can be modified without changing the set of minimizing solutions. Based on these insights, we introduce techniques to reduce the dynamic range of a given QUBO instance based on the theoretical bounds of the minimal energy value. An experimental evaluation on random QUBO instances as well as QUBO-encoded BinClustering and SubsetSum problems show that our theoretical findings manifest in practice. Results on quantum annealing hardware show that the performance can be improved drastically when following our methodology.

31 January 2023
Verified
Book Chapter
Closed access
PDF file
RFRaphael Fischer
Raphael Fischer
MJMatthias Jakobs
Matthias Jakobs
SMSascha Mücke
Sascha Mücke
KMKatharina Jutta Morik
Katharina Jutta Morik

21 September 2022 in Frontiers in Artificial Intelligence
Verified
Journal Article
Open access
KMKatharina Jutta Morik
Katharina Jutta Morik
HKHelena Kotthaus
Helena Kotthaus
RFRaphael Fischer
Raphael Fischer
SMSascha Mücke
Sascha Mücke
MJMatthias Jakobs
Matthias Jakobs
DHDanny Heinrich
Danny Heinrich
Machine learning applications have become ubiquitous. Their applications range from embedded control in production machines over process optimization in diverse areas (e.g., traffic, finance, sciences) to direct user interactions like advertising and recommendations. This has led to an increased effort of making machine learning trustworthy. Explainable and fair AI have already matured. They address the knowledgeable user and the application engineer. However, there are users that want to deploy a learned model in a similar way as their washing machine. These stakeholders do not want to spend time in understanding the model, but want to rely on guaranteed properties. What are the relevant properties? How can they be expressed to the stake- holder without presupposing machine learning knowledge? How can they be guaranteed for a certain implementation of a machine learning model? These questions move far beyond the current state of the art and we want to address them here. We propose a unified framework that certifies learning methodsviacare labels. They are easy to understand and draw inspiration from well-known certificates like textile labels or property cards of electronic devices. Our framework considers both, the machine learning theory and a given implementation. We test the implementation's compliance with theoretical properties and bounds.

28 March 2020
Verified
Book Chapter
Closed access
PDF file
SMSascha Mücke
Sascha Mücke
NPNico Piatkowski
Nico Piatkowski
KMKatharina Morik
Katharina Morik

1 April 2023
Verified
Book Chapter
Closed access
PDF file
RHRaoul Heese
Raoul Heese
SMSascha Mücke
Sascha Mücke
MJMatthias Jakobs
Matthias Jakobs
TGThore Gerlach
Thore Gerlach
NPNico Piatkowski
Nico Piatkowski