BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Yating Wang

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

ResearcherUnclaimed source record
math.NANumerical AnalysisComputer Vision

Catalog footprint

What is connected

5works
3topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

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

Joint Semantic Token Selection and Prompt Optimization for Interpretable Prompt Learning

Vision-language models such as CLIP achieve strong visual-textual alignment, but often suffer from overfitting and limited interpretability when adapted through continuous prompt learning. While discrete prompt optimization improves interpretability, it usually depends on large external models, leading to high computational costs and limited scalability. In this paper, we propose Interpretable Prompt Learning (IPL), a hybrid framework that alternates between discrete semantic token selection and continuous prompt optimization. Specifically, IPL formulates semantic token selection as an approximate submodular optimization problem, encouraging tokens that are both human-understandable and semantically diverse. It further adopts an alternating optimization strategy to integrate discrete token selection with continuous prompt tuning, improving interpretability while preserving adaptability to downstream tasks. Our framework is plug-and-play, allowing seamless integration with existing prompt learning methods. Extensive experiments on multiple benchmarks show that IPL consistently improves both interpretability and accuracy across five representative prompt learning methods, providing an effective and scalable extension to existing frameworks.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Multirate partially explicit scheme for multiscale flow problems

For time-dependent problems with high-contrast multiscale coefficients, the time step size for explicit methods is affected by the magnitude of the coefficient parameter. With a suitable construction of multiscale space, one can achieve a stable temporal splitting scheme where the time step size is independent of the contrast. Consider the parabolic equation with heterogeneous diffusion parameter, the flow rates vary significantly in different regions due to the high-contrast features of the diffusivity. In this work, we aim to introduce a multirate partially explicit splitting scheme to achieve efficient simulation with the desired accuracy. We first design multiscale subspaces to handle flow with different speed. For the fast flow, we obtain a low-dimensional subspace with respect to the high-diffusive component and adopt an implicit time discretization scheme. The other multiscale subspace will take care of the slow flow, and the corresponding degrees of freedom are treated explicitly. Then a multirate time stepping is introduced for the two parts. The stability of the multirate methods is analyzed for the partially explicit scheme. Moreover, we derive local error estimators corresponding to the two components of the solutions and provide an upper bound of the errors. An adaptive local temporal refinement framework is then proposed to achieve higher computational efficiency. Several numerical tests are presented to demonstrate the performance of the proposed method.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Efficient Deep Learning Techniques for Multiphase Flow Simulation in Heterogeneous Porous Media

We present efficient deep learning techniques for approximating flow and transport equations for both single phase and two-phase flow problems. The proposed methods take advantages of the sparsity structures in the underlying discrete systems and can be served as efficient alternatives to the system solvers at the full order. In particular, for the flow problem, we design a network with convolutional and locally connected layers to perform model reductions. Moreover, we employ a custom loss function to impose local mass conservation constraints. This helps to preserve the physical property of velocity solution which we are interested in learning. For the saturation problem, we propose a residual type of network to approximate the dynamics. Our main contribution here is the design of custom sparsely connected layers which take into account the inherent sparse interaction between the input and output. After training, the approximated feed-forward map can be applied iteratively to predict solutions in the long range. Our trained networks, especially in two-phase flow where the maps are nonlinear, show their great potential in accurately approximating the underlying physical system and improvement in computational efficiency. Some numerical experiments are performed and discussed to demonstrate the performance of our proposed techniques.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

A conservative local multiscale model reduction technique for Stokes flows in heterogeneous perforated domains

In this paper, we present a new multiscale model reduction technique for the Stokes flows in heterogeneous perforated domains. The challenge in the numerical simulations of this problem lies in the fact that the solution contains many multiscale features and requires a very fine mesh to resolve all details. In order to efficiently compute the solutions, some model reductions are necessary. To obtain a reduced model, we apply the generalized multiscale finite element approach, which is a framework allowing systematic construction of reduced models. Based on this general framework, we will first construct a local snapshot space, which contains many possible multiscale features of the solution. Using the snapshot space and a local spectral problem, we identify dominant modes in the snapshot space and use them as the multiscale basis functions. Our basis functions are constructed locally with non-overlapping supports, which enhances the sparsity of the resulting linear system. In order to enforce the mass conservation, we propose a hybridized technique, and uses a Lagrange multiplier to achieve mass conservation. We will mathematically analyze the stability and the convergence of the proposed method. In addition, we will present some numerical examples to show the performance of the scheme. We show that, with a few basis functions per coarse region, one can obtain a solution with excellent accuracy.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Online Adaptive Local Multiscale Model Reduction for Heterogeneous Problems in Perforated Domains

In this paper, we develop and analyze an adaptive multiscale approach for heterogeneous problems in perforated domains. In many applications, these problems have a multiscale nature arising because of the perforations, their geometries, the sizes of the perforations, and configurations. In this paper, we present a general offline/online procedure, which can adequately and adaptively represent the local degrees of freedom and derive appropriate coarse-grid equations. The main contributions of this paper are (1) the rigorous analysis of the offline approach (2) the development of the online procedures and their analysis (3) the development of adaptive strategies. We present an online procedure, which allows adaptively incorporating global information and is important for a fast convergence when combined with the adaptivity. Our methodology allows adding and guides constructing new online multiscale basis functions adaptively in appropriate regions. We present the convergence analysis of the online adaptive enrichment algorithm for the Stokes system. In particular, we show that the online procedure has a rapid convergence with a rate related to the number of offline basis functions, and one can obtain fast convergence by a sufficient number of offline basis functions, which are computed in the offline stage. To illustrate the performance of our method, we present numerical results with both small and large perforations. We see that only a few (1 or 2) online iterations can significantly improve the offline solution.

0 citations0 reviewsNo code linkedOpen access