Researcher profile

Arkady Gonoskov

Arkady Gonoskov contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 15 - UnverifiedVerification L1Unclaimed author
3works
0followers
4topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

3 published item(s)

preprint2026arXiv

Twincher: Bijective Representation Learning for Robust Inversion of Continuous Systems

Recent advances in AI have been primarily driven by large-scale neural architectures that excel at function approximation, rather than by tailored inductive biases and inference or learning strategies that could be important for resource-efficient real-world perception and planning through the solution of inverse problems. In this work, we consider the possibility of enabling robust inversion of continuous forward processes $p \mapsto y$ by learning representations of $y$ that are bijectively aligned with $p$ while remaining insensitive to perturbations in $y$ caused by noise or model mismatch. We propose Twincher, a class of architectures based on stacks of structured diffeomorphic transformations and tailored adversarial training strategies that enable learning such bijective representations. We provide a public API for training and inference and empirically demonstrate the ability of the proposed architecture to efficiently learn bijective representations of synthetic systems, thereby enabling robust and efficient iterative inverse inference. Compared to a baseline inverse-modeling approach, the method exhibits improved data efficiency and robustness, providing initial evidence for the potential of bijective representation learning in robotics, vision, and physical AI.

preprint2022arXiv

Attaining a strong-field QED signal at laser-electron colliders with optimized focusing

Colliding bunches of high-energy electrons with intense laser pulses provides a basis for studying strong-field QED processes enabled by high values of quantum non-linearity parameter $χ$. Nevertheless, the signal deconvolution is intricate due to probabilistic nature of the processes and shot-to-shot variation of the impact parameter, which disfavors the use of tight focusing. We propose a concept for distinguishing the signal of high-$χ$ emissions that enables the use of optimal focusing to attain the highest $χ\approx 5.25 \left(\varepsilon / (\text{1 GeV})\right)\left(P/(\text{1 PW})\right)^{1/2}\left((\text{1 }μ\text{m})/λ\right)$ for a given electron energy $\varepsilon$, laser power $P$ and wavelength $λ$. Reaching such $χ$ with f/2 focusing requires more than 10 times higher power.

preprint2021arXiv

Optimized computation of tight focusing of short pulses using mapping to periodic space

When a pulsed, few-cycle electromagnetic wave is focused by optics with f-number smaller than two, the frequency components it contains are focused to different regions of space, building up a complex electromagnetic field structure. Accurate numerical computation of this structure is essential for many applications such as the analysis, diagnostics, and control of high-intensity laser-matter interactions. However, straightforward use of finite-difference methods can impose unacceptably high demands on computational resources, owing to the necessity of resolving far-field and near-field zones at sufficiently high resolution to overcome numerical dispersion effects. Here, we present a procedure for fast computation of tight focusing by mapping a spherically curved far-field region to periodic space, where the field can be advanced by a dispersion-free spectral solver. In many cases of interest, the mapping reduces both run time and memory requirements by a factor of order 10, making it possible to carry out simulations on a desktop machine or a single node of a supercomputer. We provide an open-source C++ implementation with Python bindings and demonstrate its use for a desktop machine, where the routine provides the opportunity to use the resolution sufficient for handling the pulses with spectra spanning over several octaves. The described approach can facilitate the stability analysis of theoretical proposals, the studies based on statistical inferences, as well as the overall development and analysis of experiments with tightly-focused short laser pulses.