atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

MarkovType: A Markov Decision Process Strategy for Non-Invasive Brain-Computer Interfaces Typing Systems

AAAI 2025 · Label-efficient and robust learning › Recognition and long-tail · approach: Dense features and foundation priors · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Formulates RSVP EEG typing as a POMDP and trains a recurrent recursive classifier with REINFORCE plus a supervised loss, outperforming recursive Bayesian CNN baselines in accuracy and ITR.

Problem

Symbol classification in noninvasive EEG RSVP typing is inaccurate because existing methods use binary target/non-target classification, assume within-query independence, and do not train the recursive typing procedure.

Approach

Treats the RSVP typing process as a partially observable MDP in which a recurrent agent selects queries from the symbol prior, receives partial EEG observations, and is trained with REINFORCE on a discounted reward for correct decisions, together with a hybrid supervised loss, so classification is over the full alphabet during training.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use MarkovType with discount d(n)=(2N-n-1)/N instead of RB - 2D CNNSimulated RSVP typing · Simulated RSVP typing, with threshold τaccuracy: 0.489±0.012 -> 0.870±0.004Helped
Use MarkovType with discount d(n)=(2N-n-1)/N instead of RB - 2D CNNSimulated RSVP typing · Simulated RSVP typing, with threshold τITR per selection: 1.377±0.058 -> 3.635±0.031Helped
Use MarkovType with discount d(n)=(2N-n-1)/N instead of RB - 2D CNNSimulated RSVP typing · Simulated RSVP typing, with threshold τITR per sequence: 0.537±0.020 -> 0.734±0.023Helped
Use MarkovType with discount d(n)=(2N-n-1)/N instead of RB - 1D CNNSimulated RSVP typing · Simulated RSVP typing, with threshold τsequences per selection: 2.321±0.064 -> 4.956±0.183Hurt
Replace discount d(n)=(2N-n-1)/N with d(n)=1/n (ablation)MarkovType · Simulated RSVP typing, with threshold τaccuracy: 0.870±0.004 -> 0.859±0.015Hurt
Replace discount d(n)=(2N-n-1)/N with d(n)=1/n² (ablation)MarkovType · Simulated RSVP typing, with threshold τITR per sequence: 0.734±0.023 -> 0.763±0.012Helped
Replace discount d(n)=(2N-n-1)/N with d(n)=1/n² (ablation)MarkovType · Simulated RSVP typing, with threshold τaccuracy: 0.870±0.004 -> 0.845±0.020Hurt
Replace discount d(n)=(2N-n-1)/N with d(n)=1/n³ (ablation)MarkovType · Simulated RSVP typing, with threshold τITR per sequence: 0.734±0.023 -> 0.756±0.031Helped
Replace discount d(n)=1/n² with d(n)=1/n³ (ablation)MarkovType · Simulated RSVP typing, with threshold τITR per sequence: 0.763±0.012 -> 0.756±0.031Hurt

Surprising findings

Limitations

Experimental setup

Datasets: large public RSVP benchmark (64-subject street-view target detection EEG, over 1 million stimulus presentations)

Benchmarks: simulated RSVP typing on the public 64-channel EEG RSVP dataset (1000 target symbols, alphabet of 28)

Metrics: accuracy ITR per selection ITR per sequence mean number of sequences per selection

Baselines: RB - 1D CNN RB - 2D CNN

Builds on: Recurrent Attention Model REINFORCE EEGNet Recursive Bayesian estimation for RSVP

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy