Marcin Korecki

Mr. Marcin Korecki

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
6 October 2022 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MKMarcin Korecki
Marcin Korecki
This study investigates how adaptable Machine Learning Traffic Signal control methods are to topological variability. We ask how well can these methods generalize to non-Manhattan-like networks with non-uniform distances between intersections. A Machine Learning method that is highly reliable in various topologies is proposed and compared with state-of-the-art alternatives. Lastly, we analyze the sustainability of different traffic signal control methods based on computational efforts required to achieve convergence and perform training and testing. We show that our method achieves an approximately seven-fold improvement in terms of CO $$_2$$2 emitted in training over the second-best method.

12 April 2023 in IEEE Access
Verified
Journal Article
Open access
MKMarcin Korecki
Marcin Korecki
DDDamian Dailisan
Damian Dailisan
DHDirk Helbing
Dirk Helbing
Data-driven and machine-learning-based methods are increasingly used in attempts to master the challenges of the world. But are they really the best approaches to manage complex dynamical systems? Our aim is to gain more insights into this question by studying various popular reinforcement learning methods for traffic signal control, namely in disrupted scenarios characterized by significant, unpredictable variations. The results are expected to be relevant in subject areas ranging from traffic physics to transportation theory, from dynamics in networks to complex systems, from control theory to self-organization, and from adaptive heuristics to machine learning.

6 April 2023 in Minds and Machines
Verified
Journal Article
Open access
PDF file
CCCesare Carissimo
Cesare Carissimo
MKMarcin Korecki
Marcin Korecki
Optimization is about finding the best available object with respect to an objective function. Mathematics and quantitative sciences have been highly successful in formulating problems as optimization problems, and constructing clever processes that find optimal objects from sets of objects. As computers have become readily available to most people, optimization and optimized processes play a very broad role in societies. It is not obvious, however, that the optimization processes that work for mathematics and abstract objects should be readily applied to complex and open social systems. In this paper we set forth a framework to understand when optimization is limited, particularly for complex and open social systems.

26 February 2024 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Open access
MKMarcin Korecki
Marcin Korecki
DDDamian Dailisan
Damian Dailisan
JYJoshua Yang
Joshua Yang
DHDirk Helbing
Dirk Helbing

27 June 2023 in Entropy
Verified
Journal Article
Open access
PDF file
MKMarcin Korecki
Marcin Korecki
We studied the ability of deep reinforcement learning and self-organizing approaches to adapt to dynamic complex systems, using the applied example of traffic signal control in a simulated urban environment. We highlight the general limitations of deep learning for control in complex systems, even when employing state-of-the-art meta-learning methods, and contrast it with self-organization-based methods. Accordingly, we argue that complex systems are a good and challenging study environment for developing and improving meta-learning approaches. At the same time, we point to the importance of baselines to which meta-learning methods can be compared and present a self-organizing analytic traffic signal control that outperforms state-of-the-art meta-learning in some scenarios. We also show that meta-learning methods outperform classical learning methods in our simulated environment (around 1.5–2× improvement, in most scenarios). Our conclusions are that, in order to develop effective meta-learning methods that are able to adapt to a variety of conditions, it is necessary to test them in demanding, complex settings (such as, for example, urban traffic control) and compare them against established methods.

1 March 2024 in Minds and Machines
Verified
Journal Article
Open access
PDF file
MKMarcin Korecki
Marcin Korecki
GKGuillaume Köstner
Guillaume Köstner
EMEmanuele Martinelli
Emanuele Martinelli
CCCesare Carissimo
Cesare Carissimo
Our goal in this paper is to establish a set of criteria for understanding the meaning and sources of attributing (un)fairness to AI algorithms. To do so, we first establish that (un)fairness, like other normative notions, can be understood in a proper primary sense and in secondary senses derived by analogy. We argue that AI algorithms cannot be said to be (un)fair in the proper sense due to a set of criteria related to normativity and agency. However, we demonstrate how and why AI algorithms can be qualified as (un)fair by analogy and explore the sources of this (un)fairness and the associated problems of responsibility assignment. We conclude that more user-driven AI approaches could alleviate some of these difficulties.