Source author record

Rui Fang

Rui Fang 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

2works
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

2 published item(s)

preprint2026arXiv

Global Recovery from Local Data: Interior Nudging for 2D Navier-Stokes equations in a Physical Domain

In many real-world applications of data assimilation (DA), the strategic placement of observers is crucial for effective and efficient forecasting. Motivated by practical constraints in sensor deployment, we show that global recovery of the flow field can be achieved using observations available only in a subregion of the domain, possibly far from the boundary. We focus on the two-dimensional incompressible Navier-Stokes equations posed in a bounded physical domain with Dirichlet boundary conditions. Building on the continuous data assimilation framework of Azouani, Olson, and Titi (2014), we rigorously prove that the assimilated solution converges globally to the true solution under suitable conditions on the nudging parameter, spatial resolution, and the geometry of the observation region, specifically, when the maximum distance from any point in the domain to the observational subregion is bounded by a constant multiple of \( ν^{1/2} \) (in terms of scaling). Our computational results, conducted via finite element methods over complex geometries, support the theoretical findings and reveal even greater robustness in practice. Specifically, synchronization with the true solution is achieved even when the observational subregion lies farther from the rest of the domain than the theoretical threshold permits. Across all three tested scenarios, the local nudging algorithm performs comparably to full-domain assimilation, reaching global accuracy up to machine precision. Interestingly, observational data near the boundary are found to be largely uninformative. This demonstrates that full observability is not necessary: carefully chosen interior observations, even far from the boundary, can suffice.

preprint2026arXiv

Interference-Aware Multi-Task Unlearning

Machine unlearning aims to remove the contribution of designated training data from a trained model while preserving performance on the remaining data. Existing work mainly focuses on single-task settings, whereas modern models often operate in multi-task setups with shared backbones, where removing supervision for one task or instance can unintentionally affect others. We introduce multi-task unlearning with two settings: full-task unlearning, which removes a target instance from all tasks, and partial-task unlearning, which removes supervision only from selected tasks. We show that shared parameters couple the forget and retain sets, causing task-level interference on non-target tasks and instance-level interference on other instances. To address this issue, we propose an interference-aware framework that combines task-aware gradient projection, which constrains updates within task-specific subspaces, with instance-level gradient orthogonalization, which reduces conflicts between forget and retain signals. Experiments on two multi-task computer vision benchmarks across five tasks show that our method achieves effective unlearning while maintaining strong generalization, reducing UIS compared with the strongest baseline by 30.3% in full-task unlearning and 52.9% in partial-task unlearning.