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

Yunfei Yang

Yunfei Yang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Machine LearningComputer Visionastro-ph.SRcond-mat.mtrl-scieess.IVmath.NAmath.STNumerical Analysisphysics.app-phStatistics Theory

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
6works
0followers
10topics
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

6 published item(s)

preprint2026arXiv

Mamoda2.5: Enhancing Unified Multimodal Model with DiT-MoE

We present Mamoda2.5, a unified AR-Diffusion framework that seamlessly integrates multimodal understanding and generation within a single architecture. To efficiently enhance the model's generation capability, we equip the Diffusion Transformer backbone with a fine-grained Mixture-of-Experts (MoE) design (128 experts, Top-8 routing), yielding a 25B-parameter model that activates only 3B parameters, significantly reducing training costs while scaling up the model capacity. Mamoda2.5 achieves top-tier generation performance on VBench 2.0 and sets a new record in video editing quality, surpassing evaluated open-source models and matching the performance of current top-tier proprietary models, including the Kling O1 on OpenVE-Bench. Furthermore, we introduce a joint few-step distillation and reinforcement learning framework that compresses the 30-step editing model into a 4-step model and greatly accelerates model inference. Compared to open-source baselines, Mamoda2.5 achieves up to $95.9\times$ faster video editing inference. In real-world applications, Mamoda2.5 has been successfully deployed for content moderation and creative restoration tasks in advertising scenarios, achieving a 98% success rate in internal advertising video editing scenario.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

An error analysis of generative adversarial networks for learning distributions

This paper studies how well generative adversarial networks (GANs) learn probability distributions from finite samples. Our main results establish the convergence rates of GANs under a collection of integral probability metrics defined through Hölder classes, including the Wasserstein distance as a special case. We also show that GANs are able to adaptively learn data distributions with low-dimensional structures or have Hölder densities, when the network architectures are chosen properly. In particular, for distributions concentrated around a low-dimensional set, we show that the learning rates of GANs do not depend on the high ambient dimension, but on the lower intrinsic dimension. Our analysis is based on a new oracle inequality decomposing the estimation error into the generator and discriminator approximation error and the statistical error, which may be of independent interest.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Learning Distributions by Generative Adversarial Networks: Approximation and Generalization

We study how well generative adversarial networks (GAN) learn probability distributions from finite samples by analyzing the convergence rates of these models. Our analysis is based on a new oracle inequality that decomposes the estimation error of GAN into the discriminator and generator approximation errors, generalization error and optimization error. To estimate the discriminator approximation error, we establish error bounds on approximating Hölder functions by ReLU neural networks, with explicit upper bounds on the Lipschitz constant of the network or norm constraint on the weights. For generator approximation error, we show that neural network can approximately transform a low-dimensional source distribution to a high-dimensional target distribution and bound such approximation error by the width and depth of neural network. Combining the approximation results with generalization bounds of neural networks from statistical learning theory, we establish the convergence rates of GANs in various settings, when the error is measured by a collection of integral probability metrics defined through Hölder classes, including the Wasserstein distance as a special case. In particular, for distributions concentrated around a low-dimensional set, we show that the convergence rates of GANs do not depend on the high ambient dimension, but on the lower intrinsic dimension.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

2.5-kV AlGaN/GaN Schottky Barrier Diode on Silicon Substrate with Recessed-anode Structure

In this letter, we demonstrate high-performance lateral AlGaN/GaN Schottky barrier diodes (SBD) on Si substrate with a recessed-anode structure. The optimized rapid etch process provides results in improving etching quality with a 0.26-nm roughness of the anode recessed surface. By using the high work function metal Pt as the Schottky electrode, a low Von of 0.71 V is obtained with a high uniformity of 0.023 V for 40 devices. Supported by the flat anode recess surface and related field plate design, the SBD device with the anode-cathode spacing of 15 um show the Ron,sp of 1.53 mOhm.cm2 only, the breakdown voltage can reach 1592 V with a high power FOM (Figure-of-Merit) of 1656 MW/cm2. For the SBD device with the anode-cathode spacing of 30 um, the breakdown voltage can be as high as 2521 V and the power FOM is 1244 MW/cm2.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Estimating red noise in quasi-periodic signals with MCMC-based Bayesian

Multi-parameter Bayesian inferences based on Markov chain Monte Carlo (MCMC) samples have been widely used to estimate red noise in solar period-periodic signals. To MCMC, proper priors and sufficient iterations are prerequisites ensuring the accuracy of red noise estimation. We used MCMC-based Bayesian inferences to estimate 100 groups of red noise synthesized randomly for evaluating its accuracy. At the same time, the Brooks-Gelman algorithm was employed to precisely diagnose the convergence of the Markov chains generated by MCMC. The root-mean-square error of parameter inferences to the synthetic data is only 1.14. Furthermore, we applied the algorithm to analyze the oscillation modes in a sunspot and a flare. A 70 s period is detected in the sunspot umbra in addition to 3- and 5-minute periods, and a 40 s period is detected in the flare. The results prove that estimating red noise with MCMC-based Bayesian has more high accuracy in the case of proper priors and convergence. We also find that the number of iterations increases dramatically to achieve convergence as the number of parameters grows. Therefore, we strongly recommend that when estimating red noise with MCMC-based Bayesian, different initial values must be selected to ensure that the entire posterior distribution is covered.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Light-weight Calibrator: a Separable Component for Unsupervised Domain Adaptation

Existing domain adaptation methods aim at learning features that can be generalized among domains. These methods commonly require to update source classifier to adapt to the target domain and do not properly handle the trade off between the source domain and the target domain. In this work, instead of training a classifier to adapt to the target domain, we use a separable component called data calibrator to help the fixed source classifier recover discrimination power in the target domain, while preserving the source domain's performance. When the difference between two domains is small, the source classifier's representation is sufficient to perform well in the target domain and outperforms GAN-based methods in digits. Otherwise, the proposed method can leverage synthetic images generated by GANs to boost performance and achieve state-of-the-art performance in digits datasets and driving scene semantic segmentation. Our method empirically reveals that certain intriguing hints, which can be mitigated by adversarial attack to domain discriminators, are one of the sources for performance degradation under the domain shift.

0 citations0 reviewsNo code linkedOpen access