Source author record

Songlin Zhao

Songlin Zhao appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

5works
5topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

5 published item(s)

preprint2026arXiv

Supervised Deep Multimodal Matrix Factorization for Interpretable Brain Network Analysis

We present Supervised Deep Multimodal Matrix Factorization (SD3MF), an interpretable framework for integrative brain network analysis that generalizes Symmetric Nonnegative Matrix Tri-Factorization (SNMTF) from unsupervised single-graph clustering to supervised prediction over populations of multimodal graphs. SD3MF learns deep hierarchical factorizations for each modality together with a shared latent representation that aligns subjects across views. An encoder-decoder formulation jointly optimizes graph reconstruction and supervised prediction, while adaptive weights enable data-driven multimodal fusion. By representing each subject through community-level interaction matrices, the model yields interpretable and discriminative features. Experiments on multimodal connectome datasets show that SD3MF consistently outperforms strong deep learning baselines such as CNNs and GNNs, while enabling biologically interpretable insights. Code for reproducibility is available at: https://github.com/amjadseyedi/SD3MF.

preprint2026arXiv

Towards a Virtual Neuroscientist: Autonomous Neuroimaging Analysis via Multi-Agent Collaboration

Transforming neuroimaging data into clinically actionable biomarkers is a knowledge-intensive and labor-intensive process. Standardized workflows such as fMRIPrep have improved robustness and efficiency, but they are statically configured and cannot reason about downstream objectives, deliberate over alternative strategies, or close the loop between intermediate evidence and subsequent decisions in the way a human researcher would. This lack of closed-loop adaptation often leaves domain experts trapped in a cycle of manual trial-and-error to tune parameters and remediate pipeline failures, severely constraining the scalability of clinical biomarker development. To bridge this gap, we introduce NIAgent, a multi-agent system for autonomous end-to-end neuroimaging analysis. Unlike conventional flat tool-calling agents, NIAgent adopts a code-centric execution paradigm where specialist agents collaboratively synthesize and optimize executable programs over composable domain-specific primitives. This design enables robust, long-horizon workflow construction that adapts dynamically to runtime observations. Furthermore, we propose a hierarchical verification framework for autonomous quality control, integrating cohort-level metric screening with agentic visual inspection to drive evidence-grounded workflow remediation. Experiments on ADHD-200 and ADNI demonstrate that NIAgent outperforms standard workflow-based baselines in predictive performance while exhibiting sophisticated agentic behaviors, including strategy exploration and adaptive refinement.

preprint2019arXiv

Rational solutions for three semi-discrete modified Korteweg-de Vries type equations

In this paper, we consider three semi-discrete modified Korteweg-de Vries type equations which are the nonlinear lumped self-dual network equation,the semi-discrete lattice potential modified Korteweg-de Vries equation and a semi-discrete modified Korteweg-de Vries equation. We derive several kinds of exact solutions, in particular rational solutions, in terms of the Casorati determinant for these three equations respectively. For some rational solutions, we present the related asymptotic analysis to understand their dynamics better.

preprint2015arXiv

Regularized Kernel Recursive Least Square Algoirthm

In most adaptive signal processing applications, system linearity is assumed and adaptive linear filters are thus used. The traditional class of supervised adaptive filters rely on error-correction learning for their adaptive capability. The kernel method is a powerful nonparametric modeling tool for pattern analysis and statistical signal processing. Through a nonlinear mapping, kernel methods transform the data into a set of points in a Reproducing Kernel Hilbert Space. KRLS achieves high accuracy and has fast convergence rate in stationary scenario. However the good performance is obtained at a cost of high computation complexity. Sparsification in kernel methods is know to related to less computational complexity and memory consumption.

preprint2014arXiv

Generalized Cauchy matrix approach for non-autonomous discrete Kadomtsev-Petviashvili system

In this paper, we investigate the non-autonomous discrete Kadomtsev-Petviashvili (KP) system in terms of generalized Cauchy matrix approach. These equations include non-autonomous bilinear lattice KP equation, non-autonomous lattice potential KP equation, non-autonomous lattice potential modified KP equation, non-autonomous asymmetric lattice potential modified KP equation, non-autonomous lattice Schwarzian KP equation and non-autonomous lattice KP-type Nijhoff-Quispel-Capel equation. By introducing point transformations, all the equations are described as simplified forms, where the lattice parameters are absorbed. Several kinds of solutions more than multi-soliton solutions to these equations are derived by solving determining equation set. Lax representations for these equations are also discussed.