Searcharxiv⌕ Search

arXiv subjects

Bingjie Li

Publications and source records attributed to Bingjie Li.

14 recordsLinked to original sources

Almost-Global Coordinates on Matrix Manifolds

We study global coordinates on smooth manifolds outside some closed subsets of measure zero. We first give an elementary proof that every compact smooth manifold admits such coordinates, allowing the Euclidean parameter domain to be disconnected. We then study parametrizations of classical matrix groups, Stiefel manifolds, Grassmannians and real flag manifolds. For these parametrizations, we describe the inverse maps and compute the codimensions of the omitted subsets. We construct these parametrizations using Cayley transforms, graphs of linear maps and block Gaussian elimination. We also give formulas for Riemannian gradients and Haar integrals in these coordinates.

math.DG↗

Beyond Curvature Bias: Higher-Order Manifold Fitting via Multiscale Cancellation

Local manifold-fitting procedures smooth noisy observations over neighborhoods of scale $h$, inducing a systematic normal bias of order $h^2+σ^2$ that persists at the population level. We develop geometric bias cancellation (GBC), a multiscale framework for higher-order manifold recovery under ambient Gaussian noise. For procedures admitting a normal-bias expansion $c(h,σ)b(x)+O(h^4)$, we construct cross-scale correspondence using estimated normal fibers and show that second-order normal accuracy suffices for fourth-order correspondence accuracy. Canceling the leading geometric bias yields $O(h^4)$ population Hausdorff accuracy while preserving an embedded manifold diffeomorphic to the underlying manifold. We establish the required expansions and finite-sample recovery guarantees for successive tangent-space projection and Gaussian density ridges. For STSP, geometric bias cancellation also achieves an asymptotically vanishing Hausdorff error ratio relative to oracle bandwidth-tuned single-scale fitting. For the local contraction estimator of \citet{yao2023manifold}, we identify an obstruction to scalar bias cancellation and develop a directional cancellation achieving $O(σ^4)$ population Hausdorff accuracy with uniform positive reach, as well as fourth-order finite-sample accuracy when $n\gtrsimσ^{-(d+6)}\log(1/σ)$. Simulations confirm the predicted improvement from second- to fourth-order population bias.

math.ST↗

Beyond Missing Data: Questionnaire Response Uncertainty as an Early Digital Sign of Dementia-Related Vulnerability

Explicit "Do not know" responses are treated as missing data, although their accumulation may encode uncertainty. We analysed 502,234 UK Biobank participants to test associations between response uncertainty and incident dementia-related diagnoses. Compared with participants giving 0--1 such responses, those giving more than seven had higher risks of the dementia-related disease composite (hazard ratio 1.62, 95% confidence interval 1.50--1.74), Alzheimer's disease (1.63, 1.48--1.79), and vascular dementia (1.63, 1.42--1.86) after multivariable adjustment. Associations were approximately linear, persisted after a two-year lag, and were directionally reproduced in Scotland and Wales. Polygenic risk scores minimally attenuated these associations. Domain, molecular, and chronic-disease analyses placed response uncertainty within a broader multisystem vulnerability phenotype. Here, we show that explicit response uncertainty provides a scalable behavioural marker of subsequent dementia-related risk.

stat.AP↗

Manifold Fitting by Successive Tangent-Space Projection

Manifold fitting seeks to recover the geometric structure underlying noisy ambient observations. We propose Successive Tangent Space Projection (STSP), an iterative manifold-fitting method that reduces normal noise while preserving tangential variation. The former improves fitting accuracy, whereas the latter helps retain geometric coverage. We characterise the \rev{nearby population fixed-point set} of STSP as a manifold-fitting object. Under uniform sampling from a compact smooth manifold with positive reach and isotropic Gaussian noise, this set lies within $O(σ^2)$ of the underlying manifold, and \rev{nearby population orbits} converge geometrically to it. At the finite-sample level, with high probability, fixed points in the local tube lie within $O(σ^2)$ of the underlying manifold up to sampling error, and empirical orbits \rev{initialised within that tube} and generated from a fixed reference sample enter and remain in the same neighbourhood. We further develop a multi-scale extension, MS-STSP, designed to reduce curvature bias while preserving the $O(σ^2)$ geometric localization order of STSP at both the population and finite-sample levels. Numerical experiments show that STSP compares favourably with competing methods in balancing fitting accuracy and geometric coverage, and that MS-STSP reduces curvature-induced shrinkage, particularly under high noise.

stat.ME↗

Localizing Emergent Failures in Agentic AI: Recovering Minimal Repair Families via Counterfactual Replay

Failures in agentic AI systems can arise from interactions among messages exchanged by multiple large language model (LLM) agents. Pointwise attribution cannot distinguish a jointly necessary repair from alternative singleton repairs. We formulate Minimal Repair Family Recovery (MRFR): recovering all inclusion-minimal event sets whose counterfactual replay restores task success within a declared size bound. We propose Graph-Constrained Joint Replay (GCJR), which slices failure-relevant events from an execution dependency graph, constructs graph-feasible singleton and pair candidates, and verifies them by replay with paired clean counterparts. For fixed replay outcomes, GCJR is exact within its declared graph domain. On 90 in-scope cases from a 120-DAG controlled benchmark, GCJR achieves 1.000 Family Exact Match while reducing mean replay calls from 56.3 to 25.3 (55.1%) relative to exhaustive search. On a 24-case, four-agent LLM pilot, it again achieves 1.000 Family Exact Match and reduces mean model calls from 21.0 to 10.0 (52.4%); single-event replay misses jointly necessary repairs.

cs.AI↗

ACQ: A Deployed Two-Stage Framework for Automated Creative Quota Allocation in Large-Scale Online Advertising

In digital advertising, demand-side platforms (DSPs) allow advertisers to create multiple ad creatives from a single photo for real-time bidding. While increasing the number of creatives can improve bidding opportunities, it cannot scale indefinitely, and the incremental advertising revenue typically exhibits diminishing returns as more creatives are generated. This raises a practical problem for DSPs: how to automatically determine an appropriate creative quota for each photo at scale. To address this problem, we propose Automated Creatives Quota (ACQ), a deployed two-stage framework for creative quota allocation in large-scale online advertising. In the first stage, ACQ predicts quota-conditioned expected revenue using a multi-task model built on an unbalanced binary tree, which is designed to handle the highly skewed revenue distribution across quota levels. In the second stage, ACQ formulates quota allocation under global capacity constraints as a multiple-choice knapsack problem (MCKP) and solves it with an efficient dual-based algorithm. Extensive offline experiments and online experiments on Kuaishou's advertising delivery platform demonstrate the effectiveness of ACQ, achieving a 6.20% increase in platform advertising revenue.

cs.AI↗

Multidimensional physical fitness is associated with reduced dementia risk through proteomic and neuroimaging pathways: a prospective cohort study of the UK Biobank

Dementia affects over 55 million people worldwide, yet whether distinct domains of physical fitness independently protect against neurodegeneration through shared or divergent biological mechanisms remains unknown. Using the UK Biobank (n = 51,517; 12-year follow-up), we integrated epidemiological, proteomic, and neuroimaging analyses to systematically characterize the multidimensional fitness-dementia relationship. Higher handgrip strength, cardiorespiratory fitness, and pulmonary function were each independently associated with reduced dementia risk (HRs 0.50, 0.62, and 0.73, respectively, for highest vs. lowest tertiles), with stronger associations in women and younger individuals. Plasma proteomic profiling revealed domain-specific molecular signatures--neurofilament light chain predominating for muscular and cardiorespiratory fitness, and inflammatory mediators including GDF15 for pulmonary function--with 22-40 proteins per domain independently predicting dementia, converging on neuroinflammatory and neurovascular pathways. Brain MRI analyses identified hippocampal volume as a significant structural mediator (proportion mediated: 3.7-10.1%), indicating structural preservation as one of multiple mechanistic pathways. Population attributable fraction analyses estimated that suboptimal fitness may account for approximately 26% of dementia cases. These findings reveal that multidimensional physical fitness shapes dementia risk through distinct yet converging neuroinflammatory, neurovascular, and structural brain mechanisms, with implications for life-course prevention.

stat.AP↗

Routine Blood Biomarkers Reveal a Preclinical Continuum of Multiple Myeloma Risk

Multiple myeloma (MM) is preceded by a long preclinical phase spanning decades, yet scalable, non-specialist tools to identify individuals at elevated risk before end-organ damage are lacking. In a prospective analysis of 299,035 cancer-free UK Biobank participants followed for a median of 12.4 years, during which 768 developed incident MM, we conducted a biomarker-wide association scan across 61 routinely measured blood analytes spanning hematological, protein metabolism, renal, and immune categories. Markers of protein dysregulation-elevated total protein, depressed albumin, and a low albumin-to-globulin (A/G) ratio-showed the strongest preclinical associations (hazard ratios 0.61-1.54 per SD), consistent with progressive monoclonal immunoglobulin accumulation and suppression of normal polyclonal synthesis years before diagnosis. These signals were accompanied by indicators of erythropoietic suppression, morphological red cell dysregulation, and a shift toward lower neutrophil and higher lymphocyte fractions, reflecting coordinated perturbations across hematopoietic and immune compartments. Longitudinal trajectory analyses showed that these multi-system deviations emerge more than a decade before diagnosis and intensify as clinical onset approaches. Dose-response modelling revealed pronounced nonlinear associations for protein and erythrocytic markers, with risk concentrated among individuals with extreme values. Incorporating significant biomarkers into a clinical risk model improved 10-year MM discrimination from a C-index of 0.684 to 0.744, with the high-risk decile accumulating 0.79% cumulative incidence versus 0.47% under the clinical model alone. These findings provide a practical framework for biomarker-guided MM risk stratification and targeted surveillance using routinely available clinical tests.

stat.AP↗

Enhanced High-Dimensional Data Visualization through Adaptive Multi-Scale Manifold Embedding

To address the dual challenges of the curse of dimensionality and the difficulty in separating intra-cluster and inter-cluster structures in high-dimensional manifold embedding, we proposes an Adaptive Multi-Scale Manifold Embedding (AMSME) algorithm. By introducing ordinal distance to replace traditional Euclidean distances, we theoretically demonstrate that ordinal distance overcomes the constraints of the curse of dimensionality in high-dimensional spaces, effectively distinguishing heterogeneous samples. We design an adaptive neighborhood adjustment method to construct similarity graphs that simultaneously balance intra-cluster compactness and inter-cluster separability. Furthermore, we develop a two-stage embedding framework: the first stage achieves preliminary cluster separation while preserving connectivity between structurally similar clusters via the similarity graph, and the second stage enhances inter-cluster separation through a label-driven distance reweighting. Experimental results demonstrate that AMSME significantly preserves intra-cluster topological structures and improves inter-cluster separation on real-world datasets. Additionally, leveraging its multi-resolution analysis capability, AMSME discovers novel neuronal subtypes in the mouse lumbar dorsal root ganglion scRNA-seq dataset, with marker gene analysis revealing their distinct biological roles.

cs.LG↗

Manifold Fitting

While classical data analysis has addressed observations that are real numbers or elements of a real vector space, at present many statistical problems of high interest in the sciences address the analysis of data that consist of more complex objects, taking values in spaces that are naturally not (Euclidean) vector spaces but which still feature some geometric structure. Manifold fitting is a long-standing problem, and has finally been addressed in recent years by Fefferman et al. (2020, 2021a). We develop a method with a theory guarantee that fits a $d$-dimensional underlying manifold from noisy observations sampled in the ambient space $\mathbb{R}^D$. The new approach uses geometric structures to obtain the manifold estimator in the form of image sets via a two-step mapping approach. We prove that, under certain mild assumptions and with a sample size $N=\mathcal{O}(σ^{(-d+3)})$, these estimators are true $d$-dimensional smooth manifolds whose estimation error, as measured by the Hausdorff distance, is bounded by $\mathcal{O}(σ^2\log(1/σ))$ with high probability. Compared with the existing approaches proposed in Fefferman et al. (2018, 2021b); Genovese et al. (2014); Yao and Xia (2019), our method exhibits superior efficiency while attaining very low error rates with a significantly reduced sample size, which scales polynomially in $σ^{-1}$ and exponentially in $d$. Extensive simulations are performed to validate our theoretical results. Our findings are relevant to various fields involving high-dimensional data in machine learning. Furthermore, our method opens up new avenues for existing non-Euclidean statistical methods in the sense that it has the potential to unify them to analyze data on manifolds in the ambience space domain.

math.ST↗

A Modified Nonlinear Conjugate Gradient Algorithm for Functions with Non-Lipschitz Gradient

In this paper, we propose a modified nonlinear conjugate gradient (NCG) method for functions with a non-Lipschitz continuous gradient. First, we present a new formula for the conjugate coefficient β_k in NCG, conducting a search direction that provides an adequate function decrease. We can derive that our NCG algorithm guarantees strongly convergent for continuous differential functions without Lipschitz continuous gradient. Second, we present a simple interpolation approach that could automatically achieve shrinkage, generating a step length satisfying the standard Wolfe conditions in each step. Our framework considerably broadens the applicability of NCG and preserves the superior numerical performance of the PRP-type methods.

math.NA↗

An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem

Vehicle routing problem (VRP) is a typical discrete combinatorial optimization problem, and many models and algorithms have been proposed to solve the VRP and its variants. Although existing approaches have contributed a lot to the development of this field, these approaches either are limited in problem size or need manual intervening in choosing parameters. To solve these difficulties, many studies have considered the learning-based optimization (LBO) algorithms to solve the VRP. This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches. We performed a statistical analysis of the reviewed articles from various aspects and designed three experiments to evaluate the performance of four representative LBO algorithms. Finally, we conclude the applicable types of problems for different LBO algorithms and suggest directions in which researchers can improve LBO algorithms.

cs.LG↗

Manifold Fitting in Ambient Space

Modern sample points in many applications no longer comprise real vectors in a real vector space but sample points of much more complex structures, which may be represented as points in a space with a certain underlying geometric structure, namely a manifold. Manifold learning is an emerging field for learning the underlying structure. The study of manifold learning can be split into two main branches: dimension reduction and manifold fitting. With the aim of combining statistics and geometry, we address the problem of manifold fitting in the ambient space. Inspired by the relation between the eigenvalues of the Laplace-Beltrami operator and the geometry of a manifold, we aim to find a small set of points that preserve the geometry of the underlying manifold. From this relationship, we extend the idea of subsampling to sample points in high-dimensional space and employ the Moving Least Squares (MLS) approach to approximate the underlying manifold. We analyze the two core steps in our proposed method theoretically and also provide the bounds for the MLS approach. Our simulation results and theoretical analysis demonstrate the superiority of our method in estimating the underlying manifold.

stat.ML↗

Exterior Point Method for Completely Positive Factorization

Completely positive factorization (CPF) is a critical task with applications in many fields. This paper proposes a novel method for the CPF. Based on the idea of exterior point iteration, an optimization model is given, which aims to orthogonally transform a symmetric lower rank factor to be nonnegative. The optimization problem can be solved via a modified nonlinear conjugate gradient method iteratively. The iteration points locate on the exterior of the orthonormal manifold and the closed set whose transformed matrices are nonnegative before convergence generally. Convergence analysis is given for the local or global optimum of the objective function, together with the iteration algorithm. Some potential issues that may affect the CPF are explored numerically. The exterior point method performs much better than other algorithms, not only in the efficiency of computational cost or accuracy, but also in the ability to address the CPF in some hard cases.

math.OC↗