Searcharxiv⌕ Search

arXiv subjects

Maciej Wojtala

Publications and source records attributed to Maciej Wojtala.

3 recordsLinked to original sources

Communication-Enhanced Tutoring for Efficient Decentralized Multi-Agent Reinforcement Learning

Centralized Training with Decentralized Execution (CTDE) is the dominant paradigm in multi-agent reinforcement learning (MARL), enabling agents to act independently at test time while leveraging additional information during training. However, the most prominent methods within CTDE, based on value decomposition, are limited in learning efficiency and final performance by partial observability in both training and execution. To overcome this limitation, in this work, we propose the framework of tutoring: In training, the agents share information in their latent space to develop well-informed policies that achieve strong performance. Then, to recover decentralized execution, these policies concurrently adjust to anticipate lack of communication, and they are distilled into counterparts that rely solely on local observations. We demonstrate the effectiveness of our approach on Hallway, which, to the best of our knowledge, has not been solved before without test-time communication, SMAC under settings more difficult than the standard ones, and SMACv2.

cs.LG↗

Iarrobino's symmetric decomposition for self-dual modules

We generalize Iarrobino's symmetric decomposition for the associated graded algebra of an Artinian Gorenstein algebra to a symmetric decomposition of finite-length self-dual modules over a local algebra, and we deduce consequences for the Hilbert functions of such self-dual modules. We classify the local Hilbert functions for small degree modules. We generalize Kunte's criterion for self-duality in terms of Macaulay's inverse systems.

math.AC↗

Irreversibility of Structure Tensors of Modules

Determining the matrix multiplication exponent $ω$ is one of the greatest open problems in theoretical computer science. We show that it is impossible to prove $ω= 2$ by starting with structure tensors of modules of fixed degree and using arbitrary restrictions. It implies that the same is impossible by starting with $1_A$-generic non-diagonal tensors of fixed size with minimal border rank. This generalizes the work of Bläser and Lysikov [3]. Our methods come from both commutative algebra and complexity theory.

cs.CC↗