arXiv subjects

Wenxin Liu

Publications and source records attributed to Wenxin Liu.

15 recordsLinked to original sources

arXiv2026

Construction and Design of MPAC Codes

This paper proposes modified polarization-adjusted convolutional (MPAC) codes and their hybrid decoding that achieves an improved performance-complexity tradeoff. For MPAC codes, only a subset of the information bits undergo the convolutional transform. The output is then combined with the remaining information bits for the inner polar transform. Correspondingly, the convolutionally transformed bits are recovered by Fano decoding, while the remaining information bits are recovered by the successive cancellation (SC) decoding, constituting the hybrid Fano-successive cancellation (HFSC) decoding. The MPAC codes are further designed by the coset-wise analysis that characterizes the number of minimum weight codewords (MWCs). It is discovered that a partially convolutional transform can improve the codeword through utilizing the row combinations of the frozen set efficiently. This property enables the MPAC codes to outperform their prototype polarization-adjusted convolutional (PAC) codes and cyclic redundancy check (CRC)-polar codes. Furthermore, MPAC codes can be optimized by reducing the number of MWCs. Our numerical results demonstrate that, with a similar decoding complexity budget, the MPAC codes offer competent decoding performance when compared with PAC codes using Fano decoding and CRC-polar codes using SC list (SCL) decoding.

cs.IT↗

arXiv2026

A PDE-constrained Optimization Approach to Optimal Trajectory Planning under Uncertainty via Reflected Schrödinger Bridges

A computational PDE-constrained optimization approach is proposed for optimal trajectory planning under uncertainty by means of an associated Schroedinger Bridge Problem (SBP). The proposed SBP formulation is interpreted as the mean-field limit associated with the energy-optimal evolution of a particle governed by a stochastic differential equation (SDE) with nonlinear drift and reflecting boundary conditions, constrained to prescribed initial and terminal densities. The resulting mean-field system consists of a nonlinear Fokker-Planck equation coupled with a Hamilton-Jacobi-Bellman equation, subject to two-point boundary conditions in time and Neumann boundary conditions in space. Through the Hopf-Cole transformation, this nonlinear system is recast as a pair of forward-backward advection-diffusion equations, which are amenable to efficient numerical solution via a standard finite element discretization. The weak formulation naturally enforces reflecting boundary conditions without requiring explicit particle-boundary collision detection, thus circumventing the computational difficulties inherent to particle-based methods in complex geometries. Numerical experiments on challenging 3D maze configurations demonstrate fast convergence, mass conservation, and validate the optimal controls computed through reflected SDE simulations.

math.OC↗

arXiv2025

Optimization and Control Technologies for Renewable-Dominated Hydrogen-Blended Integrated Gas-Electricity System: A Review

The growing coupling among electricity, gas, and hydrogen systems is driven by green hydrogen blending into existing natural gas pipelines, paving the way toward a renewable-dominated energy future. However, the integration poses significant challenges, particularly ensuring efficient and safe operation under varying hydrogen penetration and infrastructure adaptability. This paper reviews progress in optimization and control technologies for hydrogen-blended integrated gas-electricity system. First, key technologies and international demonstration projects are introduced to provide an overview of current developments. Besides, advances in gas-electricity system integration, including modeling, scheduling, planning and market design, are reviewed respectively. Then, the potential for cross-system fault propagation is highlighted, and practical methods for safety analysis and control are proposed. Finally, several possible research directions are introduced, aiming to ensure efficient renewable integration and reliable operation.

eess.SY↗

arXiv2024

Spin: An Efficient Secure Computation Framework with GPU Acceleration

Accuracy and efficiency remain challenges for multi-party computation (MPC) frameworks. Spin is a GPU-accelerated MPC framework that supports multiple computation parties and a dishonest majority adversarial setup. We propose optimized protocols for non-linear functions that are critical for machine learning, as well as several novel optimizations specific to attention that is the fundamental unit of Transformer models, allowing Spin to perform non-trivial CNNs training and Transformer inference without sacrificing security. At the backend level, Spin leverages GPU, CPU, and RDMA-enabled smart network cards for acceleration. Comprehensive evaluations demonstrate that Spin can be up to $2\times$ faster than the state-of-the-art for deep neural network training. For inference on a Transformer model with 18.9 million parameters, our attention-specific optimizations enable Spin to achieve better efficiency, less communication, and better accuracy.

cs.CR↗

arXiv2023

Importance of overnight parameters to predict Sea Breeze on Long Island

The sea breeze is a phenomenon frequently impacting Long Island, New York, especially during the spring and early summer, when land surface temperatures can exceed ocean temperatures considerably. The sea breeze influences daily weather conditions by causing a shift in wind direction and speed, limiting the maximum temperature, and occasionally serving as a trigger for precipitation and thunderstorms. Advance prediction of the presence or absence of the sea breeze for a certain location on a given day would therefore be beneficial to weather forecasters. To forecast sea breeze occurrence based on the previous night's weather conditions, we used a novel algorithm called the $D$-Basis. We analyzed sea breeze data from a recent four year period (2017-2020) at a single weather station several miles inland from the coast. High or constant station pressure, high or constant dew point, and onshore wind from the previous night were found to be strong predictors of sea breeze formation the following day. The accuracy of the prediction was around 74\% for June 2020. Unlike other prediction methods which involve the comparison of sea surface and land surface temperatures in near real time, our prediction method is based on the parameters from the prior night, allowing it to potentially aid in advanced forecasting of the sea breeze.

physics.ao-ph↗

arXiv2022

LLOL: Low-Latency Odometry for Spinning Lidars

In this paper, we present a low-latency odometry system designed for spinning lidars. Many existing lidar odometry methods wait for an entire sweep from the lidar before processing the data. This introduces a large delay between the first laser firing and its pose estimate. To reduce this latency, we treat the spinning lidar as a streaming sensor and process packets as they arrive. This effectively distributes expensive operations across time, resulting in a very fast and lightweight system with much higher throughput and lower latency. Our open-source implementation is available at \url{https://github.com/versatran01/llol}.

cs.RO↗

arXiv2022

Feature Importance-aware Transferable Adversarial Attacks

Transferability of adversarial examples is of central importance for attacking an unknown model, which facilitates adversarial attacks in more practical scenarios, e.g., black-box attacks. Existing transferable attacks tend to craft adversarial examples by indiscriminately distorting features to degrade prediction accuracy in a source model without aware of intrinsic features of objects in the images. We argue that such brute-force degradation would introduce model-specific local optimum into adversarial examples, thus limiting the transferability. By contrast, we propose the Feature Importance-aware Attack (FIA), which disrupts important object-aware features that dominate model decisions consistently. More specifically, we obtain feature importance by introducing the aggregate gradient, which averages the gradients with respect to feature maps of the source model, computed on a batch of random transforms of the original clean image. The gradients will be highly correlated to objects of interest, and such correlation presents invariance across different models. Besides, the random transforms will preserve intrinsic features of objects and suppress model-specific information. Finally, the feature importance guides to search for adversarial examples towards disrupting critical features, achieving stronger transferability. Extensive experimental evaluation demonstrates the effectiveness and superior performance of the proposed FIA, i.e., improving the success rate by 9.5% against normally trained models and 12.8% against defense models as compared to the state-of-the-art transferable attacks. Code is available at: https://github.com/hcguoO0/FIA

cs.CV↗

arXiv2021

Bayesian Deep Basis Fitting for Depth Completion with Uncertainty

In this work we investigate the problem of uncertainty estimation for image-guided depth completion. We extend Deep Basis Fitting (DBF) for depth completion within a Bayesian evidence framework to provide calibrated per-pixel variance. The DBF approach frames the depth completion problem in terms of a network that produces a set of low-dimensional depth bases and a differentiable least squares fitting module that computes the basis weights using the sparse depths. By adopting a Bayesian treatment, our Bayesian Deep Basis Fitting (BDBF) approach is able to 1) predict high-quality uncertainty estimates and 2) enable depth completion with few or no sparse measurements. We conduct controlled experiments to compare BDBF against commonly used techniques for uncertainty estimation under various scenarios. Results show that our method produces better uncertainty estimates with accurate depth prediction.

cs.CV↗

arXiv2020

TLIO: Tight Learned Inertial Odometry

In this work we propose a tightly-coupled Extended Kalman Filter framework for IMU-only state estimation. Strap-down IMU measurements provide relative state estimates based on IMU kinematic motion model. However the integration of measurements is sensitive to sensor bias and noise, causing significant drift within seconds. Recent research by Yan et al. (RoNIN) and Chen et al. (IONet) showed the capability of using trained neural networks to obtain accurate 2D displacement estimates from segments of IMU data and obtained good position estimates from concatenating them. This paper demonstrates a network that regresses 3D displacement estimates and its uncertainty, giving us the ability to tightly fuse the relative state measurement into a stochastic cloning EKF to solve for pose, velocity and sensor biases. We show that our network, trained with pedestrian data from a headset, can produce statistically consistent measurement and uncertainty to be used as the update step in the filter, and the tightly-coupled system outperforms velocity integration approaches in position estimates, and AHRS attitude filter in orientation estimates.

cs.RO↗

arXiv2019

Nuclear Environments Inspection with Micro Aerial Vehicles: Algorithms and Experiments

In this work, we address the estimation, planning, control and mapping problems to allow a small quadrotor to autonomously inspect the interior of hazardous damaged nuclear sites. These algorithms run onboard on a computationally limited CPU. We investigate the effect of varying illumination on the system performance. To the best of our knowledge, this is the first fully autonomous system of this size and scale applied to inspect the interior of a full scale mock-up of a Primary Containment Vessel (PCV). The proposed solution opens up new ways to inspect nuclear reactors and to support nuclear decommissioning, which is well known to be a dangerous, long and tedious process. Experimental results with varying illumination conditions show the ability to navigate a full scale mock-up PCV pedestal and create a map of the environment, while concurrently avoiding obstacles.

cs.RO↗

arXiv2019

Robustness Meets Deep Learning: An End-to-End Hybrid Pipeline for Unsupervised Learning of Egomotion

In this work, we propose a method that combines unsupervised deep learning predictions for optical flow and monocular disparity with a model based optimization procedure for instantaneous camera pose. Given the flow and disparity predictions from the network, we apply a RANSAC outlier rejection scheme to find an inlier set of flows and disparities, which we use to solve for the relative camera pose in a least squares fashion. We show that this pipeline is fully differentiable, allowing us to combine the pose with the network outputs as an additional unsupervised training loss to further refine the predicted flows and disparities. This method not only allows us to directly regress relative pose from the network outputs, but also automatically segments away pixels that do not fit the rigid scene assumptions that many unsupervised structure from motion methods apply, such as on independently moving objects. We evaluate our method on the KITTI dataset, and demonstrate state of the art results, even in the presence of challenging independently moving objects.

cs.CV↗

arXiv2017

A Distributed Dynamic Programming-based Solution for Load Management in Smart Grids

Load management is being recognized as an important option for active user participation in the energy market. Traditional load management methods usually require a centralized powerful control center and a two-way communication network between the system operators and energy end-users. The increasing user participation in smart grids may limit their applications. In this paper, a distributed solution for load management in emerging smart grids is proposed. The load management problem is formulated as a constrained optimization problem aiming at maximizing the overall utility of users while meeting the requirement for load reduction requested by the system operator, and is solved by using a distributed dynamic programming algorithm. The algorithm is implemented via a distributed framework and thus can deliver a highly desired distributed solution. It avoids the required use of a centralized coordinator or control center, and can achieve satisfactory outcomes for load management. Simulation results with various test systems demonstrate its effectiveness.

eess.SP↗

arXiv2009

Twisted exponential sums of polynomials in one variable

The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the $C$-function of the twisted T-adic exponential sum. This bound gives lower bounds for the Newton polygon of the $L$-function of twisted $p$-power order exponential sums.

math.NT↗

arXiv2009

Generic T-adic exponential sums in one variable

The $T$-adic exponential sum associated to a Laurent polynomial in one variable is studied. An explicit arithmetic polygon is proved to be the generic Newton polygon of the $C$-function of the T-adic exponential sum. It gives the generic Newton polygon of $L$-functions of $p$-power order exponential sums.

math.NT↗

arXiv2009

$T$-adic exponential sums of polynomials in one variable

The $T$-adic exponential sum of a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the $C$-function of the T-adic exponential sum. This bound gives lower bounds for the Newton polygon of the $L$-function of exponential sums of $p$-power order.

math.NT↗