Search arXivSearch

arXiv · 2206.01820

A Robust Backpropagation-Free Framework for Images

Abstract

While current deep learning algorithms have been successful for a wide variety of artificial intelligence (AI) tasks, including those involving structured image data, they present deep neurophysiological conceptual issues due to their reliance on the gradients that are computed by backpropagation of errors (backprop). Gradients are required to obtain synaptic weight adjustments but require knowledge of feed-forward activities in order to conduct backward propagation, a biologically implausible process. This is known as the "weight transport problem". Therefore, in this work, we present a more biologically plausible approach towards solving the weight transport problem for image data. This approach, which we name the error kernel driven activation alignment (EKDAA) algorithm, accomplishes through the introduction of locally derived error transmission kernels and error maps. Like standard deep learning networks, EKDAA performs the standard forward process via weights and activation functions; however, its backward error computation involves adaptive error kernels that propagate local error signals through the network. The efficacy of EKDAA is demonstrated by performing visual-recognition tasks on the Fashion MNIST, CIFAR-10 and SVHN benchmarks, along with demonstrating its ability to extract visual features from natural color images. Furthermore, in order to demonstrate its non-reliance on gradient computations, results are presented for an EKDAA trained CNN that employs a non-differentiable activation function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timothy Zee, Alexander G. Ororbia, Ankur Mali, Ifeoma Nwogu. 2023-11-05. A Robust Backpropagation-Free Framework for Images. https://arxiv.org/abs/2206.01820

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Continuous Spiking Graph Neural Networks

Continuous graph neural networks (CGNNs) have garnered significant attention due to their ability to generalize existing discrete graph neural networks (GNNs) by introducing continuous dynamics. They typically draw inspiration from diffusion-based methods to introduce a novel propagation scheme, which is analyzed using ordinary differential equations (ODE). However, the implementation of CGNNs requires significant computational power, making them challenging to deploy on battery-powered devices. Inspired by recent spiking neural networks (SNNs), which emulate a biological inference process and provide an energy-efficient neural architecture, we incorporate the SNNs with CGNNs in a unified framework, named Continuous Spiking Graph Neural Networks (COS-GNN). We employ SNNs for graph node representation at each time step, which are further integrated into the ODE process along with time. To enhance information preservation and mitigate information loss in SNNs, we introduce the high-order structure of COS-GNN, which utilizes the second-order ODE for spiking representation and continuous propagation. Moreover, we provide the theoretical proof that COS-GNN effectively mitigates the issues of exploding and vanishing gradients, enabling us to capture long-range dependencies between nodes. Experimental results on graph-based learning tasks demonstrate the effectiveness of the proposed COS-GNN over competitive baselines.

cs.NE

Emergent Intelligence: Resonant Oscillators Produce Proactive Adaptive Behavior

Most artificial neural systems are built to map given inputs to outputs. Adaptive agents face a prior problem: they must act without enough evidence, seek encounters with the world, and revise behavior when evidence appears. We propose another starting point for intelligent neural networks: proactive search without signals, curiosity at its most basic. We ask whether it can come from a minimal untrained circuit. The spiking unit studied here inverts its response to input: with no signal in its window it fires faster; once signals arrive it switches to a slower, inverted regime. Search needs three or more such oscillators in counter-phase, each reading the same input in a different time window. With no training, supervision, parameter tuning, or controller, the composite switches on its own between exploratory spiral search and exploitative tracking, finding both first-degree symmetry and second-degree groups. The switch comes from temporal disagreement between its fast and slow readings of the same signal. We view the circuit as evolutionarily trained: its abilities come from structure, not experience. Ablation over 63 configurations and 63,000 trials shows the switch needs both temporal staggering and counter-phase opposition, neither enough alone: the behavior is emergent, not programmed. The spiral persists at zero rotational diffusion, so it is structural, and degrades gently under perturbation. More oscillators improve spiral regularity but cut resource capture, so the smallest sufficient circuit wins. We propose that this principle underlies search in simple organisms, navigation and decisions in complex ones, and, being so simple and common, goes unnoticed unless you strip the logic bare. Eventually, networks of such proactive primitives may offer another foundation for AI architectures that explore our world rather than merely predict the next symbol in a sequence.

cs.NE

A Confidence-Driven Evolutionary Algorithm for Noisy Optimization with Joint Chance Constraints

Many real-world optimization problems involve noisy objective evaluations and probabilistic constraints, particularly in the form of joint chance constraints, which are computationally expensive to evaluate. In this work, we propose CR-EA-C, a confidence-driven evolutionary algorithm for solving noisy black-box optimization problems under joint chance constraints. CR-EA-C introduces three key components: (1) analytical feasibility estimation for joint chance constraints, (2) a pairwise statistical ranking mechanism for robust comparison under noise, and (3) a modified infeasibility-driven survival strategy to accelerate convergence. These components enable statistically reliable decision-making while improving the efficiency of function evaluations. The proposed method is evaluated against four recent metaheuristic algorithms under various uncertainty distributions. Furthermore, its practical effectiveness is also assessed on two additional real-world optimization problems and compared with conventional static sampling methods. Experimental results show that CR-EA-C consistently satisfies the prescribed joint chance constraints while achieving competitive objective values overall. This demonstrates that CR-EA-C is an effective general-purpose approach for noisy optimization.

cs.NE