Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

A Erdem Sagtekin

dblp:372/3366 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 74% Reinforcement learning · 26%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › multi-agent reinforcement learning › credit assignment
temporal credit assignment
0.912025
Error Forcing in Recurrent Neural Networks · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
sequential monte carlo
0.812024
Inferring stochastic low-rank recurrent neural networks from neural data · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.812024
Inferring stochastic low-rank recurrent neural networks from neural data · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference › sequential variational inference
variational sequential monte carlo
0.812024
Inferring stochastic low-rank recurrent neural networks from neural data · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

bayesian inference · 0.9backpropagation through time · 0.9variational sequential monte carlo · 0.8fixed-point identification · 0.8
YearPublicationVenuePosition
2025 Error Forcing in Recurrent Neural Networks
abstract
How should feedback influence recurrent neural network (RNN) learning? One way to address the known limitations of backpropagation through time is to directly adjust neural activities during the learning process. However, it remains unclear how to effectively use feedback to shape RNN dynamics. Here, we introduce error forcing (EF), where the network activity is guided orthogonally toward the zero-error manifold during learning. This method contrasts with alternatives like teaching forcing, which impose stronger constraints on neural activity and thus induce larger feedback influence on circuit dynamics. Furthermore, EF can be understood from a Bayesian perspective as a form of approximate dynamic inference. Empirically, EF consistently outperforms other learning algorithms across several tasks and its benefits persist when additional biological constraints are taken into account. Overall, EF is a powerful temporal credit assignment mechanism and a promising candidate model for learning in biological systems.
A Erdem Sagtekin, Colin Bredenberg, Cristina Savin
NeurIPS1
2024 Inferring stochastic low-rank recurrent neural networks from neural data
abstract
A central aim in computational neuroscience is to relate the activity of large populations of neurons to an underlying dynamical system. Models of these neural dynamics should ideally be both interpretable and fit the observed data well. Low-rank recurrent neural networks (RNNs) exhibit such interpretability by having tractable dynamics. However, it is unclear how to best fit low-rank RNNs to data consisting of noisy observations of an underlying stochastic system. Here, we propose to fit stochastic low-rank RNNs with variational sequential Monte Carlo methods. We validate our method on several datasets consisting of both continuous and spiking neural data, where we obtain lower dimensional latent dynamics than current state of the art methods. Additionally, for low-rank models with piecewise linear nonlinearities, we show how to efficiently identify all fixed points in polynomial rather than exponential cost in the number of units, making analysis of the inferred dynamics tractable for large RNNs. Our method both elucidates the dynamical systems underlying experimental recordings and provides a generative model whose trajectories match observed variability.
Matthijs Pals, A Erdem Sagtekin, Felix Pei, Manuel Glöckler, Jakob H. Macke
NeurIPS2