Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,181 papers · 148 categories

Trend · papers per month

16334965 · Jun 202019922001200920182026
48 results for feedback plasticity

A neural network learns to control a two-link arm with non-linear dynamics.

problem Training spiking neural networks to control complex, non-linear systems.
method Feedback-based Online Local Learning Of Weights (FOLLOW) to train a network of spiking neurons with hidden layers.
result The network learns an inverse model of the arm's dynamics and uses it to generate a motor command for control.

New method improves deep learning performance without weight symmetry.

problem Challenges in scaling non-symmetric learning methods to deep convolutional networks.
method Introduced techniques to mitigate scalability issues, including a modified feedback alignment method.
result Demonstrated competitive performance with backpropagation using a weaker form of weight symmetry.

Proposes VPF for efficient training of DBMs without Gibbs sampling or feedback phases.

problem Efficient training of deep neural networks with biological plausibility.
method Variational Probability Flow (VPF) for binary Deep Boltzmann Machines (DBMs).
result VPF learns features quickly and generates high-likelihood samples.

Differentiable plasticity enables efficient lifelong learning in neural networks.

problem Building agents that can learn from experience quickly and efficiently.
method Optimized plastic connections in recurrent neural networks using gradient descent.
result Plastic neural networks can learn and reconstruct novel images and solve meta-learning tasks.

Introduces generalized almost plastic structures on manifolds.

problem Integrability of plastic structures on manifolds.
method Constructs a family of generalized almost plastic structures on pseudo-Riemannian manifolds with specific tensor fields and compatibility conditions.
result Characterizes the integrability of these structures with respect to a given affine connection.

Flashback Learning balances model stability and plasticity in continual learning.

problem Balancing model stability and plasticity in continual learning.
method Flashback Learning (FL) uses a bidirectional regularization approach to balance stability and plasticity.
result FL improves model accuracy by up to 4.91% in Class-Incremental and 3.51% in Task-Incremental settings.

Physics-informed deep learning approximates strain gradient plasticity solutions.

problem Stiffness and computational challenges in solving strain gradient plasticity models.
method Physics-informed deep learning (PIDL) with modified loss functions and optimization schemes.
result PIDL methods address stiffness and computational challenges in strain gradient plasticity.

Biological neurons learn tensor decompositions of higher-order correlations using nonlinear Hebbian plasticity.

problem Learning higher-order correlations in biological neurons.
method Introduce and study generalized nonlinear Hebbian learning rules.
result Neurons can learn tensor eigenvectors of higher-order input correlation tensors.

A model retains learned knowledge for longer by adding a plastic component to neural networks.

problem Catastrophic forgetting in neural networks when learning new tasks.
method Differentiable Hebbian Consolidation model with a DHP Softmax layer.
result Reduces forgetting in benchmarks like Permuted MNIST and Vision Datasets Mixture.

Unified approach for neural networks with multi-compartmental neurons and non-Hebbian plasticity.

problem Limited computational power of existing neural network models for multi-compartmental neurons and non-Hebbian plasticity.
method Unified extension of similarity matching approach to derive neural networks with multi-compartmental neurons and local, non-Hebbian learning rules.
result Unified approach facilitates understanding of multi-compartmental neuronal structures and non-Hebbian plasticity.

Vision transformers benefit from non-smooth components in adaptation.

problem Understanding the role of non-smoothness in vision transformer adaptation.
method Theoretical analysis and extensive experiments on large-scale vision transformers.
result High plasticity of attention modules and feedforward layers leads to better finetuning performance.

Selective reinitialization improves adaptability of neural bandits in dynamic environments.

problem Loss of plasticity in neural bandits, leading to rigid neural network parameters.
method Selective Reinitialization (SeRe) framework that dynamically resets underutilized units.
result SeRe enhances adaptability of CNB algorithms, reducing cumulative regret in dynamic environments.

Multi-model forgetting occurs when training multiple deep networks sequentially, leading to performance degradation of previously trained models.

problem Performance degradation of previously trained models when sequentially training multiple deep networks with shared parameters.
method Introduce a weight plasticity loss that regularizes the learning of shared parameters based on their importance for previous models.
result Weight plasticity loss effectively preserves the performance of previously trained models during sequential training and neural architecture search.

Elite ONNs learn better with synaptic plasticity, improving performance over CNNs.

problem Limited heterogeneity in ONNs due to fixed operator sets.
method Synaptic plasticity-based search for optimal operator sets.
result Elite ONNs achieve superior learning performance compared to conventional methods.

Model neural plasticity as binary optimization to dynamically activate or deactivate network units.

problem Dynamic learning and adaptability of neural networks.
method Model neural plasticity as an L0L_0-norm regularized binary optimization problem, where units can be activated or deactivated based on a cost-benefit tradeoff.
result Demonstrates that a single parameter kk can modulate learning dynamics, unifying network sparsification and expansion.

Dropout helps a stable network learn new tasks without forgetting old ones.

problem Catastrophic forgetting in neural networks when learning multiple tasks.
method Investigate the relationship between dropout and stability in neural networks, showing dropout acts as an implicit gating mechanism.
result Dropout stabilizes a network's learning, allowing it to learn new tasks without forgetting old ones.

Sleep-based regularization stabilizes STDP in recurrent neural networks.

problem Pathological weight dynamics in recurrent SNNs.
method Periodic offline phases with stochastic decay and spontaneous activity.
result Sleep-based renormalization prevents weight saturation and preserves learned structure.

Analyze and predict complex 3D shape deformations using LSTM autoencoders and oriented bounding boxes.

problem Detecting and predicting patterns in sequences of deforming 3D shapes.
method Use LSTM autoencoders to create low-dimensional representations of 3D shapes, incorporating oriented bounding boxes for structural components.
result The method detects patterns in plastic deformation and predicts future states of 3D shapes with improved accuracy.

A high-parallelism SNN improves feature learning efficiency and robustness.

problem Slow learning speed and limited learning capability in existing SNNs.
method Inspired by Inception modules, high-parallelism architecture, Vote-for-All decoding, adaptive repolarization mechanism.
result Superior performance and competitive accuracy compared to state-of-the-art unsupervised SNNs.

Study examines how training regime affects neural networks' forgetting.

problem Catastrophic forgetting in neural networks when learning multiple tasks sequentially.
method Analyzes the impact of different training regimes (learning rate, batch size, regularization) on forgetting.
result Training regimes that widen tasks' local minima help prevent catastrophic forgetting.

ABS dynamically adjusts batch size based on policy stability, improving RL performance.

problem Diminishing returns with large batch sizes in RL due to non-stationary data.
method Adaptive Batch Scaling (ABS) with Behavioral Divergence metric.
result Larger batch sizes can improve RL performance, contrary to conventional wisdom.

Study evaluates CL methods in RNNs, highlighting differences from feedforward networks.

problem Preventing catastrophic forgetting in RNNs processing sequential data.
method Comprehensive evaluation of CL methods, including elastic weight consolidation and hypernetworks.
result Weight-importance methods perform similarly regardless of sequence length but require more stability for high working memory demands.