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,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for connectionist models

This work argues for the importance of objects in model-based reinforcement learning.

problem Dynamic construction of models in real-world problems.
method Identifies requirements for overcoming limitations in connectionist models.
result Objects are essential for dynamic model construction in reinforcement learning.

Planar neural networks learn image transformations from sequences.

problem Learning image transformations for mental simulation.
method Using planar neural networks, the study investigates various factors affecting the learning of image transformations.
result The approach can effectively learn and transfer image transformations, including translation, rotation, and scaling.

This paper explores BDL hyperparameters for robust polynomial mapping with noise.

problem Designing BDL hyperparameters for robust function mapping with uncertainty quantification.
method Mapping Bayesian connectionist representations to polynomials of varying orders and noise types.
result Optimal network depth and ensemble size for prediction and uncertainty quantification.

Paper shows continuous speech recognition with EEG features, no speech input.

problem Continuous speech recognition with limited vocabulary and noisy/no speech input.
method Connectionist temporal classification (CTC) model, EEG features, new deep learning architecture.
result Continuous speech recognition achieved on limited vocabulary with noisy/no speech input.

The ability to learn tasks in a sequential fashion is crucial to the development of artificial intelligence. Neural networks are not, in general, capable of this and it has been widely thought that catastrophic forgetting is an inevitable feature of connectionist models. We show that it is possible to overcome this lim…

2016-12-02abs ↗pdf ↗

Connectionist temporal classification (CTC) is widely used for maximum likelihood learning in end-to-end speech recognition models. However, there is usually a disparity between the negative maximum likelihood and the performance metric used in speech recognition, e.g., word error rate (WER). This results in a mismatch…

2017-12-19abs ↗pdf ↗

Study on reducing forgetting in neural networks using compression theory.

problem Catastrophic forgetting in neural networks.
method Defined forgetting as increased description lengths, compared variational posterior approaches to prequential coding methods.
result Proposed a new continual learning method combining ML plug-in and Bayesian mixture codes.

Secure neural network inference on untrusted platforms using holographic reduced representations.

problem Secure neural network inference on untrusted platforms.
method Connectionist Symbolic Pseudo Secrets using Holographic Reduced Representations (HRR).
result Empirical robustness to attack under various threat models.

Plug-in method decomposes latent representations into interpretable factors.

problem Decomposing latent representations in neural networks without altering the original models.
method Factors' Decomposer-Entangler Network (FDEN) that learns to decompose latent representations into mutually independent factors.
result FDEN framework effectively decomposes latent representations into interpretable factors, maintaining original model integrity.

We study a multiclass multiple instance learning (MIL) problem where the labels only suggest whether any instance of a class exists or does not exist in a training sample or example. No further information, e.g., the number of instances of each class, relative locations or orders of all instances in a training sample, …

2018-11-29abs ↗pdf ↗

Many of the current scientific advances in the life sciences have their origin in the intensive use of data for knowledge discovery. In no area this is so clear as in bioinformatics, led by technological breakthroughs in data acquisition technologies. It has been argued that bioinformatics could quickly become the fiel…

2018-02-27abs ↗pdf ↗

Study combines speaker verification and voice trigger detection in a single network.

problem Separate training for speaker verification and voice trigger detection.
method Multi-task learning with a single network trained on both tasks.
result Single network achieves comparable accuracy to independent models for each task.

Paper closes neural-symbolic learning loop with grammar model and back-search algorithm.

problem Slow convergence in neural-symbolic learning due to error propagation issues.
method Introduces grammar model as symbolic prior and back-search algorithm for efficient error propagation.
result Significantly outperforms RL methods in performance, converging speed, and data efficiency.

New neural network avoids forgetting old knowledge as new data comes in.

problem Catastrophic forgetting in lifelong learning systems.
method Sequential Neural Coding Network, biologically-plausible synapse adaptation, task-executive control mimicry.
result Significantly less forgetting compared to standard neural models in experiments.

A study on preventing catastrophic forgetting in neural networks using conditional computation.

problem Catastrophic forgetting in connectionist neural networks.
method Conditional computation framework where parameters are conditioned on each input example.
result Proposed conditional rehearsal to prevent forgetting of previously learned examples.

Study shows adversarial attacks can fool speech-to-text models, and PCA is ineffective as a defense.

problem Adversarial attacks can mislead speech-to-text neural networks.
method Crafted adversarial waveforms, used PCA for defense, tested under black-box setting.
result PCA is ineffective as a defense mechanism against adversarial attacks in audio domain.

Study shows challenges in converting RNNs to FSMs due to computational complexity.

problem Understanding the equivalence and distance between RNNs and FSMs.
method Computational proofs for equivalence and distance problems between RNNs and FSMs.
result Undecidability and hardness of approximation problems between RNNs and FSMs.

Deep learning models match traditional surrogate models in accuracy and speed for satellite remote sensing.

problem Limited computational power hinders high-resolution numerical model simulations.
method Deep learning framework applied to satellite remote sensing data.
result Deep learning models can accurately and efficiently emulate numerical models.

Brain2Char decodes text from brain recordings, achieving state-of-the-art performance.

problem Directly decoding text from brain recordings for communication.
method Combines 3D Inception layers, bidirectional recurrent layers, and language model weighted beam search. Uses CTC loss and auxiliary losses for regularization.
result Achieves 10.6%, 8.5%, and 7.0% WER on vocabulary sizes from 1200 to 1900 words.

Bayesian CNN with Variational Inference improves uncertainty handling in neural networks.

problem Uncertainty in neural networks, especially in regions with little data.
method Bayesian Convolutional Neural Network (BayesCNN) using Variational Inference.
result BayesCNN achieves equivalent performance to frequentist inference and incorporates uncertainty measurements.

Study develops time-continuous models and probabilistic descriptions for agent-based economic market models.

problem Formulating and describing agent-based economic market models in a time-continuous and probabilistic manner.
method Derived time-continuous formulations, discussed impact of time-scaling, proved stability, presented probabilistic descriptions using kinetic theory.
result Time-continuous formulations and probabilistic descriptions for agent-based economic market models.

Hybrid model combines interpretable and black-box models for better transparency and performance.

problem Balancing interpretability and predictive performance in machine learning models.
method Proposes a Hybrid Predictive Model (HPM) integrating an interpretable model with a black-box model, using principled objective functions and customized training algorithms.
result Hybrid models achieve an efficient trade-off between transparency and predictive performance.

Boosts generative models by combining multiple meta-models.

problem Challenges in creating a single generative model that accurately represents complex data.
method Cascades multiple meta-models (like RBM and VAE) to create a stronger generative model.
result Derives a decomposable variational lower bound for training and evaluating the boosted model.

The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.

problem Modeling aggregate claim amount with frequency-severity and joint dependencies.
method Developed three types of BCART models: frequency-severity, sequential, and joint models. Used various distributions for claim severity data.
result Weibull distribution outperforms gamma and lognormal for right-skewed, heavy-tailed claim severity data.