Researcher profile

Feng Dai

Feng Dai contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

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

7 published item(s)

preprint2026arXiv

Max-Min Neural Network Operators For Approximation of Multivariate Functions

In this paper, we develop a multivariate framework for approximation by max-min neural network operators. Building on the recent advances in approximation theory by neural network operators, particularly, the univariate max-min operators, we propose and analyze new multivariate operators activated by sigmoidal functions. We establish pointwise and uniform convergence theorems and derive quantitative estimates for the order of approximation via modulus of continuity and multivariate generalized absolute moment. Our results demonstrate that multivariate max-min structure of operators, besides their algebraic elegance, provide efficient and stable approximation tools in both theoretical and applied settings.

preprint2026arXiv

TEA: Temporal Adaptive Satellite Image Semantic Segmentation

Crop mapping based on satellite images time-series (SITS) holds substantial economic value in agricultural production settings, in which parcel segmentation is an essential step. Existing approaches have achieved notable advancements in SITS segmentation with predetermined sequence lengths. However, we found that these approaches overlooked the generalization capability of models across scenarios with varying temporal length, leading to markedly poor segmentation results in such cases. To address this issue, we propose TEA, a TEmporal Adaptive SITS semantic segmentation method to enhance the model's resilience under varying sequence lengths. We introduce a teacher model that encapsulates the global sequence knowledge to guide a student model with adaptive temporal input lengths. Specifically, teacher shapes the student's feature space via intermediate embedding, prototypes and soft label perspectives to realize knowledge transfer, while dynamically aggregating student model to mitigate knowledge forgetting. Finally, we introduce full-sequence reconstruction as an auxiliary task to further enhance the quality of representations across inputs of varying temporal lengths. Through extensive experiments, we demonstrate that our method brings remarkable improvements across inputs of different temporal lengths on common benchmarks. Our code will be publicly available.

preprint2026arXiv

VIP: Visual-guided Prompt Evolution for Efficient Dense Vision-Language Inference

Pursuing training-free open-vocabulary semantic segmentation in an efficient and generalizable manner remains challenging due to the deep-seated spatial bias in CLIP. To overcome the limitations of existing solutions, this work moves beyond the CLIP-based paradigm and harnesses the recent spatially-aware dino$.$txt framework to facilitate more efficient and high-quality dense prediction. While dino$.$txt exhibits robust spatial awareness, we find that the semantic ambiguity of text queries gives rise to severe mismatch within its dense cross-modal interactions. To address this, we introduce Visual-guided Prompt evolution (VIP) to rectify the semantic expressiveness of text queries in dino$.$txt, unleashing its potential for fine-grained object perception. Towards this end, VIP integrates alias expansion with a visual-guided distillation mechanism to mine valuable semantic cues, which are robustly aggregated in a saliency-aware manner to yield a high-fidelity prediction. Extensive evaluations demonstrate that VIP: 1. surpasses the top-leading methods by 1.4%-8.4% average mIoU, 2. generalizes well to diverse challenging domains, and 3. requires marginal inference time and memory overhead.

preprint2022arXiv

Brezis--Van Schaftingen--Yung Formulae in Ball Banach Function Spaces with Applications to Fractional Sobolev and Gagliardo--Nirenberg Inequalities

Let $X$ be a ball Banach function space on ${\mathbb R}^n$. In this article, under some mild assumptions about both $X$ and the boundedness of the Hardy--Littlewood maximal operator on the associate space of the convexification of $X$, the authors prove that, for any locally integrable function $f$ with $\|\,|\nabla f|\,\|_{X}<\infty$, $$\sup_{λ\in(0,\infty)}λ\left \|\left|\left\{y\in{\mathbb R}^n:\ |f(\cdot)-f(y)| >λ|\cdot-y|^{\frac{n}{q}+1}\right\}\right|^{\frac{1}{q}} \right\|_X\sim \|\,|\nabla f|\,\|_X$$ with the positive equivalence constants independent of $f$, where the index $q\in(0,\infty)$ is related to $X$ and $|\{y\in{\mathbb R}^n:\ |f(\cdot)-f(y)| >λ|\cdot-y|^{\frac{n}{q}+1}\}|$ is the Lebesgue measure of the set under consideration. In particular, when $X:=L^p({\mathbb R}^n)$ with $p\in [1,\infty)$, the above formulae hold true for any given $q\in (0,\infty)$ with $n(\frac{1}{p}-\frac{1}{q})<1$, which when $q=p$ are exactly the recent surprising formulae of H. Brezis, J. Van Schaftingen, and P.-L. Yung, and which in other cases are new. This generalization has a wide range of applications and, particularly, enables the authors to establish new fractional Sobolev and new Gagliardo--Nirenberg inequalities in various function spaces, including Morrey spaces, mixed-norm Lebesgue spaces, variable Lebesgue spaces, weighted Lebesgue spaces, Orlicz spaces, and Orlicz-slice (generalized amalgam) spaces, and, even in all these special cases, the obtained results are new. The proofs of these results strongly depend on the Poincaré inequality, the extrapolation, the exact operator norm on $X&#39;$ of the Hardy--Littlewood maximal operator, and the exquisite geometry of $\mathbb{R}^n.$

preprint2022arXiv

Cycle Self-Training for Semi-Supervised Object Detection with Distribution Consistency Reweighting

Recently, many semi-supervised object detection (SSOD) methods adopt teacher-student framework and have achieved state-of-the-art results. However, the teacher network is tightly coupled with the student network since the teacher is an exponential moving average (EMA) of the student, which causes a performance bottleneck. To address the coupling problem, we propose a Cycle Self-Training (CST) framework for SSOD, which consists of two teachers T1 and T2, two students S1 and S2. Based on these networks, a cycle self-training mechanism is built, i.e., S1${\rightarrow}$T1${\rightarrow}$S2${\rightarrow}$T2${\rightarrow}$S1. For S${\rightarrow}$T, we also utilize the EMA weights of the students to update the teachers. For T${\rightarrow}$S, instead of providing supervision for its own student S1(S2) directly, the teacher T1(T2) generates pseudo-labels for the student S2(S1), which looses the coupling effect. Moreover, owing to the property of EMA, the teacher is most likely to accumulate the biases from the student and make the mistakes irreversible. To mitigate the problem, we also propose a distribution consistency reweighting strategy, where pseudo-labels are reweighted based on distribution consistency across the teachers T1 and T2. With the strategy, the two students S2 and S1 can be trained robustly with noisy pseudo labels to avoid confirmation biases. Extensive experiments prove the superiority of CST by consistently improving the AP over the baseline and outperforming state-of-the-art methods by 2.1% absolute AP improvements with scarce labeled data.

preprint2010arXiv

Moduli of Smoothness and Approximation on the Unit Sphere and the Unit Ball

A new modulus of smoothness based on the Euler angles is introduced on the unit sphere and is shown to satisfy all the usual characteristic properties of moduli of smoothness, including direct and inverse theorem for the best approximation by polynomials and its equivalence to a $K$-functional, defined via partial derivatives in Euler angles. The set of results on the moduli on the sphere serves as a basis for defining new moduli of smoothness and their corresponding $K$-functionals on the unit ball, which are used to characterize the best approximation by polynomials on the ball.

preprint2010arXiv

Polynomial Approximation in Sobolev Spaces on the Unit Sphere and the Unit Ball

This work is a continuation of the recent study by the authors on approximation theory over the sphere and the ball. The main results define new Sobolev spaces on these domains and study polynomial approximations for functions in these spaces, including simultaneous approximation by polynomials and relation between best approximation to a function and to its derivatives.