arXiv subjects

Runze Li

Publications and source records attributed to Runze Li.

At least 91 records · Page 5Linked to original sources

arXiv2024

Time-Varying Strong Coupling and Its Induced Time Diffraction of Magnon Modes

Time-varying media break the temporal translation symmetry of wave propagation in materials, enabling advanced wave manipulations. However, this novel phenomenon has been rarely explored in magnonic systems due to the significant challenge of achieving a sudden and prominent change in magnon dispersion within materials. Here, we construct a time-varying strong coupling between two magnon modes, and observe a change in the beats of Rabi-like oscillations near the pulse edges. Using a frequency-comb spectroscopy technique developed in this work, we characterize the frequency conversion of magnon modes induced by the time-varying strong-coupling effect. Moreover, we construct time slits with adjacent time interfaces and demonstrate, for the first time, the double-slit time diffraction of magnon modes, analogous to the well-known Young's double-slit experiment. These findings rely solely on the time-varying strong magnon coupling, independent of device reconfiguration. Our results open avenues for applications such as all-magnetic mixers or on-chip GHz sources.

cond-mat.mes-hall↗

arXiv2024

Archimedes' Revenge

We offer an instructive solution to the problem of computing the volume of the orthogonal intersection of three hyperboloids.

math.HO↗

arXiv2024

Statistical Convergence Rates of Optimal Transport Map Estimation between General Distributions

This paper studies the convergence rates of optimal transport (OT) map estimators, a topic of growing interest in statistics, machine learning, and various scientific fields. Despite recent advancements, existing results rely on regularity assumptions that are very restrictive in practice and much stricter than those in Brenier's Theorem, including the compactness and convexity of the probability support and the bi-Lipschitz property of the OT maps. We aim to broaden the scope of OT map estimation and fill this gap between theory and practice. Given the strong convexity assumption on Brenier's potential, we first establish the non-asymptotic convergence rates for the original plug-in estimator without requiring restrictive assumptions on probability measures. Additionally, we introduce a sieve plug-in estimator and establish its convergence rates without the strong convexity assumption on Brenier's potential, enabling the widely used cases such as the rank functions of normal or t-distributions. We also establish new Poincaré-type inequalities, which are proved given sufficient conditions on the local boundedness of the probability density and mild topological conditions of the support, and these new inequalities enable us to achieve faster convergence rates for the Donsker function class. Moreover, we develop scalable algorithms to efficiently solve the OT map estimation using neural networks and present numerical experiments to demonstrate the effectiveness and robustness.

math.ST↗

arXiv2024

Hypothesis Testing for High-Dimensional Matrix-Valued Data

This paper addresses hypothesis testing for the mean of matrix-valued data in high-dimensional settings. We investigate the minimum discrepancy test, originally proposed by Cragg (1997), which serves as a rank test for lower-dimensional matrices. We evaluate the performance of this test as the matrix dimensions increase proportionally with the sample size, and identify its limitations when matrix dimensions significantly exceed the sample size. To address these challenges, we propose a new test statistic tailored for high-dimensional matrix rank testing. The oracle version of this statistic is analyzed to highlight its theoretical properties. Additionally, we develop a novel approach for constructing a sparse singular value decomposition (SVD) estimator for singular vectors, providing a comprehensive examination of its theoretical aspects. Using the sparse SVD estimator, we explore the properties of the sample version of our proposed statistic. The paper concludes with simulation studies and two case studies involving surveillance video data, demonstrating the practical utility of our proposed methods.

stat.ME↗

arXiv2024

AdaTrans: Feature-wise and Sample-wise Adaptive Transfer Learning for High-dimensional Regression

We consider the transfer learning problem in the high dimensional linear regression setting, where the feature dimension is larger than the sample size. To learn transferable information, which may vary across features or the source samples, we propose an adaptive transfer learning method that can detect and aggregate the feature-wise (F-AdaTrans) or sample-wise (S-AdaTrans) transferable structures. We achieve this by employing a fused-penalty, coupled with weights that can adapt according to the transferable structure. To choose the weight, we propose a theoretically informed, data-driven procedure, enabling F-AdaTrans to selectively fuse the transferable signals with the target while filtering out non-transferable signals, and S-AdaTrans to obtain the optimal combination of information transferred from each source sample. We show that, with appropriately chosen weights, F-AdaTrans achieves a convergence rate close to that of an oracle estimator with a known transferable structure, and S-AdaTrans recovers existing near-minimax optimal rates as a special case. The effectiveness of the proposed method is validated using both simulation and real data, demonstrating favorable performance compared to the existing methods.

stat.ML↗

arXiv2024

A Likelihood Approach to Incorporating Self-Report Data in HIV Recency Classification

Estimating new HIV infections is significant yet challenging due to the difficulty in distinguishing between recent and long-term infections. We demonstrate that HIV recency status (recent v.s. long-term) could be determined from the combination of self-report testing history and biomarkers, which are increasingly available in bio-behavioral surveys. HIV recency status is partially observed, given the self-report testing history. For example, people who tested positive for HIV over one year ago should have a long-term infection. Based on the nationally representative samples collected by the Population-based HIV Impact Assessment (PHIA) Project, we propose a likelihood-based probabilistic model for HIV recency classification. The model incorporates both labeled and unlabeled data and integrates the mechanism of how HIV recency status depends on biomarkers and the mechanism of how HIV recency status, together with the self-report time of the most recent HIV test, impacts the test results, via a set of logistic regression models. We compare our method to logistic regression and the binary classification tree (current practice) on Malawi, Zimbabwe, and Zambia PHIA data, as well as on simulated data. Our model obtains more efficient and less biased parameter estimates and is relatively robust to potential reporting error and model misspecification.

stat.AP↗

arXiv2024

Accurate Inference for Penalized Logistic Regression

Inference for high-dimensional logistic regression models using penalized methods has been a challenging research problem. As an illustration, a major difficulty is the significant bias of the Lasso estimator, which limits its direct application in inference. Although various bias corrected Lasso estimators have been proposed, they often still exhibit substantial biases in finite samples, undermining their inference performance. These finite sample biases become particularly problematic in one-sided inference problems, such as one-sided hypothesis testing. This paper proposes a novel two-step procedure for accurate inference in high-dimensional logistic regression models. In the first step, we propose a Lasso-based variable selection method to select a suitable submodel of moderate size for subsequent inference. In the second step, we introduce a bias corrected estimator to fit the selected submodel. We demonstrate that the resulting estimator from this two-step procedure has a small bias order and enables accurate inference. Numerical studies and an analysis of alcohol consumption data are included, where our proposed method is compared to alternative approaches. Our results indicate that the proposed method exhibits significantly smaller biases than alternative methods in finite samples, thereby leading to improved inference performance.

stat.ME↗

arXiv2024

Rapid aerodynamic prediction of swept wings via physics-embedded transfer learning

Machine learning-based models provide a promising way to rapidly acquire transonic swept wing flow fields but suffer from large computational costs in establishing training datasets. Here, we propose a physics-embedded transfer learning framework to efficiently train the model by leveraging the idea that a three-dimensional flow field around wings can be analyzed with two-dimensional flow fields around cross-sectional airfoils. An airfoil aerodynamics prediction model is pretrained with airfoil samples. Then, an airfoil-to-wing transfer model is fine-tuned with a few wing samples to predict three-dimensional flow fields based on two-dimensional results on each spanwise cross section. Sweep theory is embedded when determining the corresponding airfoil geometry and operating conditions, and to obtain the sectional airfoil lift coefficient, which is one of the operating conditions, the low-fidelity vortex lattice method and data-driven methods are proposed and evaluated. Compared to a nontransfer model, introducing the pretrained model reduces the error by 30%, while introducing sweep theory further reduces the error by 9%. When reducing the dataset size, less than half of the wing training samples are need to reach the same error level as the nontransfer framework, which makes establishing the model much easier.

physics.flu-dyn↗

arXiv2024

A Generative Diffusion Model for Probabilistic Ensembles of Precipitation Maps Conditioned on Multisensor Satellite Observations

A generative diffusion model is used to produce probabilistic ensembles of precipitation intensity maps at the 1-hour 5-km resolution. The generation is conditioned on infrared and microwave radiometric measurements from the GOES and DMSP satellites and is trained with merged ground radar and gauge data over southeastern United States. The generated precipitation maps reproduce the spatial autocovariance and other multiscale statistical properties of the gauge-radar reference fields on average. Conditioning the generation on the satellite measurements allows us to constrain the magnitude and location of each generated precipitation feature. The mean of the 128- member ensemble shows high spatial coherence with the reference fields with 0.82 linear correlation between the two. On average, the coherence between any two ensemble members is approximately the same as the coherence between any ensemble member and the ground reference, attesting that the ensemble dispersion is a proper measure of the estimation uncertainty. From the generated ensembles we can easily derive the probability of the precipitation intensity exceeding any given intensity threshold, at the 5-km resolution of the generation or at any desired aggregated resolution.

physics.ao-ph↗

arXiv2024

Conditional score-based diffusion models for solving inverse problems in mechanics

We propose a framework to perform Bayesian inference using conditional score-based diffusion models to solve a class of inverse problems in mechanics involving the inference of a specimen's spatially varying material properties from noisy measurements of its mechanical response to loading. Conditional score-based diffusion models are generative models that learn to approximate the score function of a conditional distribution using samples from the joint distribution. More specifically, the score functions corresponding to multiple realizations of the measurement are approximated using a single neural network, the so-called score network, which is subsequently used to sample the posterior distribution using an appropriate Markov chain Monte Carlo scheme based on Langevin dynamics. Training the score network only requires simulating the forward model. Hence, the proposed approach can accommodate black-box forward models and complex measurement noise. Moreover, once the score network has been trained, it can be re-used to solve the inverse problem for different realizations of the measurements. We demonstrate the efficacy of the proposed approach on a suite of high-dimensional inverse problems in mechanics that involve inferring heterogeneous material properties from noisy measurements. Some examples we consider involve synthetic data, while others include data collected from actual elastography experiments. Further, our applications demonstrate that the proposed approach can handle different measurement modalities, complex patterns in the inferred quantities, non-Gaussian and non-additive noise models, and nonlinear black-box forward models. The results show that the proposed framework can solve large-scale physics-based inverse problems efficiently.

stat.ML↗

arXiv2024

TransFusion: Covariate-Shift Robust Transfer Learning for High-Dimensional Regression

The main challenge that sets transfer learning apart from traditional supervised learning is the distribution shift, reflected as the shift between the source and target models and that between the marginal covariate distributions. In this work, we tackle model shifts in the presence of covariate shifts in the high-dimensional regression setting. Specifically, we propose a two-step method with a novel fused-regularizer that effectively leverages samples from source tasks to improve the learning performance on a target task with limited samples. Nonasymptotic bound is provided for the estimation error of the target model, showing the robustness of the proposed method to covariate shifts. We further establish conditions under which the estimator is minimax-optimal. Additionally, we extend the method to a distributed setting, allowing for a pretraining-finetuning strategy, requiring just one round of communication while retaining the estimation rate of the centralized version. Numerical tests validate our theory, highlighting the method's robustness to covariate shifts.

stat.ML↗

arXiv2024

Anomalous shift in Andreev reflection from side incidence

Andreev reflection at a normal-superconductor interface may be accompanied with an anomalous spatial shift. The studies so far are limited to the top incidence configuration. Here, we investigate this effect in the side incidence configuration, with the interface parallel to the principal axis of superconductor. We find that the shift exhibits rich behaviors reflecting the character of pair potential. It has two contributions: one from the $k$-dependent phase of pair potential, and the other from the evanescent mode. For chiral $p$-wave pairing, the pairing phase contribution is proportional to the chirality of pairing and is independent of excitation energy, whereas the evanescent mode contribution is independent of chirality and is nonzero only for excitation energy below the gap. The two contributions also have opposite parity with respect to the incident angle. For $d_{x^{2}-y^{2}}$-wave pairing, only the evanescent mode contribution exists, and the shift exhibits suppressed zones in incident angles, manifesting the superconducting nodes. The dependence of the shift on other factors, such as the angle of incident plane and Fermi surface anisotropy, are discussed.

cond-mat.supr-con↗

arXiv2024

Mesh-Agnostic Decoders for Supercritical Airfoil Prediction and Inverse Design

Mesh-agnostic models have advantages in terms of processing unstructured spatial data and incorporating partial differential equations. Recently, they have been widely studied for constructing physics-informed neural networks, but they need to be trained on a case-by-case basis and require large training times. On the other hand, fast prediction and design tools are desired for aerodynamic shape designs, and data-driven mesh-based models have achieved great performance. Therefore, this paper proposes a data-driven mesh-agnostic decoder that combines the fast prediction ability of data-driven models and the flexibility of mesh-agnostic models. The model is denoted by an implicit decoder, which consists of two subnetworks, i.e., ShapeNet and HyperNet. ShapeNet is based on implicit neural representation, and HyperNet is a simple neural network. The implicit decoder is trained for the fast prediction of supercritical airfoils. Different activation functions are compared, and a spatial constraint is proposed to improve the interpretability and generalization ability of the model. Then, the implicit decoder is used together with a mesh-based encoder to build a generative model, which is used for the inverse design of supercritical airfoils with specified physical features.

physics.flu-dyn↗

arXiv2024

Fast buffet onset prediction and optimization method based on a pre-trained flowfield prediction model

The transonic buffet is a detrimental phenomenon occurs on supercritical airfoils and limits aircraft's operating envelope. Traditional methods for predicting buffet onset rely on multiple computational fluid dynamics simulations to assess a series of airfoil flowfields and then apply criteria to them, which is slow and hinders optimization efforts. This article introduces an innovative approach for rapid buffet onset prediction. A machine-learning flowfield prediction model is pre-trained on a large database and then deployed offline to replace simulations in the buffet prediction process for new airfoil designs. Unlike using a model to directly predict buffet onset, the proposed technique offers better visualization capabilities by providing users with intuitive flowfield outputs. It also demonstrates superior generalization ability, evidenced by a 32.5% reduction in average buffet onset prediction error on the testing dataset. The method is utilized to optimize the buffet performance of 11 distinct airfoils within and outside the training dataset. The optimization results are verified with simulations and proved to yield improved samples across all cases. It is affirmed the pre-trained flowfield prediction model can be applied to accelerate aerodynamic shape optimization, while further work still needs to raise its reliability for this safety-critical task.

physics.flu-dyn↗

arXiv2024

Reducing multivariate independence testing to two bivariate means comparisons

Testing for independence between two random vectors is a fundamental problem in statistics. It is observed from empirical studies that many existing omnibus consistent tests may not work well for some strongly nonmonotonic and nonlinear relationships. To explore the reasons behind this issue, we novelly transform the multivariate independence testing problem equivalently into checking the equality of two bivariate means. An important observation we made is that the power loss is mainly due to cancellation of positive and negative terms in dependence metrics, making them very close to zero. Motivated by this observation, we propose a class of consistent metrics with a positive integer $γ$ that exactly characterize independence. Theoretically, we show that the metrics with even and infinity $γ$ can effectively avoid the cancellation, and have high powers under the alternatives that two mean differences offset each other. Since we target at a wide range of dependence scenarios in practice, we further suggest to combine the p-values of test statistics with different $γ$'s through the Fisher's method. We illustrate the advantages of our proposed tests through extensive numerical studies.

stat.ME↗

arXiv2023

Dense, irregular, yet always graphic $3$-uniform hypergraph degree sequences

A $3$-uniform hypergraph is a generalization of simple graphs where each hyperedge is a subset of vertices of size $3$. The degree of a vertex in a hypergraph is the number of hyperedges incident with it. The degree sequence of a hypergraph is the sequence of the degrees of its vertices. The degree sequence problem for $3$-uniform hypergraphs is to decide if a $3$-uniform hypergraph exists with a prescribed degree sequence. Such a hypergraph is called a realization. Recently, Deza \emph{et al.} proved that the degree sequence problem for $3$-uniform hypergraphs is NP-complete. Some special cases are easy; however, polynomial algorithms have been known so far only for some very restricted degree sequences. The main result of our research is the following. If all degrees are between $\frac{2n^2}{63}+O(n)$ and $\frac{5n^2}{63}-O(n)$ in a degree sequence $D$, further, the number of vertices is at least $45$, and the degree sum can be divided by $3$, then $D$ has a $3$-uniform hypergraph realization. Our proof is constructive and in fact, it constructs a hypergraph realization in polynomial time for any degree sequence satisfying the properties mentioned above. To our knowledge, this is the first polynomial running time algorithm to construct a $3$-uniform hypergraph realization of a highly irregular and dense degree sequence.

math.CO↗

arXiv2023

Simulation of ionizing radiation in cell phone camera image sensors

The Distributed Electronic Cosmic-ray Observatory (DECO) is a cell phone app that uses a cell phone camera image sensor to detect cosmic-ray particles and particles from radioactive decay. Images recorded by DECO are classified by a convolutional neural network (CNN) according to their morphology. In this project, we develop a GEANT4-derived simulation of particle interactions inside the CMOS sensor using the Allpix$^2$ modular framework. We simulate muons, electrons, and photons with energy range 10 keV to 100 GeV, and their deposited energy agrees well with expectations. Simulated events are recorded and processed in a similar way as data images taken by DECO, and the result shows both similar image morphology with data events and good quantitative data-Monte Carlo agreement.

astro-ph.IM↗

arXiv2023

Risk-Sensitive Deep RL: Variance-Constrained Actor-Critic Provably Finds Globally Optimal Policy

While deep reinforcement learning has achieved tremendous successes in various applications, most existing works only focus on maximizing the expected value of total return and thus ignore its inherent stochasticity. Such stochasticity is also known as the aleatoric uncertainty and is closely related to the notion of risk. In this work, we make the first attempt to study risk-sensitive deep reinforcement learning under the average reward setting with the variance risk criteria. In particular, we focus on a variance-constrained policy optimization problem where the goal is to find a policy that maximizes the expected value of the long-run average reward, subject to a constraint that the long-run variance of the average reward is upper bounded by a threshold. Utilizing Lagrangian and Fenchel dualities, we transform the original problem into an unconstrained saddle-point policy optimization problem, and propose an actor-critic algorithm that iteratively and efficiently updates the policy, the Lagrange multiplier, and the Fenchel dual variable. When both the value and policy functions are represented by multi-layer overparameterized neural networks, we prove that our actor-critic algorithm generates a sequence of policies that finds a globally optimal policy at a sublinear rate. Further, We provide numerical studies of the proposed method using two real datasets to back up the theoretical results.

cs.LG↗