|
|
|
Publications in Math-Net.Ru |
Citations |
|
2025 |
| 1. |
V. G. Shishlyakov, “Criteria of expressibility of CPL-functions in generalized bases”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2025, no. 2, 88–90   ; Moscow University Mathematics Bulletin, 80:2 (2025), 148–150 |
|
2023 |
| 2. |
V. G. Shishlyakov, “CPL-functions expressibility by neural circuits on ReLU bases”, Intelligent systems. Theory and applications, 27:1 (2023), 35–78 |
|
2022 |
| 3. |
V. G. Shishlyakov, “Convex CPL-functions recovering by neural networks on RELU-bases”, Intelligent systems. Theory and applications, 26:4 (2022), 173–196 |
1
|
| 4. |
N. Alexiadis, V. S. Polovnikov, A. A. Chasovskikh, V. G. Shishlyakov, “Feedback connection in recurrent circuits”, Intelligent systems. Theory and applications, 26:4 (2022), 51–74  |
| 5. |
V. G. Shishlyakov, “On the construction of an explicit neural network architecture that approximates particle-linear functions”, Intelligent systems. Theory and applications, 26:2 (2022), 42–60 |
2
|
|
2021 |
| 6. |
V. G. Shishlyakov, “Improvements to neural network architecture for approximating particle-linear functions”, Intelligent systems. Theory and applications, 25:4 (2021), 271–274 |
|
| Organisations |
|
|
