Source author record

Yongjie Yang

Yongjie Yang appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

12works
8topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

12 published item(s)

preprint2026arXiv

AR1-ZO: Topology-Aware Rank-1 Zeroth-Order Queries for High-Rank LoRA Fine-Tuning

Zeroth-order (ZO) optimization enables large-language-model fine-tuning without storing backpropagation activations, while LoRA supplies compact trainable adapters. Combining them creates a rank paradox: increasing LoRA rank improves adapter capacity, but standard two-point ZO either perturbs a rank-dependent number of coordinates or, under atomwise updates, can make the finite-difference signal unobservable. This paper shows that the bottleneck is a measurement-topology problem rather than a need for an external subspace. LoRA already decomposes into matched rank-$1$ atoms, each a complete factor-coordinate block of dimension $d_\text{out}+d_\text{in}$. Querying one atom per step keeps the stored adapter rank $r$ while removing $r$ from the single-query perturbation dimension. The naive atomwise query is still miscalibrated: if it inherits canonical LoRA scaling $α/r$, the active finite-difference signal shrinks as $1/r$ and the active finite-difference signal-to-noise ratio (FD-SNR) as $1/r^2$, producing directional collapse under a fixed residual evaluation-noise floor. AR1-ZO pairs alternating rank-$1$ atom queries with topology-aware scaling $γ=αr$, restoring rank-invariant active signal without auxiliary bases, activation hooks, curvature estimates, or extra forward queries. Theory proves atom minimality, rank-independent active query dimension, directional collapse and restoration, and the remaining rank dependence as an amortized coverage cost. Experiments on OPT and Qwen3 models validate the signal mechanism and show that AR1-ZO makes high-rank LoRA effective among matched-budget ZO methods under the standard two-forward-pass query budget.

preprint2022arXiv

Emergence of insulating ferrimagnetism and perpendicular magnetic anisotropy in 3d-5d perovskite oxide composite films for insulator spintronic

Magnetic insulators with strong perpendicular magnetic anisotropy (PMA) play a key role in exploring pure spin current phenomena and developing ultralow-dissipation spintronic devices, thereby it is highly desirable to develop new material platforms. Here we report epitaxial growth of La2/3Sr1/3MnO3 (LSMO)-SrIrO3 (SIO) composite oxide films (LSMIO) with different crystalline orientations fabricated by sequential two-target ablation process using pulsed laser deposition. The LSMIO films exhibit high crystalline quality with homogeneous mixture of LSMO and SIO at atomic level. Ferrimagnetic and insulating transport characteristics are observed, with the temperature-dependent electric resistivity well fitted by Mott variable-range-hopping model. Moreover, the LSMIO films show strong PMA. Through further constructing all perovskite oxide heterostructures of the ferrimagnetic insulator LSMIO and a strong spin-orbital coupled SIO layer, pronounced spin Hall magnetoresistance (SMR) and spin Hall-like anomalous Hall effect (SH-AHE) were observed. These results illustrate the potential application of the ferrimagnetic insulator LSMIO in developing all-oxide ultralow-dissipation spintronic devices.

preprint2022arXiv

Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations

In the {claw, diamond}-free edge deletion problem, we are given a graph $G$ and an integer $k>0$, the question is whether there are at most $k$ edges whose deletion results in a graph without claws and diamonds as induced graphs. Based on some refined observations, we propose a kernel of $O(k^3)$ vertices and $O(k^4)$ edges, significantly improving the previous kernel of $O(k^{12})$ vertices and $O(k^{24})$ edges. In addition, we derive an $O^*(3.792^k)$-time algorithm for the {claw, diamond}-free edge deletion problem.

preprint2022arXiv

Short-term passenger flow prediction for multi-traffic modes: A Transformer and residual network based multi-task learning method

With the prevailing of mobility as a service (MaaS), it becomes increasingly important to manage multi-traffic modes simultaneously and cooperatively. As an important component of MaaS, short-term passenger flow prediction for multi-traffic modes has thus been brought into focus. It is a challenging problem because the spatiotemporal features of multi-traffic modes are critically complex. Moreover, the passenger flows of multi-traffic modes differentiate and fluctuate significantly. To solve these problems, this paper proposes a multitask learning-based model, called Res-Transformer, for short-term inflow prediction of multi-traffic modes (subway, taxi, and bus). Each traffic mode is treated as a single task in the model. The Res-Transformer consists of two parts: (1) several modified Transformer layers comprising the conv-Transformer layer and the multi-head attention mechanism, which helps to extract the spatial and temporal features of multi-traffic modes, (2) the structure of residual network is utilized to obtain the correlations of different traffic modes and prevent gradient vanishing, gradient explosion, and overfitting. The Res-Transformer model is evaluated on two large-scale real-world datasets from Beijing, China. One is the region of a traffic hub and the other is the region of a residential area. Experiments are conducted to compare the performance of the proposed model with several baseline models. Results prove the effectiveness and robustness of the proposed method. This paper can give critical insights into the short-term inflow prediction for multi-traffic modes.

preprint2021arXiv

Cooperative control of perpendicular magnetic anisotropy via crystal structure and orientation in single-crystal flexible SrRuO3 membranes

Flexible magnetic materials with robust and controllable perpendicular magnetic anisotropy (PMA) are highly desirable for developing flexible high-performance spintronic devices. However, it is still challenge to fabricate PMA films through current techniques of direct deposition on polymers. Here, we report a facile method for synthesizing single-crystal freestanding SrRuO3 (SRO) membranes with controlled crystal structure and orientation using water-soluble Ca3-xSrxAl2O6 sacrificial layers. Through cooperative effect of crystal structure and orientation engineering, flexible SrRuO3 membranes reveal highly tunable magnetic anisotropy from in-plane to our-of-plane with a remarkable PMA energy of 7.34*106 erg/cm3. Based on the first-principles calculations, it reveals that the underlying mechanism of PMA modulation is intimately correlated with structure-controlled Ru 4d-orbital occupation, as well as the spin-orbital matrix element differences, dependent on the crystal orientation. In addition, there are no obvious changes of the magnetism after 10,000 bending cycles, indicating an excellent magnetism reliability in the prepared films. This work provides a feasible approach to prepare the flexible oxide films with strong and controllable PMA.

preprint2020arXiv

On the Complexity of Constructive Control under Nearly Single-Peaked Preferences

We investigate the complexity of {\sc{Constructive Control by Adding/Deleting Votes}} (CCAV/CCDV) for $r$-approval, Condorcet, Maximin and Copeland$^α$ in $k$-axes and $k$-candidates partition single-peaked elections. In general, we prove that CCAV and CCDV for most of the voting correspondences mentioned above are NP-hard even when~$k$ is a very small constant. Exceptions are CCAV and CCDV for Condorcet and CCAV for $r$-approval in $k$-axes single-peaked elections, which we show to be fixed-parameter tractable with respect to~$k$. In addition, we give a polynomial-time algorithm for recognizing $2$-axes elections, resolving an open problem. Our work leads to a number of dichotomy results. To establish an NP-hardness result, we also study a property of $3$-regular bipartite graphs which may be of independent interest. In particular, we prove that for every $3$-regular bipartite graph, there are two linear orders of its vertices such that the two endpoints of every edge are consecutive in at least one of the two orders.

preprint2016arXiv

A Further Step Towards an Understanding of the Tournament Equilibrium Set

We study some problems pertaining to the tournament equilibrium set (TEQ for short). A tournament $H$ is a TEQ-retentive tournament if there is a tournament $T$ which has a minimal TEQ-retentive set $R$ such that $T[R]$ is isomorphic to $H$. We study TEQ-retentive tournaments and achieve many significant results. In particular, we prove that there are no TEQ-retentive tournaments of size 4, only 2 non-isomorphic TEQ-retentive tournaments of sizes 5 and 6, respectively, and 26 non-isomorphic TEQ-retentive tournaments of size 7. For three tournaments $H_1, H_2$ and $T$, we say $T$ is a $(H_1,H_2)$-TEQ-retentive tournament if $T$ has two minimal TEQ-retentive sets $R_1$ and $R_2$ such that $T[R_1]$ and $T[R_2]$ are isomorphic to $H_1$ and $H_2$, respectively. We show that there are no $(H_1,H_2)$-retentive tournaments for $H_1$ and $H_2$ being small tournaments. Our results imply that Schwartz's Conjecture holds in all tournaments of size at most 14. Finally, we study Schwartz's Conjecture in several classes of tournaments. To achieve these results, we study the relation between (directed) domination graphs of tournaments and TEQ-retentive sets, and derive a number of properties on minimal TEQ-retentive sets.

preprint2016arXiv

Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis

In the Proper Interval Vertex Deletion problem (PIVD for short), we are given a graph $G$ and an integer parameter $k>0$, and the question is whether there are at most $k$ vertices in $G$ whose removal results in a proper interval graph. It is known that the PIVD problem is fixed-parameter tractable and admits a polynomial but "unreasonably" large kernel of $O(k^{53})$ vertices. A natural question is whether the problem admits a polynomial kernel of "reasonable" size. In this paper, we answer this question by deriving an $O(k^7)$-vertex kernel for the PIVD problem. Our kernelization is based on several new observations and a refined analysis of the kernelization.

preprint2016arXiv

The Complexity of Shelflisting

Optimal shelflisting invites profit maximization to become sensitive to the ways in which purchasing decisions are order-dependent. We study the computational complexity of the corresponding product arrangement problem when consumers are either rational maximizers, use a satisficing procedure, or apply successive choice. The complexity results we report are shown to crucially depend on the size of the top cycle in consumers' preferences over products and on the direction in which alternatives on the shelf are encountered.

preprint2014arXiv

Election Attacks with Few Candidates

We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types), and bribery problems are fixed-parameter tractable for most of the generalized scoring rules, with respect to the number of candidates. Our results imply that all these strategic voting problems are fixed-parameter tractable for most of the common voting rules, such as Plurality, r-Approval, Borda, Copeland, Maximin, Bucklin, etc., with respect to the number of candidates.

preprint2014arXiv

How Credible is the Prediction of a Party-Based Election?

In a party-based election system, the voters are grouped into parties and all voters of a party are assumed to vote according to the party preferences over the candidates. Hence, once the party preferences are declared the outcome of the election can be determined. However, in the actual election, the members of some "instable" parties often leave their own party to join other parties. We introduce two parameters to measure the credibility of the prediction based on party preferences: Min is the minimum number of voters leaving the instable parties such that the prediction is no longer true, while Max is the maximum number of voters leaving the instable parties such that the prediction remains valid. Concerning the complexity of computing Min and Max, we consider both positional scoring rules (Plurality, Veto, r-Approval and Borda) and Condorcet-consistent rules (Copeland and Maximin). We show that for all considered scoring rules, Min is polynomial-time computable, while it is NP-hard to compute Min for Copeland and Maximin. With the only exception of Borda, Max can be computed in polynomial time for other scoring rules. We have NP-hardness results for the computation of Max under Borda, Maximin and Copeland.

preprint2013arXiv

Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems

Both weighted and unweighted Borda manipulation problems have been proved $\mathcal{NP}$-hard. However, there is no exact combinatorial algorithm known for these problems. In this paper, we initiate the study of exact combinatorial algorithms for both weighted and unweighted Borda manipulation problems. More precisely, we propose $O^*((m\cdot 2^m)^{t+1})$time and $O^*(t^{2m})$time\footnote{$O^*()$ is the $O()$ notation with suppressed factors polynomial in the size of the input.} combinatorial algorithms for weighted and unweighted Borda manipulation problems, respectively, where $t$ is the number of manipulators and $m$ is the number of candidates. Thus, for $t=2$ we solve one of the open problems posted by Betzler et al. [IJCAI 2011]. As a byproduct of our results, we show that the {unweighted Borda manipulation} problem admits an algorithm of running time $O^*(2^{9m^2\log{m}})$, based on an integer linear programming technique. Finally, we study the {unweighted Borda manipulation} problem under single-peaked elections and present polynomial-time algorithms for the problem in the case of two manipulators, in contrast to the $\mathcal{NP}$-hardness of this case in general settings.