Searcharxiv⌕ Search

arXiv subjects

Zixuan Yang

Publications and source records attributed to Zixuan Yang.

33 records · Page 2Linked to original sources

On saturation problems for matchings with regularity constraints

A graph $G$ is $F$-saturated if $G$ is $F$-free but for any edge $e$ in the complement of $G$ the graph $G + e$ contains $F$. Gerbner et al. (Discrete Math., 345 (2022), 112921) initiated the study of $rsat(n,F)$, the minimum number of edges in a regular $n$-vertex $F$-saturated graph, and they posed the problem of for which graphs $rsat(n, F )$ exists. Regarding this problem, we obtain the precise value of $rsat(n,(m+1)K_2)$ for all possible cases, where $(m+1)K_2$ denotes a matching of size $m+1$. As a natural counterpart, we also determine the maximum number of edges in a regular $n$-vertex $(m+1)K_2$-free graph for all $m\ge 1$ and $n\ge 2m+2$.

math.CO↗

Learning Cascade Ranking as One Network

Cascade Ranking is a prevalent architecture in large-scale top-k selection systems like recommendation and advertising platforms. Traditional training methods focus on single-stage optimization, neglecting interactions between stages. Recent advances have introduced interaction-aware training paradigms, but still struggle to 1) align training objectives with the goal of the entire cascade ranking (i.e., end-to-end recall of ground-truth items) and 2) learn effective collaboration patterns for different stages. To address these challenges, we propose LCRON, which introduces a novel surrogate loss function derived from the lower bound probability that ground truth items are selected by cascade ranking, ensuring alignment with the overall objective of the system. According to the properties of the derived bound, we further design an auxiliary loss for each stage to drive the reduction of this bound, leading to a more robust and effective top-k selection. LCRON enables end-to-end training of the entire cascade ranking system as a unified network. Experimental results demonstrate that LCRON achieves significant improvement over existing methods on public benchmarks and industrial applications, addressing key limitations in cascade ranking training and significantly enhancing system performance.

cs.IR↗

Exploring Human-Like Thinking in Search Simulations with Large Language Models

Simulating user search behavior is a critical task in information retrieval, which can be employed for user behavior modeling, data augmentation, and system evaluation. Recent advancements in large language models (LLMs) have opened up new possibilities for generating human-like actions including querying, browsing, and clicking. In this work, we explore the integration of human-like thinking into search simulations by leveraging LLMs to simulate users' hidden cognitive processes. Specifically, given a search task and context, we prompt LLMs to first think like a human before executing the corresponding action. As existing search datasets do not include users' thought processes, we conducted a user study to collect a new dataset enriched with users' explicit thinking. We investigate the impact of incorporating such human-like thinking on simulation performance and apply supervised fine-tuning (SFT) to teach LLMs to emulate both human thinking and actions. Our experiments span two dimensions in leveraging LLMs for user simulation: (1) with or without explicit thinking, and (2) with or without fine-tuning on the thinking-augmented dataset. The results demonstrate the feasibility and potential of incorporating human-like thinking in user simulations, though performance improvements on some metrics remain modest. We believe this exploration provides new avenues and inspirations for advancing user behavior modeling in search simulations.

cs.IR↗

Adaptive$^2$: Adaptive Domain Mining for Fine-grained Domain Adaptation Modeling

Advertising systems often face the multi-domain challenge, where data distributions vary significantly across scenarios. Existing domain adaptation methods primarily focus on building domain-adaptive neural networks but often rely on hand-crafted domain information, e.g., advertising placement, which may be sub-optimal. We think that fine-grained "domain" patterns exist that are difficult to hand-craft in online advertisement. Thus, we propose Adaptive$^2$, a novel framework that first learns domains adaptively using a domain mining module by self-supervision and then employs a shared&specific network to model shared and conflicting information. As a practice, we use VQ-VAE as the domain mining module and conduct extensive experiments on public benchmarks. Results show that traditional domain adaptation methods with hand-crafted domains perform no better than single-domain models under fair FLOPS conditions, highlighting the importance of domain definition. In contrast, Adaptive$^2$ outperforms existing approaches, emphasizing the effectiveness of our method and the significance of domain mining. We also deployed Adaptive$^2$ in the live streaming scenario of Kuaishou Advertising System, demonstrating its commercial value and potential for automatic domain identification. To the best of our knowledge, Adaptive$^2$ is the first approach to automatically learn both domain identification and adaptation in online advertising, opening new research directions for this area.

cs.LG↗

Improving Expressive Power of Spectral Graph Neural Networks with Eigenvalue Correction

In recent years, spectral graph neural networks, characterized by polynomial filters, have garnered increasing attention and have achieved remarkable performance in tasks such as node classification. These models typically assume that eigenvalues for the normalized Laplacian matrix are distinct from each other, thus expecting a polynomial filter to have a high fitting ability. However, this paper empirically observes that normalized Laplacian matrices frequently possess repeated eigenvalues. Moreover, we theoretically establish that the number of distinguishable eigenvalues plays a pivotal role in determining the expressive power of spectral graph neural networks. In light of this observation, we propose an eigenvalue correction strategy that can free polynomial filters from the constraints of repeated eigenvalue inputs. Concretely, the proposed eigenvalue correction strategy enhances the uniform distribution of eigenvalues, thus mitigating repeated eigenvalues, and improving the fitting capacity and expressive power of polynomial filters. Extensive experimental results on both synthetic and real-world datasets demonstrate the superiority of our method. The code is available at: https://github.com/Lukangkang123/EC-GNN

cs.LG↗

Reinfier and Reintrainer: Verification and Interpretation-Driven Safe Deep Reinforcement Learning Frameworks

Ensuring verifiable and interpretable safety of deep reinforcement learning (DRL) is crucial for its deployment in real-world applications. Existing approaches like verification-in-the-loop training, however, face challenges such as difficulty in deployment, inefficient training, lack of interpretability, and suboptimal performance in property satisfaction and reward performance. In this work, we propose a novel verification-driven interpretation-in-the-loop framework Reintrainer to develop trustworthy DRL models, which are guaranteed to meet the expected constraint properties. Specifically, in each iteration, this framework measures the gap between the on-training model and predefined properties using formal verification, interprets the contribution of each input feature to the model's output, and then generates the training strategy derived from the on-the-fly measure results, until all predefined properties are proven. Additionally, the low reusability of existing verifiers and interpreters motivates us to develop Reinfier, a general and fundamental tool within Reintrainer for DRL verification and interpretation. Reinfier features breakpoints searching and verification-driven interpretation, associated with a concise constraint-encoding language DRLP. Evaluations demonstrate that Reintrainer outperforms the state-of-the-art on six public benchmarks in both performance and property guarantees. Our framework can be accessed at https://github.com/Kurayuri/Reinfier.

cs.LG↗

Seeing is not Believing: An Identity Hider for Human Vision Privacy Protection

Massive captured face images are stored in the database for the identification of individuals. However, these images can be observed unintentionally by data managers, which is not at the will of individuals and may cause privacy violations. Existing protection schemes can maintain identifiability but slightly change the facial appearance, rendering it still susceptible to the visual perception of the original identity by data managers. In this paper, we propose an effective identity hider for human vision protection, which can significantly change appearance to visually hide identity while allowing identification for face recognizers. Concretely, the identity hider benefits from two specially designed modules: 1) The virtual face generation module generates a virtual face with a new appearance by manipulating the latent space of StyleGAN2. In particular, the virtual face has a similar parsing map to the original face, supporting other vision tasks such as head pose detection. 2) The appearance transfer module transfers the appearance of the virtual face into the original face via attribute replacement. Meanwhile, identity information can be preserved well with the help of the disentanglement networks. In addition, diversity and background preservation are supported to meet the various requirements. Extensive experiments demonstrate that the proposed identity hider achieves excellent performance on privacy protection and identifiability preservation.

cs.CV↗

Numerical investigation of mixed-phase turbulence induced by a plunging jet

In nature and engineering applications, plunging jet acts as a key process causing interface breaking and generating mixed-phase turbulence. In this paper, high-resolution numerical simulation of water jet plunging into a quiescent pool was perform to investigate the statistical property of the mixed-phase turbulence, with special focus on the closure problem of the Reynolds-averaged equation. We conducted phase-resolved simulations, with the air--water interface captured using a coupled level-set and volume-of-fluid method. Nine cases were performed to analyse the effects of the Froude number and Reynolds number. The simulation results showed that the turbulent statistics are insensitive to the Reynolds number under investigation, while the Froude number influences the flow properties significantly. To investigate the closure problem of the mean momentum equation, the turbulent kinetic energy (TKE) and turbulent mass flux (TMF) and their transport equations were further investigated. It was discovered that the balance relationship of the TKE budget terms remained similar to many single-phase turbulent flows. The TMF is an additional unclosed term in the mixed-phase turbulence. Our simulation results showed that the production term of its transport equation was highly correlated to the TKE. Based on this finding, a closure model of its production term was further proposed.

physics.flu-dyn↗

Controllability of Networked Sampled-data Systems

The controllability of networked sampled-data systems with zero-order holders on the control and transmission channels is explored, where single- and multi-rate sampling patterns are considered, respectively. The effects of sampling on the controllability of networked systems are analyzed, with some necessary and/or sufficient controllability conditions derived. Different from the sampling control of single systems, the pathological sampling of node systems could be eliminated by an appropriate design of network structure and inner couplings. While for singular topology matrices, the pathological sampling of single nodes will cause the entire system to lose controllability. Moreover, any periodic sampling will not affect the controllability of networked systems with specific node dynamics. All the results indicate that whether a networked system is under pathological sampling or not is jointly determined by mutually coupled factors.

eess.SY↗

Controllability of Multilayer Networked Sampled-data Systems

This paper explores the state controllability of multilayer networked sampled-data systems with inter-layer couplings, where zero-order holders (ZOHs) are on the control and transmission channels. The effects of both single- and multi-rate sampling on controllability of multilayer networked linear time-invariant (LTI) systems are analyzed, with some sufficient and/or necessary controllability conditions derived. Under specific conditions, the pathological sampling of single node systems could be eliminated by the network structure and inner couplings among different nodes and different layers. The representative drive-response inter-layer coupling mode is studied, and it reveals that the whole system could be controllable due to the inter-layer couplings even if the response layer is uncontrollable itself. Moreover, simulated examples show that the modification of sampling rate on local channels could lay a positive or negative effect on the controllability of the whole system. All the results indicate that the controllability of the multilayer networked sampled-data system is collectively affected by mutually coupled factors.

eess.SY↗

On the wavenumber-frequency spectra of the wall pressure fluctuations in turbulent channel flow

Direct numerical simulations (DNS) of turbulent channel flows up to $Re_τ \approx 1000$ are conducted to investigate the three-dimensional (consisting of streamwise wavenumber, spanwise wavenumber and frequency) spectrum of wall pressure fluctuations. To develop a predictive model of the wavenumber-frequency spectrum from the wavenumber spectrum, the time decorrelation mechanisms of wall pressure fluctuations are investigated. It is discovered that the energy-containing part of the wavenumber-frequency spectrum of wall pressure fluctuations can be well predicted using a similar random sweeping model for streamwise velocity fluctuations. To refine the investigation, we further decompose the spectrum of the total wall pressure fluctuations into the auto spectra of rapid and slow pressure fluctuations, and the cross spectrum between them. We focus on evaluating the assumption applied in many predictive models, that is, the magnitude of the cross spectrum is negligibly small. The present DNS shows that neglecting the cross spectrum causes a maximum error up to 4.7dB in the sub-convective region for all Reynolds numbers under test. Our analyses indicate that the assumption of neglecting the cross spectrum needs to be applied carefully in the investigations of acoustics at low Mach numbers, in which the sub-convective components of wall pressure fluctuations make important contributions to the radiated acoustic power.

physics.flu-dyn↗

On the wavenumber-frequency spectra of wall pressure fluctuations in turbulent channel flows

The characteristics of the wavenumber-frequency spectra of the rapid, slow and total wall pressure fluctuations are investigated using direct numerical simulation (DNS) of turbulent channel flow up to $\Rey_τ\approx 1000$. For the wavenumber-frequency spectra of the total wall pressure fluctuations, a valley-like behavior of contour lines in the sub-convective region is found, which may be linked to the Kraichnan-Phillips theorem. For the decomposition of the wall pressure spectra, it is commonly assumed in previous studies that the cross spectral density (CSD) between the rapid and slow components of the wall pressure fluctuations can be neglected. Yet no experimental or numerical evidence is available for either confirming or disproving this assumption. In this paper, we use DNS data to quantitatively evaluate this assumption. Emphasizes are put on the error in decibel scale caused by neglecting the CSD between the rapid and slow components of the wall pressure fluctuations. It is found that this assumption is approximately accurate for one- and two-dimensional spectra, but causes a large magnitude of error in the three-dimensional wavenumber-frequency spectra. An error of 5dB is observed in the sub-convective region and such a large error is observed for a wide range of Reynolds numbers ($180\le\Rey_τ\le 1000$). The analyses show that the assumption of neglecting the CSD needs to be applied carefully at the scales falling in the sub-convective region.

physics.flu-dyn↗

A characterization for graphs having strong parity factors

A graph $G$ has the \emph{strong parity property} if for every subset $X\subseteq V$ with $|X|$ even, $G$ has a spanning subgraph $F$ with minimum degree at least one such that $d_F(v)\equiv 1\pmod 2$ for all $v\in X$, $d_F(y)\equiv 0\pmod 2$ for all $y\in V(G)-X$. Bujtás, Jendrol and Tuza (On specific factors in graphs, \emph{Graphs and Combin.}, 36 (2020), 1391-1399.) introduced the concept and conjectured that every 2-edge-connected graph with minimum degree at least three has the strong parity property. In this paper, we give a characterization for graphs to have the strong parity property and construct a counterexample to disprove the conjecture proposed by Bujtás, Jendrol and Tuza.

math.CO↗

Secrecy Outage Analysis for Cooperative NOMA Systems with Relay Selection Scheme

This paper considers the secrecy outage performance of a multiple-relay assisted non-orthogonal multiple access (NOMA) network over Nakagami-$m$ fading channels. Two slots are utilized to transmit signals from the base station to destination. At the first slot, the base station broadcasts the superposition signal of the two users to all decode-and-forward relays by message mapping strategy. Then the selected relay transmits superposition signal to the two users via power-domain NOMA technology. Three relay selection (RS) schemes, i.e., optimal single relay selection (OSRS) scheme, two-step single relay selection (TSRS) scheme, and optimal dual relay selection (ODRS) scheme, are proposed and the secrecy outage performance are analyzed. As a benchmark, we also examine the secrecy outage performance of the NOMA systems with traditional multiple relays combining (TMRC) scheme in which all the relay that successfully decode signals from the source forward signals to the NOMA users with equal power. Considering the correlation between the secrecy capacity of two users and different secrecy requirement for two NOMA users, the closed-form expressions for the security outage probability (SOP) of the proposed OSRS, TSRS, and ODRS schemes along with the TMRC scheme are derived and validated via simulations. To get more insights, we also derive the closed-form expressions for the asymptotic SOP for all the schemes with fixed and dynamic power allocations. Furthermore, the secrecy diversity order (SDO) of cooperative NOMA systems is obtained. The results demonstrate that our proposed schemes can significantly enhance the secrecy performance compared to the TMRC scheme and that all the RS schemes with fixed power allocation obtain zero SDO and the OSRS scheme with dynamic power allocation obtains the same SDO as TMRC.

cs.IT↗

Channel Attention and Multi-level Features Fusion for Single Image Super-Resolution

Convolutional neural networks (CNNs) have demonstrated superior performance in super-resolution (SR). However, most CNN-based SR methods neglect the different importance among feature channels or fail to take full advantage of the hierarchical features. To address these issues, this paper presents a novel recursive unit. Firstly, at the beginning of each unit, we adopt a compact channel attention mechanism to adaptively recalibrate the channel importance of input features. Then, the multi-level features, rather than only deep-level features, are extracted and fused. Additionally, we find that it will force our model to learn more details by using the learnable upsampling method (i.e., transposed convolution) only on residual branch (instead of using it both on residual branch and identity branch) while using the bicubic interpolation on the other branch. Analytic experiments show that our method achieves competitive results compared with the state-of-the-art methods and maintains faster speed as well.

cs.CV↗