Searcharxiv⌕ Search

arXiv subjects

Ying Cao

Publications and source records attributed to Ying Cao.

At least 19 recordsLinked to original sources

$β$-number and Its Applications to Data Science

In this paper, we introduce a novel metric, $β$-number, designed to measure the "$p$-th order $d$-dimensional oscillation degree" of a set. For a given set $K$ in the Euclidean space $\mathbb{R}^n$, $β$-number is computed by identifying an optimal $d$-dimensional plane $L$ that minimizes the average $p$-th order distance of all points in $K$ to $L$. This metric serves as a versatile tool in data science, functioning both as a dimensionality reduction technique to find the optimal $p$-th order $d$-dimensional subspace and as a measure to characterize data oscillation for classification. We conduct a thorough exploration of $β$-number through theoretical analysis and numerical experiments. Initially, we establish the upper and lower bounds of $β$-number for any set $K$, along with its scaling law. We then elucidate the relationships between $β$-number and its related parameters. A key finding of this study is that in discrete settings, when $p=2$, the $d$-dimensional plane determined by $β$-number coincides with that obtained via Principal Component Analysis (PCA), positioning $β$-number as a generalization of PCA. Furthermore, we propose two algorithms for calculating $β$-number in both continuous and discrete settings. We validate our theoretical results through a series of numerical experiments in low-dimensional cases. Finally, we demonstrate the potential of $β$-number in practical data analysis through a dimensionality reduction task and an image classification task.

cs.LG↗

Real-rooted Ehrhart $h^*$-polynomials of crown posets and wheel and whirl matroids

We prove that the Ehrhart $h^*$-polynomials of crown order polytopes are real-rooted, settling a conjecture of Lundström and Saud Maia Leite. For each integer $r\ge3$, the crown order polytope on $2r$ elements and the rank-$r$ whirl base polytope have the same $h^*$-polynomial. The $h^*$-polynomials of the rank-$r$ wheel and whirl base polytopes, as well as every convex combination of the two, have $2r-2$ distinct negative roots. Their coefficient sequences are positive, unimodal, and strictly ultra log-concave of order $2r-2$.

math.CO↗

Negative edge correlation in complete bipartite graphs

We prove strict pairwise negative correlation under both the uniform forest measure and the uniform connected-subgraph measure on the complete bipartite graph $K_{m,n}$ for all $m,n\geq2$. Under the connected-subgraph measure, any two distinct edges of a fixed copy of $K_{2,2}$ remain strictly negatively correlated after conditioning on the subgraph induced by the remaining vertices.

math.CO↗

An Adaptive-Horizon Graph Neural Operator for coupled surrogate morphodynamic modelling

Morphodynamic simulations require repeated coupling between hydrodynamic solvers, sediment transport modules, and bed updating. For long duration, multi-scenario simulations on large unstructured meshes, such coupling is computationally demanding. This study proposes an Adaptive-Horizon Graph Neural Operator (AH-GNO) that formulates bed evolution as a graph operator learning problem from recent hydrodynamic and topographic states to predict future bed elevation increments. The model operates directly on the native unstructured meshes. The approach integrates area-weighted graph learning, historical state selection, and forecast horizon estimation, allowing the effective history length (K) and update interval (B) to vary with the evolving flow and bed state. Using Telemac2D/GAIA solutions as supervised numerical references, the framework is evaluated on the official Bump and Yen bend benchmarks and on a field-scale application (Waiho River, New Zealand). Results show that the AH-GNO reproduces the main patterns of bedform migration, bend-scale erosion and deposition, and localized bed adjustment. Across the three cases, the tested CPU-GPU deployment reduced post-training bed-update workflow time from 12~1204 s with GAIA to 0.08~3.34 s with AH-GNO. This improvement corresponds to deployment-specific accelerations of approximately 150~360 times relative to 4-core GAIA CPU configurations, and with 105~186 times gains for 20-core CPU configurations. These results suggest that, while retaining hydrodynamic feedback from TELEMAC-2D, a learned operator for bed updating can provide an efficient acceleration component for morphodynamic scenario analysis and rapid coupled simulation.

physics.comp-ph↗

Content-Edited Layout Generation for Graphic Design

In this paper, we formulate a novel form of conditional layout generation for graphic design, termed content-edited layout generation(CELG). CELG extends conventional content-aware layout generation (CLG), which generates a foreground layout for a fixed background image. The key distinction is that CELG treats the input image as an editable visual asset and, conditioned on a textual design intention and a foreground requirement that may be empty, produces an adapted background together with its layout. To study this task, we introduce Search-Compare-Edit(SCE), a data construction framework that supplies the paired supervision missing from existing design datasets. Starting from professional design canvases and their layouts, SCE synthesizes plausible pre-edit source images and corresponding editing instructions, yielding InstructEdit, a dataset of aligned source images, target canvases, instructions, and layouts. Based on the generated data, we train a two-flow multimodal flow matching model that couples a pretrained image editor with a layout flow transformer, enabling background editing and layout generation simultaneously within a unified framework that more closely reflects real-world design workflows. Our experiments systematically demonstrate the value of CELG as a distinct task and the performance advantages of the proposed model.

cs.GR↗

On the Escaping Efficiency of Distributed Adversarial Training Algorithms

Adversarial training has been widely studied in recent years due to its role in improving model robustness against adversarial attacks. This paper focuses on comparing different distributed adversarial training algorithms--including centralized and decentralized strategies--within multi-agent learning environments. Previous studies have highlighted the importance of model flatness in determining robustness. To this end, we develop a general theoretical framework to study the escaping efficiency of these algorithms from local minima, which is closely related to the flatness of the resulting models. We show that when the perturbation bound is sufficiently small (i.e., when the attack strength is relatively mild) and a large batch size is used, decentralized adversarial training algorithms--including consensus and diffusion--are guaranteed to escape faster from local minima than the centralized strategy, thereby favoring flatter minima. However, as the perturbation bound increases, this trend may no longer hold. In the simulation results, we illustrate our theoretical findings and systematically compare the performance of models obtained through decentralized and centralized adversarial training algorithms. The results highlight the potential of decentralized strategies to enhance the robustness of models in distributed settings.

cs.LG↗

Human-aware Design Generation: Adding 3D Humans into Graphic Designs

Graphic designs nowadays predominantly contain human images, where people are posed and framed in a delicate way to guide viewers' visual exploration and evoke desired feelings. Despite recent progress in automatic graphic design generation, there has been no work on investigating the role of the human representations in design creation. In this paper, we seek to emphasize the importance of visual human representations in graphic design generation, by studying a novel task, dubbed as design-conditioned 3D human adding. To solve this task, we propose a model that adds 3D human representations into an existing partial design, by predicting their 3D poses, their 2D composition in the image containing them, as well as the spatial arrangement of the image in the input design, to generate a complete design. Our experiments show that our model outperforms baselines by predicting the 3D human poses, 2D framing and human image layout that better harmonize with the other existing design elements, and generating higher-quality holistic designs. Our work is the first to explore connections between 3D human generation and 2D graphic design generation, which would inspire future research in leveraging 3D information to build more powerful generative models for graphic designs in the 2D domain. The code is available at https://github.com/GreyNails/Human-aware-Design-Generation-Adding-3D-Humans-into-Graphic-Designs.

cs.GR↗

Learning Interaction between Image and Layout Priors for Joint Image-Layout Generation in Design Templates

In this paper, we address the problem of graphic design template creation, which generates a background image and a layout of foreground elements over the background to form a harmonious composition from an input text. Prior work on graphic design generation mostly adopts a sequential paradigm, where design elements are generated sequentially. We argue that such a sequential scheme falls short of faithfully capturing the dependency between the background and layout (and thus the joint image-layout distribution), which limits the quality of generated design templates. To overcome this limitation, we propose a model, InterIL, which jointly generates the two modalities, background image and layout, in a single generative process. The novel design of our joint model connects the backbones of pretrained image and layout diffusion models with a learnable communication module to explicitly model bidirectional image-layout interaction. During training, the image and layout backbones are frozen to maintain and leverage the vast pretrained single-modality prior knowledge, while only the communication module is updated, so that the model can focus on learning image-layout interaction and thereby better capture the joint image-layout distribution for improved composition harmony. Our model has no design-specific inductive bias, which allows it to better preserve the original characteristics of realistic designs. We further introduce a test-time guidance strategy to enable users to impose their specific preferences on generated results. Our experiments show that, compared with prior approaches, our model can generate significantly better results in terms of image, layout and image-layout harmonization, producing outputs closer to real samples. We also demonstrate the flexibility of our model in enforcing user preferences at inference without retraining.

cs.CV↗

Inverse reinforcement learning for indefinite mean-field social optimization with multiplicative noise

This paper studies the inverse reinforcement learning (RL) problem for linear-quadratic mean-field (MF) social optimization. The considered system features multiplicative noise and indefinite cost weights, which violate standard convexity assumptions and pose analytical challenges. The goal is to recover unknown social cost weights from expert demonstrations and reproduce the optimal control policies. This requires solving coupled stochastic algebraic Riccati equations and Lyapunov equations with unknown system dynamics. To this end, we first propose a model-based inverse RL algorithm with two sequential loops that separately handle individual and MF dynamics, and we prove its convergence and closed-loop stabilizability. Moreover, we characterize the non-uniqueness of the recovered cost weights. To eliminate reliance on system dynamics, we develop a model-free inverse RL algorithm using integral RL and least-squares identification, which requires only measured trajectory data satisfying mild rank conditions. Finally, numerical simulations validate the effectiveness of the proposed approaches.

math.OC↗

Stabilizer Design for Policy Iteration in Stochastic Linear Quadratic Control: A Spectrum-Assignment Approach

Policy iteration (PI) is an important reinforcement learning tool for solving optimal control problems which includes an initialization stage, i.e., the search for an initial stabilizing controller. However, the initialization stage typically relies on complete model information, thereby imposing substantial constraints on the initialization of model-free PI. For stochastic systems with multiplicative noise dependent on state and control, the stability is not ensured by Hurwitz conditions as in the deterministic case, but rather by a Lyapunov-type inequality that incorporates both drift and diffusion terms. Therefore, the corresponding model-free PI initialization problem is more challenging. To this end, a novel spectrum assignment method is proposed to obtain an initial stabilizer for PI in continuous-time indefinite stochastic linear quadratic control. With the help of the Lyapunov-type operator's spectrum, the original system is gradually approximated from the stable auxiliary system by adjusting a cumulative factor, thereby obtaining a stabilizing control gain. Furthermore, by leveraging system data and adjusting the cumulative factor, we design a model-free algorithm that does not rely on an initial stabilizing policy and can achieve optimal control. Finally, simulation results are provided to validate the effectiveness of the proposed methods.

math.OC↗

Partition-selected flow polynomials and associated arrangements

We introduce a partition-selection method to generalize the flow, chromatic, and Tutte polynomials of a graph by restricting the standard edge subgraph expansions to subgraphs given by prescribed connected vertex partitions. We establish similar deletion-contraction formulas and specialization relations for these polynomials, recovering all classical polynomial invariants when the selection is the set of all partitions. Next we study a relation between Jaeger et al.'s nonhomogeneous flows and a special class of partition-selected flow polynomials (called affine flow polynomials). Specifically, we give a geometric realization of nowhere-zero nonhomogeneous flows by restricting the edge-coordinate arrangement to affine flow spaces. The resulting characteristic polynomials coincide with Kochol's admissible assigning polynomials and with affine flow polynomials, which enumerate nowhere-zero nonhomogeneous flows over finite fields. To see the key role of the partition-selection framework, we further introduce boundary arrangements determined by the bond structure of a graph. Using the intersection posets of boundary arrangements, we obtain the classification of all restricted arrangements mentioned above, the comparison of unsigned coefficients of affine flow polynomials, and the decomposition formulas for affine flow polynomials.

math.CO↗

Breaking the Likelihood Trap: Consistent Generative Recommendation with Graph-structured Model

Reranking, as the final stage of recommender systems, plays a crucial role in determining the final exposure, directly influencing user experience. Recently, generative reranking has gained increasing attention for formulating reranking as a holistic sequence generation task, implicitly modeling complex dependencies among items. However, most existing methods suffer from the likelihood trap, where high-likelihood sequences are often repetitive and perceived as low-quality by humans, thereby limiting user engagement. In this work, we propose Consistent Graph-structured Generative Recommendation (CONGRATS). We first introduce a novel Graph-structured Model, which enables the generation of more diverse sequences by exploring multiple paths. This design not only expands the decoding space to promote diversity, but also improves prediction accuracy by explicitly modeling item dependencies from graph transitions. Furthermore, we design a Consistent Differentiable Training method that incorporates an evaluator, allowing the model to learn directly from user preferences. Extensive offline experiments validate the superior performance of CONGRATS over state-of-the-art reranking methods. Moreover, CONGRATS has been evaluated on a large-scale video-sharing app, Kuaishou, with over 300 million daily active users, demonstrating that our approach significantly improves both recommendation quality and diversity, validating our effectiveness in practical industrial platforms.

cs.IR↗

Ehrhart quasi-polynomials of rational polytopes by real dilations

This paper is to study the Ehrhart function $L(P,t)$ of a rational $n$-polytope $P$, defined as the number of lattice points of dilated polytopes $tP$ with real numbers $t\geq 0$. It turns out that $L(P,t)$ is a quasi-polynomial of real variable $t$ in the sense that \[ L(P,t)=\sum_{k=0}^{n} c_k(P,t)t^k, \quad t\geq 0, \] where $c_k(P,t)$ are periodic piecewise polynomials of degree $n-k$ if ${\rm aff}\,P$ contains the origin, and are periodic functions vanishing almost everywhere otherwise. When $P$ is a rational simplex $σ$, the coefficient functions $c_k(σ,t)$ are given explicitly in terms of vertex information of the simplex $σ$. Moreover, the reciprocity law still holds.

math.CO↗

Elder-Sim: A Psychometrically Validated Platform for Personality-Stable Elderly Digital Twins

Background: LLMs enable patient-facing conversational agents, creating a pathway toward digital twins that capture older adults' lived experiences and behavioral responses across time. A central barrier is personality drift -- inconsistent trait expression across repeated interactions -- which undermines reliability of generated trajectories and intervention-response simulation in geriatric care. Objective: To develop ELDER-SIM, a multi-role elderly-care conversational platform for building personality-stable digital twin agents, and to propose a psychometric validation framework for quantifying personality consistency in LLM-based agents. Methods: ELDER-SIM was implemented via n8n workflow orchestration with local LLM inference (Ollama/vLLM), integrating (1) Big Five (OCEAN) trait specifications, (2) a Cognitive Conceptualization Diagram (CCD) grounded in Beck's CBT framework, and (3) a MySQL-based long-term memory module. Ablation studies across four conditions -- Baseline, +Memory, +CCD, and +LoRA (fine-tuned on 19,717 instruction pairs from CHARLS) -- were evaluated via Cronbach's $α$, ICC, and role discrimination accuracy. Results: Reliability was acceptable to excellent across conditions (Cronbach's $α$: 0.70--0.94; ICC: 0.85--0.96). Role discrimination improved from 83.3% (Baseline) to 88.9% (+Memory), 94.4% (+CCD), and 97.2% (+LoRA). CCD produced the largest consistency gain (mean $α$ 0.702$\to$0.892), while LoRA achieved the highest overall consistency ($α$ 0.940; ICC 0.958). Conclusions: ELDER-SIM provides a psychometrically validated approach for constructing personality-consistent elderly digital twin agents. Structured cognitive modeling and domain adaptation reduce personality drift, supporting reliable longitudinal simulation for elderly mental health care and reproducible in silico evaluation before clinical deployment.

cs.HC↗

Characteristic quasi-polynomials of truncated arrangements

Given an (affine) integral arrangement $\mathcal{A}$ in $\mathbb{R}^n$, the reduction of $\mathcal{A}$ modulo an arbitrary positive integer $q$ naturally yields an arrangement $\mathcal{A}_q$ in $\mathbb{Z}_q^n$. Our primary objective is to study the combinatorial aspects of the restriction $\mathcal{A}^{(B,\bm b)}$ to the solution space of $B\bm x=\bm b$, and its reduction $\mathcal{A}_q^{(B,\bm b)}$ modulo $q$. This work generalizes the earlier results of Kamiya, Takemura and Terao, as well as Chen and Wang. The purpose of this paper is threefold as follows. Firstly, we derive an explicit counting formula for the cardinality of the complement $M\big(\mathcal{A}_q^{(B,\bm b)}\big)$ of $\mathcal{A}_q^{(B,\bm b)}$; and prove that for all positive integers $q>q_0$, this cardinality coincides with a quasi-polynomial $χ^{\text{quasi}}\big(\mathcal{A}^{(B,\bm b)},q\big)$ in $q$ with a period $ρ_C$. Secondly, we weaken Chen and Wang's original hypothesis $a \mid b$ to a strictly more general condition $\gcd(a,ρ_C)\mid \gcd(b,ρ_C)$, and introduce the concept of combinatorial equivalence for positive integers. Within this framework, we establish three unified comparison relations: between the unsigned coefficients of $χ^{\text{quasi}}\big(\mathcal{A}^{(B,\bm b)},a\big)$ and $χ^{\text{quasi}}\big(\mathcal{A}^{(B,\bm b)},b\big)$; between the unsigned coefficients of distinct constituents of $χ^{\text{quasi}}\big(\mathcal{A}^{(B,\bm b)},q\big)$; and between the cardinalities of $M\big(\mathcal{A}_q^{(B,\bm b)}\big)$ and $M\big(\mathcal{A}_{pq}^{(B,\bm b)}\big)$. Thirdly, using our method, we revisit the enumerative aspects of group colorings and nowhere-zero nonhomogeneous form flows from the early work of Forge, Zaslavsky and Kochol.

math.CO↗

CD-DPE: Dual-Prompt Expert Network Based on Convolutional Dictionary Feature Decoupling for Multi-Contrast MRI Super-Resolution

Multi-contrast magnetic resonance imaging (MRI) super-resolution intends to reconstruct high-resolution (HR) images from low-resolution (LR) scans by leveraging structural information present in HR reference images acquired with different contrasts. This technique enhances anatomical detail and soft tissue differentiation, which is vital for early diagnosis and clinical decision-making. However, inherent contrasts disparities between modalities pose fundamental challenges in effectively utilizing reference image textures to guide target image reconstruction, often resulting in suboptimal feature integration. To address this issue, we propose a dual-prompt expert network based on a convolutional dictionary feature decoupling (CD-DPE) strategy for multi-contrast MRI super-resolution. Specifically, we introduce an iterative convolutional dictionary feature decoupling module (CD-FDM) to separate features into cross-contrast and intra-contrast components, thereby reducing redundancy and interference. To fully integrate these features, a novel dual-prompt feature fusion expert module (DP-FFEM) is proposed. This module uses a frequency prompt to guide the selection of relevant reference features for incorporation into the target image, while an adaptive routing prompt determines the optimal method for fusing reference and target features to enhance reconstruction quality. Extensive experiments on public multi-contrast MRI datasets demonstrate that CD-DPE outperforms state-of-the-art methods in reconstructing fine details. Additionally, experiments on unseen datasets demonstrated that CD-DPE exhibits strong generalization capabilities.

cs.CV↗

Using the Schmidt Decomposition to Determine Quantum Entanglement

Quantum information theory is a rapidly growing area of math and physics that combines two independent theories, quantum mechanics and information theory. Quantum entanglement is a concept that was first proposed in the EPR paradox. In quantum mechanics, particles can be in superposition, meaning they are in multiple different states at once. It is not until the particle is measured that it is forced into a single state. However, it is possible that particles can be tied to other particles, meaning that the measurement of one particle will determine the measurement of the other particle. Entanglement is at the very core of quantum information theory. It is one of the core pieces that allows for the massive increase in computing power. For this paper, we decided to focus on demonstrating the mathematical method (the Schmidt decomposition) for determining if a system is entangled, and a demonstration of quantum entanglement's use (quantum teleportation) as well as a quick look at how to extend the uses of the Schmidt decomposition.

quant-ph↗

Stability and Generalization of Adversarial Diffusion Training

Algorithmic stability is an established tool for analyzing generalization. While adversarial training enhances model robustness, it often suffers from robust overfitting and an enlarged generalization gap. Although recent work has established the convergence of adversarial training in decentralized networks, its generalization properties remain unexplored. This work presents a stability-based generalization analysis of adversarial training under the diffusion strategy for convex losses. We derive a bound showing that the generalization error grows with both the adversarial perturbation strength and the number of training steps, a finding consistent with single-agent case but novel for decentralized settings. Numerical experiments on logistic regression validate these theoretical predictions.

cs.LG↗