Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
12works
0followers
14topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

12 published item(s)

preprint2026arXiv

Secret Stealing Attacks on Local LLM Fine-Tuning through Supply-Chain Model Code Backdoors

Local fine-tuning datasets routinely contain sensitive secrets such as API keys, personal identifiers, and financial records. Although ''local offline fine-tuning'' is often viewed as a privacy boundary, we reveal that compromised model code is sufficient to steal them. Current passive pretrained-weight poisoning attacks, while effective for natural language, fundamentally fail to capture such sparse high-entropy targets due to their reliance on probabilistic semantic prefixes. To bridge this gap, we identify and exploit a practical but overlooked supply-chain vector -- model code camouflaged as standard architectural definitions -- to realize a paradigm shift from passive weight poisoning to active execution hijacking. We introduce a deterministic full-chain memorization mechanism: it locks onto token-level secrets in dynamic computation flows via online tensor-rule matching, and leverages value-gradient decoupling to stealthily inject attack gradients, overcoming gradient drowning to force model memorization. Furthermore, we achieve, for the first time, attacker-verifiable secret stealing through black-box queries that precisely distinguishes true leakage from hallucination. Experiments demonstrate that our method achieves over 98\% Strict ASR without compromising the primary task, and can effectively bypass defense measures including DP-SGD, semantic auditing, and code auditing.

preprint2022arXiv

FEDformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecasting

Although Transformer-based methods have significantly improved state-of-the-art results for long-term series forecasting, they are not only computationally expensive but more importantly, are unable to capture the global view of time series (e.g. overall trend). To address these problems, we propose to combine Transformer with the seasonal-trend decomposition method, in which the decomposition method captures the global profile of time series while Transformers capture more detailed structures. To further enhance the performance of Transformer for long-term prediction, we exploit the fact that most time series tend to have a sparse representation in well-known basis such as Fourier transform, and develop a frequency enhanced Transformer. Besides being more effective, the proposed method, termed as Frequency Enhanced Decomposed Transformer ({\bf FEDformer}), is more efficient than standard Transformer with a linear complexity to the sequence length. Our empirical studies with six benchmark datasets show that compared with state-of-the-art methods, FEDformer can reduce prediction error by $14.8\%$ and $22.6\%$ for multivariate and univariate time series, respectively. Code is publicly available at https://github.com/MAZiqing/FEDformer.

preprint2022arXiv

The characterizing properties of (signless) Laplacian permanental polynomials of bicyclic graphs

Let $G$ be a graph with $n$ vertices, and let $L(G)$ and $Q(G)$ be the Laplacian matrix and signless Laplacian matrix of $G$, respectively. The polynomial $π(L(G);x)={\rm per}(xI-L(G))$ (resp. $π(Q(G);x)={\rm per}(xI-Q(G))$) is called {\em Laplacian permanental polynomial} (resp. {\em signless Laplacian permanental polynomial}) of $G$. In this paper, we show that two classes of bicyclic graphs are determined by their (signless) Laplacian permanental polynomials.

preprint2022arXiv

TreeDRNet:A Robust Deep Model for Long Term Time Series Forecasting

Various deep learning models, especially some latest Transformer-based approaches, have greatly improved the state-of-art performance for long-term time series forecasting.However, those transformer-based models suffer a severe deterioration performance with prolonged input length, which prohibits them from using extended historical info.Moreover, these methods tend to handle complex examples in long-term forecasting with increased model complexity, which often leads to a significant increase in computation and less robustness in performance(e.g., overfitting). We propose a novel neural network architecture, called TreeDRNet, for more effective long-term forecasting. Inspired by robust regression, we introduce doubly residual link structure to make prediction more robust.Built upon Kolmogorov-Arnold representation theorem, we explicitly introduce feature selection, model ensemble, and a tree structure to further utilize the extended input sequence, which improves the robustness and representation power of TreeDRNet. Unlike previous deep models for sequential forecasting work, TreeDRNet is built entirely on multilayer perceptron and thus enjoys high computational efficiency. Our extensive empirical studies show that TreeDRNet is significantly more effective than state-of-the-art methods, reducing prediction errors by 20% to 40% for multivariate time series. In particular, TreeDRNet is over 10 times more efficient than transformer-based methods. The code will be released soon.

preprint2021arXiv

DeepLight: Deep Lightweight Feature Interactions for Accelerating CTR Predictions in Ad Serving

Click-through rate (CTR) prediction is a crucial task in online display advertising. The embedding-based neural networks have been proposed to learn both explicit feature interactions through a shallow component and deep feature interactions using a deep neural network (DNN) component. These sophisticated models, however, slow down the prediction inference by at least hundreds of times. To address the issue of significantly increased serving delay and high memory usage for ad serving in production, this paper presents \emph{DeepLight}: a framework to accelerate the CTR predictions in three aspects: 1) accelerate the model inference via explicitly searching informative feature interactions in the shallow component; 2) prune redundant layers and parameters at intra-layer and inter-layer level in the DNN component; 3) promote the sparsity of the embedding layer to preserve the most discriminant signals. By combining the above efforts, the proposed approach accelerates the model inference by 46X on Criteo dataset and 27X on Avazu dataset without any loss on the prediction accuracy. This paves the way for successfully deploying complicated embedding-based neural networks in production for ad serving.

preprint2021arXiv

Lévy walk dynamics in non-static media

Almost all the media the particles move in are non-static. Depending on the expected resolution of the studied dynamics and the amplitude of the displacement of the media, sometimes the non-static behaviours of the media can not be ignored. In this paper, we build the model describing Lévy walks in non-static media, where the physical and comoving coordinates are connected by scale factor. We derive the equation governing the probability density function of the position of the particles in comoving coordinate. Using the Hermite orthogonal polynomial expansions, some statistical properties are obtained, such as mean squared displacements (MSDs) in both coordinates and kurtosis. For some representative non-static media and Lévy walks, the asymptotic behaviors of MSDs in both coordinates are analyzed in detail. The stationary distributions and mean first passage time for some cases are also discussed through numerical simulations.

preprint2020arXiv

Bid Shading by Win-Rate Estimation and Surplus Maximization

This paper describes a new win-rate based bid shading algorithm (WR) that does not rely on the minimum-bid-to-win feedback from a Sell-Side Platform (SSP). The method uses a modified logistic regression to predict the profit from each possible shaded bid price. The function form allows fast maximization at run-time, a key requirement for Real-Time Bidding (RTB) systems. We report production results from this method along with several other algorithms. We found that bid shading, in general, can deliver significant value to advertisers, reducing price per impression to about 55% of the unshaded cost. Further, the particular approach described in this paper captures 7% more profit for advertisers, than do benchmark methods of just bidding the most probable winning price. We also report 4.3% higher surplus than an industry Sell-Side Platform shading service. Furthermore, we observed 3% - 7% lower eCPM, eCPC and eCPA when the algorithm was integrated with budget controllers. We attribute the gains above as being mainly due to the explicit maximization of the surplus function, and note that other algorithms can take advantage of this same approach.

preprint2020arXiv

Bid Shading in The Brave New World of First-Price Auctions

Online auctions play a central role in online advertising, and are one of the main reasons for the industry's scalability and growth. With great changes in how auctions are being organized, such as changing the second- to first-price auction type, advertisers and demand platforms are compelled to adapt to a new volatile environment. Bid shading is a known technique for preventing overpaying in auction systems that can help maintain the strategy equilibrium in first-price auctions, tackling one of its greatest drawbacks. In this study, we propose a machine learning approach of modeling optimal bid shading for non-censored online first-price ad auctions. We clearly motivate the approach and extensively evaluate it in both offline and online settings on a major demand side platform. The results demonstrate the superiority and robustness of the new approach as compared to the existing approaches across a range of performance metrics.

preprint2020arXiv

Lévy walk dynamics in an external harmonic potential

Lévy walks (LWs) are spatiotemporally coupled random-walk processes describing superdiffusive heat conduction in solids, propagation of light in disordered optical materials, motion of molecular motors in living cells, or motion of animals, humans, robots, and viruses. We here investigate a key feature of LWs, their response to an external harmonic potential. In this generic setting for confined motion we demonstrate that LWs equilibrate exponentially and may assume a bimodal stationary distribution. We also show that the stationary distribution has a horizontal slope next to a reflecting boundary placed at the origin, in contrast to correlated superdiffusive processes. Our results generalize LWs to confining forces and settle some long-standing puzzles around LWs.

preprint2020arXiv

Relativistic calculations of $R(D^{(*)})$, $R(D^{(*)}_s)$, $R(η_c)$ and $R(J/ψ)$

Recently, the deviation of the ratios $R(D)$, $R(D^{*})$ and $R(J/ψ)$ have been found between experimental data and the Standard Model predictions, which may be the hint of New Physics. In this work, we calculate these ratios within the Standard Model by using the improved instantaneous Bethe-Salpeter method. The emphasis is pad to the relativistic correction of the form factors. The results are $R(D)=0.312 ^{+0.006}_{-0.007}$, $R(D^*)= 0.249^{+0.001}_{-0.002}$, $R(D_s)=0.320 ^{+0.009}_{-0.009}$, $R(D^*_s)=0.251 ^{+0.002}_{-0.003}$, $R(η_c)=0.384 ^{+0.032}_{-0.042}$, and $R(J/ψ)=0.267 ^{+0.009}_{-0.011}$, which are consistent with predictions of other models and the experimental data. The semileptonic decay rates and corresponding form factors at zero recoil are also given.

preprint2019arXiv

Continuous time random walks and Lévy walks with stochastic resetting

Intermittent stochastic processes appear in a wide field, such as chemistry, biology, ecology, and computer science. This paper builds up the theory of intermittent continuous time random walk (CTRW) and Lévy walk, in which the particles are stochastically reset to a given position with a resetting rate $r$. The mean squared displacements of the CTRW and Lévy walks with stochastic resetting are calculated, uncovering that the stochastic resetting always makes the CTRW process localized and Lévy walk diffuse slower. The asymptotic behaviors of the probability density function of Lévy walk with stochastic resetting are carefully analyzed under different scales of $x$, and a striking influence of stochastic resetting is observed.

preprint2019arXiv

Identifying Solar Flare Precursors Using Time Series of SDO/HMI Images and SHARP Parameters

We present several methods towards construction of precursors, which show great promise towards early predictions, of solar flare events in this paper. A data pre-processing pipeline is built to extract useful data from multiple sources, Geostationary Operational Environmental Satellites (GOES) and Solar Dynamics Observatory (SDO)/Helioseismic and Magnetic Imager (HMI), to prepare inputs for machine learning algorithms. Two classification models are presented: classification of flares from quiet times for active regions and classification of strong versus weak flare events. We adopt deep learning algorithms to capture both the spatial and temporal information from HMI magnetogram data. Effective feature extraction and feature selection with raw magnetogram data using deep learning and statistical algorithms enable us to train classification models to achieve almost as good performance as using active region parameters provided in HMI/Space-Weather HMI-Active Region Patch (SHARP) data files. Case studies show a significant increase in the prediction score around 20 hours before strong solar flare events.