Search arXiv⌕ Search

arXiv subjects

Yue Yu

Publications and source records attributed to Yue Yu.

At least 343 records · Page 19Linked to original sources
arXiv2022

Hybrid mixed discontinuous Galerkin finite element method for incompressible wormhole propagation problem

Wormhole propagation plays a very important role in the product enhancement of oil and gas reservoir. A new combined hybrid mixed finite element method is proposed to solve incompressible wormhole propagation problem with discontinuous Galerkin finite element procedure, in which, the new hybrid mixed finite element algorithm is established for pressure equation, while the discontinuous Galerkin finite element method is considered for concentration equation, and then the porosity function is computed straightly by the approximate value of the concentration. This new combined method can keep local mass balance, meantime it also keeps the boundedness of the porosity. The convergence of the proposed method is analyzed and the optimal error estimate is derived. Finally, numerical examples are presented to verify the validity of the algorithm and the correctness of the theoretical results.

math.NA↗
arXiv2022

Electric field enhancement of pool boiling of dielectric fluids on pillar-structured surfaces: A lattice Boltzmann study

In this paper, by using a phase-change lattice Boltzmann (LB) model coupled with an electric field model, we numerically investigate the performance and enhancement mechanism of pool boiling of dielectric fluids on pillar-structured surfaces under an electric field. The numerical investigation reveals that applying an electric field causes both positive and negative influences on the pool boiling of dielectric fluids on pillar-structured surfaces. It is found that, under the action of an electric field, the electric force prevents the bubbles nucleated in the channels from crossing the edges of the pillar tops. On the one hand, such an effect results in the bubble coalescence in the channels and blocks the paths of liquid supply for the channels, which leads to the deterioration of pool boiling in the medium-superheat regime. On the other hand, it prevents the coalescence between the bubbles in the channels and those on the pillar tops, which suppresses the formation of a continuous vapor film and therefore delays the occurrence of boiling crisis. Meanwhile, the electric force can promote the departure of the bubbles on the pillar tops. Accordingly, the critical heat flux (CHF) can be improved. Based on the revealed mechanism, wettability-modified regions are applied to the pillar tops for further enhancing the boiling heat transfer. It is shown that the boiling performance on pillar-structured surfaces can be enhanced synergistically with the CHF being increased by imposing an electric field and the maximum heat transfer coefficient being improved by applying mixed wettability to the pillar-structured surfaces.

physics.flu-dyn↗
arXiv2022

PolyU-BPCoMa: A Dataset and Benchmark Towards Mobile Colorized Mapping Using a Backpack Multisensorial System

Constructing colorized point clouds from mobile laser scanning and images is a fundamental work in surveying and mapping. It is also an essential prerequisite for building digital twins for smart cities. However, existing public datasets are either in relatively small scales or lack accurate geometrical and color ground truth. This paper documents a multisensorial dataset named PolyU-BPCoMA which is distinctively positioned towards mobile colorized mapping. The dataset incorporates resources of 3D LiDAR, spherical imaging, GNSS and IMU on a backpack platform. Color checker boards are pasted in each surveyed area as targets and ground truth data are collected by an advanced terrestrial laser scanner (TLS). 3D geometrical and color information can be recovered in the colorized point clouds produced by the backpack system and the TLS, respectively. Accordingly, we provide an opportunity to benchmark the mapping and colorization accuracy simultaneously for a mobile multisensorial system. The dataset is approximately 800 GB in size covering both indoor and outdoor environments. The dataset and development kits are available at https://github.com/chenpengxin/PolyU-BPCoMa.git.

cs.CV↗
arXiv2022

Adaptive Constraint Satisfaction for Markov Decision Process Congestion Games: Application to Transportation Networks

Under the Markov decision process (MDP) congestion game framework, we study the problem of enforcing population distribution constraints on a population of players with stochastic dynamics and coupled congestion costs. Existing research demonstrates that the constraints on the players' population distribution can be satisfied by enforcing tolls. However, computing the minimum toll value for constraint satisfaction requires accurate modeling of the player's congestion costs. Motivated by settings where an accurate congestion cost model is unavailable (e.g. transportation networks), we consider an MDP congestion game with unknown congestion costs. We assume that a constraint-enforcing authority can repeatedly enforce tolls on a population of players who converges to an $ε$-optimal population distribution for any given toll. We then construct a myopic update algorithm to compute the minimum toll value while ensuring that the constraints are satisfied on average. We analyze how the players' sub-optimal responses to tolls impact the rates of convergence towards the minimum toll value and constraint satisfaction. Finally, we construct a congestion game model for Uber drivers in Manhattan, New York City (NYC) using data from the Taxi and Limousine Commission (TLC) to illustrate how to efficiently reduce congestion while minimizing the impact on driver earnings.

cs.GT↗
arXiv2022

Real-Time Quadrotor Trajectory Optimization with Time-Triggered Corridor Constraints

One of the keys to flying quadrotors is to optimize their trajectories within the set of collision-free corridors. These corridors impose nonconvex constraints on the trajectories, making real-time trajectory optimization challenging. We introduce a novel numerical method that approximates the nonconvex corridor constraints with time-triggered convex corridor constraints. This method combines bisection search and repeated infeasibility detection. We further develop a customized C++ implementation of the proposed method, based on a first-order conic optimization method that detects infeasibility and exploits problem structure. We demonstrate the efficiency and effectiveness of the proposed method using numerical simulation on randomly generated problem instances as well as indoor flight experiments with hoop obstacles. Compared with mixed integer programming, the proposed method is about 50--200 times faster.

math.OC↗
arXiv2022

Physics-Informed Deep Neural Operator Networks

Standard neural networks can approximate general nonlinear operators, represented either explicitly by a combination of mathematical operators, e.g., in an advection-diffusion-reaction partial differential equation, or simply as a black box, e.g., a system-of-systems. The first neural operator was the Deep Operator Network (DeepONet), proposed in 2019 based on rigorous approximation theory. Since then, a few other less general operators have been published, e.g., based on graph neural networks or Fourier transforms. For black box systems, training of neural operators is data-driven only but if the governing equations are known they can be incorporated into the loss function during training to develop physics-informed neural operators. Neural operators can be used as surrogates in design problems, uncertainty quantification, autonomous systems, and almost in any application requiring real-time inference. Moreover, independently pre-trained DeepONets can be used as components of a complex multi-physics system by coupling them together with relatively light training. Here, we present a review of DeepONet, the Fourier neural operator, and the graph neural operator, as well as appropriate extensions with feature expansions, and highlight their usefulness in diverse applications in computational mechanics, including porous media, fluid mechanics, and solid mechanics.

cs.LG↗
arXiv2022

Theory of superconductivity in doped quantum paraelectrics

Recent experiments on Nb-doped SrTiO$_3$ have shown that the superconducting energy gap to the transition temperature ratio maintains the Bardeen-Cooper-Schrieffer (BCS) value throughout its superconducting dome. Motivated by these and related studies, we show that the Cooper pairing mediated by a single soft transverse-optical phonon is the most natural mechanism for such a superconducting dome given experimental constraints, and present the microscopic theory for this pairing mechanism. Furthermore, we show that this mechanism is consistent with the $T^2$ resistivity in the normal state. Lastly, we discuss what physical insights SrTiO$_3$ provides for superconductivity in other quantum paraelectrics such as KTaO$_3$.

cond-mat.supr-con↗
arXiv2022

Overpotential decomposition enabled decoupling of complex kinetic processes in battery electrodes

Identifying overpotential components of electrochemical systems enables quantitative analysis of polarization contributions of kinetic processes under practical operating conditions. However, the inherently coupled kinetic processes lead to an enormous challenge in measuring individual overpotentials, particularly in composite electrodes of lithium-ion batteries. Herein, the full decomposition of electrode overpotential is realized by the collaboration of single-layer structured particle electrode (SLPE) constructions and time-resolved potential measurements, explicitly revealing the evolution of kinetic processes. Perfect prediction of the discharging profiles is achieved via potential measurements on SLPEs, even in extreme polarization conditions. By decoupling overpotentials in different electrode/cell structures and material systems, the dominant limiting processes of battery rate performance are uncovered, based on which the optimization of electrochemical kinetics can be conducted. Our study not only shades light on decoupling complex kinetics in electrochemical systems, but also provides vitally significant guidance for the rational design of high-performance batteries.

physics.chem-ph↗
arXiv2022

Vertiport Selection in Hybrid Air-Ground Transportation Networks via Mathematical Programs with Equilibrium Constraints

Urban air mobility is a concept that promotes aerial modes of transport in urban areas. In these areas, the location and capacity of the vertiports--where the travelers embark and disembark the aircraft--not only affect the flight delays of the aircraft, but can also aggravate the congestion of ground vehicles by creating extra ground travel demands. We introduce a mathematical model for selecting the location and capacity of the vertiports that minimizes the traffic congestion in hybrid air-ground transportation networks. Our model is based on a mathematical program with bilinear equilibrium constraints. Furthermore, we show how to compute a global optimal solution of this mathematical program by solving a mixed integer linear program. We demonstrate our results via the Anaheim transportation network model, which contains more than 400 nodes and 900 links.

math.OC↗
arXiv2022

Extrapolated Proportional-Integral Projected Gradient Method for Conic Optimization

Conic optimization is the minimization of a convex quadratic function subject to conic constraints. We introduce a novel first-order method for conic optimization, named \emph{extrapolated proportional-integral projected gradient method (xPIPG)}, that automatically detects infeasibility. The iterates of xPIPG either asymptotically satisfy a set of primal-dual optimality conditions, or generate a proof of primal or dual infeasibility. We demonstrate the application of xPIPG using benchmark problems in model predictive control. xPIPG outperforms many state-of-the-art conic optimization solvers, especially when solving large-scale problems.

math.OC↗
arXiv2022

MetaNOR: A Meta-Learnt Nonlocal Operator Regression Approach for Metamaterial Modeling

We propose MetaNOR, a meta-learnt approach for transfer-learning operators based on the nonlocal operator regression. The overall goal is to efficiently provide surrogate models for new and unknown material-learning tasks with different microstructures. The algorithm consists of two phases: (1) learning a common nonlocal kernel representation from existing tasks; (2) transferring the learned knowledge and rapidly learning surrogate operators for unseen tasks with a different material, where only a few test samples are required. We apply MetaNOR to model the wave propagation within 1D metamaterials, showing substantial improvements on the sampling efficiency for new materials.

cond-mat.mtrl-sci↗
arXiv2022

Nonparametric learning of kernels in nonlocal operators

Nonlocal operators with integral kernels have become a popular tool for designing solution maps between function spaces, due to their efficiency in representing long-range dependence and the attractive feature of being resolution-invariant. In this work, we provide a rigorous identifiability analysis and convergence study for the learning of kernels in nonlocal operators. It is found that the kernel learning is an ill-posed or even ill-defined inverse problem, leading to divergent estimators in the presence of modeling errors or measurement noises. To resolve this issue, we propose a nonparametric regression algorithm with a novel data adaptive RKHS Tikhonov regularization method based on the function space of identifiability. The method yields a noisy-robust convergent estimator of the kernel as the data resolution refines, on both synthetic and real-world datasets. In particular, the method successfully learns a homogenized model for the stress wave propagation in a heterogeneous solid, revealing the unknown governing laws from real-world data at microscale. Our regularization method outperforms baseline methods in robustness, generalizability and accuracy.

stat.ML↗
arXiv2022

Nebula-I: A General Framework for Collaboratively Training Deep Learning Models on Low-Bandwidth Cloud Clusters

The ever-growing model size and scale of compute have attracted increasing interests in training deep learning models over multiple nodes. However, when it comes to training on cloud clusters, especially across remote clusters, huge challenges are faced. In this work, we introduce a general framework, Nebula-I, for collaboratively training deep learning models over remote heterogeneous clusters, the connections between which are low-bandwidth wide area networks (WANs). We took natural language processing (NLP) as an example to show how Nebula-I works in different training phases that include: a) pre-training a multilingual language model using two remote clusters; and b) fine-tuning a machine translation model using knowledge distilled from pre-trained models, which run through the most popular paradigm of recent deep learning. To balance the accuracy and communication efficiency, in Nebula-I, parameter-efficient training strategies, hybrid parallel computing methods and adaptive communication acceleration techniques are jointly applied. Meanwhile, security strategies are employed to guarantee the safety, reliability and privacy in intra-cluster computation and inter-cluster communication. Nebula-I is implemented with the PaddlePaddle deep learning framework, which can support collaborative training over heterogeneous hardware, e.g. GPU and NPU. Experiments demonstrate that the proposed framework could substantially maximize the training efficiency while preserving satisfactory NLP performance. By using Nebula-I, users can run large-scale training tasks over cloud clusters with minimum developments, and the utility of existed large pre-trained models could be further promoted. We also introduced new state-of-the-art results on cross-lingual natural language inference tasks, which are generated based upon a novel learning framework and Nebula-I.

cs.LG↗
arXiv2022

Modality-Balanced Embedding for Video Retrieval

Video search has become the main routine for users to discover videos relevant to a text query on large short-video sharing platforms. During training a query-video bi-encoder model using online search logs, we identify a modality bias phenomenon that the video encoder almost entirely relies on text matching, neglecting other modalities of the videos such as vision, audio. This modality imbalanceresults from a) modality gap: the relevance between a query and a video text is much easier to learn as the query is also a piece of text, with the same modality as the video text; b) data bias: most training samples can be solved solely by text matching. Here we share our practices to improve the first retrieval stage including our solution for the modality imbalance issue. We propose MBVR (short for Modality Balanced Video Retrieval) with two key components: manually generated modality-shuffled (MS) samples and a dynamic margin (DM) based on visual relevance. They can encourage the video encoder to pay balanced attentions to each modality. Through extensive experiments on a real world dataset, we show empirically that our method is both effective and efficient in solving modality bias problem. We have also deployed our MBVR in a large video platform and observed statistically significant boost over a highly optimized baseline in an A/B test and manual GSB evaluations.

cs.CV↗
arXiv2022

Quenched randomness, thermal fluctuations and reentrant superconductivity: application to UTe$_2$

Reentrant superconductivity has been observed in the candidate spin-triplet superconductor UTe$_2$ as a function of the magnetic field applied along the hard axis. Resistivity measurements have shown, a broadened superconducting transition appears near the minimal $T_c$, highlighting the importance of superconducting fluctuations in this regime. We present a phenomenological study assuming a field-driven first-order transition between two superconducting states. We show that with quenched randomness, inhomogeneity-enhanced superconducting fluctuations near the transition could naturally account for both the reentrant superconductivity as well as the broadened superconducting transition.

cond-mat.supr-con↗
arXiv2022

Self-Training with Differentiable Teacher

Self-training achieves enormous success in various semi-supervised and weakly-supervised learning tasks. The method can be interpreted as a teacher-student framework, where the teacher generates pseudo-labels, and the student makes predictions. The two models are updated alternatingly. However, such a straightforward alternating update rule leads to training instability. This is because a small change in the teacher may result in a significant change in the student. To address this issue, we propose DRIFT, short for differentiable self-training, that treats teacher-student as a Stackelberg game. In this game, a leader is always in a more advantageous position than a follower. In self-training, the student contributes to the prediction performance, and the teacher controls the training process by generating pseudo-labels. Therefore, we treat the student as the leader and the teacher as the follower. The leader procures its advantage by acknowledging the follower's strategy, which involves differentiable pseudo-labels and differentiable sample weights. Consequently, the leader-follower interaction can be effectively captured via Stackelberg gradient, obtained by differentiating the follower's strategy. Experimental results on semi- and weakly-supervised classification and named entity recognition tasks show that our model outperforms existing approaches by large margins.

cs.CL↗
arXiv2022

AcTune: Uncertainty-aware Active Self-Training for Semi-Supervised Active Learning with Pretrained Language Models

While pre-trained language model (PLM) fine-tuning has achieved strong performance in many NLP tasks, the fine-tuning stage can be still demanding in labeled data. Recent works have resorted to active fine-tuning to improve the label efficiency of PLM fine-tuning, but none of them investigate the potential of unlabeled data. We propose {\ours}, a new framework that leverages unlabeled data to improve the label efficiency of active PLM fine-tuning. AcTune switches between data annotation and model self-training based on uncertainty: it selects high-uncertainty unlabeled samples for active annotation and low-uncertainty ones for model self-training. Under this framework, we design (1) a region-aware sampling strategy that reduces redundancy when actively querying for annotations and (2) a momentum-based memory bank that dynamically aggregates the model's pseudo labels to suppress label noise in self-training. Experiments on 6 text classification datasets show that AcTune outperforms the strongest active learning and self-training baselines and improves the label efficiency of PLM fine-tuning by 56.2\% on average. Our implementation will be available at \url{https://github.com/yueyu1030/actune}.

cs.CL↗