Source author record

Feng Guo

Feng Guo 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

23works
19topics
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

23 published item(s)

preprint2026arXiv

Seed Hijacking of LLM Sampling and Quantum Random Number Defense

Large language models (LLMs) rely on deterministic pseudorandom number generators (PRNGs) for autoregressive sampling, creating a critical supply-chain attack surface overlooked by existing defenses. We present SeedHijack, a backdoor attack that manipulates PRNG outputs to force attacker-specified token selection without altering model logits. In a 540-trial benchmark on GPT-2 (124M), the attack achieves 99.6% exact token injection across 9 sampling configurations; it reaches 100% success on four aligned models (1.5B-7B, RLHF/SFT/reasoning distillation) and bypasses all alignment methods tested in this work. We further propose a defense based on a hardware quantum random number generator (QRNG), which neutralizes the attack in our evaluated threat model with negligible median overhead (+0.6% latency, +7.7 MB memory). Our work identifies a critical sampling-layer vulnerability and provides a practical, deployable QRNG-based defense.

preprint2022arXiv

A new scheme for approximating the weakly efficient solution set of vector rational optimization problems

In this paper, we provide a new scheme for approximating the weakly efficient solution set for a class of vector optimization problems with rational objectives over a feasible set defined by finitely many polynomial inequalities. More precisely, we present a procedure to obtain a sequence of explicit approximations of the weakly efficient solution set of the problem in question. Each approximation is the intersection of the sublevel set of a single polynomial and the feasible set. To this end, we make use of the achievement function associated with the considered problem and construct polynomial approximations of it over the feasible set from above. Remarkably, the construction can be converted to semidefinite programming problems. Several nontrivial examples are designed to illustrate the proposed new scheme.

preprint2022arXiv

Extensions of S-Lemma for Noncommutative Polynomials

We consider the problem of extending the classical S-lemma from commutative case to noncommutative cases. We show that a symmetric quadratic homogeneous matrix-valued polynomial is positive semidefinite if and only if its coefficient matrix is positive semidefinite. Then we extend the S-lemma to three kinds of noncommutative polynomials: noncommutative polynomials whose coefficients are real numbers, matrix-valued noncommutative polynomials and hereditary polynomials.

preprint2022arXiv

Limits of real bivariate rational functions

Given two nonzero polynomials $f, g \in\mathbb R[x,y]$ and a point $(a, b) \in \mathbb{R}^2,$ we give some necessary and sufficient conditions for the existence of the limit $\displaystyle \lim_{(x, y) \to (a, b)} \frac{f(x, y)}{g(x, y)}.$ We also show that, if the denominator $g$ has an isolated zero at the given point $(a, b),$ then the set of possible limits of $\displaystyle \lim_{(x, y) \to (a, b)} \frac{f(x, y)}{g(x, y)}$ is a closed interval in $\overline{\mathbb{R}}$ and can be explicitly determined. As an application, we propose an effective algorithm to verify the existence of the limit and compute the limit (if it exists). Our approach is geometric and is based on Puiseux expansions.

preprint2022arXiv

Mechanics of Morphogenesis in Neural Development: in vivo, in vitro, and in silico

Morphogenesis in the central nervous system has received intensive attention as elucidating fundamental mechanisms of morphogenesis will shed light on the physiology and pathophysiology of the developing central nervous system. Morphogenesis of the central nervous system is of a vast topic that includes important morphogenetic events such as neurulation and cortical folding. Here we review three types of methods used to improve our understanding of morphogenesis of the central nervous system: in vivo experiments, organoids (in vitro), and computational models (in silico). The in vivo experiments are used to explore cellular- and tissue-level mechanics and interpret them on the roles of neurulation morphogenesis. Recent advances in human brain organoids have provided new opportunities to study morphogenesis and neurogenesis to compensate for the limitations of in vivo experiments, as organoid models are able to recapitulate some critical neural morphogenetic processes during early human brain development. Due to the complexity and costs of in vivo and in vitro studies, a variety of computational models have been developed and used to explain the formation and morphogenesis of brain structures. We review and discuss the Pros and Cons of these methods and their usage in the studies on morphogenesis of the central nervous system. Notably, none of these methods alone is sufficient to unveil the biophysical mechanisms of morphogenesis, thus calling for the interdisciplinary approaches using a combination of these methods in order to test hypotheses and generate new insights on both normal and abnormal development of the central nervous system.

preprint2022arXiv

PL-VINS: Real-Time Monocular Visual-Inertial SLAM with Point and Line Features

Leveraging line features to improve localization accuracy of point-based visual-inertial SLAM (VINS) is gaining interest as they provide additional constraints on scene structure. However, real-time performance when incorporating line features in VINS has not been addressed. This paper presents PL-VINS, a real-time optimization-based monocular VINS method with point and line features, developed based on the state-of-the-art point-based VINS-Mono \cite{vins}. We observe that current works use the LSD \cite{lsd} algorithm to extract line features; however, LSD is designed for scene shape representation instead of the pose estimation problem, which becomes the bottleneck for the real-time performance due to its high computational cost. In this paper, a modified LSD algorithm is presented by studying a hidden parameter tuning and length rejection strategy. The modified LSD can run at least three times as fast as LSD. Further, by representing space lines with the Plücker coordinates, the residual error in line estimation is modeled in terms of the point-to-line distance, which is then minimized by iteratively updating the minimum four-parameter orthonormal representation of the Plücker coordinates. Experiments in a public benchmark dataset show that the localization error of our method is 12-16\% less than that of VINS-Mono at the same pose update frequency. %For the benefit of the community, The source code of our method is available at: https://github.com/cnqiangfu/PL-VINS.

preprint2022arXiv

Smartphone-based Hard-braking Event Detection at Scale for Road Safety Services

Road crashes are the sixth leading cause of lost disability-adjusted life-years (DALYs) worldwide. One major challenge in traffic safety research is the sparsity of crashes, which makes it difficult to achieve a fine-grain understanding of crash causations and predict future crash risk in a timely manner. Hard-braking events have been widely used as a safety surrogate due to their relatively high prevalence and ease of detection with embedded vehicle sensors. As an alternative to using sensors fixed in vehicles, this paper presents a scalable approach for detecting hard-braking events using the kinematics data collected from smartphone sensors. We train a Transformer-based machine learning model for hard-braking event detection using concurrent sensor readings from smartphones and vehicle sensors from drivers who connect their phone to the vehicle while navigating in Google Maps. The detection model shows superior performance with a $0.83$ Area under the Precision-Recall Curve (PR-AUC), which is $3.8\times$better than a GPS speed-based heuristic model, and $166.6\times$better than an accelerometer-based heuristic model. The detected hard-braking events are strongly correlated with crashes from publicly available datasets, supporting their use as a safety surrogate. In addition, we conduct model fairness and selection bias evaluation to ensure that the safety benefits are equally shared. The developed methodology can benefit many safety applications such as identifying safety hot spots at road network level, evaluating the safety of new user interfaces, as well as using routing to improve traffic safety.

preprint2021arXiv

Global Łojasiewicz inequalities on comparing the rate of growth of polynomial functions

We present a global version of the Łojasiewicz inequality on comparing the rate of growth of two polynomial functions in the case the mapping defined by these functions is (Newton) non-degenerate at infinity. In addition, we show that the condition of non-degeneracy at infinity is generic in the sense that it holds in an open and dense semi-algebraic set of the entire space of input data.

preprint2020arXiv

AutoQ: Automated Kernel-Wise Neural Network Quantization

Network quantization is one of the most hardware friendly techniques to enable the deployment of convolutional neural networks (CNNs) on low-power mobile devices. Recent network quantization techniques quantize each weight kernel in a convolutional layer independently for higher inference accuracy, since the weight kernels in a layer exhibit different variances and hence have different amounts of redundancy. The quantization bitwidth or bit number (QBN) directly decides the inference accuracy, latency, energy and hardware overhead. To effectively reduce the redundancy and accelerate CNN inferences, various weight kernels should be quantized with different QBNs. However, prior works use only one QBN to quantize each convolutional layer or the entire CNN, because the design space of searching a QBN for each weight kernel is too large. The hand-crafted heuristic of the kernel-wise QBN search is so sophisticated that domain experts can obtain only sub-optimal results. It is difficult for even deep reinforcement learning (DRL) Deep Deterministic Policy Gradient (DDPG)-based agents to find a kernel-wise QBN configuration that can achieve reasonable inference accuracy. In this paper, we propose a hierarchical-DRL-based kernel-wise network quantization technique, AutoQ, to automatically search a QBN for each weight kernel, and choose another QBN for each activation layer. Compared to the models quantized by the state-of-the-art DRL-based schemes, on average, the same models quantized by AutoQ reduce the inference latency by 54.06\%, and decrease the inference energy consumption by 50.69\%, while achieving the same inference accuracy.

preprint2020arXiv

MindReading: An Ultra-Low-Power Photonic Accelerator for EEG-based Human Intention Recognition

A scalp-recording electroencephalography (EEG)-based brain-computer interface (BCI) system can greatly improve the quality of life for people who suffer from motor disabilities. Deep neural networks consisting of multiple convolutional, LSTM and fully-connected layers are created to decode EEG signals to maximize the human intention recognition accuracy. However, prior FPGA, ASIC, ReRAM and photonic accelerators cannot maintain sufficient battery lifetime when processing real-time intention recognition. In this paper, we propose an ultra-low-power photonic accelerator, MindReading, for human intention recognition by only low bit-width addition and shift operations. Compared to prior neural network accelerators, to maintain the real-time processing throughput, MindReading reduces the power consumption by 62.7\% and improves the throughput per Watt by 168\%.

preprint2020arXiv

Multitasking additional-to-driving: Prevalence, structure, and associated risk in SHRP2 naturalistic driving data

This paper 1) analyzes the extent to which drivers engage in multitasking additional-to-driving (MAD) under various conditions, 2) specifies odds ratios (ORs) of crashing associated with MAD compared to no task engagement, and 3) explores the structure of MAD, based on data from the Second Strategic Highway Research Program Naturalistic Driving Study (SHRP2 NDS). Sensitivity analysis in which secondary tasks were re-defined by grouping similar tasks was performed to investigate the extent to which ORs are affected by the specific task definitions in SHRP2. A novel visual representation of multitasking was developed to show which secondary tasks co-occur frequently and which ones do not. MAD occurs in 11% of control driving segments, 22% of crashes and near-crashes (CNC), 26% of Level 1-3 crashes and 39% of rear-end striking crashes, and 9%, 16%, 17% and 28% respectively for the same event types if MAD is defined in terms of general task groups. The most common co-occurrences of secondary tasks vary substantially among event types; for example, 'Passenger in adjacent seat - interaction' and 'Other non-specific internal eye glance' tend to co-occur in CNC but tend not to co-occur in control driving segments. The odds ratios of MAD compared to driving without any secondary task and the corresponding 95% confidence intervals are 2.38 (2.17-2.61) for CNC, 3.72 (3.11-4.45) for Level 1-3 crashes and 8.48 (5.11-14.07) for rear-end striking crashes. The corresponding ORs using general task groups to define MAD are slightly lower at 2.00 (1.80-2.21) for CNC, 3.03 (2.48-3.69) for Level 1-3 crashes and 6.94 (4.04-11.94) for rear-end striking crashes. The results confirm that independently of whether secondary tasks are defined according to SHRP2 or general task groups, the reduction of driving performance from MAD observed in simulator studies is manifested in real-world crashes as well.

preprint2020arXiv

On continuous selections of polynomial functions

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that there are only finitely many continuous selections of it and each one is semi-algebraic. Then, we establish some generic properties regarding the critical points, defined by the Clarke subdifferential, of these continuous selections. In particular, given a set of finitely many polynomials with generic coefficients, we show that the critical points of all continuous selections of it are finite and the critical values are all different, and we also derive the coercivity of those continuous selections which are bounded from below. We point out that some existing results about Łojasiewicz's inequality and error bounds for the maximum function of some finitely many polynomials are also valid for all the continuous selections of them.

preprint2020arXiv

On types of KKT points in polynomial optimization

Let $f$ be a real polynomial function with $n$ variables and $S$ be a basic closed semialgebraic set in $\Bbb{R}^n$. In this paper, we are interested in the problem of identifying the type (local minimizer, maximizer or not extremum point) of a given isolated KKT point $x^*$ of $f$ over $S.$ To this end, we investigate some properties of the tangency variety of $f$ on $S$ at $x^*,$ by which we introduce the definition of faithful radius of $f$ over $S$ at $x^*.$ Then, we show that the type of $x^*$ can be determined by the global extrema of $f$ over the intersection of $S$ and the Euclidean ball centered at $x^*$ with a faithful radius. Finally, we propose an algorithm involving algebraic computations to compute a faithful radius of $x^*$ and determine its type.

preprint2020arXiv

Salience and Market-aware Skill Extraction for Job Targeting

At LinkedIn, we want to create economic opportunity for everyone in the global workforce. To make this happen, LinkedIn offers a reactive Job Search system, and a proactive Jobs You May Be Interested In (JYMBII) system to match the best candidates with their dream jobs. One of the most challenging tasks for developing these systems is to properly extract important skill entities from job postings and then target members with matched attributes. In this work, we show that the commonly used text-based \emph{salience and market-agnostic} skill extraction approach is sub-optimal because it only considers skill mention and ignores the salient level of a skill and its market dynamics, i.e., the market supply and demand influence on the importance of skills. To address the above drawbacks, we present \model, our deployed \emph{salience and market-aware} skill extraction system. The proposed \model ~shows promising results in improving the online performance of job recommendation (JYMBII) ($+1.92\%$ job apply) and skill suggestions for job posters ($-37\%$ suggestion rejection rate). Lastly, we present case studies to show interesting insights that contrast traditional skill recognition method and the proposed \model~from occupation, industry, country, and individual skill levels. Based on the above promising results, we deployed the \model ~online to extract job targeting skills for all $20$M job postings served at LinkedIn.

preprint2020arXiv

The Devil is in the Details: Delving into Unbiased Data Processing for Human Pose Estimation

Being a fundamental component in training and inference, data processing has not been systematically considered in human pose estimation community, to the best of our knowledge. In this paper, we focus on this problem and find that the devil of human pose estimation evolution is in the biased data processing. Specifically, by investigating the standard data processing in state-of-the-art approaches mainly including coordinate system transformation and keypoint format transformation (i.e., encoding and decoding), we find that the results obtained by common flipping strategy are unaligned with the original ones in inference. Moreover, there is a statistical error in some keypoint format transformation methods. Two problems couple together, significantly degrade the pose estimation performance and thus lay a trap for the research community. This trap has given bone to many suboptimal remedies, which are always unreported, confusing but influential. By causing failure in reproduction and unfair in comparison, the unreported remedies seriously impedes the technological development. To tackle this dilemma from the source, we propose Unbiased Data Processing (UDP) consist of two technique aspect for the two aforementioned problems respectively (i.e., unbiased coordinate system transformation and unbiased keypoint format transformation). As a model-agnostic approach and a superior solution, UDP successfully pushes the performance boundary of human pose estimation and offers a higher and more reliable baseline for research community. Code is public available in https://github.com/HuangJunJie2017/UDP-Pose

preprint2015arXiv

Ferromagnetic resonance phase imaging in spin Hall multilayers

We experimentally image the magnetic precession phase of patterned spin Hall multilayer samples to study the rf driving field vector using time-resolved anomalous Nernst effect (TRANE) microscopy. Our ferromagnetic resonance (FMR) measurements quantify the phase and amplitude for both the magnetic precession and the electric current, which allows us to establish the total driving field orientation and the strength of spin Hall effect. In a channel of uniform width, we observe spatial variation of the FMR phase laterally across the channel. We interpret our findings in the context of electrical measurement using the spin-transfer torque ferromagnetic resonance technique and show that observed phase variation introduces a systematic correction into the spin Hall angle if spatial phase and amplitude variations are not taken into account.

preprint2015arXiv

Martingale Representation and Logarithmic-Sobolev Inequality for Fractional Ornstein-Uhlenbeck Measure

In this paper, we consider the measure determined by a fractional Ornstein-Uhlenbeck process. For such measure, we establish a martingale representation theorem and consequently obtain the Logarithmic-Sobolev inequality. To this end, we also present the integration by parts formula for such measure, which is obtained via its pull back formula and the Bismut method.

preprint2015arXiv

Phase-sensitive imaging of ferromagnetic resonance using ultrafast heat pulses

Measuring local magnetization dynamics and its spatial variation is essential for advancements in spintronics and relevant applications. Here we demonstrate a phase-sensitive imaging technique for studying patterned magnetic structures based on picosecond laser heating. With the time-resolved anomalous Nernst effect (TRANE) and extensions, we simultaneously image the dynamic magnetization and RF driving current density. The stroboscopic detection implemented in TRANE microscopy provides access to both amplitude and phase information of ferromagnetic resonance (FMR) and RF current. Using this approach, we measure the spatial variation of the Oersted driving field angle across a uniform channel. In a spatially nonuniform sample with a cross shape, a strong spatial variation for the RF current as well as FMR precession is observed. We find that both the amplitude and the phase of local FMR precession are closely related to those of the RF current.

preprint2014arXiv

Semidefinite representations of non-compact convex sets

We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic set and show that under these conditions our modified hierarchies of nested theta bodies and Lasserre's relaxations converge to the closure of the convex hull of $S$. Moreover, if the PP-BDR property is satisfied, our theta body and Lasserre's relaxation are exact when the order is large enough; if the PP-BDR property does not hold, our hierarchies convergent uniformly to the closure of the convex hull of $S$ restricted to every fixed ball centered at the origin. We illustrate through a set of examples that the conditions of pointedness and closedness are essential to ensure the convergence. Finally, we provide some strategies to deal with cases where the conditions of pointedness and closedness are violated.

preprint2013arXiv

Semidefinite relaxations for semi-infinite polynomial programming

This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation method. We first introduce two SDP relaxation methods for solving polynomial optimization problems with finitely many constraints. Then we propose an exchange algorithm with SDP relaxations to solve SIPP problems with compact index set. At last, we extend the proposed method to SIPP problems with noncompact index set via homogenization. Numerical results show that the algorithm is efficient in practice.

preprint2012arXiv

Certificates of Impossibility of Hilbert-Artin Representations of a Given Degree for Definite Polynomials and Functions

We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials with real coefficients must contain polynomials in the denominator of degree no less than a given input lower bound. By Artin's solution to Hilbert's 17th problems, such representations always exist for some denominator degree. Our certificates of infeasibility are based on the generalization of Farkas's Lemma to semidefinite programming. The literature has many famous examples of impossibility of SOS representability including Motzkin's, Robinson's, Choi's and Lam's polynomials, and Reznick's lower degree bounds on uniform denominators, e.g., powers of the sum-of-squares of each variable. Our work on exact certificates for positive semidefiniteness allows for non-uniform denominators, which can have lower degree and are often easier to convert to exact identities. Here we demonstrate our algorithm by computing certificates of impossibilities for an arbitrary sum-of-squares denominator of degree 2 and 4 for some symmetric sextics in 4 and 5 variables, respectively. We can also certify impossibility of base polynomials in the denominator of restricted term structure, for instance as in Landau's reduction by one less variable.

preprint2012arXiv

Minimizing Rational Functions by Exact Jacobian SDP Relaxation Applicable to Finite Singularities

This paper considers the optimization problem of minimizing a rational function. We reformulate this problem as polynomial optimization by the technique of homogenization. These two problems are shown to be equivalent under some generic conditions. The exact Jacobian SDP relaxation method proposed by Nie is used to solve the resulting polynomial optimization. We also prove that the assumption of nonsingularity in Nie's method can be weakened as the finiteness of singularities. Some numerical examples are given to illustrate the efficiency of our method.

preprint2011arXiv

SDPTools: High Precision SDP Solver in Maple

Semidefinite programs are an important class of convex optimization problems. It can be solved efficiently by SDP solvers in Matlab, such as SeDuMi, SDPT3, DSDP. However, since we are running fixed precision SDP solvers in Matlab, for some applications, due to the numerical error, we can not get good results. SDPTools is a Maple package to solve SDP in high precision. We apply SDPTools to the certification of the global optimum of rational functions. For the Rumps Model Problem, we obtain the best numerical results so far.