Jerzy Kamiński

Mr. Jerzy Kamiński

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
15 July 2023
Verified
Conference Paper
Open access
Jerzy KamińskiJerzy Kamiński
Jerzy Kamiński
IDIrina Deeva
Irina Deeva
The issue of structure learning in large Bayesian networks has gained significant attention from the academic community in recent years due to its wide-ranging applications in various fields. Efficient algorithms for structure learning are crucial for enabling the practical use of Bayesian networks in real-world scenarios where the number of variables can be substantial. In previous approaches, addressing this problem has resulted in either prolonged convergence times or significant degradation of the problem. Although evolutionary algorithms have been effective in training Bayesian Networks (BNs), their application to large BNs has been impractical due to lengthy convergence times. In this paper, we introduce a modified evolutionary algorithm for training large BNs by dividing the network into smaller ones, coding and connecting them through evolutionary optimization. Our proposed approach significantly accelerates the training process, achieving a time acceleration of more than twenty times compared to existing solutions, while maintaining comparable or slightly degraded quality.

1 August 2024 in Scientific and Technical Journal of Information Technologies, Mechanics and Optics
Verified
Journal Article
Open access
PDF file
IDIrina Deeva
Irina Deeva
KSKarine Shakhkyan
Karine Shakhkyan
Jerzy KamińskiJerzy Kamiński
Jerzy Kamiński
The article presents a new approach to modeling nonlinear dependencies called composite Bayesian networks. The main emphasis is on integrating machine learning models into Bayesian networks while maintaining their fundamental principles. The novelty of the approach is that it allows us to solve the problem of data inconsistency with traditional assumptions about dependencies. The presented method consists in selecting a variety of machine learning models at the stage of training composite Bayesian networks. This allows you to flexibly customize the nature of the dependencies in accordance with the requirements and dictated characteristics of the modeled object. The software implementation is made in the form of a specialized framework that describes all the necessary functionality. The results of experiments to evaluate the effectiveness of modeling dependencies between features are presented. Data for the experiments was taken from the bnlearn repository for benchmarks and from the UCI repository for real data. The performance of composite Bayesian networks was validated by comparing the likelihood and F1 score with classical Bayesian networks trained with the Hill-Climbing algorithm, demonstrating high accuracy in representing multivariate distributions. The improvement in benchmarks is insignificant since they contain linear dependencies that are well modeled by the classical algorithm. An average 30 % improvement in likelihood was obtained on real UCI datasets. The obtained data can be applied in areas that require modeling complex dependencies between features, for example, in machine learning, statistics, data analysis, as well as in specific subject areas.

13 July 2026
Verified
Conference Paper
Open access
VAVadim Akhmerov
Vadim Akhmerov
DGDmitry Gilemkhanov
Dmitry Gilemkhanov
Jerzy KamińskiJerzy Kamiński
Jerzy Kamiński
IDIvan Dubrovsky
Ivan Dubrovsky
MZMaria Zaitseva
Maria Zaitseva
NNNikolay Nikitin
Nikolay Nikitin
We investigate the use of large language models (LLMs) as evolutionary operators for optimizing the architecture of multi-agent systems (MAS) - a representative instance of LLM-driven optimization over attributed-graph artifacts that arise in generative design. Given a task description, an initial MAS configuration is generated and then refined on a per-task basis through two optimization strategies: (1) a population-based evolutionary approach where LLMs serve as mutation, crossover, and selection operators, with an LLM-as-a-Judge ensemble providing the surrogate fitness signal; and (2) a simpler iterative regeneration scheme that uses textual feedback from LLM judges to guide single-solution improvement without maintaining a population. We evaluate both approaches on the GAIA benchmark. Our experiments reveal a critical sensitivity to the judge model's quality: a capable judge (Claude 4 Sonnet) yields +14.3 and +6.67 percentage-point accuracy improvements for evolutionary and iterative approaches, respectively, whereas a weaker judge (Gemini-2.5-Flash) provides no benefit or even degrades performance below the unoptimized baseline. Both approaches incur substantial computational costs, raising questions about practical cost-effectiveness. These results highlight fundamental challenges of surrogate fitness functions in LLM-driven evolutionary optimization and offer practical insights for applying evolutionary methods to MAS architecture design.

1 June 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
Jerzy KamińskiJerzy Kamiński
Jerzy Kamiński
IGIlya Galyukshev
Ilya Galyukshev
SCSergey Chuprin
Sergey Chuprin
AKArtem Kuznetsov
Artem Kuznetsov
AKAnna Kalyuzhnaya
Anna Kalyuzhnaya
This paper addresses the critical scalability challenge that large language model agents face when operating over massive tool repositories. As tool catalogs expand to hundreds or thousands of functions, current architectures exhibit substantial performance degradation caused by semantic collisions between similar tools and ineffective handling of complex multi-tool scenarios. To address these bottlenecks, we propose a recall-first Retrieval–Plan–Select (RPS) framework that combines context-aware query decomposition with synthetic tool description augmentation. The proposed approach explicitly separates retrieval, planning, and final selection through step-local candidate generation, while augmented tool descriptions enriched with expanded summaries and synthetic user questions reduce representation collisions in dense embedding spaces. Evaluation across Ultratool, ToolLinkOS, and ToolRet demonstrates that contextual decomposition consistently improves end-to-end recall under large tool catalogs, increasing recall from 0.340 to 0.494 on Ultratool, from 0.208 to 0.323 on ToolLinkOS, and from 0.300 to 0.347 on ToolRet. Description augmentation further improves retrieval quality, increasing Recall@10 from 0.288 to 0.403 and reducing high-similarity semantic collisions by 41.9% at the 0.90 cosine-similarity threshold. The proposed framework highlights that scalable tool use should be approached primarily as a recall-oriented retrieval and planning problem rather than as a flat in-context selection task, providing practical guidance for building large-scale tool-augmented agents over modern API and MCP-based ecosystems.