The Locally Competitive Algorithm
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Convolutional Sparse Coding via the Locally Competitive Algorithm on Loihi 2
Announce Type: new Abstract: Sparse coding provides a principled framework for signal representation by expressing an input as a linear combination of only a small number of basis functions. The Locally Competitive Algorithm (LCA) is particularly attractive in the context of neuromorphic computing because its dynamics, leaky integration, thresholding, and lateral inhibition map naturally to neuromorphic hardware. While prior work has studied non-convolutional LCA on Loihi 2, the...
Approximating Hartree-Fock theory via an efficiently local reformulation
Announce Type: new Abstract: We explore a reorganized framework for the Hartree Fock equations that allows varying patterns of locality to be imposed on the molecular orbitals while maintaining a highly efficient self-consistent field optimization algorithm. Rather than limiting orbitals' spread and then variationally minimizing the energy within those limits, our reorganization neatly pairs each local degree of freedom with a specific solution condition that itself has a naturally local...
On solving symmetric multi-type orthogonal non-negative matrix tri-factorization problem
arXiv:2606.08291v1 Announce Type: new Abstract: We study the symmetric multi-type orthogonal non-negative matrix tri-factorization problem, where several symmetric non-negative matrices are simultaneously approximated by factors of the form $GS_{i}G^{\top}$, with a shared non-negative and orthogonal factor $G$. This model is motivated by clustering and network analysis, where non-negativity improves interpretability and orthogonality gives a natural assignment-type structure to the latent...
S$^3$LDBO: A Snapshot Single-Loop Algorithm for Decentralized Bilevel Optimization
arXiv:2605.31311v1 Announce Type: cross Abstract: Networked AI systems increasingly rely on multiple agents that collaboratively learn and adapt models over communication networks. In such systems, bilevel formulations naturally arise in hyperparameter optimization, data cleaning, and meta-learning, but the repeated evaluation of gradients, Jacobians, and Hessians can impose a substantial computational burden on individual agents. To address this challenge, we propose Snapshot-SLDBO...
Human-Like Neural Nets by Catapulting
Human-like Neural Nets by Catapulting Speculative proposal to create artificial neural nets with human-like performance by high-learning-rate/regularization training of overparameterized NNs to trigger catapulting/grokking. Over-parameterization as a route to true generalization would resolve many outstanding mysteries of artificial versus natural intelligence. There are many mysteries about deep learning and human intelligence, but we could describe the biggest anomaly this way: why are...
Riemannian Stochastic Optimization for Sufficient Dimension Reduction
arXiv:2606.00413v1 Announce Type: cross Abstract: Sufficient dimension reduction (SDR) makes high-dimensional regression tractable by projecting the covariates onto a low-dimensional subspace that preserves the conditional mean of the response. Existing gradient-based estimators either operate in the ambient space and suffer from the curse of dimensionality, or localize in the reduced space at a per-outer-iteration cost at least quadratic in the sample size. We show that minimizers of the...
Multi-Column RBF Neural Network Using Adaptive and Non-Adaptive Particle Swarm Optimization
new Abstract: The radial basis function neural network (RBFN) trained with a gradient descending algorithm provides an effective fully connected structure in both shallow and deep networks. The error correction (ErrCor), a state-of-the-art gradient-based training method, selects optimal hidden units to improve accuracy. Alternatively, as a population-based algorithm, the particle swarm optimization algorithm (PSO) uses the swarm experience to optimize RBFN parameters, offering global search...
FFR: Forward-Forward Learning for Regression
arXiv:2606.03927v1 Announce Type: new Abstract: The Forward-Forward (FF) algorithm offers a computationally efficient and biologically plausible alternative to backpropagation (BP) by training neural networks through purely local, layer-wise optimization. However, FF is inherently designed for classification via contrastive positive-negative sample pairs, and extending it to regression poses fundamental challenges: continuous target space lack natural "opposites" for contrastive learning,...
Graph Regularized Non-negative Reduced Biquaternion Matrix Factorization for Color Image Recognition
arXiv:2606.03654v1 Announce Type: new Abstract: Non-negative reduced biquaternion matrix factorization (NRBMF) uses the product of reduced biquaternion (RB) matrices to incorporate the non-negativity constraints of color image pixels into the factorization process. However, NRBMF mainly focuses on reconstruction accuracy and does not exploit the local geometric structure of image data, which may limit the discriminative ability of the learned low-dimensional features. To address this issue,...
A Pan-Cancer Multi-Omic SuperLearner for Regulated Cell Death Survival Topologies
Introduction: Regulated cell death (RCD) pathways profoundly influence tumor progression and immune modulation. In prior work, we constructed a comprehensive database mapping 25 forms of RCD across seven multi-omic layers encompassing 33 tumor types (CancerRCDShiny). Despite their robust ability to identify risk populations, translating these prognostic signatures into personalized clinical workflows requires a shift from generalized cohort stratification to individualized risk mapping.