Paper develops brain-inspired unsupervised learning for scalable object detection.
problem Machine vision systems struggle with object discovery and detection, especially under nonideal conditions.
method Leverages large-scale perceptual data to develop brain-inspired flexible, scale, and shift invariant object prototypes.
result Efficient unsupervised learning framework constructs accurate part-aware object models and robust detection algorithms.
SiamJEPA uses Siamese student encoders to improve JEPA-based representation learning.
problem Improving self-supervised representation learning in JEPA models.
method Proposes SiamJEPA with masked Siamese student encoders and EMA teacher network.
result Siamese student encoders improve representation separability and learning speed.
TMNs model brain memory systems for continual learning.
problem Catastrophic forgetting in neural networks.
method Triple Network architecture of GANs, incorporating brain-inspired algorithms.
result New state-of-the-art performance on class-incremental learning benchmarks.
V-HMN integrates memory mechanisms for improved image recognition.
problem Limited interpretability and high data requirements of existing vision backbones.
method Brain-inspired hierarchical memory modules with iterative refinement.
result V-HMN achieves strong performance on image classification benchmarks.
This paper proposes a brain-inspired approach to quantum machine learning with the goal of circumventing many of the complications of other approaches. The fact that quantum processes are unitary presents both opportunities and challenges. A principal opportunity is that a large number of computations can be carried ou…
This paper presents an efficient binarized algorithm for both learning and classification of human epileptic seizures from intracranial electroencephalography (iEEG). The algorithm combines local binary patterns with brain-inspired hyperdimensional computing to enable end-to-end learning and inference with binary opera…
A brain-inspired spiking Transformer reduces energy consumption and enhances interpretability.
problem Energy inefficiency and lack of interpretability in Transformer models.
method Spiking STDP Transformer using spike-timing-dependent plasticity (STDP) for self-attention.
result Achieves 94.35% and 78.08% accuracy on CIFAR-10 and CIFAR-100 datasets respectively, with 88.47% energy reduction.
A human does not have to see all elephants to recognize an animal as an elephant. On contrast, current state-of-the-art deep learning approaches heavily depend on the variety of training samples and the capacity of the network. In practice, the size of network is always limited and it is impossible to access all the da…
The paper introduces reservoir computing models for complex systems.
problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.
QubitHD improves HD computing ML efficiency without sacrificing accuracy.
problem Trade-off between energy efficiency and classification accuracy in HD computing-based ML.
method Stochastically binarizes HD-based algorithms while maintaining comparable classification accuracies.
result 65% improvement in energy efficiency and 95% improvement in training time on FPGA.
A new SNN learning algorithm for energy-efficient VLSI circuits.
problem Designing energy-efficient SNNs for VLSI implementation.
method Temporal coding, analog VLSI, resistive memory.
result Classification accuracy comparable to state-of-the-art temporal coding SNN algorithms.
Paper presents privacy-preserving techniques for HD computing.
problem Privacy loss in HD computing due to reversible computation.
method Quantization and pruning of hypervectors for differential privacy.
result Differentially private HD model for cloud inference.
Theoretical framework for target propagation shows differences from backpropagation.
problem Understanding and improving target propagation for neural networks.
method Mathematical optimization analysis and novel reconstruction loss.
result A novel reconstruction loss improves feedback weight training and introduces architectural flexibility.
SynergicLearning combines NN and HD models for high accuracy and efficiency.
problem Combining neural networks and hyperdimensional learning for improved accuracy and efficiency.
method Hybrid model combining NN feature extraction and HD classification, parameterized hardware implementation.
result Improves accuracy by at least 10% compared to HD learning models and 1.60x power efficiency.
The study uses response theory to understand RNNs processing input signals.
problem Understanding how RNNs process sequential data.
method Deriving a Volterra series representation for SRNNs output using response theory from nonequilibrium statistical mechanics.
result SRNNs can be viewed as kernel machines operating on a reproducing kernel Hilbert space associated with the response feature.
Financial markets modeled like brain networks using dMNC.
problem Understanding latent dynamics in financial markets.
method Biologically inspired framework using dMNC.
result Structural persistence, regime shifts, and early warning signals identified.
G-Net constructs binary neural networks with high accuracy using randomized binary embeddings.
problem Creating high-accuracy binary neural networks with theoretical guarantees.
method Proposes a novel floating-point G-Net family with randomized binary embeddings and theoretical accuracy guarantees.
result Empirically, G-Net achieves almost 30% higher accuracy on CIFAR-10 compared to prior HDC models.
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.
NegBio-VAE models neural spike counts with negative binomial distribution.
problem Limited biological plausibility of continuous latent variables in VAEs for neural spike modeling.
method Proposes a negative binomial latent-variable model with a dispersion parameter for overdispersed spike count modeling.
result NegBio-VAE outperforms competing models in reconstruction and generation tasks.
Deep neural network learns compact representations for driving tasks.
problem Improving autonomous driving through better neural network representations.
method Inspired by human brain's hierarchical structure and predictive nature, the paper proposes a deep learning framework that learns compact representations of driving concepts.
result The paper successfully learns compact representations using as few as 16 neural units for car and lane concepts.
Recently, product images have gained increasing attention in clothing recommendation since the visual appearance of clothing products has a significant impact on consumers' decision. Most existing methods rely on conventional features to represent an image, such as the visual features extracted by convolutional neural …
Survey of alignment techniques for large language models.
problem Ensuring large language models align with human values.
method Analysis of diverse alignment methods and training paradigms.
result Preference-based methods offer more flexibility for nuanced alignment.
SparseProp speeds up SNN simulations and training by four orders of magnitude.
problem Efficiently simulating and training large spiking neural networks.
method Event-based algorithm that reduces computational cost from O(N) to O(log(N)) per spike.
result Numerically exact simulations of large spiking networks and efficient training using backpropagation.
Poisson variational autoencoders introduce a metabolic cost term that penalizes high baseline activity.
problem Energy constraints in computation.
method Poisson variational autoencoders with a Kullback-Leibler divergence term proportional to firing rates.
result Poisson variational autoencoders introduce a metabolic cost term that penalizes high baseline activity.
Meta-learning adapts models for unseen tasks across AI, robotics, and NLP.
problem Adapting models to unseen tasks efficiently and accurately.
method Black-box, metric-based, layered, and Bayesian approaches.
result Meta-learning enhances model generalization and adaptation to unseen tasks.
Meta-learning improves neural networks by adapting learning algorithms.
problem Conventional AI approaches solve tasks from scratch, but meta-learning aims to improve the learning algorithm.
method Meta-learning adapts a learning algorithm based on multiple learning episodes.
result Meta-learning can tackle deep learning challenges like data and computation bottlenecks.
Survey explores how transfer learning improves deep reinforcement learning.
problem Challenges in reinforcement learning efficiency and effectiveness.
method Categorizes and analyzes transfer learning approaches.
result Transfer learning enhances reinforcement learning performance.
Machine learning models adapt to motor learning but face challenges.
problem Adapting machine learning to handle motor variability and differentiate new movements from known ones.
method Parameter adaptation, transfer and meta-learning, reinforcement learning.
result Challenges in applying machine learning models for motor learning support systems.
New method uses bi-level optimization to learn useful representations for imitation learning.
problem Learning useful representations for multiple tasks in imitation learning settings.
method Formulates representation learning as a bi-level optimization problem.
result Bi-level optimization framework provides sample complexity benefits for imitation learning.
Tabular Q-Learning with learned state abstractions solves continuous control tasks.
problem Challenging reinforcement learning problems in continuous control.
method Learned state abstraction to transform continuous state-space into discrete.
result Tabular Q-Learning with learned abstractions achieves efficient learning in unseen tasks.
Study Whittle index learning algorithms for restless bandits with constant stepsizes.
problem Optimizing decisions in restless multi-armed bandits with constant stepsizes.
method Developed Q-learning algorithms with constant stepsizes for index learning in restless bandits, extending to DQN and function approximations.
result The algorithms learn the Whittle index effectively.
Paper discusses flaws in traditional RL for lifelong learning.
problem Traditional RL fails to model lifelong learning systems.
method Simplified prototype of lifelong RL system.
result Insights into lifelong RL, showing traditional RL's limitations.
AI learns to learn sequentially without forgetting.
problem Preventing catastrophic forgetting in machine learning models.
method Meta-learning a neuromodulatory activation-gating function to control selective activation in deep neural networks.
result State-of-the-art continual learning performance with 600 classes (9,000 updates).
Poisson learning doesn't solve graph semi-supervised learning issues.
problem Global information loss in graph-based semi-supervised learning.
method Poisson learning is Laplace regularization with thresholding.
result Poisson learning cannot overcome the global information loss problem.
New unsupervised learning technique learns independent kernels for better machine learning tasks.
problem Improving unsupervised representation learning for machine learning tasks.
method Stacking convolutional transforms using alternating proximal minimization scheme.
result DCTL outperforms shallow version CTL on benchmark datasets.
Meta-learning helps models learn quickly from few samples.
problem Deep learning requires many samples, which are hard to get.
method Meta-learning optimizes models to adapt quickly to new tasks.
result Meta-learning can improve model efficiency and adaptability.
New self-imitation learning method improves performance in continuous control tasks.
problem Improving off-policy learning in continuous control tasks.
method Proposes a n-step lower bound to generalize lower-bound Q-learning and introduces a new family of self-imitation learning algorithms.
result n-step lower bound Q-learning achieves a better trade-off between bias and contraction rate, leading to improved performance.
Deep reinforcement learning finds optimal learning policies for adaptive systems.
problem Finding individualized learning plans for learners with unknown latent traits.
method Formulated as a Markov decision process, applied deep Q-learning with a transition model estimator.
result The algorithm efficiently discovers optimal learning policies with small data sets.
Unified framework explains all types of learning, including brain.
problem Lack of clear explanation for deep learning success.
method Constructing a learning principle that equates all learning to probability estimation.
result Unified understanding of learning across different fields.
Cyclical learning rates improve DRL performance without manual tuning.
problem Manual hyperparameter tuning in DRL is time-consuming and error-prone.
method Proposes cyclical learning rates for DRL problems.
result Cyclical learning achieves similar or better results than fixed learning rates.
Study batch reinforcement learning methods for personalized medical treatments.
problem Batch reinforcement learning for personalized medical treatments.
method Direct policy learning and model-based learning approaches.
result Model-based learning is impossible with finite model classes but feasible with relaxed conditions.
A new meta-meta classification method tackles few-shot learning tasks.
problem Learning with limited data in small-data settings.
method Designing an ensemble of learners for a large set of problems, then learning how to combine them for a new problem.
result Meta-meta classification outperforms traditional meta-learning and ensembling approaches in one-shot learning tasks.
The paper proposes a learning algorithm that improves adaptability and generalization.
problem Improving adaptability and generalization in learning models.
method Learning to meta-learn by meta-finetuning on related tasks before adapting to specific tasks.
result Learning to meta-learn improves adaptability and generalization across various tasks.
Bayesian meta-learning improves few-shot learning with deep kernels.
problem Few-shot learning with small labeled datasets.
method Bayesian treatment of meta-learning using deep kernels.
result Deep Kernel Transfer (DKT) outperforms state-of-the-art algorithms.
Transfer learning improves algorithm recommendation performance.
problem Improving algorithm recommendation with limited data.
method Train a neural network on meta-datasets, then transfer knowledge to similar datasets.
result Transfer learning enhances meta-learning for algorithm recommendation.
This paper surveys meta-learning, online, and continual learning.
problem Combining and understanding meta-learning, online, and continual learning.
method Organizing various problem settings using consistent terminology and formal descriptions.
result Fosters further advancements in meta-learning, online, and continual learning.
Relational logistic regression (RLR) is a representation of conditional probability in terms of weighted formulae for modelling multi-relational data. In this paper, we develop a learning algorithm for RLR models. Learning an RLR model from data consists of two steps: 1- learning the set of formulae to be used in the m…
Survey on curriculum learning for reinforcement learning.
problem Efficiently learning complex tasks in reinforcement learning.
method Framework for curriculum learning in reinforcement learning.
result Survey and classification of existing CL methods.