ArticlePLoS computational biology2018
Optimizing the learning rate for adaptive estimation of neural encoding models.
Article in PLoS computational biology, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
14 citing papers in PubMed.
- Prioritized learning of cross-population neural dynamics.Journal of neural engineering · 2025Article
- Automatic head and neck tumor segmentation through deep learning and Bayesian optimization on three-dimensional medical images.Computers in biology and medicine · 2025Article
- Dynamical modeling of nonlinear latent factors in multiscale neural activity with real-time inference.Advances in neural information processing systems · 2025Article
- Dissociative and prioritized modeling of behaviorally relevant neural dynamics using recurrent neural networks.Nature neuroscience · 2024Article
- Brain-computer interfaces for neuropsychiatric disorders.Nature reviews bioengineering · 2024Article
- Event detection and classification from multimodal time series with application to neural data.Journal of neural engineering · 2024Article
- Multimodal subspace identification for modeling discrete-continuous spiking and field potential population activity.Journal of neural engineering · 2024Article
- Modeling and dissociation of intrinsic and input-driven neural population dynamics underlying behavior.Proceedings of the National Academy of Sciences of the United States of America · 2024Article
- Unsupervised learning of stationary and switching dynamical system models from Poisson observations.Journal of neural engineering · 2023Article
- Modeling multiscale causal interactions between spiking and field potential signals during behavior.Journal of neural engineering · 2022Article
- Multiscale low-dimensional motor cortical state dynamics predict naturalistic reach-and-grasp behavior.Nature communications · 2021Article
- Modeling behaviorally relevant neural dynamics enabled by preferential subspace identification.Nature neuroscience · 2021Article
- Brain-machine interfaces from motor to mood.Nature neuroscience · 2019Review
- Mood variations decoded from multi-site intracranial human brain activity.Nature biotechnology · 2018Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Closed-loop neurotechnologies often need to adaptively learn an encoding model that relates the neural activity to the brain state, and is used for brain state decoding. The speed and accuracy of adaptive learning algorithms are critically affected by the learning rate, which dictates how fast model parameters are updated based on new observations. Despite the importance of the learning rate, currently an analytical approach for its selection is largely lacking and existing signal processing methods vastly tune it empirically or heuristically. Here, we develop a novel analytical calibration algorithm for optimal selection of the learning rate in adaptive Bayesian filters. We formulate the problem through a fundamental trade-off that learning rate introduces between the steady-state error and the convergence time of the estimated model parameters. We derive explicit functions that predict the effect of learning rate on error and convergence time. Using these functions, our calibration algorithm can keep the steady-state parameter error covariance smaller than a desired upper-bound while minimizing the convergence time, or keep the convergence time faster than a desired value while minimizing the error. We derive the algorithm both for discrete-valued spikes modeled as point processes nonlinearly dependent on the brain state, and for continuous-valued neural recordings modeled as Gaussian processes linearly dependent on the brain state. Using extensive closed-loop simulations, we show that the analytical solution of the calibration algorithm accurately predicts the effect of learning rate on parameter error and convergence time. Moreover, the calibration algorithm allows for fast and accurate learning of the encoding model and for fast convergence of decoding to accurate performance. Finally, larger learning rates result in inaccurate encoding models and decoders, and smaller learning rates delay their convergence. The calibration algorithm provides a novel analytical approach to predictably achieve a desired level of error and convergence time in adaptive learning, with application to closed-loop neurotechnologies and other signal processing domains.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.