Search arXiv⌕ Search

arXiv subjects

Yue Yu

Publications and source records attributed to Yue Yu.

At least 379 records · Page 21Linked to original sources

Nonlocal Kernel Network (NKN): a Stable and Resolution-Independent Deep Neural Network

Neural operators have recently become popular tools for designing solution maps between function spaces in the form of neural networks. Differently from classical scientific machine learning approaches that learn parameters of a known partial differential equation (PDE) for a single instance of the input parameters at a fixed resolution, neural operators approximate the solution map of a family of PDEs. Despite their success, the uses of neural operators are so far restricted to relatively shallow neural networks and confined to learning hidden governing laws. In this work, we propose a novel nonlocal neural operator, which we refer to as nonlocal kernel network (NKN), that is resolution independent, characterized by deep neural networks, and capable of handling a variety of tasks such as learning governing equations and classifying images. Our NKN stems from the interpretation of the neural network as a discrete nonlocal diffusion reaction equation that, in the limit of infinite layers, is equivalent to a parabolic nonlocal equation, whose stability is analyzed via nonlocal vector calculus. The resemblance with integral forms of neural operators allows NKNs to capture long-range dependencies in the feature space, while the continuous treatment of node-to-node interactions makes NKNs resolution independent. The resemblance with neural ODEs, reinterpreted in a nonlocal sense, and the stable network dynamics between layers allow for generalization of NKN's optimal parameters from shallow to deep networks. This fact enables the use of shallow-to-deep initialization techniques. Our tests show that NKNs outperform baseline methods in both learning governing equations and image classification tasks and generalize well to different resolutions and depths.

cs.LG↗

A sparse grid discrete ordinate discontinuous Galerkin method for the radiative transfer equation

The radiative transfer equation is a fundamental equation in transport theory and applications, which is a 5-dimensional PDE in the stationary one-velocity case, leading to great difficulties in numerical simulation. To tackle this bottleneck, we first use the discrete ordinate technique to discretize the scattering term, an integral with respect to the angular variables, resulting in a semi-discrete hyperbolic system. Then, we make the spatial discretization by means of the discontinuous Galerkin (DG) method combined with the sparse grid method. The final linear system is solved by the block Gauss-Seidal iteration method. The computational complexity and error analysis are developed in detail, which show the new method is more efficient than the original discrete ordinate DG method. A series of numerical results are performed to validate the convergence behavior and effectiveness of the proposed method.

math.NA↗

A lowest-order locking-free nonconforming virtual element method based on the reduced integration technique for linear elasticity problems

We develop a lowest-order nonconforming virtual element method for planar linear elasticity, which can be viewed as an extension of the idea in Falk (1991) to the virtual element method (VEM), with the family of polygonal meshes satisfying a very general geometric assumption. The method is shown to be uniformly convergent for the nearly incompressible case with optimal rates of convergence. The crucial step is to establish the discrete Korn's inequality, yielding the coercivity of the discrete bilinear form. We also provide a unified locking-free scheme both for the conforming and nonconforming VEMs in the lowest order case. Numerical results validate the feasibility and effectiveness of the proposed numerical algorithms.

math.NA↗

NeuronFair: Interpretable White-Box Fairness Testing through Biased Neuron Identification

Deep neural networks (DNNs) have demonstrated their outperformance in various domains. However, it raises a social concern whether DNNs can produce reliable and fair decisions especially when they are applied to sensitive domains involving valuable resource allocation, such as education, loan, and employment. It is crucial to conduct fairness testing before DNNs are reliably deployed to such sensitive domains, i.e., generating as many instances as possible to uncover fairness violations. However, the existing testing methods are still limited from three aspects: interpretability, performance, and generalizability. To overcome the challenges, we propose NeuronFair, a new DNN fairness testing framework that differs from previous work in several key aspects: (1) interpretable - it quantitatively interprets DNNs' fairness violations for the biased decision; (2) effective - it uses the interpretation results to guide the generation of more diverse instances in less time; (3) generic - it can handle both structured and unstructured data. Extensive evaluations across 7 datasets and the corresponding DNNs demonstrate NeuronFair's superior performance. For instance, on structured datasets, it generates much more instances (~x5.84) and saves more time (with an average speedup of 534.56%) compared with the state-of-the-art methods. Besides, the instances of NeuronFair can also be leveraged to improve the fairness of the biased DNNs, which helps build more fair and trustworthy deep learning systems.

cs.LG↗

Proportional-Integral Projected Gradient Method for Conic Optimization

Conic optimization is the minimization of a differentiable convex objective function subject to conic constraints. We propose a novel primal-dual first-order method for conic optimization, named proportional-integral projected gradient method (PIPG). PIPG ensures that both the primal-dual gap and the constraint violation converge to zero at the rate of \(O(1/k)\), where \(k\) is the number of iterations. If the objective function is strongly convex, PIPG improves the convergence rate of the primal-dual gap to \(O(1/k^2)\). Further, unlike any existing first-order methods, PIPG also improves the convergence rate of the constraint violation to \(O(1/k^3)\). We demonstrate the application of PIPG in constrained optimal control problems.

math.OC↗

Harvesting the triplet excitons of quasi-two-dimensional perovskite toward highly efficient white light-emitting diodes

Utilization of triplet excitons, which generally emit poorly, is always fundamental to realize highly efficient organic light-emitting diodes (LEDs). While triplet harvest and energy transfer via electron exchange between triplet donor and acceptor are fully understood in doped organic phosphorescence and delayed fluorescence systems, the utilization and energy transfer of triplet excitons in quasi-two-dimensional (quasi-2D) perovskite are still ambiguous. Here, we use an orange-phosphorescence-emitting ultrathin organic layer to probe triplet behavior in the sky-blue-emitting quasi-2D perovskite. The delicate white LEDs architecture enables a carefully tailored Dexter-like energy-transfer mode that largely rescues the triplet excitons in quasi-2D perovskite. Our white organic-inorganic LEDs achieve maximum forward-viewing external quantum efficiency of 8.6% and luminance over 15000 cd m-2, exhibiting a significant efficiency enhancement versus the corresponding sky-blue perovskite LED (4.6%). The efficient management of energy transfer between excitons in quasi-2D perovskite and Frenkel excitons in organic layer opens the door to fully utilizing excitons for white organic-inorganic LEDs.

physics.optics↗

Who, What, Why and How? Towards the Monetary Incentive in Crowd Collaboration: A Case Study of Github's Sponsor Mechanism

While many forms of financial support are currently available, there are still many complaints about inadequate financing from software maintainers. In May 2019, GitHub, the world's most active social coding platform, launched the Sponsor mechanism as a step toward more deeply integrating open source development and financial support. This paper collects data on 8,028 maintainers, 13,555 sponsors, and 22,515 sponsorships and conducts a comprehensive analysis. We explore the relationship between the Sponsor mechanism and developers along four dimensions using a combination of qualitative and quantitative analysis, examining why developers participate, how the mechanism affects developer activity, who obtains more sponsorships, and what mechanism flaws developers have encountered in the process of using it. We find a long-tail effect in the act of sponsorship, with most maintainers' expectations remaining unmet, and sponsorship has only a short-term, slightly positive impact on development activity but is not sustainable. While sponsors participate in this mechanism mainly as a means of thanking the developers of OSS that they use, in practice, the social status of developers is the primary influence on the number of sponsorships. We find that both the Sponsor mechanism and open source donations have certain shortcomings and need further improvements to attract more participants.

cs.HC↗

Variable Demand and Multi-commodity Flow in Markovian Network Equilibrium

Markovian network equilibrium generalizes the classical Wardrop equilibrium in network games. At a Markovian network equilibrium, each player of the game solves a Markov decision process instead of a shortest path problem. We propose two novel extensions of Markovian network equilibrium by considering 1) variable demand, which offers the players a quitting option, and 2) multi-commodity flow, which allows players to have heterogeneous ending time. We further develop dynamic-programming-based iterative algorithms for the proposed equilibrium problems, together with their arithmetic complexity analysis. Finally, we illustrate our network equilibrium model via a multi-commodity ride-sharing example, and compare the computational efficiency of our algorithms against state-of-the-art optimization software Mosek over extensive numerical experiments.

math.OC↗

deGraphCS: Embedding Variable-based Flow Graph for Neural Code Search

With the rapid increase in the amount of public code repositories, developers maintain a great desire to retrieve precise code snippets by using natural language. Despite existing deep learning based approaches(e.g., DeepCS and MMAN) have provided the end-to-end solutions (i.e., accepts natural language as queries and shows related code fragments retrieved directly from code corpus), the accuracy of code search in the large-scale repositories is still limited by the code representation (e.g., AST) and modeling (e.g., directly fusing the features in the attention stage). In this paper, we propose a novel learnable deep Graph for Code Search (calleddeGraphCS), to transfer source code into variable-based flow graphs based on the intermediate representation technique, which can model code semantics more precisely compared to process the code as text directly or use the syntactic tree representation. Furthermore, we propose a well-designed graph optimization mechanism to refine the code representation, and apply an improved gated graph neural network to model variable-based flow graphs. To evaluate the effectiveness of deGraphCS, we collect a large-scale dataset from GitHub containing 41,152 code snippets written in C language, and reproduce several typical deep code search methods for comparison. Besides, we design a qualitative user study to verify the practical value of our approach. The experimental results have shown that deGraphCS can achieve state-of-the-art performances, and accurately retrieve code snippets satisfying the needs of the users.

cs.SE↗

A revised comparison between FF five-factor model and three-factor model,based on China's A-share market

In allusion to some contradicting results in existing research, this paper selects China's latest stock data from 2005 to 2020 for empirical analysis. By choosing this periods' data, we avoid the periods of China's significant stock market reforms to reduce the impact of the government's policy on the factor effect. In this paper, the redundant factors (HML, CMA) are orthogonalized, and the regression analysis of 5*5 portfolio of Size-B/M and Size-Inv is carried out with these two orthogonalized factors. It found that the HML and the CMA are still significant in many portfolios, indicating that they have a strong explanatory ability, which is also consistent with the results of GRS test. All these show that the five-factor model has a better ability to explain the excess return rate. In the concrete analysis, this paper uses the methods of the five-factor 25-group portfolio returns calculation, the five-factor regression analysis, the orthogonal treatment, the five-factor 25-group regression and the GRS test to more comprehensively explain the excellent explanatory ability of the five-factor model to the excess return. Then, we analyze the possible reasons for the strong explanatory ability of the HML, CMA and RMW from the aspects of price to book ratio, turnover rate and correlation coefficient. We also give a detailed explanation of the results, and analyze the changes of China's stock market policy and investors' investment style recent years. Finally, this paper attempts to put forward some useful suggestions on the development of asset pricing model and China's stock market.

q-fin.GN↗

WRENCH: A Comprehensive Benchmark for Weak Supervision

Recent Weak Supervision (WS) approaches have had widespread success in easing the bottleneck of labeling training data for machine learning by synthesizing labels from multiple potentially noisy supervision sources. However, proper measurement and analysis of these approaches remain a challenge. First, datasets used in existing works are often private and/or custom, limiting standardization. Second, WS datasets with the same name and base data often vary in terms of the labels and weak supervision sources used, a significant "hidden" source of evaluation variance. Finally, WS studies often diverge in terms of the evaluation protocol and ablations used. To address these problems, we introduce a benchmark platform, WRENCH, for thorough and standardized evaluation of WS approaches. It consists of 22 varied real-world datasets for classification and sequence tagging; a range of real, synthetic, and procedurally-generated weak supervision sources; and a modular, extensible framework for WS evaluation, including implementations for popular WS methods. We use WRENCH to conduct extensive comparisons over more than 120 method variants to demonstrate its efficacy as a benchmark platform. The code is available at https://github.com/JieyuZ2/wrench.

cs.LG↗

Second-Harmonic Generation in Etchless Lithium Niobate Nanophotonic Waveguides with Bound States in the Continuum

Bound states in the continuum (BICs) have been extensively studied in various systems since its first proposal in quantum mechanics. Photonic BICs can enable optical mode confinement and provide field enhancement for nonlinear optics, but they have rarely been explored in nonlinear integrated photonic waveguides. Applying BICs in photonic integrated circuits enables low-loss light guidance and routing in low-refractive-index waveguides on high-refractive-index substrates, which is suitable for integrated photonics with nonlinear materials. Here, we report experimental demonstration of second-harmonic generation from telecom to near-visible wavelengths on an etchless lithium niobate platform by using a photonic BIC for the second-harmonic mode. The devices feature second-harmonic conversion efficiency of 0.175%W-1cm-2 and excellent thermal stability with a wavelength shift of only 1.7 nm from 25°C to 100°C. Our results represent a new paradigm of nonlinear integrated photonics on a cost-effective and convenient platform, which can enable a broad range of on-chip applications such as optical parametric generation, signal processing, and quantum photonics.

physics.optics↗

Observation of bound states in the continuum in a micromechanical resonator

Bound states in the continuum (BICs) refer to physical states that possess intrinsic zero dissipation loss even though they are located in the continuous energy spectrum. BICs have been widely explored in optical and acoustic structures, leading to applications in sensing and lasing. Realizing BICs in micromechanical structures is of significant importance for both fundamental research and engineering applications. Here, we fabricated, with CMOS-compatible processes on a silicon chip, a wheel-shaped micromechanical resonator, in which we experimentally observed the BIC in the micromechanical domain. Such BICs result from destructive interference between two dissipative modes of the mechanical structure under broken azimuthal symmetry. These BICs are found to be robust against size variations of the dissipation channels. The demonstrated mechanical BIC can be obtained with a large and robust supporting structure, which substantially reduces device fabrication difficulty and allows for its operation in versatile environments for broader application areas. Our results open a new way of phonon trapping in micromechanical structures with dissipation channels, and produce long phonon lifetimes that are desired in many mechanical applications such as mechanical oscillators, sensors, and quantum information processors.

physics.app-ph↗

A physics-informed variational DeepONet for predicting the crack path in brittle materials

Failure trajectories, identifying the probable failure zones, and damage statistics are some of the key quantities of relevance in brittle fracture applications. High-fidelity numerical solvers that reliably estimate these relevant quantities exist but they are computationally demanding requiring a high resolution of the crack. Moreover, independent intensive simulations need to be carried out even for a small change in domain parameters and/or material properties. Therefore, fast and generalizable surrogate models are needed to alleviate the computational burden but the discontinuous nature of fracture mechanics presents a major challenge to developing such models. We propose a physics-informed variational formulation of DeepONet (V-DeepONet) for brittle fracture analysis. V-DeepONet is trained to map the initial configuration of the defect to the relevant fields of interests (e.g., damage and displacement fields). Once the network is trained, the entire global solution can be rapidly obtained for any initial crack configuration and loading steps on that domain. While the original DeepONet is solely data-driven, we take a different path to train the V-DeepONet by imposing the governing equations in variational form and we also use some labelled data. We demonstrate the effectiveness of V-DeepOnet through two benchmarks of brittle fracture, and we verify its accuracy using results from high-fidelity solvers. Encoding the physical laws and also some data to train the network renders the surrogate model capable of accurately performing both interpolation and extrapolation tasks, considering that fracture modeling is very sensitive to fluctuations. The proposed hybrid training of V-DeepONet is superior to state-of-the-art methods and can be applied to a wide array of dynamical systems with complex responses.

cs.LG↗

Proportional-Integral Projected Gradient Method for Infeasibility Detection in Conic Optimization

A constrained optimization problem is primal infeasible if its constraints cannot be satisfied, and dual infeasible if the constraints of its dual problem cannot be satisfied. We propose a novel iterative method, named proportional-integral projected gradient method (PIPG), for detecting primal and dual infeasiblity in convex optimization with quadratic objective function and conic constraints. The iterates of PIPG either asymptotically provide a proof of primal or dual infeasibility, or asymptotically satisfy a set of primal-dual optimality conditions. Unlike existing methods, PIPG does not compute matrix inverse, which makes it better suited for large-scale and real-time applications. We demonstrate the application of PIPG in quasiconvex and mixed-integer optimization using examples in constrained optimal control.

math.OC↗

Peridynamic Model for Single-Layer Graphene Obtained from Coarse Grained Bond Forces

An ordinary state-based peridynamic material model is proposed for single sheet graphene. The model is calibrated using coarse grained molecular dynamics simulations. The coarse graining method allows the dependence of bond force on bond length to be determined, including the horizon. The peridynamic model allows the horizon to be rescaled, providing a multiscale capability and allowing for substantial reductions in computational cost compared with molecular dynamics. The calibrated peridynamic model is compared to experimental data on the deflection and perforation of a graphene monolayer by an atomic force microscope probe.

cond-mat.mtrl-sci↗

Advances in Trajectory Optimization for Space Vehicle Control

Space mission design places a premium on cost and operational efficiency. The search for new science and life beyond Earth calls for spacecraft that can deliver scientific payloads to geologically rich yet hazardous landing sites. At the same time, the last four decades of optimization research have put a suite of powerful optimization tools at the fingertips of the controls engineer. As we enter the new decade, optimization theory, algorithms, and software tooling have reached a critical mass to start seeing serious application in space vehicle guidance and control systems. This survey paper provides a detailed overview of recent advances, successes, and promising directions for optimization-based space vehicle control. The considered applications include planetary landing, rendezvous and proximity operations, small body landing, constrained attitude reorientation, endo-atmospheric flight including ascent and reentry, and orbit transfer and injection. The primary focus is on the last ten years of progress, which have seen a veritable rise in the number of applications using three core technologies: lossless convexification, sequential convex programming, and model predictive control. The reader will come away with a well-rounded understanding of the state-of-the-art in each space vehicle control application, and will be well positioned to tackle important current open problems using convex optimization as a core technology.

math.OC↗

Pull Request Latency Explained: An Empirical Overview

Pull request latency evaluation is an essential application of effort evaluation in the pull-based development scenario. It can help the reviewers sort the pull request queue, remind developers about the review processing time, speed up the review process and accelerate software development. There is a lack of work that systematically organizes the factors that affect pull request latency. Also, there is no related work discussing the differences and variations in characteristics in different scenarios and contexts. In this paper, we collected relevant factors through a literature review approach. Then we assessed their relative importance in five scenarios and six different contexts using the mixed-effects linear regression model. We find that the relative importance of factors differs in different scenarios, e.g., the first response time of the reviewer is most important when there exist comments. Meanwhile, the number of commits in a pull request has a more significant impact on pull request latency when closing than submitting due to changes in contributions brought about by the review process.

cs.SE↗