BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Ying Guo

Ying Guo contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
quant-phComputer VisionMachine LearningNeurons and CognitionComputationComputational Complexitycs.CYData Structures and Algorithmseess.IVMultimediaNeural and Evolutionary Computing

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
12works
0followers
11topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

12 published item(s)

preprint2026arXiv

HiDream-O1-Image: A Natively Unified Image Generative Foundation Model with Pixel-level Unified Transformer

The evolution of visual generative models has long been constrained by fragmented architectures relying on disjoint text encoders and external VAEs. In this report, we present HiDream-O1-Image, a natively unified generative foundation model via pixel-space Diffusion Transformer, that pioneers a paradigm shift from modular architectures to an end-to-end in-context visual generation engine. By mapping raw image pixels, text tokens, and task-specific conditions into a single shared token space, HiDream-O1-Image achieves a structural unification of multimodal inputs within an Unified Transformer (UiT) architecture. This native encoding paradigm eliminates the need for separate VAEs or disjoint pre-trained text encoders, allowing the model to treat diverse generation and editing tasks as a consistent in-context reasoning process. Extensive experiments show that HiDream-O1-Image excels across various generation tasks, including text-to-image generation, instruction-based editing, and subject-driven personalization. Notably, with only 8B parameters, HiDream-O1-Image (8B) achieves performance parity with or even surpasses established state-of-the-art models with significantly larger parameters (e.g., 27B Qwen-Image). Crucially, to validate the immense scalability of this paradigm, we successfully scale the architecture up to over 200B parameters. Experimental results demonstrate that this massive-scale version HiDream-O1-Image-Pro (200B+) unlocks unprecedented generative capabilities and superior performance, establishing new state-of-the-art benchmarks. Ultimately, HiDream-O1-Image highlights the immense potential of natively unified architectures and charts a highly scalable path toward next-generation multimodal AI.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Quantifying the Upper Limit of Backflash Attack in Quantum Key Distribution

Quantum key distribution (QKD) provides information-theoretic security grounded in the fundamental laws of physics. Nevertheless, practical imperfections can introduce side channels that expose QKD systems to quantum hacking, especially passive attacks that are inherently difficult to detect. In this study, we experimentally and theoretically investigate the upper limit of the backflash attack-a representative passive side-channel threat. Using a fully equipped fiber-based QKD receiver, we demonstrate the feasibility of the attack and reveal its limited capability in distinguishing quantum states. We further develop a theoretical framework to quantify the maximum distinguishability achievable by an eavesdropper, taking into account the broadband spectral nature of backflash photons. The analysis shows that Eve can extract effective key information from at most 95.7% of the backflash photons. Based on these findings, we evaluate the secure key rate of a decoy-state BB84 QKD system under backflash attack. Our results provide a quantitative assessment of the vulnerability of QKD systems to backflash emissions and offer a general methodology to evaluate the practical security of QKD systems.

0 citations0 reviewsNo code linkedOpen access
preprint2025arXiv

Continuous-variable quantum key distribution network based on entangled states of optical frequency combs

Continuous-variable quantum key distribution (CVQKD) features a high key rate and compatibility with classical optical communication. Developing expandable and efficient CVQKD networks will promote the deployment of large-scale quantum communication networks in the future. This paper proposes a CVQKD network based on the entangled states of an optical frequency comb. This scheme generates Einstein-Podolsky-Rosen entangled states with a frequency comb structure through the process of a type-II optical parametric oscillator. By combining with the scheme of entanglement in the middle, a fully connected CVQKD network capable of distributing secret keys simultaneously can be formed. We analyze the security of the system in the asymptotic case. Simulation results show that under commendable controlling of system loss and noise, the proposed scheme is feasible for deploying a short-distance fully connected CVQKD network. Loss will be the main factor limiting the system's performance. The proposed scheme provides new ideas for a multi-user fully connected CVQKD network.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Data-Efficient Brain Connectome Analysis via Multi-Task Meta-Learning

Brain networks characterize complex connectivities among brain regions as graph structures, which provide a powerful means to study brain connectomes. In recent years, graph neural networks have emerged as a prevalent paradigm of learning with structured data. However, most brain network datasets are limited in sample sizes due to the relatively high cost of data acquisition, which hinders the deep learning models from sufficient training. Inspired by meta-learning that learns new concepts fast with limited training examples, this paper studies data-efficient training strategies for analyzing brain connectomes in a cross-dataset setting. Specifically, we propose to meta-train the model on datasets of large sample sizes and transfer the knowledge to small datasets. In addition, we also explore two brain-network-oriented designs, including atlas transformation and adaptive task reweighing. Compared to other pre-training strategies, our meta-learning-based approach achieves higher and stabler performance, which demonstrates the effectiveness of our proposed solutions. The framework is also able to derive new insights regarding the similarities among datasets and diseases in a data-driven fashion.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

FBNETGEN: Task-aware GNN-based fMRI Analysis via Functional Brain Network Generation

Functional magnetic resonance imaging (fMRI) is one of the most common imaging modalities to investigate brain functions. Recent studies in neuroscience stress the great potential of functional brain networks constructed from fMRI data for clinical predictions. Traditional functional brain networks, however, are noisy and unaware of downstream prediction tasks, while also incompatible with the deep graph neural network (GNN) models. In order to fully unleash the power of GNNs in network-based fMRI analysis, we develop FBNETGEN, a task-aware and interpretable fMRI analysis framework via deep brain network generation. In particular, we formulate (1) prominent region of interest (ROI) features extraction, (2) brain networks generation, and (3) clinical predictions with GNNs, in an end-to-end trainable model under the guidance of particular prediction tasks. Along with the process, the key novel component is the graph generator which learns to transform raw time-series features into task-oriented brain networks. Our learnable graphs also provide unique interpretations by highlighting prediction-related brain regions. Comprehensive experiments on two datasets, i.e., the recently released and currently largest publicly available fMRI dataset Adolescent Brain Cognitive Development (ABCD), and the widely-used fMRI dataset PNC, prove the superior effectiveness and interpretability of FBNETGEN. The implementation is available at https://github.com/Wayfear/FBNETGEN.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Identifying Critical LMS Features for Predicting At-risk Students

Learning management systems (LMSs) have become essential in higher education and play an important role in helping educational institutions to promote student success. Traditionally, LMSs have been used by postsecondary institutions in administration, reporting, and delivery of educational content. In this paper, we present an additional use of LMS by using its data logs to perform data-analytics and identify academically at-risk students. The data-driven insights would allow educational institutions and educators to develop and implement pedagogical interventions targeting academically at-risk students. We used anonymized data logs created by Brightspace LMS during fall 2019, spring 2020, and fall 2020 semesters at our college. Supervised machine learning algorithms were used to predict the final course performance of students, and several algorithms were found to perform well with accuracy above 90%. SHAP value method was used to assess the relative importance of features used in the predictive models. Unsupervised learning was also used to group students into different clusters based on the similarities in their interaction/involvement with LMS. In both of supervised and unsupervised learning, we identified two most-important features (Number_Of_Assignment_Submissions and Content_Completed). More importantly, our study lays a foundation and provides a framework for developing a real-time data analytics metric that may be incorporated into a LMS.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Improving Adversarial Transferability with Gradient Refining

Deep neural networks are vulnerable to adversarial examples, which are crafted by adding human-imperceptible perturbations to original images. Most existing adversarial attack methods achieve nearly 100% attack success rates under the white-box setting, but only achieve relatively low attack success rates under the black-box setting. To improve the transferability of adversarial examples for the black-box setting, several methods have been proposed, e.g., input diversity, translation-invariant attack, and momentum-based attack. In this paper, we propose a method named Gradient Refining, which can further improve the adversarial transferability by correcting useless gradients introduced by input diversity through multiple transformations. Our method is generally applicable to many gradient-based attack methods combined with input diversity. Extensive experiments are conducted on the ImageNet dataset and our method can achieve an average transfer success rate of 82.07% for three different models under single-model setting, which outperforms the other state-of-the-art methods by a large margin of 6.0% averagely. And we have applied the proposed method to the competition CVPR 2021 Unrestricted Adversarial Attacks on ImageNet organized by Alibaba and won the second place in attack success rates among 1558 teams.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Multi-Forgery Detection Challenge 2022: Push the Frontier of Unconstrained and Diverse Forgery Detection

In this paper, we present the Multi-Forgery Detection Challenge held concurrently with the IEEE Computer Society Workshop on Biometrics at CVPR 2022. Our Multi-Forgery Detection Challenge aims to detect automatic image manipulations including but not limited to image editing, image synthesis, image generation, image photoshop, etc. Our challenge has attracted 674 teams from all over the world, with about 2000 valid result submission counts. We invited the Top 10 teams to present their solutions to the challenge, from which three teams are awarded prizes in the grand finale. In this paper, we present the solutions from the Top 3 teams, in order to boost the research work in the field of image forgery detection.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Enhancing discrete-modulated continuous-variable measurement-device-independent quantum key distribution via quantum catalysis

The discrete modulation can make up for the shortage of transmission distance in measurement-device-independent continuous-variable quantum key distribution (MDI-CVQKD) that has an unique advantage against all side-channel attacks but also challenging for the further performance improvement. Here we suggest a quantum catalysis (QC) approach for enhancing the performance of the discrete-modulated (DM) MDI-CVQKD in terms of the achievable secret key rate and lengthening the maximal transmission distance. The numerical simulation results show that the QC-based MDI-CVQKD with discrete modulation that involves a zero-photon catalysis (ZPC) operation can not only obtain a higher secret key rate than the original DM protocol, but also contributes to the reasonable increase of the corresponding optimal variance. As for the extreme asymmetric and symmetric cases, the secret key rate and maximal transmission distance of the ZPC-involved DM MDI-CVQKD system can be further improved under the same parameters. This approach enables the system to tolerate lower reconciliation efficiency, which will promote the practical implementations with state-of-art technology.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

HINT: A Hierarchical Independent Component Analysis Toolbox for Investigating Brain Functional Networks using Neuroimaging Data

Independent component analysis (ICA) is a popular tool for investigating brain organization in neuroscience research. In fMRI studies, an important goal is to study how brain networks are modulated by subjects' clinical and demographic variables. Existing ICA methods and toolboxes don't incorporate subjects' covariates effects in ICA estimation of brain networks, which potentially leads to loss in accuracy and statistical power in detecting brain network differences between subjects' groups. We introduce a Matlab toolbox, HINT (Hierarchical INdependent component analysis Toolbox), that provides a hierarchical covariate-adjusted ICA (hc-ICA) for modeling and testing covariate effects and generates model-based estimates of brain networks on both the population- and individual-level. HINT provides a user-friendly Matlab GUI that allows users to easily load images, specify covariate effects, monitor model estimation via an EM algorithm, specify hypothesis tests, and visualize results. HINT also has a command line interface which allows users to conveniently run and reproduce the analysis with a script. HINT implements a new multi-level probabilistic ICA model for group ICA. It provides a statistically principled ICA modeling framework for investigating covariate effects on brain networks. HINT can also generate and visualize model-based network estimates for user-specified subject groups, which greatly facilitates group comparisons.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Linear-Time Parameterized Algorithms with Limited Local Resources

We propose a new (theoretical) computational model for the study of massive data processing with limited computational resources. Our model measures the complexity of reading the very large data sets in terms of the data size N and analyzes the computational cost in terms of a parameter k that characterizes the computational power provided by limited local computing resources. We develop new algorithmic techniques that implement algorithms for solving well-known computational problems on the proposed model. In particular, we present an algorithm that finds a k-matching in a general unweighted graph in time O(N + k^{2.5}) and an algorithm that constructs a maximum weighted k-matching in a general weighted graph in time O(N + k^3 log k). Both algorithms have their space complexity bounded by O(k^2).

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Multi-label learning for improving discretely-modulated continuous-variable quantum key distribution

Discretely-modulated continuous-variable quantum key distribution (CVQKD) is more suitable for long-distance transmission compared with its Gaussian-modulated CVQKD counterpart. However, its security can only be guaranteed when modulation variance is very small, which limits its further development. To solve this problem, in this work, we propose a novel scheme for discretely-modulated CVQKD using multi-label learning technology, called multi-label learning-based CVQKD (ML-CVQKD). In particular, the proposed scheme divides the whole quantum system into state learning and state prediction. The former is used for training and estimating quantum classifier, and the latter is used for generating final secret key. A quantum multi-label classification (QMLC) algorithm is also designed as an embedded classifier for distinguishing coherent state. Feature extraction for coherent state and related machine learning-based metrics for the quantum classifier are successively suggested. Security analysis shows that QMLC-embedded ML-CVQKD is able to immune intercept-resend attack so that small modulation variance is no longer compulsively required, thereby improving the performance of discretely-modulated CVQKD system.

0 citations0 reviewsNo code linkedOpen access