Demo Data from EDBT 2026 / reviewers in the wild / expert
Amy L. Orsborn
dblp:27/9124
· DBLP profile ↗
6ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0003-4131-5781ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1
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
1 paper |
Graph learning · 87% Probabilistic and Bayesian machine learning · 13% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 50% Computational social science and digital humanities · 50% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph neural network |
0.7 | 1 | 2023 | AMAG: Additive, Multiplicative and Adaptive Graph Neural Network For Forecasting Neuron Activity · NeurIPS 2023 |
Machine learning › Graph learning › graph neural network
message passing |
0.7 | 1 | 2023 | AMAG: Additive, Multiplicative and Adaptive Graph Neural Network For Forecasting Neuron Activity · NeurIPS 2023 |
Computational social science and digital humanities
forecasting |
0.7 | 1 | 2023 | AMAG: Additive, Multiplicative and Adaptive Graph Neural Network For Forecasting Neuron Activity · NeurIPS 2023 |
Bioinformatics and computational biology › computational neuroscience
neural population dynamics |
0.7 | 1 | 2023 | AMAG: Additive, Multiplicative and Adaptive Graph Neural Network For Forecasting Neuron Activity · NeurIPS 2023 |
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model |
0.2 | 1 | 2023 | AMAG: Additive, Multiplicative and Adaptive Graph Neural Network For Forecasting Neuron Activity · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
multiplicative message passing · 1.3additive message passing · 1.3adaptive graph learning · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SPINT: Spatial Permutation-Invariant Neural Transformer for Consistent Intracortical Motor DecodingabstractIntracortical Brain-Computer Interfaces (iBCI) decode behavior from neural population activity to restore motor functions and communication abilities in individuals with motor impairments. A central challenge for long-term iBCI deployment is the nonstationarity of neural recordings, where the composition and tuning profiles of the recorded populations are unstable across recording sessions. Existing approaches attempt to address this issue by explicit alignment techniques; however, they rely on fixed neural identities and require test-time labels or parameter updates, limiting their generalization across sessions and imposing additional computational burden during deployment. In this work, we address the problem of cross-session nonstationarity in long-term iBCI systems and introduce SPINT - a Spatial Permutation-Invariant Neural Transformer framework for behavioral decoding that operates directly on unordered sets of neural units. Central to our approach is a novel context-dependent positional embedding scheme that dynamically infers unit-specific identities, enabling flexible generalization across recording sessions. SPINT supports inference on variable-size populations and allows few-shot, gradient-free adaptation using a small amount of unlabeled data from the test session. We evaluate SPINT on three multi-session datasets from the FALCON Benchmark, covering continuous motor decoding tasks in human and non-human primates. SPINT demonstrates robust cross-session generalization, outperforming existing zero-shot and few-shot unsupervised baselines while eliminating the need for test-time alignment and fine-tuning. Our work contributes an initial step toward a robust and scalable neural decoding framework for long-term iBCI applications. Trung Le 0002, Lu Mi, Amy L. Orsborn, Uygar Sümbül, Eli Shlizerman |
NeurIPS | 6 |
| 2023 | AMAG: Additive, Multiplicative and Adaptive Graph Neural Network For Forecasting Neuron ActivityabstractLatent Variable Models (LVMs) propose to model the dynamics of neural populations by capturing low-dimensional structures that represent features involved in neural activity. Recent LVMs are based on deep learning methodology where a deep neural network is trained to reconstruct the same neural activity given as input and as a result to build the latent representation. Without taking past or future activity into account such a task is non-causal. In contrast, the task of forecasting neural activity based on given input extends the reconstruction task. LVMs that are trained on such a task could potentially capture temporal causality constraints within its latent representation. Forecasting has received less attention than reconstruction due to recording challenges such as limited neural measurements and trials. In this work, we address modeling neural population dynamics via the forecasting task and improve forecasting performance by including a prior, which consists of pairwise neural unit interaction as a multivariate dynamic system. Our proposed model---Additive, Multiplicative, and Adaptive Graph Neural Network (AMAG)---leverages additive and multiplicative message-passing operations analogous to the interactions in neuronal systems and adaptively learns the interaction among neural units to forecast their future activity. We demonstrate the advantage of AMAG compared to non-GNN based methods on synthetic data and multiple modalities of neural recordings (field potentials from penetrating electrodes or surface-level micro-electrocorticography) from four rhesus macaques. Our results show the ability of AMAG to recover ground truth spatial interactions and yield estimation for future dynamics of the neural population. Leo Scholl, Trung Le 0002, Pavithra Rajeswaran, Amy L. Orsborn, Eli Shlizerman |
NeurIPS | 5 |
| 2016 | Robust Brain-Machine Interface Design Using Optimal Feedback Control Modeling and Adaptive Point Process FilteringabstractMuch progress has been made in brain-machine interfaces (BMI) using decoders such as Kalman filters and finding their parameters with closed-loop decoder adaptation (CLDA). However, current decoders do not model the spikes directly, and hence may limit the processing time-scale of BMI control and adaptation. Moreover, while specialized CLDA techniques for intention estimation and assisted training exist, a unified and systematic CLDA framework that generalizes across different setups is lacking. Here we develop a novel closed-loop BMI training architecture that allows for processing, control, and adaptation using spike events, enables robust control and extends to various tasks. Moreover, we develop a unified control-theoretic CLDA framework within which intention estimation, assisted training, and adaptation are performed. The architecture incorporates an infinite-horizon optimal feedback-control (OFC) model of the brain's behavior in closed-loop BMI control, and a point process model of spikes. The OFC model infers the user's motor intention during CLDA-a process termed intention estimation. OFC is also used to design an autonomous and dynamic assisted training technique. The point process model allows for neural processing, control and decoder adaptation with every spike event and at a faster time-scale than current decoders; it also enables dynamic spike-event-based parameter adaptation unlike current CLDA methods that use batch-based adaptation on much slower adaptation time-scales. We conducted closed-loop experiments in a non-human primate over tens of days to dissociate the effects of these novel CLDA components. The OFC intention estimation improved BMI performance compared with current intention estimation techniques. OFC assisted training allowed the subject to consistently achieve proficient control. Spike-event-based adaptation resulted in faster and more consistent performance convergence compared with batch-based methods, and was robust to parameter initialization. Finally, the architecture extended control to tasks beyond those used for CLDA training. These results have significant implications towards the development of clinically-viable neuroprosthetics. Maryam Modir Shanechi, Amy L. Orsborn, Jose M. Carmena |
PLoS Comput. Biol. | 2 |
| 2014 | Continuous Closed-Loop Decoder Adaptation with a Recursive Maximum Likelihood Algorithm Allows for Rapid Performance Acquisition in Brain-Machine InterfacesabstractClosed-loop decoder adaptation (CLDA) is an emerging paradigm for both improving and maintaining online performance in brain-machine interfaces (BMIs). The time required for initial decoder training and any subsequent decoder recalibrations could be potentially reduced by performing continuous adaptation, in which decoder parameters are updated at every time step during these procedures, rather than waiting to update the decoder at periodic intervals in a more batch-based process. Here, we present recursive maximum likelihood (RML), a CLDA algorithm that performs continuous adaptation of a Kalman filter decoder's parameters. We demonstrate that RML possesses a variety of useful properties and practical algorithmic advantages. First, we show how RML leverages the accuracy of updates based on a batch of data while still adapting parameters on every time step. Second, we illustrate how the RML algorithm is parameterized by a single, intuitive half-life parameter that can be used to adjust the rate of adaptation in real time. Third, we show how even when the number of neural features is very large, RML's memory-efficient recursive update rules can be reformulated to also be computationally fast so that continuous adaptation is still feasible. To test the algorithm in closed-loop experiments, we trained three macaque monkeys to perform a center-out reaching task by using either spiking activity or local field potentials to control a 2D computer cursor. RML achieved higher levels of performance more rapidly in comparison to a previous CLDA algorithm that adapts parameters on a more intermediate timescale. Overall, our results indicate that RML is an effective CLDA algorithm for achieving rapid performance acquisition using continuous adaptation. Siddharth Dangi, Suraj Gowda, Helene G. Moorman, Amy L. Orsborn, Kelvin So, Maryam Modir Shanechi, Jose M. Carmena |
Neural Comput. | 4 |
| 2013 | Design and Analysis of Closed-Loop Decoder Adaptation Algorithms for Brain-Machine InterfacesabstractClosed-loop decoder adaptation (CLDA) is an emerging paradigm for achieving rapid performance improvements in online brain-machine interface (BMI) operation. Designing an effective CLDA algorithm requires making multiple important decisions, including choosing the timescale of adaptation, selecting which decoder parameters to adapt, crafting the corresponding update rules, and designing CLDA parameters. These design choices, combined with the specific settings of CLDA parameters, will directly affect the algorithm's ability to make decoder parameters converge to values that optimize performance. In this article, we present a general framework for the design and analysis of CLDA algorithms and support our results with experimental data of two monkeys performing a BMI task. First, we analyze and compare existing CLDA algorithms to highlight the importance of four critical design elements: the adaptation timescale, selective parameter adaptation, smooth decoder updates, and intuitive CLDA parameters. Second, we introduce mathematical convergence analysis using measures such as mean-squared error and KL divergence as a useful paradigm for evaluating the convergence properties of a prototype CLDA algorithm before experimental testing. By applying these measures to an existing CLDA algorithm, we demonstrate that our convergence analysis is an effective analytical tool that can ultimately inform and improve the design of CLDA algorithms. Siddharth Dangi, Amy L. Orsborn, Helene G. Moorman, Jose M. Carmena |
Neural Comput. | 2 |
| 2010 | System Architecture for Stiffness Control in Brain-Machine InterfacesabstractBrain-machine interfaces (BMIs) provide a versatile tool for rehabilitation of severely disabled people. Current BMI systems focus on the control of kinematic variables. However, this approach limits the application space of BMI technology to simulated environments. Real-world rehabilitation robots, on the other hand, must operate in a variety of complex physical situations. BMI systems that are aimed toward prostheses must, then, control interaction forces with their environments. In this paper, we design a BMI-driven architecture that provides a critical link between neuronal ensemble activity and real-world dynamics. In particular, our system allows simultaneous estimation of kinematic and stiffness variables of a prosthetic device. This approach is achieved by recording instantaneous activities from cortical neural ensembles that input to a musculoskeletal model of the arm, from which limb kinematics and dynamics are estimated and converted into control signals of a prosthetic device. Using real neural and behavioral data from nonhuman primates, we show that our architecture can accurately predict kinematic and stiffness variables in different dynamic situations. This architecture has strong implications in the development of the next generation of neural prosthetics that will restore motor function in neurologically impaired patients. Moreover, it demonstrates a novel framework for studying how the brain learns and adapts to new environments. Rodolphe Héliot, Amy L. Orsborn, Karunesh Ganguly, Jose M. Carmena |
IEEE Trans. Syst. Man Cybern. Part A | 2 |