Searcharxiv⌕ Search

arXiv subjects

Yakun Wang

Publications and source records attributed to Yakun Wang.

At least 19 recordsLinked to original sources

Regular subgroups of wreath products and Cayley Cartesian products

The Cartesian product of Cayley graphs is again a Cayley graph. For connected graphs, the converse question reduces to Cartesian powers of Cartesian-prime graphs, and consequently to the study of regular subgroups of wreath products in the product action. We prove that, for a transitive permutation group $G$ of degree $2p$ or $4p$, where $p$ is prime, $G\wr S_2$ contains a regular subgroup if and only if $G$ does, and construct counterexamples of degree $8p$ for every prime $p\equiv3\pmod4$. By modifying this construction, we obtain an infinite family of connected non-Cayley graphs whose Cartesian squares are Cayley graphs, giving a negative answer to the converse question. The smallest graph in our family has $120$ vertices and valency $27$. In contrast, we prove that a connected vertex-transitive graph of order $pq$, where $p$ and $q$ are primes, has a Cayley Cartesian power if and only if the graph itself is Cayley.

math.CO↗

Zero Flux: Flow-Based Comparison of High-Dimensional Discrete Distributions

Comparing two high-dimensional discrete distributions has always been a challenging task due to the exponentially growing state space and complex changes in interactions. A recent work suggests comparing distributions through a vector field trained using flow matching between two continuous distributions. The resulting vector field at mid-point vanishes if and only if two distributions identical. However, such a flow-based criterion does not naturally apply to discrete distributions. We extend this principle to the discrete domain and introduce the \emph{Zero Flux} criterion, a discrepancy based on local probability fluxes. Under independent coupling, we show that all local probability fluxes vanish at the midpoint if and only if two distributions are the same. This discrepancy decomposes the joint distributional difference into smaller, local contributions and can be efficiently estimated from samples. We establish finite sample error bounds for our estimator. Experiments on synthetic and real categorical data demonstrate reliable recovery of sparse dependence signals and stable tracking of distribution shifts in high dimensions.

stat.ML↗

Zero-Flow Two-Sample Tests

Motivated by the success of modern flow-based generative models in modeling complex data, we study two-sample testing through the lens of flow-based methods. We propose the Zero-Flow Two-Sample Test (ZF2ST), built on the zero-flow criterion, which characterizes distributional equality through a time-reversal antisymmetry of a learnable velocity field. We extend this criterion and further develop the Zero-Flow Discrepancy, an identifying discrepancy that controls the Wasserstein distance, and derive a variational representation in terms of a witness function. This representation naturally leads to a witness-based test whose power is governed by the signal-to-noise ratio (SNR), allowing direct power maximization for witness learning. ZF2ST learns the witness on one data split and performs testing on held-out samples, thereby maintaining Type-I error control and admitting a simple asymptotic null distribution. Experimentally, ZF2ST performs competitively across various synthetic and real-world benchmarks, while showing particularly strong performance in distinguishing image distributions from different sources.

cs.LG↗

Dark Matter Inelastic Scattering with Nuclei for Direct Detection

We investigate the nuclear responses for the WIMP-nucleus scattering in the dark matter direct detection with particular emphasis on the inelastic channel for the $^{129}$Xe and $^{131}$Xe isotopes. Our generalization incorporates both the elastic and inelastic scattering channels. With multipole expansion of the effective operators, the angular momentum, parity and time-reversal selection rules can effectively determine the allowed transitions. Instead of the nuclear shell model, we use the state-of-the-art relativistic configuration-interaction density functional theory, which is more suitable for heavy nuclei such as xenon isotopes, to calculate the nuclear response functions. For certain interaction operators, the inelastic contribution can be comparable as its elastic counterpart and some can even dominate by up to three orders of magnitude. Additionally, the higher excited nuclear states can have comparable signal rate as the first excited states. We compare our results with the nuclear shell model calculation. The differences would have significant effects for interpreting the dark matter direct detection searches.

hep-ph↗

Revisiting nuclear chirality in $^{128}$Cs with relativistic configuration-interaction density functional theory

Nuclear chirality in $^{128}$Cs is revisited within the microscopic relativistic configuration-interaction density functional (ReCD) theory. The positive-parity doublet bands are investigated by simultaneously examining their energy spectra, electromagnetic transition probabilities, $g$ factors, spectroscopic quadrupole moments, and underlying angular-momentum geometry. Without introducing additional parameters adjusted to the spectroscopic data, the ReCD calculations provide an overall satisfactory description of the available experimental observables. In particular, a comprehensive analysis of the available experimental data and the calculated spectroscopic observables indicates qualitative resemblances between the partner bands around $I = 17\hbar$. A microscopic analysis of the angular-momentum geometry through \textit{azimuthal plots} reveals a distinct evolution of the rotational mode with increasing spin: chiral vibration at $I < 17\hbar$, static chirality at $I = 17\hbar$, and a transition toward planar rotation at higher spins. These results suggest that static chiral geometry in $^{128}$Cs is confined to a narrow spin region around $I = 17\hbar$ within the present ReCD calculations.

nucl-th↗

Charge radii of calcium isotopes within relativistic configuration-interaction density functional theory

The charge radii of calcium isotopes are investigated within the framework of relativistic configuration-interaction density functional (ReCD) theory. The ReCD theory microscopically incorporates beyond-mean-field correlations through rotational symmetry restoration and configuration mixing among quasiparticle excited states, and treats even-even and odd-$A$ isotopes on the same footing. It is found that beyond-mean-field correlations significantly soften the potential energy surfaces of calcium isotopes and shift the energy minima from nearly spherical mean-field solutions to deformed shapes. The quadrupole deformation parameters predicted by the ReCD theory show much better agreement with the available experimental data than the mean-field results, supporting the reliability of the calculated potential energy surfaces and highlighting the important role of beyond-mean-field correlations. Owing to the sensitive dependence of charge radii on nuclear deformation, the charge radii obtained within the ReCD framework are generally larger than the mean-field predictions. The nearly identical charge radii of $^{40}\mathrm{Ca}$ and $^{48}\mathrm{Ca}$, as well as the unexpectedly large charge radius of $^{52}\mathrm{Ca}$, are well reproduced. Compared with the mean-field calculations, the description of the odd-even staggering is improved, especially for the enhanced charge radii of $^{42}\mathrm{Ca}$ and $^{44}\mathrm{Ca}$. It is also worth noting that secondary local minima appear in the ReCD-based potential energy surfaces of the odd-$A$ calcium isotopes $^{41,43,47}\mathrm{Ca}$. The present results suggest that shape mixing between different local minima, which is not fully included in the present calculation, may further improve the description of the pronounced odd-even staggering observed in calcium isotopes.

nucl-th↗

A scalable linear programming-based framework for data clustering

We extend the linear programming-based algorithm of De Rosa et al~\cite{derKhaWan24} for K-means clustering to two important clustering paradigms: fair K-means clustering and spectral clustering. For fair K-means clustering, we show that widely used notions of group fairness can be incorporated into the partition-matrix formulation of K-means clustering through a linear number of linear inequalities. For spectral clustering, we consider a linear programming relaxation of the minimum ratio-cut problem that fits naturally within the same framework. We complement these formulations with problem-specific initialization and rounding procedures and evaluate the resulting algorithms on a large collection of real-world data sets. Denoting by $n$ the number of data points, our computational results demonstrate that the proposed approach solves $90\%$ of benchmark instances with $n \leq 3000$ to within $1\%$ optimality in at most three hours. This in turn demonstrates the remarkable strength of the proposed LP relaxations in both applications. Moreover, for more than $56\%$ of the instances, the proposed algorithm finds better solutions than those produced by popular fair Lloyd-type and spectral clustering heuristics.

math.OC↗

Positive and Negative Determinant Strategies in Repeated Games with Behavior-Value Inconsistency

Direct reciprocity, based on the repeated interactions, is a fundamental mechanism to promote cooperation. Zero-determinant (ZD) strategies have opened an avenue for unilateral payoff control. However, previous studies neglect internal costs provided what agents do differ from what agents think, which is crucial for decision making of intelligent agents. Motivated by this, we establish a game theoretical framework by assuming that an individual pays the internal cost if the behavior is inconsistent with the internal thought. We prove that ZD strategy does not exist if the cost via behavior-value inconsistency is present. Instead, we find a new class of repeated strategies that enforce a unilateral payoff control, which is termed as positive/negative determinant strategy. The found strategy allows an individual to enforce an affine combination of two individuals' average payoffs above/below zero. Consequently, a focal individual is able to unilaterally control the opponent's payoff below a given value via negative determinant strategy, and a focal individual is able to get more payoff than the opponent via positive determinant strategy. We also find that the control ability of positive/negative determinant strategies is better off than that of ZD strategies. Our work highlights the importance of inconsistency between the behavior and value on payoff control, which is typically absent in classic ZD strategies.

cs.GT↗

Direct Fisher Score Estimation for Likelihood Maximization

We study the problem of likelihood maximization when the likelihood function is intractable but model simulations are readily available. We propose a sequential, gradient-based optimization method that directly models the Fisher score based on a local score matching technique which uses simulations from a localized region around each parameter iterate. By employing a linear parameterization to the surrogate score model, our technique admits a closed-form, least-squares solution. This approach yields a fast, flexible, and efficient approximation to the Fisher score, effectively smoothing the likelihood objective and mitigating the challenges posed by complex likelihood landscapes. We provide theoretical guarantees for our score estimator, including bounds on the bias introduced by the smoothing. Empirical results on a range of synthetic and real-world problems demonstrate the superior performance of our method compared to existing benchmarks.

stat.ML↗

Zero-Flow Encoders

Flow-based methods have achieved significant success in various generative modeling tasks, capturing nuanced details within complex data distributions. However, few existing works have exploited this unique capability to resolve fine-grained structural details beyond generation tasks. This paper presents a flow-inspired framework for representation learning. First, we demonstrate that a rectified flow trained using independent coupling is zero everywhere at $t=0.5$ if and only if the source and target distributions are identical. We term this property the \emph{zero-flow criterion}. Second, we show that this criterion can certify conditional independence, thereby extracting \emph{sufficient information} from the data. Third, we translate this criterion into a tractable, simulation-free loss function that enables learning amortized Markov blankets in graphical models and latent representations in self-supervised learning tasks. Experiments on both simulated and real-world datasets demonstrate the effectiveness of our approach. The code reproducing our experiments can be found at: https://github.com/probabilityFLOW/zfe.

stat.ML↗

Replay-guided Test-time Adaptation for Fault Diagnosis Under Unseen Operating Conditions

In modern industrial systems, machinery frequently operates under dynamic environments with continuously varying loads and speeds. Consequently, deep learning-based fault diagnosis models often suffer from severe performance degradation under unseen operating conditions due to complex data distribution shifts. Since existing methods predominantly rely on static offline training, they lack the capability to dynamically adapt to these continuous variations. To address this issue, an integrated framework combining offline domain generalization (DG) and online test-time adaptation (OTTA) is proposed. Initially, a model with preliminary generalization capability is obtained offline by extracting domain-invariant features via adversarial learning. During the online phase, a dual-memory replay mechanism is developed. By selectively storing high-confidence online pseudo-labeled samples and replaying them with historical offline data, the model facilitates adaptation to changing data distributions and helps reduce forgetting of previously learned knowledge Experiments on a real-world motor dataset show that the proposed approach achieves competitive performance under the considered unseen operating conditions.

eess.SP↗

Regret Analysis of Guided Diffusion for Black-Box Optimization over Structured Inputs

Guided-diffusion black-box optimization (BO) has shown strong empirical performance on structured design problems such as molecules and crystals, but its regret behavior remains poorly understood. Existing BO regret analyses typically rely on maximum information gain, non-pretrained surrogate models, or exact acquisition maximization -- assumptions that break down in modern diffusion -- BO pipelines, where pretrained diffusion models serve as powerful priors over valid structures and acquisition maximization is replaced by approximate sampling over astronomically large discrete spaces. We develop a first certificate-based expected simple-regret framework for guided-diffusion BO that avoids maximum-information-gain bounds, RKHS assumptions, and exact acquisition maximization. The central quantity in our analysis is mass lift: the increase in probability mass assigned to near-optimal designs relative to the pretrained generator. This view explains how exponential-looking finite-budget convergence and polynomial acceleration can all arise from the same mechanism. We also give practical diagnostics for estimating search exponents from finite candidate pools and a proposal-corrected resampling construction that provides a fully certified sampler instance.

stat.ML↗

On the power of linear programming for K-means clustering

In [SIAM J. Optim., 2022], the authors introduced a new linear programming (LP) relaxation for K-means clustering. In this paper, we further investigate both theoretical and computational properties of this relaxation. As evident from our numerical experiments with both synthetic real-world data sets, the proposed LP relaxation is almost always tight; i.e. its optimal solution is feasible for the original nonconvex problem. To better understand this unexpected behaviour, on the theoretical side, we focus on K-means clustering with two clusters, and we obtain sufficient conditions under which the LP relaxation is tight. We further analyze the sufficient conditions when the input is generated according to a popular stochastic model and obtain recovery guarantees for the LP relaxation. We conclude our theoretical study by constructing a family of inputs for which the LP relaxation is never tight. Denoting by $n$ the number of data points to be clustered, the LP relaxation contains $Ω(n^3)$ inequalities making it impractical for large data sets. To address the scalability issue, by building upon a cutting-plane algorithm together with the GPU implementation of PDLP, a first-order method LP solver, we develop an efficient algorithm that solves the proposed LP and hence the K-means clustering problem, for up to $n \leq 4000$ data points.

math.OC↗

Infeasibility Aware Large Language Models for Combinatorial Optimization

Large language models (LLMs) are increasingly explored for NP-hard combinatorial optimization problems, but most existing methods emphasize feasible-instance solution generation and do not explicitly address infeasibility detection. We propose an infeasibility-aware framework that combines certifiable dataset construction, supervised fine-tuning, and LLM-assisted downstream search. For the minor-embedding problem, we introduce a new mathematical programming formulation together with provable zero-phase infeasibility screening, which enables scalable construction of training instances labeled either as feasible with structured certificates or as certifiably infeasible. Using training data generated through this exact optimization pipeline, we show that an 8B-parameter LLM can be fine-tuned to jointly perform solution generation and infeasibility detection. We further utilize LLM outputs as warm starts for downstream local search, providing a practical way to accelerate optimization even when the LLM outputs are imperfect. Experiments show that our fine-tuned model improves overall accuracy by up to 30\% over GPT-5.2; meanwhile LLM-guided warm starts provide up to $2\times$ speedup compared with starting from scratch in downstream local search.

cs.AI↗

Probing Axion via Mössbauer Spectroscopy

We propose using the ultra-narrow 88 keV Mössbauer transition in $^{109}$Ag to search for QCD axion dark matter. The sub-eV axion field oscillates coherently, inducing a time-varying effective $\barθ_{\rm QCD}$ angle. This, in turn, modulates the nuclear binding energy. From existing linewidth measurements, we derive constraints on the $f_a^{-1}$-$m_a$ plane that already surpass other laboratory bounds. We further detail an experimental setup to directly probe this time-dependent signature via precision Mössbauer spectroscopy in the gravitational potential. This Letter demonstrates that this approach can significantly extend search capability and probe a vast, unexplored region of axion parameter space. Particularly, this setup can probe axion masses beyond the reach of existing experiments, such as atomic-clock measurements, offering a powerful new way for exploring higher-mass axion dark matter. The sensitivity has the potential to be further improved with advancing experimental capabilities.

hep-ph↗

Machine Learning Based Probe Skew Correction for High-frequency BH Loop Measurements

Experimental characterization of magnetic components has grown to be increasingly important to understand and model their behaviours in high-frequency PWM converters. The BH loop measurement is the only available approach to separate the core loss as an electrical method, which, however, is susceptive to the probe phase skew. As an alternative to the regular de-skew approaches based on hardware, this work proposes a novel machine-learning-based method to identify and correct the probe skew, which builds on the newly discovered correlation between the skew and the shape/trajectory of the measured BH loop. A special technique is proposed to artificially generate skewed images from measured waveforms as augmented training sets. A machine learning pipeline is developed with the Convolutional Neural Network (CNN) to treat the problem as an image-based prediction task. The trained model has demonstrated a high accuracy and generalizability in identifying the skew value from a BH loop unseen by the model, which enables the compensation of the skew to yield the corrected core loss value and BH loop.

eess.SP↗

The stability of bi-polarization on dynamical directed graphs: an emergent game perspective

This paper proposes a co-evolutionary model of directed graphs and three opinions, i.e., conservative$(+)$, neutral$(\odot)$ and liberal$(-)$. Agents update both opinions and social relationships with bias. We find that an emergent game suffices to predict the stability of bi-polarization under a rare opinion updating limit and a large system size limit. The bi-polarization is stable if and only if the emergent game has an internal Nash equilibrium. The necessary and sufficient condition is explained by both risk dominance and evolutionary stability. This game approach facilitates us to reveal the stability of bi-polarization in empirical systems. Our work fosters the understanding of opinion formation for controversial topics, and shows a deep connection between opinion dynamics and evolutionary game theory.

nlin.AO↗

Guiding Time-Varying Generative Models with Natural Gradients on Exponential Family Manifold

Optimising probabilistic models is a well-studied field in statistics. However, its connection with the training of generative models remains largely under-explored. In this paper, we show that the evolution of time-varying generative models can be projected onto an exponential family manifold, naturally creating a link between the parameters of a generative model and those of a probabilistic model. We then train the generative model by moving its projection on the manifold according to the natural gradient descent scheme. This approach also allows us to efficiently approximate the natural gradient of the KL divergence without relying on MCMC for intractable models. Furthermore, we propose particle versions of the algorithm, which feature closed-form update rules for any parametric model within the exponential family. Through toy and real-world experiments, we validate the effectiveness of the proposed algorithms. The code of the proposed algorithms can be found at https://github.com/anewgithubname/iNGD.

stat.ML↗