{"id":"9f092acd-0930-405b-9a9f-03f9d9aa6b94","arxiv_id":"1908.03926","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"The paper presents a discrete hidden Markov model for time-varying MEG/EEG source location with a closed-form forward-backward posterior over voxels, estimated via EM, plus switch and dynamic procedures for multi-source localization.","lead":"A statistics team models moving brain sources as a discrete hidden Markov chain over a grid of brain locations and computes the source location posterior at every time point in closed form from the full MEG/EEG recording. The method avoids sequential sampling, but relies on fixing the dipole moment and on hand-chosen regions of interest.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Concern: the discrete posterior is conditional on a fixed, user-specified moment q (Sections 2.2 and 4); if the true q_t varies or is misspecified, moment dynamics can be misread as source motion, and no sensitivity analysis is provided.","rationale":"The reader's weakest_assumption identifies the same load-bearing concern: the fixed moment and strength parameter q_t. I agree this is the most load-bearing because it directly undermines the 'time-varying source' claim: the method computes a location posterior conditional on a q that is fixed by hand, and the real-data analysis fixes q to an arbitrary unit vector. A misspecified or time-varying q changes the forward model, so the location posterior can be biased in a direction that looks like source motion; no simulation or sensitivity check addresses this. The discrete HMM machinery itself is standard and plausible; the discretization error and the weak Theorem 2.2 are real limitations but secondary, because the single-source posterior computation is the core of the method and the fixed-q assumption enters even there. The reader's CONDITIONAL verdict remains appropriate: the paper should not be rejected, but the central claim of reliable, time-varying source quantification is not fully supported without either estimating q or demonstrating robustness to moment misspecification.","tokens_in":26878,"tokens_out":11764,"duration_ms":134402,"concrete_test":"Simulate a single-source data set with p_t held fixed at p* = (1,1,5) cm (Table 5 setup) and q_t rotating in the horizontal plane, q_t = R(omega t) q_0 with omega = pi/50 per time step, T = 100, and noise V from Table 5. Run the proposed dynamic EM with q fixed at (a) q_0 and (b) a unit vector along z. Compute the posterior mean trajectory of p_t. If the posterior means move by more than one voxel width while p* is fixed, or if changing the assumed q shifts the mode by more than one voxel, the location posterior is not robust to time-varying moments, and the central claim fails unless q is known.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central object P(J_t^p in V_k | Y_T, Theta) is not a posterior over the full source: Section 2.2 states 'the moment and strength parameter q_t is fixed for all the time points,' and Section 4 assumes 'a unit moment for all possible sources for simplicity.' Since the emission in Eq. (2.1) is B_l(J_t^p) = (mu_0 / 4 pi) [q_t x (r_l - p_t)] . e_z / ||r_l - p_t||^3, the likelihood at every voxel is computed with this fixed q. The forward-backward recursion is exact for the resulting discrete HMM, but the HMM itself is the wrong generative model whenever q_t varies or is misspecified. In particular, a dipole with fixed location but rotating q_t produces a time-varying field pattern; the fixed-q likelihood can interpret this as a moving source, creating spurious posterior movement. The simulations in Table 5 keep q_t nearly constant (moment variance 1e-4), so the failure mode is never exercised; the real-data analysis fixes q to an arbitrary unit vector without validation. Without a sensitivity analysis over q, the claim that the discrete posterior quantifies the time-varying source is unsupported for exactly the regime the title promises.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a discrete hidden Markov model approach to the MEG inverse problem. The source location space is discretized into K voxels, and the hidden state at each time point is the voxel containing the source. A forward-backward algorithm computes the discrete posterior P(J_t^p in V_k | Y_T, Theta) using the entire set of measurements, and an EM algorithm estimates the model parameters. A dynamic procedure iteratively shrinks the ROI and increases mesh resolution, and a switch procedure approximates the multi-source posterior by iteratively conditioning on the other sources. The method is demonstrated on simulated single- and two-source data, on a BCI MEG data set, and on an EEG working-memory data set.","tokens_in":27124,"tokens_out":8945,"duration_ms":86414,"significance":"If the proposed framework were fully validated, it would offer an attractive alternative to sequential Monte Carlo for time-varying MEG source localization, providing closed-form discrete posteriors and smoothing over all measurements. The forward-backward recursions and EM updates are standard under the stated discrete model, and the dynamic and switch procedures address important computational scalability issues. The use of simulated ground truth and two real data applications is a strength. However, several load-bearing issues currently prevent the central claim from being supported: the discrete HMM is not completely specified, the moment parameter is fixed without sensitivity analysis, the discretization error is unquantified, and the switch-procedure theorem is vacuous as stated. These issues are fixable but require substantial additional work.","major_comments":[{"comment":"The discrete HMM is not fully specified. The paper states approximations of the continuous initial, transition, and emission probabilities, but never defines how P(v_1k=1|Theta) and P(v_tk=1|v_{t-1,l}=1,Theta) are computed from the Gaussian AR model of Eq (2.4). The forward-backward algorithm in Tables 1-2 and the EM updates in Table 3 require these quantities. Please provide explicit formulas, presumably integrals of the Gaussian densities over the voxels, and state how the categorical initial and transition probabilities are derived from the continuous model.","section":"Section 2.2, Eqs (2.6)-(2.8)"},{"comment":"The moment/strength parameter q_t is fixed for all time points (Section 2.2) and set to a unit vector in the real data (Section 4). Because the emission B_l(J_t^p) depends on q_t, a time-varying or misspecified moment can produce time-varying field patterns that the fixed-q likelihood will attribute to source motion. The simulations in Table 5 keep q_t essentially constant (moment variances 1e-4), so this failure mode is never exercised. Add a sensitivity analysis with rotating or misspecified moments, or explicitly restrict the claim to sources with a known, constant moment.","section":"Section 2.2 and Section 4, Eq (2.1)"},{"comment":"The paper claims that the discrete posterior 'approximates' the continuous posterior, but no discretization error bound or convergence analysis is provided. The dynamic procedure's ROI shrinkage also has no coverage guarantee. Provide either a theoretical bound (e.g., as K increases) or an empirical convergence study (e.g., showing stability of the posterior as mesh grids increase) to support the central approximation claim.","section":"Section 2.2 and Section 2.5"},{"comment":"Theorem 2.2 as stated is vacuous: 'there exists epsilon > 0 such that |...| <= c epsilon' is trivially true for arbitrary epsilon, and the proof relies on assumption (B.3), which essentially assumes the difference between the switch and non-switch marginals is small. The theorem therefore does not provide a meaningful bound on the switch procedure's approximation error. Either state the theorem with a concrete quantity (e.g., the distance ||Theta_s - Theta_ns||) or present the switch procedure as a heuristic supported by the two-source simulation.","section":"Appendix B / Theorem 2.2"},{"comment":"In the real-data analysis, the parameters mu_0, Sigma_0, and Sigma are manually set, and the reported posterior distributions are not accompanied by any sensitivity analysis over these choices. Since the method's output likely depends on these manual settings, please report robustness results, for example by varying the manual parameters and showing that the posterior means and distributions remain stable.","section":"Section 4"}],"minor_comments":[{"comment":"The product alpha_tk(Theta) beta_tk(Theta) equals the posterior P(v_tk=1|Y_T,Theta) only up to a normalizing constant that depends on t. The equality in (2.9) should be replaced by proportionality, or the normalization over k should be stated explicitly.","section":"Section 2.2, Eq (2.9)"},{"comment":"The first Markov property is printed tautologically as p(J_t^p|J_{t-1}^p,Theta) = p(J_t^p|J_{t-1}^p,Theta); the intended statement is that J_t^p is first-order Markov in time.","section":"Section 2.1, bullet 1"},{"comment":"The standard deviations in Table 6 are based on only four repetitions. This is a very small number of replications; please either increase the number of simulations or interpret the reported variability with appropriate caution.","section":"Section 3, Table 6"},{"comment":"The claim that sequential sampling methods 'may suffer from slow convergence due to the large volume of measurement' is not supported by any comparison in the paper. Adding a small benchmark against SIS or a particle filter would substantiate this motivation.","section":"Abstract and Introduction"},{"comment":"The symbol J_p_T for the collection of sources is easily confused with the single-source notation J_t^p; consider using clearer notation, such as a bold or uppercase calligraphic symbol.","section":"Notation"},{"comment":"There are minor typos: in Section 2.3, 'P(J_p_T|YT, Theta(J-1)' is missing a closing bracket, and in Section 6, 'mutiple-source' should be 'multiple-source'.","section":"Section 2.3 and Section 6"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is within the scope of AOAS and addresses a practically important problem. The main structural gaps are fixable: the discrete HMM needs explicit transition/initial probabilities, the fixed-moment assumption needs a sensitivity analysis, and Theorem 2.2 should either be corrected or downgraded. The real-data analyses are exploratory and depend on externally estimated numbers of sources, which is acceptable but should be stated clearly. No concerns about citation patterns or novelty disclosure."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The new thing here is real: instead of sampling a continuous posterior as in your earlier SIS work, you represent the source location as a discrete hidden Markov state over voxels and compute the posterior with exact forward-backward recursions. That gives a closed-form discrete posterior that uses the entire measurement window, which is a legitimate and potentially useful advance for MEG/EEG practice. The EM updates are derived cleanly, the switch and dynamic procedures address the multi-source and large-ROI problems sensibly, and the paper is honest about what it fixes and what it leaves fixed.\n\nThe main soft spot is load-bearing. The likelihood is computed with a moment vector q that is fixed for all time points and all voxels. If the true moment varies or rotates, a fixed-q model can reinterpret moment dynamics as apparent source movement. The simulations keep q essentially constant (moment variance 1e-4), so that failure mode is never exercised, and the real-data analyses fix a unit moment without validation. The paper says the posterior quantifies the time-varying source, but it really quantifies the source under a strong, untested assumption about q. Some sensitivity analysis over q is essential.\n\nTwo other gaps are worth naming. First, the discretization error from replacing a continuous AR process with voxel transitions is never quantified; the mesh size is just chosen and increased heuristically. The forward-backward calculation is exact for the discrete model, but the discrete model's approximation error to the continuous target is unmeasured. Second, Theorem 2.2's bound is of the form \"there exists epsilon such that the error is at most c times epsilon,\" which is close to vacuous without a rate or a bound on epsilon. The comparison in the simulations also omits the existing KF/FIS and SIS baselines, so we do not see whether the discrete approach actually beats what is already in the literature.\n\nThese are fixable problems rather than fatal ones. The core HMM representation is sound under its stated model, and the paper does engage with the relevant prior work. I would send this to referees. The review will need to demand a sensitivity analysis for q, a quantitative discretization-error statement, and at least one head-to-head comparison with a reasonable sequential-sampling or Kalman baseline. The paper is aimed at MEG/EEG method developers and practitioners in cognitive neuroscience; for them, the discrete closed-form posterior is a concrete and potentially useful alternative to particle filtering. With those additions, it could become a solid contribution.","headline":"A genuinely new discrete HMM formulation for MEG source localization with exact forward-backward posteriors, but the fixed moment assumption and an unquantified discretization error keep the central claim from being fully supported.","tokens_in":27694,"tokens_out":1867,"would_cite":false,"duration_ms":23603,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["62F15","62M05","62P10"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper turns the time-varying MEG source-localization problem into a finite hidden Markov model, computing a closed-form discrete posterior for the source location at every time point from all measurements.","keywords":["MEG inverse problem","discrete posterior distribution","Expectation-Maximization","spatio-temporal model","source localization","hidden Markov model","forward-backward algorithm","magnetoencephalography"],"falsifier":"Simulate a source moving along a known trajectory while its dipole moment direction rotates; run the discrete method with a fixed unit moment and check whether the posterior means track the true path or shift to wrong voxels. A cleaner check: with known parameters, compare the discrete posterior to the exact continuous posterior obtained by fine-grid numerical integration on a small ROI; disagreement beyond the chosen voxel resolution would refute the closed-form claim.","tokens_in":26619,"feed_emoji":"🧠","tokens_out":8952,"duration_ms":82521,"temperature":0.7,"pith_summary":"The paper aims to quantify where a brain source is located over time in magnetoencephalography (MEG), a problem that is ill-posed and nonlinear in the location parameter. Its central claim is that discretizing the region of interest into voxels and treating the source location as a hidden Markov state yields a closed-form discrete posterior distribution at every time point, computed from the entire sequence of measurements rather than only the past. This avoids the slow convergence of sequential sampling methods while still describing the time evolution of the source. If the claim holds, practitioners get a tractable, probabilistic map of source activity across the whole scan.","feed_headline":"Closed-form discrete posterior locates moving MEG sources","feed_subtitle":"Turns the nonlinear inverse problem into a hidden Markov model solved by forward-backward and EM, without particle sampling.","key_machinery":"The machinery is the discretization of the brain region of interest into $K$ voxels $\\{V_k\\}$ with binary indicator variables $v_{tk}$, which turns the continuous state-space model into a finite hidden Markov model. This discretization makes the posterior $P(J_t^p \\in V_k \\mid Y_T, \\Theta)$ computable in closed form by the forward-backward algorithm, and it gives the EM algorithm closed-form parameter updates. The switch and dynamic procedures are auxiliary devices that make the same machinery tractable when there are multiple sources or when the region of interest is unknown; the switch handles state-space explosion by iterated marginal posteriors, and the dynamic procedure shrinks the ROI and increases mesh density during iterations.","core_discovery":"The paper claims that the continuous nonlinear MEG inverse problem can be replaced by a finite hidden Markov model over voxels: for each time point $t$ and voxel $V_k$, the posterior probability $P(J_t^p \\in V_k \\mid Y_T, \\Theta)$ is computed exactly (up to discretization) as the product $\\alpha_{tk}(\\Theta)\\beta_{tk}(\\Theta)$ from the forward-backward algorithm. The forward pass uses measurements up to $t$, the backward pass uses measurements from $t+1$ to $T$, so the posterior reflects the whole experiment. Parameters $\\Theta$ are estimated by an EM algorithm whose M-step updates have closed forms because the state space is finite. For multiple sources, a switch procedure computes each source's marginal posterior conditional on the others, and a dynamic procedure shrinks the region of interest while refining the mesh across EM iterations. The result is a quantification of the source trajectory as a posterior probability map rather than a point estimate or a sample cloud.","pith_inferences":["The same discretization could be extended to a joint location-orientation state by including the moment orientation in the voxel state, at the cost of a larger state space; the forward-backward and EM machinery would carry over unchanged.","Comparing posteriors from two mesh resolutions on the same data would give a practical convergence diagnostic, since the paper does not quantify discretization error.","If the number of sources is uncertain, the switch procedure could be embedded in a model-selection scheme, treating the source count as a hyperparameter and comparing marginal likelihoods.","A misspecified moment should show up as a systematic shift of the posterior; this is a testable empirical prediction that the paper does not address."],"forward_implications":["At every time point the method yields a full voxel-level probability map, so source uncertainty is reported directly rather than as a point estimate.","Because the backward pass uses future measurements, the posterior can localize a source more accurately after the fact than any filtering-only scheme.","The closed-form EM updates mean the computational bottleneck is the forward-backward sweep, so the method scales to long recordings without particle sampling.","For multiple sources, the switch procedure offers a tractable approximation with a proven bound relative to the full joint posterior.","When no region of interest is given, the dynamic procedure starts from a coarse whole-head grid and automatically concentrates the mesh around the active source."],"supporting_citations":[{"why":"Supplies the EM algorithm whose closed-form updates estimate the model parameters from incomplete MEG data.","marker":"[5]"},{"why":"Supplies the forward-backward algorithm that computes the smoothing posterior over voxel states.","marker":"[17]"},{"why":"The sequential importance sampling approach that this paper contrasts with and claims to improve on.","marker":"[23]"},{"why":"Provides the estimated number of sources used to initialize the real-data MEG and EEG analyses.","marker":"[24]"},{"why":"The Kalman-filter and fixed-interval-smoother state-space approach this method is designed to improve.","marker":"[13]"},{"why":"Establishes the quasi-static Biot-Savart forward model and the location/moment parameterization used throughout.","marker":"[7]"},{"why":"A dynamic MAP-EM algorithm for distributed sources that motivates the paper's dynamic spatio-temporal model.","marker":"[9]"}],"fun_headline_variants":["Discrete exact posterior tracks moving MEG sources","No-sampling posterior for time-varying brain sources","Forward-backward EM yields exact MEG source posteriors","Discrete HMM replaces particle filters for MEG sources","Closed-form posteriors map brain source paths over time"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the dipole moment and strength vector $q_t$ is fixed for all time points, and in the real-data analysis is set to a unit vector; if the true moment changes over time or is misspecified, the computed location posterior can be systematically biased.","fun_headline_variants_meta":{"raw":{"variants":["Discrete exact posterior tracks moving MEG sources","No-sampling posterior for time-varying brain sources","Forward-backward EM yields exact MEG source posteriors","Discrete HMM replaces particle filters for MEG sources","Closed-form posteriors map brain source paths over time"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000372,"raw_usage":{"total_tokens":2028,"prompt_tokens":1025,"completion_tokens":1003,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":641,"completion_tokens_details":{"reasoning_tokens":927}},"tokens_in":641,"tokens_out":1003,"duration_ms":8829,"temperature":1.0,"reasoning_tokens":927,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:58:21.140900+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate a source moving along a known trajectory while its dipole moment direction rotates; run the discrete method with a fixed unit moment and check whether the posterior means track the true path or shift to wrong voxels. A cleaner check: with known parameters, compare the discrete posterior to the exact continuous posterior obtained by fine-grid numerical integration on a small ROI; disagreement beyond the chosen voxel resolution would refute the closed-form claim.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the EM algorithm whose closed-form updates estimate the model parameters from incomplete MEG data."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the forward-backward algorithm that computes the smoothing posterior over voxel states."},{"cited_title":"Yao and W","cited_arxiv_id":null,"evidence_quote":"The sequential importance sampling approach that this paper contrasts with and claims to improve on."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the estimated number of sources used to initialize the real-data MEG and EEG analyses."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"The Kalman-filter and fixed-interval-smoother state-space approach this method is designed to improve."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes the quasi-static Biot-Savart forward model and the location/moment parameterization used throughout."},{"cited_title":"Lamus, M","cited_arxiv_id":null,"evidence_quote":"A dynamic MAP-EM algorithm for distributed sources that motivates the paper's dynamic spatio-temporal model."}],"review_version":1}