SearcharxivSearch

arXiv subjects

Oleksandr Iaroshenko

Publications and source records attributed to Oleksandr Iaroshenko.

3 recordsLinked to original sources

Binary Operations on Neuromorphic Hardware with Application to Linear Algebraic Operations and Stochastic Equations

Non-von Neumann computational hardware, based on neuron-inspired, non-linear elements connected via linear, weighted synapses -- so-called neuromorphic systems -- is a viable computational substrate. Since neuromorphic systems have been shown to use less power than CPUs for many applications, they are of potential use in autonomous systems such as robots, drones, and satellites, for which power resources are at a premium. The power used by neuromorphic systems is approximately proportional to the number of spiking events produced by neurons on-chip. However, typical information encoding on these chips is in the form of firing rates that unarily encode information. That is, the number of spikes generated by a neuron is meant to be proportional to an encoded value used in a computation or algorithm. Unary encoding is less efficient (produces more spikes) than binary encoding. For this reason, here we present neuromorphic computational mechanisms for implementing binary two's complement operations. We use the mechanisms to construct a neuromorphic, binary matrix multiplication algorithm that may be used as a primitive for linear differential equation integration, deep networks, and other standard calculations. We also construct a random walk circuit and apply it in Brownian motion simulations. We study how both algorithms scale in circuit size and iteration time.

q-bio.NC

Image Compression: Sparse Coding vs. Bottleneck Autoencoders

Bottleneck autoencoders have been actively researched as a solution to image compression tasks. However, we observed that bottleneck autoencoders produce subjectively low quality reconstructed images. In this work, we explore the ability of sparse coding to improve reconstructed image quality for the same degree of compression. We observe that sparse image compression produces visually superior reconstructed images and yields higher values of pixel-wise measures of reconstruction quality (PSNR and SSIM) compared to bottleneck autoencoders. % In addition, we find that using alternative metrics that correlate better with human perception, such as feature perceptual loss and the classification accuracy, sparse image compression scores up to 18.06\% and 2.7\% higher, respectively, compared to bottleneck autoencoders. Although computationally much more intensive, we find that sparse coding is otherwise superior to bottleneck autoencoders for the same degree of compression.

cs.CV

On approximation of Ginzburg-Landau minimizers by $\mathbb S^1$-valued maps in domains with vanishingly small holes

We consider a two-dimensional Ginzburg-Landau problem on an arbitrary domain with a finite number of vanishingly small circular holes. A special choice of scaling relation between the material and geometric parameters (Ginzburg-Landau parameter vs hole radius) is motivated by a recently dsicovered phenomenon of vortex phase separation in superconducting composites. We show that, for each hole, the degrees of minimizers of the Ginzburg-Landau problems in the classes of $\mathbb S^1$-valued and $\mathbb C$-valued maps, respectively, are the same. The presence of two parameters that are widely separated on a logarithmic scale constitutes the principal difficulty of the analysis that is based on energy decomposition techniques.

math.AP