Searcharxiv⌕ Search

arXiv subjects

Sebastian Müller

Publications and source records attributed to Sebastian Müller.

At least 37 records · Page 2Linked to original sources

CFIRE: A General Method for Combining Local Explanations

We propose a novel eXplainable AI algorithm to compute faithful, easy-to-understand, and complete global decision rules from local explanations for tabular data by combining XAI methods with closed frequent itemset mining. Our method can be used with any local explainer that indicates which dimensions are important for a given sample for a given black-box decision. This property allows our algorithm to choose among different local explainers, addressing the disagreement problem, \ie the observation that no single explanation method consistently outperforms others across models and datasets. Unlike usual experimental methodology, our evaluation also accounts for the Rashomon effect in model explainability. To this end, we demonstrate the robustness of our approach in finding suitable rules for nearly all of the 700 black-box models we considered across 14 benchmark datasets. The results also show that our method exhibits improved runtime, high precision and F1-score while generating compact and complete rules.

cs.LG↗

Trace formula for quantum chaotic systems with geometrical symmetries and spin

We derive a Gutzwiller-type trace formula for quantum chaotic systems that accounts for both particle spin precession and discrete geometrical symmetries. This formula generalises previous results that were obtained either for systems with spin [1,2] or for systems with symmetries [3,4], but not for a combination of both. The derivation requires not only a combination of methodologies for these two settings, but also the treatment of new effects in the form of double groups and spin components of symmetry operations. The resulting trace formula expresses the level density of subspectra associated to irreducible representations of the group of unitary symmetries in terms of periodic orbits in the system's fundamental domain. We also derive a corresponding expression for the spectral determinant. In a follow-up paper [5] we will show that our formula allows to study the impact of geometrical symmetries and spin on spectral statistics.

math-ph↗

Deterministic Bounds in Committee Selection: Enhancing Decentralization and Scalability in Distributed Ledgers

Consensus plays a crucial role in distributed ledger systems, impacting both scalability and decentralization. Many blockchain systems use a weighted lottery based on a scarce resource such as a stake, storage, memory, or computing power to select a committee whose members drive the consensus and are responsible for adding new information to the ledger. Therefore, ensuring a robust and fair committee selection process is essential for maintaining security, efficiency, and decentralization. There are two main approaches to randomized committee selection. In one approach, each validator candidate locally checks whether they are elected to the committee and reveals their proof during the consensus phase. In contrast, in the second approach, a sortition algorithm decides a fixed-sized committee that is globally verified. This paper focuses on the latter approach, with cryptographic sortition as a method for fair committee selection that guarantees a constant committee size. Our goal is to develop deterministic guarantees that strengthen decentralization. We introduce novel methods that provide deterministic bounds on the influence of adversaries within the committee, as evidenced by numerical experiments. This approach overcomes the limitations of existing protocols that only offer probabilistic guarantees, often providing large committees that are impractical for many quorum-based applications like atomic broadcast and randomness beacon protocols.

cs.DC↗

Ultra-high precision comb-locked terahertz frequency-domain spectroscopy of whispering-gallery modes

We demonstrate the capabilities of a novel frequency-domain terahertz spectrometer based on a comb-locked frequency synthesizer, which provides absolute frequency calibration. The inherent stability and repeatability of the scans allow for the combination of fast data acquisition with an average time-limited signal-to-noise ratio. We demonstrate kilohertz level frequency resolution in terahertz precision spectroscopy of ultrahigh quality whispering-gallery-mode resonators. Spectra covering multiple free spectral ranges (>36GHz) with sub-20kHz resolution are acquired in 5s. We analyse the coupling behaviour and temperature tuning of single resonances and, for the first time, observe minute red and blue shifts of different mode families. The experimental results are supported with finite element simulations.

physics.optics↗

Multilevel Geometric Optimization for Regularised Constrained Linear Inverse Problems

We present a geometric multilevel optimization approach that smoothly incorporates box constraints. Given a box constrained optimization problem, we consider a hierarchy of models with varying discretization levels. Finer models are accurate but expensive to compute, while coarser models are less accurate but cheaper to compute. When working at the fine level, multilevel optimisation computes the search direction based on a coarser model which speeds up updates at the fine level. Moreover, exploiting geometry induced by the hierarchy the feasibility of the updates is preserved. In particular, our approach extends classical components of multigrid methods like restriction and prolongation to the Riemannian structure of our constraints.

math.OC↗

Reality-based UTXO Ledger

The Unspent Transaction Output (UTXO) model is commonly used in the field of Distributed Ledger Technology (DLT) to transfer value between participants. One of its advantages is that it allows parallel processing of transactions, as independent transactions can be added in any order. This property of order invariance and parallelisability has potential benefits in terms of scalability. However, since the UTXO Ledger is an append-only data structure, this advantage is compromised through the presence of conflicting transactions. We propose an extended UTXO Ledger model that optimistically updates the ledger and keeps track of the dependencies of the possible conflicts. In the presence of a conflict resolution mechanism, we propose a method to reduce the extended ledger back to a consistent UTXO Ledger.

cs.DC↗

An Empirical Evaluation of the Rashomon Effect in Explainable Machine Learning

The Rashomon Effect describes the following phenomenon: for a given dataset there may exist many models with equally good performance but with different solution strategies. The Rashomon Effect has implications for Explainable Machine Learning, especially for the comparability of explanations. We provide a unified view on three different comparison scenarios and conduct a quantitative evaluation across different datasets, models, attribution methods, and metrics. We find that hyperparameter-tuning plays a role and that metric selection matters. Our results provide empirical support for previously anecdotal evidence and exhibit challenges for both scientists and practitioners.

cs.LG↗

An attack resilient policy on the tip pool for DAG-based distributed ledgers

This paper discusses congestion control and inconsistency problems in DAG-based distributed ledgers and proposes an additional filter to mitigate these issues. Unlike traditional blockchains, DAG-based DLTs use a directed acyclic graph structure to organize transactions, allowing higher scalability and efficiency. However, this also introduces challenges in controlling the rate at which blocks are added to the network and preventing the influence of spam attacks. To address these challenges, we propose a filter to limit the tip pool size and to avoid referencing old blocks. Furthermore, we present experimental results to demonstrate the effectiveness of this filter in reducing the negative impacts of various attacks. Our approach offers a lightweight and efficient solution for managing the flow of blocks in DAG-based DLTs, which can enhance the consistency and reliability of these systems. Index

cs.CR↗

Mitigation of liveness attacks in DAG-based ledgers

The robust construction of the ledger data structure is an essential ingredient for the safe operation of a distributed ledger. While in traditional linear blockchain systems, permission to append to the structure is leader-based, in Directed Acyclic Graph-based ledgers, the writing access can be organised leaderless. However, this leaderless approach relies on fair treatment of non-referenced blocks, i.e. tips, by honest block issuers. We study the impact of a deviation from the standard tip selection by a subset of block issuers with the aim of halting the confirmation of honest blocks entirely. We provide models on this so-called orphanage of blocks and validate these through open-sourced simulation studies. A critical threshold for the adversary issuance rate is shown to exist, above which the tip pool becomes unstable, while for values below the orphanage decrease exponentially. We study the robustness of the protocol with an expiration time on tips, also called garbage collection, and modification of the parent references per block.

cs.DC↗

TangleSim: An Agent-based, Modular Simulator for DAG-based Distributed Ledger Technologies

DAG-based DLTs allow for parallel, asynchronous writing access to a ledger. Consequently, the perception of the most recent blocks may differ considerably between nodes, and the underlying network properties of the P2P layer have a direct impact on the performance of the protocol. Moreover, the stronger inter-dependencies of several core components demand a more complex and complete approach to studying such DLTs. This paper presents an agent-based, open-sourced simulator for large-scale networks that implement the leaderless Tangle 2.0 consensus protocol. Its scope includes modelling the underlying peer-to-peer communication with network topology, package loss, heterogeneous latency, the gossip protocol with reliable broadcast qualities, the underlying DAG-based data structure, and the consensus protocol. The simulator allows us to explore the performance of the protocol in different network environments, as well as different attack scenarios.

cs.DC↗

Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG

We introduce the theoretical foundations of the Tangle 2.0, a probabilistic leaderless consensus protocol based on a directed acyclic graph (DAG) called the Tangle. The Tangle naturally succeeds the blockchain as its next evolutionary step as it offers features suited to establish more efficient and scalable distributed ledger solutions. Consensus is no longer found in the longest chain but on the heaviest DAG, where PoW is replaced by a stake- or reputation-based weight function. The DAG structure and the underlying Reality-based UTXO Ledger allow parallel validation of transactions without the need for total ordering. Moreover, it enables the removal of the intermediary of miners and validators, allowing a pure two-step process that follows the \emph{propose-vote} paradigm at the node level and not at the validator level. We propose a framework to analyse liveness and safety under different communication and adversary models. This allows providing impossibility results in some edge cases and in the asynchronous communication model. We provide formal proof of the security of the protocol assuming a common random coin.

cs.DC↗

Robustness of the Tangle 2.0 Consensus

In this paper, we investigate the performance of the Tangle 2.0 consensus protocol in a Byzantine environment. We use an agent-based simulation model that incorporates the main features of the Tangle 2.0 consensus protocol. Our experimental results demonstrate that the Tangle 2.0 protocol is robust to the bait-and-switch attack up to the theoretical upper bound of the adversary's 33% voting weight. We further show that the common coin mechanism in Tangle 2.0 is necessary for robustness against powerful adversaries. Moreover, the experimental results confirm that the protocol can achieve around 1s confirmation time in typical scenarios and that the confirmation times of non-conflicting transactions are not affected by the presence of conflicts.

cs.DC↗

Salt-based autopeering for DLT-networks

The security of any Distributed Ledger Technology (DLT) depends on the safety of the network layer. Much effort has been put into understanding the consensus layer of DLTs. However, many network layer designs seem ad-hoc and lack a careful analysis of the influence of the design decisions on the whole DLT system. We propose a salt-based automated neighbor selection protocol that shows the inherent tradeoffs of certain design decisions and allows a quantitative treatment of some network topology requirements. This example may serve as a design framework and facilitate future research. We provide a selection of results from simulations to highlight some tradeoffs in the design decisions.

cs.DC↗

Simulation of self-piercing rivetting processes in fibre reinforced polymers: Material modelling and parameter identification

This paper addresses the numerical simulation of self-piercing rivetting processes to join fibre reinforced polymers and sheet metals. Special emphasis is placed on the modelling of the deformation and failure behaviour of the composite material. Different from the simulation of rivetting processes in metals, which requires the modelling of large plastic deformations, the mechanical response of composites is typically governed by intra- and interlaminar damage phenomena. Depending on the polymeric matrix, viscoelastic effects can interfere particularly with the long-term behaviour of the joint. We propose a systematic approach to the modelling of composite laminates, discuss limitations of the used model, and present details of parameter identification. Homogenisation techniques are applied to predict the mechanical behaviour of the composite in terms of effective anisotropic elastic and viscoelastic material properties. In combination with a continuum damage approach this model represents the deformation and failure behaviour of individual laminae. Cohesive zone elements enable the modelling of delamination processes. The parameters of the latter models are identified from experiments. The defined material model for the composite is eventually utilised in the simulation of an exemplary self-piercing rivetting process.

physics.app-ph↗

Voting-based probabilistic consensuses and their applications in distributed ledgers

We review probabilistic models known as majority dynamics (also known as threshold Voter Models) and discuss their possible applications for achieving consensus in cryptocurrency systems. In particular, we show that using this approach straightforwardly for practical consensus in Byzantine setting can be problematic and requires extensive further research. We then discuss the FPC consensus protocol which circumvents the problems mentioned above by using external randomness.

cs.DC↗

Explainable Machine Learning with Prior Knowledge: An Overview

This survey presents an overview of integrating prior knowledge into machine learning systems in order to improve explainability. The complexity of machine learning models has elicited research to make them more explainable. However, most explainability methods cannot provide insight beyond the given data, requiring additional information about the context. We propose to harness prior knowledge to improve upon the explanation capabilities of machine learning models. In this paper, we present a categorization of current research into three main categories which either integrate knowledge into the machine learning pipeline, into the explainability method or derive knowledge from explanations. To classify the papers, we build upon the existing taxonomy of informed machine learning and extend it from the perspective of explainability. We conclude with open challenges and research directions.

cs.LG↗

Estimations of means and variances in a Markov linear model

Multivariate regression models and ANOVA are probably the most frequently applied methods of all statistical analyses. We study the case where the predictors are qualitative variables, and the response variable is quantitative. In this case, we propose an alternative to the classic approaches that does not assume homoscedasticity but assumes that a Markov chain can describe the covariates' correlations. This approach transforms the dependent covariates using a change of measure to independent covariates. The transformed estimates allow a pairwise comparison of the mean and variance of the contribution of different values of the covariates. We show that under standard moment conditions, the estimators are asymptotically normally distributed. We test our method with data from simulations and apply it to several classic data sets.

stat.AP↗

Committee selection in DAG distributed ledgers and applications

In this paper, we propose several solutions to the committee selection problem among participants of a DAG distributed ledger. Our methods are based on a ledger intrinsic reputation model that serves as a selection criterion. The main difficulty arises from the fact that the DAG ledger is a priori not totally ordered and that the participants need to reach a consensus on participants' reputation. Furthermore, we outline applications of the proposed protocols, including: (i) self-contained decentralized random number beacon; (ii) selection of oracles in smart contracts; (iii) applications in consensus protocols and sharding solutions. We conclude with a discussion on the security and liveness of the proposed protocols by modeling reputation with a Zipf law.

cs.DC↗