SearcharxivSearch

arXiv subjects

Bingqi Liu

Publications and source records attributed to Bingqi Liu.

7 recordsLinked to original sources

Bayesian Smoothed Quantile Regression

The standard asymmetric Laplace framework for Bayesian quantile regression (BQR) suffers from a fundamental decision-theoretic misalignment, yielding biased finite-sample estimates, and precludes gradient-based computation due to non-smoothness. We propose Bayesian smoothed quantile regression (BSQR), a principled framework built on a kernel-smoothed, fully differentiable likelihood. Methodologically, the symmetrizing property of our objective reduces inferential bias and aligns the posterior mean with the true conditional quantile. Theoretically, we establish posterior consistency and a Bernstein--von Mises theorem under misspecification, delivering asymptotic normality and valid frequentist coverage via a generalized Wilks phenomenon, while guaranteeing global posterior existence unlike empirical likelihood approaches. Computationally, BSQR enables Hamiltonian Monte Carlo for BQR, alleviating high-dimensional mixing bottlenecks. In simulations, BSQR reduces out-of-sample prediction error by up to 50% and improves sampling efficiency by up to 80% relative to asymmetric Laplace benchmarks, with uniform and triangular kernels performing particularly well. In a financial application to asymmetric systemic risk, BSQR uncovers distinct regime shifts around the COVID-19 period and yields sharper yet well-calibrated predictive quantiles, underscoring its practical relevance.

stat.ME

Pulse Shape Discrimination Algorithms: Survey and Benchmark

This review presents a comprehensive survey and benchmark of pulse shape discrimination (PSD) algorithms for radiation detection, classifying nearly sixty methods into statistical (time-domain, frequency-domain, neural network-based) and prior-knowledge (machine learning, deep learning) paradigms. We implement and evaluate all algorithms on two standardized datasets: an unlabeled set from a 241Am-9Be source and a time-of-flight labeled set from a 238Pu-9Be source, using metrics including Figure of Merit (FOM), F1-score, ROC-AUC, and inter-method correlations. Our analysis reveals that deep learning models, particularly Multi-Layer Perceptrons (MLPs) and hybrid approaches combining statistical features with neural regression, often outperform traditional methods. We discuss architectural suitabilities, the limitations of FOM, alternative evaluation metrics, and performance across energy thresholds. Accompanying this work, we release an open-source toolbox in Python and MATLAB, along with the datasets, to promote reproducibility and advance PSD research.

cs.LG

Random-coupled Neural Network

Improving the efficiency of current neural networks and modeling them in biological neural systems have become popular research directions in recent years. Pulse-coupled neural network (PCNN) is a well applicated model for imitating the computation characteristics of the human brain in computer vision and neural network fields. However, differences between the PCNN and biological neural systems remain: limited neural connection, high computational cost, and lack of stochastic property. In this study, random-coupled neural network (RCNN) is proposed. It overcomes these difficulties in PCNN's neuromorphic computing via a random inactivation process. This process randomly closes some neural connections in the RCNN model, realized by the random inactivation weight matrix of link input. This releases the computational burden of PCNN, making it affordable to achieve vast neural connections. Furthermore, the image and video processing mechanisms of RCNN are researched. It encodes constant stimuli as periodic spike trains and periodic stimuli as chaotic spike trains, the same as biological neural information encoding characteristics. Finally, the RCNN is applicated to image segmentation, fusion, and pulse shape discrimination subtasks. It is demonstrated to be robust, efficient, and highly anti-noised, with outstanding performance in all applications mentioned above.

cs.CV

A Log-domain Interior Point Method for Convex Quadratic Games

In this paper, we propose an equilibrium-seeking algorithm for finding generalized Nash equilibria of non-cooperative monotone convex quadratic games. Specifically, we recast the Nash equilibrium-seeking problem as variational inequality problem that we solve using a log-domain interior point method and provide a general purpose solver based on this algorithm. This approach is suitable for non-potential, general sum games and does not require extensive structural assumptions. We demonstrate the efficiency and versatility of our method using three benchmark games and demonstrate our algorithm is especially effective on small to medium scale problems.

math.OC

H2O+: An Improved Framework for Hybrid Offline-and-Online RL with Dynamics Gaps

Solving real-world complex tasks using reinforcement learning (RL) without high-fidelity simulation environments or large amounts of offline data can be quite challenging. Online RL agents trained in imperfect simulation environments can suffer from severe sim-to-real issues. Offline RL approaches although bypass the need for simulators, often pose demanding requirements on the size and quality of the offline datasets. The recently emerged hybrid offline-and-online RL provides an attractive framework that enables joint use of limited offline data and imperfect simulator for transferable policy learning. In this paper, we develop a new algorithm, called H2O+, which offers great flexibility to bridge various choices of offline and online learning methods, while also accounting for dynamics gaps between the real and simulation environment. Through extensive simulation and real-world robotics experiments, we demonstrate superior performance and flexibility over advanced cross-domain online and offline RL algorithms.

cs.LG

Robust low-rank tensor regression via clipping and Huber loss

In this paper, we construct a parameter estimation framework for robust low-rank tensor regression based on a truncation method and Huber loss, specifically focusing on models with random noise having only finite second-order moments. Through a robust gradient descent method, our proposed Huber-type estimator is theoretically optimal in two aspects: (1) its statistical error rate matches the optimal upper bound established for the traditional least squares method under sub-Gaussian error; and (2) the sample complexity for recovering the tensor parameter is also optimal. Extensive numerical experiments demonstrate the robustness of our estimator, indicating that the utilization of truncation and Huber loss significantly enhances stability and statistical effectiveness, outperforming the traditional least squares method. Additionally, the phenomenon of phase transition in the convergence rate of the proposed estimator is confirmed through simulation. Furthermore, applications to image recovery and the Beijing air-quality dataset demonstrate the practical effectiveness of our method.

math.ST

Toward a fractal spectrum approach for neutron and gamma pulse shape discrimination

There is a key research issue to accurately select out neutron signals and discriminate gamma signals from a mixed radiation field in the neutron detection. This paper proposes a fractal spectrum discrimination approach by means of different spectrum characteristics of neutron and gamma. Figure of merit and average discriminant error ratio are adopted together to evaluate the discriminant effects. Different neutron and gamma signals with various noises and pulse pile-ups are simulated according to real data in the literature. The proposed approach is compared with the digital charge integration and pulse gradient methods. It is found that the fractal approach exhibits the best discriminant performance among three methods. The fractal spectrum approach is not sensitive to the high frequency noises and pulse pile-ups. It means that the proposed approach takes the advantages of anti-noises and high discriminant ability, and can be used to better discriminate neutron and gamma in neutron detection.

physics.ins-det