SearcharxivSearch

arXiv subjects

Noemi Derzsy

Publications and source records attributed to Noemi Derzsy.

4 recordsLinked to original sources

An Interpretable Graph-based Mapping of Trustworthy Machine Learning Research

There is an increasing interest in ensuring machine learning (ML) frameworks behave in a socially responsible manner and are deemed trustworthy. Although considerable progress has been made in the field of Trustworthy ML (TwML) in the recent past, much of the current characterization of this progress is qualitative. Consequently, decisions about how to address issues of trustworthiness and future research goals are often left to the interested researcher. In this paper, we present the first quantitative approach to characterize the comprehension of TwML research. We build a co-occurrence network of words using a web-scraped corpus of more than 7,000 peer-reviewed recent ML papers -- consisting of papers both related and unrelated to TwML. We use community detection to obtain semantic clusters of words in this network that can infer relative positions of TwML topics. We propose an innovative fingerprinting algorithm to obtain probabilistic similarity scores for individual words, then combine them to give a paper-level relevance score. The outcomes of our analysis inform a number of interesting insights on advancing the field of TwML research.

cs.SI

Scaling in Income Inequalities and its Dynamical Origin

We provide an analytically treatable model that describes in a unified manner income distribution for all income categories. The approach is based on a master equation with growth and reset terms. The model assumptions on the growth and reset rates are tested on an exhaustive database with incomes on individual level spanning a nine year period in the Cluj county (Romania). In agreement with our theoretical predictions we find that income distributions computed for several years collapse on a master-curve when a properly normalised income is considered. The Beta Prime distribution is appropriate to fit the collapsed data and it is shown that distributions derived for other countries are following similar trends with different fit parameters. The non-universal feature of the fit parameters suggests that for a more realistic modelling the model parameters have to be linked with specific socio-economic regulations.

q-fin.GN

Evolution of the Global Risk Network Mean-Field Stability Point

With a steadily growing human population and rapid advancements in technology, the global human network is increasing in size and connection density. This growth exacerbates networked global threats and can lead to unexpected consequences such as global epidemics mediated by air travel, threats in cyberspace, global governance, etc. A quantitative understanding of the mechanisms guiding this global network is necessary for proper operation and maintenance of the global infrastructure. Each year the World Economic Forum publishes an authoritative report on global risks, and applying this data to a CARP model, we answer critical questions such as how the network evolves over time. In the evolution, we compare not the current states of the global risk network at different time points, but its steady state at those points, which would be reached if the risk were left unabated. Looking at the steady states show more drastically the differences in the challenges to the global economy and stability the world community had faced at each point of the time. Finally, we investigate the influence between risks in the global network, using a method successful in distinguishing between correlation and causation. All results presented in the paper were obtained using detailed mathematical analysis with simulations to support our findings.

cs.SI

Limits of Predictability of Cascading Overload Failures in Spatially-Embedded Networks with Distributed Flows

Cascading failures are a critical vulnerability of complex information or infrastructure networks. Here we investigate the properties of load-based cascading failures in real and synthetic spatially-embedded network structures, and propose mitigation strategies to reduce the severity of damages caused by such failures. We introduce a stochastic method for optimal heterogeneous distribution of resources (node capacities) subject to a fixed total cost. Additionally, we design and compare the performance of networks with N-stable and (N-1)-stable network-capacity allocations by triggering cascades using various real-world node-attack and node-failure scenarios. We show that failure mitigation through increased node protection can be effectively achieved against single node failures. However, mitigating against multiple node failures is much more difficult due to the combinatorial increase in possible failures. We analyze the robustness of the system with increasing protection, and find that a critical tolerance exists at which the system undergoes a phase transition, and above which the network almost completely survives an attack. Moreover, we show that cascade-size distributions measured in this region exhibit a power-law decay. Finally, we find a strong correlation between cascade sizes induced by individual nodes and sets of nodes. We also show that network topology alone is a weak factor in determining the progression of cascading failures.

physics.soc-ph