Searcharxiv⌕ Search

arXiv subjects

Li

Publications and source records attributed to Li.

At least 19 recordsLinked to original sources

High Precision Fundamental Physics Experiments at JLab with Spin-transparent Storage Rings of Low-energy Polarized Electron Beams

A breakthrough in fundamental physics experiments measuring particle spin precession may happen if spin-transparent storage rings become adopted tools for such experiments. We present a new design of highly specialized table-sized storage rings, which use low-energy polarized electron beams and Mott polarimetry. Based on the spin transparency ansatz, the spin precession stemming from the magnetic dipole moment is canceled at any beam energy after an electron's turn along the periodic orbit in the ring. Meanwhile, a spin precession induced by the fundamental physics of interest, e.g., the electron's permanent electric dipole moment (EDM) and/or ultralight-dark-matter-mediated forces such as axions, will accumulate. However, capitalizing on such types of rings is not only desirable for measurements of EDMs and axion searches relevant to $CP$ violation and matter-antimatter asymmetry in the Universe, but may also find very promising applications in quantum computing.

nucl-ex↗

Scaling Taxonomy-Free Image Labeling with Generative AI: A Multimodal

Providing real-time multimodal insights into images is challenging because it requires low latency, high description accuracy, and scalable solutions that are both cost-effective and efficient. For example, given a new image of an outfit, we would like to generate insights that the image depicts "earth tones" and "linen pants" and allow users to explore similar ideas along these themes. Traditional strategies to generate such insights would typically involve building taxonomies producing a golden set labeled by humans, training models on these datasets, and deploying these models for online inference services. Such workflows are constrained by fixed taxonomy, high labeling cost, limited labeling coverage in sample space, and human errors and expertise gaps in labelers. In addition, these methods are expensive and cumbersome to iterate over time. Recent trends have started exploring generative AI models for online insights, but this method suffers from long latency and prohibitive costs to support a high volume of requests or large amounts of offline labeling needs. We present Generative Labeling On Clusters (GLOC) as a solution to provide highly scalable, cost-effective, low latency, and high accuracy online image insight services. GLOC leverages highly optimized image embeddings to form image clusters that are semantically close to each other for the purpose of the type of insights, and summarizes the insights at the cluster level, which effectively generalizes to members in the cluster. At Pinterest, GLOC powers image descriptors and pivot query suggestions for Hybrid Search, which is a multimodal search service enabling users to search with both an image and a text query. Our offline and online A/B tests demonstrate that GLOC significantly outperforms previous methods, delivering improvements in quality and efficiency.

cs.LG↗

Fourier-Laplace transforms in polynomial Ornstein-Uhlenbeck volatility models

We consider the Fourier-Laplace transforms of a broad class of polynomial Ornstein-Uhlenbeck (OU) volatility models, including the well-known Stein-Stein, Schöbel-Zhu, one-factor Bergomi, and the recently introduced quintic OU models motivated by the SPX-VIX joint calibration problem. We show the connection between the joint Fourier-Laplace functional of the log-price and the integrated variance, and the solution of an infinite-dimensional system of Riccati equations. Next, under some non-vanishing conditions on the Fourier-Laplace transforms, we establish an existence result for such Riccati equations and show how the Fourier-Laplace functional can be seen as the limit of a sequence of entire functions. On the practical side, we develop a numerical scheme to solve the stiff infinite-dimensional system of Riccati equations and demonstrate the efficiency and accuracy of the scheme for pricing SPX options and volatility swaps using Fourier and Laplace inversions, with specific examples of the quintic OU and the one-factor Bergomi models and their calibration to real market data.

q-fin.MF↗

VTC-AUDIT: An Interventional Reliability Audit for Visual-Token Compression under Paired Image Shifts

Visual-token compression is usually evaluated by clean accuracy and efficiency, but these averages do not reveal failures that compression introduces under an image shift where the uncompressed model stays correct. We introduce VTC-AUDIT, which estimates this incremental risk only on pairs where the full model is correct on both images and the compressed model is correct on the clean image. The four arms then cross two binary choices: which image selects the retained token positions, and which image supplies the visual features. We audit three open 8-9B vision-language models on four tasks and eight pre-specified shifts. We evaluate two training-free compressors---hard-pruning DivPrune and prune-and-merge ApET---at a matched 25% retained-position budget, producing 708,000 inference records. Reselecting positions on the shifted image, rather than reusing the clean-image positions, raises the failure rate in all six model-compressor settings. The increase is 3.04-9.60 percentage points for DivPrune and 2.05-4.20 percentage points for ApET, with every 95% interval above zero. Repeating the audit on a separately resampled second manifest reproduces all six increases. In a pooled monitor audit across the four benchmarks, support Jaccard instability fails the practical AUROC criterion of 0.65 in all six settings, whereas clean compressed-model uncertainty clears it. Thus, support turnover is a weak ranking signal under the audited benchmark mixture, while clean compressed-model uncertainty is substantially more informative. These results suggest that future visual-token compression evaluations should report conditional reliability alongside clean accuracy and efficiency.

cs.CV↗

The Search for Technosignatures: a Review of Possibilities

This paper reviews the diverse range of technosignatures that have been proposed in the literature. We organize the review by spatial scales from the Earth and the solar system to the edge of the Universe, not tied to a specific observatory or technical capability. This provides a more comprehensive view of technosignature science beyond the search for radio signals that has dominated SETI since its inception. We introduce the Kardashev and Barrow scales before exploring exoplanetary technosignatures, from surface, atmospheric to orbital sources. Next, we consider stellar technosignatures that may involve massive energy utilization, stellar modification or stellar pollution, and end with a section about compact objects. We then review attempts to detect interstellar communication, and discuss many dimensions of the search space from first principles. We also consider interstellar travel technosignatures, and end with galactic, extragalactic and universal signatures. The paper argues for stronger synergies between biosignature and technosignature searches, and the importance of multimodal and multimessenger strategies. Central to this is the importance of anomaly detection as a fundamental and agnostic search strategy. We highlight instruments for detecting technosignatures, as well as a science traceability matrix template.

astro-ph.EP↗

READY or Not: Reliable Enterprise Agent Deployment

An AI agent can perform well on benchmarks and still be unsuitable for deployment. Existing AI-agent benchmarks measure whether an agent can complete realistic professional work, whereas enterprise deployment asks a different question: whether an agent can meet a required reliability level, under acceptable human oversight, and at tolerable cost. We introduce Reliable Enterprise Agent Deployment (READY), a framework for qualifying AI agents for deployment on enterprise workflows. READY preserves each workflow's own definition of successful execution while applying a common qualification procedure. Given an agent, a workflow, and a class of candidate oversight policies, READY measures the reliability and operating cost of the human-AI system, selects the minimum-cost policy that satisfies a specified reliability target, and statistically qualifies it on held-out cases. The resulting deployment profile characterizes the supported operating point: reliability, human-oversight burden, and cost. READY is implemented as an open testbed that decouples workflow specification, execution, evaluation, and qualification, and runs on existing agent-evaluation infrastructure. In an end-to-end clinical-audit case study spanning 16 agent systems and 750 cases, READY reveals differences hidden by autonomous performance: two systems separated by only 0.3 points in autonomous accuracy (72.8% vs. 72.5%) require 39.2% versus 29.6% human review, respectively, to qualify at the same 76% reliability target under the evaluated oversight policy. READY thus shifts enterprise agent evaluation from how well can the agent perform the work? to under what conditions, and at what cost, can it be reliably deployed? By making those conditions explicit and statistically testable, READY provides a basis for comparing agent systems, setting oversight requirements, and making evidence-based deployment decisions.

cs.AI↗

A Bayesian Adaptive Spectral Surrogate Model for Efficient Probabilistic Optimal Power Flow Evaluation

This paper presents an adaptive stochastic spectral embedding (ASSE) method to solve the probabilistic AC optimal power flow (AC-OPF), a critical aspect of power system operation. The proposed method can efficiently and accurately estimate the probabilistic characteristics (e.g., mean, variance, median, and quantile-based metrics) of AC-OPF solutions while minimizing power losses. Based on estimated AC-OPF decisions (i.e., generator outputs), the confidence interval (CI)-based production cost index can be determined. Specially, an adaptive domain partition strategy is adopted to guide refinement domain selection and partition. The Bayesian compressive sensing-based coefficient calculation algorithm is integrated to enhance its performance. Numerical studies on modified IEEE 9-bus and IEEE 118-bus systems demonstrate that the proposed ASSE method offers accurate and fast evaluations compared to Monte Carlo simulations. Comparisons with a sparse polynomial chaos expansion, Gaussian process regression, and deep neural networks, further illustrate its efficacy in accurately assessing the responses with strongly localized behavior and non-symmetric distributions, providing practical decision-making bounds for generator outputs and operating costs under uncertainty.

eess.SY↗

Sigmoid Attention as a Better Substrate for Learned KV Cache Eviction

Learned KV-cache eviction often faces a soft-to-hard mismatch: during training, differentiable gates typically attenuate token contributions, whereas inference saves memory only when KV entries are physically removed. We ask whether the attention substrate affects this soft-to-hard transition. Using GPT-2-scale Transformers trained on OpenWebText, we run a controlled $2\times2\times2$ comparison over attention type, learned gating, and positional encoding. Although sigmoid attention is worse as a dense language model, learned hard eviction changes the useful operating points: sigmoid-gated models delete KV entries with negligible PPL change relative to their own no-eviction references. Under a matched live-cache protocol on the same dense backbones, learned sigmoid gates obtain lower PPL than our H$_2$O and KeyDiff implementations, whereas softmax gates do not uniformly beat these post-hoc methods. The results suggest that attention normalization can substantially affect whether a training-time soft gate transfers cleanly to hard KV deletion.

cs.LG↗

Bridging Artificial Intelligence and Power Systems Education Using a Hands-On Executable Framework

Artificial intelligence (AI) is increasingly central to power and energy systems, supporting modeling, forecasting, optimization, and control. Yet most existing works emphasize specialized applications and offer little reusable material for newcomers or interdisciplinary learners, who increasingly rely on large language models rather than building their own. This gap points to a need for engineering-grounded AI (EGAI), in which AI workflows follow established engineering and power-system domain rules rather than acting as task-agnostic black boxes. Motivated by a community survey of researchers and practitioners, which shows 92% report at least one barrier before running an AI model and 94% want a power-specific hands-on course. This paper presents a framework consisting of open, executable module library that lowers the entry barrier for AI in power systems. The modules follow a progressive difficulty ladder that maps core AI concepts onto representative power-system tasks: (i) foundational deep neural network (DNN) templates for function approximation and load-curve fitting; (ii) a domain-coupled convolutional neural network (CNN) power-flow surrogate for a 5-bus system; and (iii) frontier modules on DNN-assisted optimization, deep reinforcement learning (DRL) for battery storage control, and physics-informed neural networks (PINNs) for the swing equation. All modules are released as Jupyter notebooks that run locally or on Google Colab and are delivered through an IEEE online course and IEEE Power & Energy Society (PES) webinar series. The webinar drew more than 590 live attendees, which is among the ten most-attended IEEE PES webinars, and over 344 repository visits within two weeks, reinforcing the survey-based motivation.

eess.SY↗

First-order Constrained Trilevel Optimization Over Distributed Networks for Robust Coreset Selection

With the rapid advancement of the Internet of Things (IoT), massive amounts of data are generated across distributed edge networks. Training models on full data incurs significant computational overhead and storage bottlenecks, rendering coreset selection a critical paradigm. Furthermore, given the privacy-sensitive nature of local data and the escalating demand for model robustness in real-world deployments, developing an effective distributed optimization framework for robust coreset selection is vital, yet remains largely unexplored. To this end, this work first characterizes the hierarchical dependencies among coreset selection, robust optimization, and distributed learning, and formulates the distributed robust coreset selection as a trilevel optimization problem with level-wise constraints. Furthermore, to effectively solve the trilevel problem in a distributed manner, the \underline{F}ederated \underline{F}irst-order \underline{C}onstrained \underline{T}rilevel \underline{O}ptimization (F$^2$CTO) is proposed, which synergistically integrates a hierarchical composite value-function reformulation and a distributed alternating projected gradient algorithm. To the best of our knowledge, F$^2$CTO is the first method developed for distributed robust coreset selection, as well as the first distributed optimization approach for trilevel optimization problems with level-wise constraints. Additionally, we prove that the proposed method achieves a non-asymptotic convergence rate of $\mathcal{O}(ε^{-3/2})$ for finding an $ε$-stationary point. Extensive empirical evaluations on reliable continual learning demonstrate the effectiveness and efficiency of the proposed F$^2$CTO.

cs.LG↗

Remembering George Smoot

George Smoot (1945-2025) was a major figure in observational cosmology, particularly through his role in the precision measurement of the CMB dipole and the discovery of the primordial CMB temperature anisotropy as part of the COBE team. This collection of 33 essays from collaborators, colleagues, students, and friends offers varied insights into the work, career, and life of George Smoot.

astro-ph.CO↗

Energy Management for Solar-Powered Electric-Bus Charging Station: A Data-Driven Method

This paper presents a flexible energy management system (EMS) for an electric bus charging station (EBCS) that integrates renewable generation, energy storage, and electric bus (EB) charging while accounting for uncertainties in solar PV output, electricity prices, and EB arrival/departure state of charge. A data-driven polynomial chaos expansion surrogate is developed from a limited set of uncertainty samples, and a nonparametric inference method is used to enrich the input data when historical data is limited. Case studies on a solar-powered EBCS with 20 EBs demonstrate the effectiveness of the proposed EMS and data-driven method.

eess.SY↗

Capturing Smile Dynamics with the Quintic Volatility Model: SPX, Skew-Stickiness Ratio and VIX

We introduce the two-factor Quintic Ornstein-Uhlenbeck (OU) model, where volatility is modelled as a degree-five polynomial of the sum of two Ornstein-Uhlenbeck processes driven by the same Brownian motion, each mean-reverting at a different speed. We demonstrate that the model effectively captures the volatility surfaces of SPX and VIX while aligning with the skew-stickiness ratio (SSR) across maturities ranging from a few days to over two years. Furthermore, it is consistent with key empirical stylized facts, notably reproducing the Zumbach effect.

q-fin.MF↗

FlashFPS: Efficient Farthest Point Sampling for Large-Scale Point Clouds via Pruning and Caching

Point-based Neural Networks (PNNs) have become a key approach for point cloud processing. However, a core operation in these models, Farthest Point Sampling (FPS), often introduces significant inference latency, especially for large-scale processing. Despite existing CUDA- and hardware-level optimizations, FPS remains a major bottleneck due to exhaustive computations across multiple network layers in PNNs, which hinders scalability. Through systematic analysis, we identify three substantial redundancies in FPS, including unnecessary full-cloud computations, redundant late-stage iterations, and predictable inter-layer outputs that make later FPS computations avoidable. To address these, we propose \textbf{\textit{FlashFPS}}, a hardware-agnostic, plug-and-play framework for FPS acceleration, composed of \textit{FPS-Prune} and \textit{FPS-Cache}. \textit{FPS-Prune} introduces candidate pruning and iteration pruning to reduce redundant computations in FPS while preserving sampling quality, and \textit{FPS-Cache} eliminates layer-wise redundancy via cache-and-reuse. Integrated into existing CUDA libraries and state-of-the-art PNN accelerators, \textit{FlashFPS} achieves 5.16$\times$ speedup over the standard CUDA baseline on GPU and 2.69$\times$ on PNN accelerators, with negligible accuracy loss, enabling efficient and scalable PNN inference. Codes are released at https://github.com/Yuzhe-Fu/FlashFPS.

cs.LG↗

Developing the PsyCogMetrics AI Lab to Evaluate Large Language Models and Advance Cognitive Science -- A Three-Cycle Action Design Science Study

This study presents the development of the PsyCogMetrics AI Lab (psycogmetrics.ai), an integrated, cloud-based platform that operationalizes psychometric and cognitive-science methodologies for Large Language Model (LLM) evaluation. Framed as a three-cycle Action Design Science study, the Relevance Cycle identifies key limitations in current evaluation methods and unfulfilled stakeholder needs. The Rigor Cycle draws on kernel theories such as Popperian falsifiability, Classical Test Theory, and Cognitive Load Theory to derive deductive design objectives. The Design Cycle operationalizes these objectives through nested Build-Intervene-Evaluate loops. The study contributes a novel IT artifact, a validated design for LLM evaluation, benefiting research at the intersection of AI, psychology, cognitive science, and the social and behavioral sciences.

q-bio.NC↗

Counterweights and Complementarities: The Convergence of AI and Blockchain Powering a Decentralized Future

This editorial addresses the critical intersection of artificial intelligence (AI) and blockchain technologies, highlighting their contrasting tendencies toward centralization and decentralization, respectively. While AI, particularly with the rise of large language models (LLMs), exhibits a strong centralizing force due to data and resource monopolization by large corporations, blockchain offers a counterbalancing mechanism through its inherent decentralization, transparency, and security. The editorial argues that these technologies are not mutually exclusive but possess complementary strengths. Blockchain can mitigate AI's centralizing risks by enabling decentralized data management, computation, and governance, promoting greater inclusivity, transparency, and user privacy. Conversely, AI can enhance blockchain's efficiency and security through automated smart contract management, content curation, and threat detection. The core argument calls for the development of ``decentralized intelligence'' (DI) -- an interdisciplinary research area focused on creating intelligent systems that function without centralized control.

cs.AI↗

The future of gravitational wave science unlocking LIGO potential: AI-driven data analysis and exploration

The advent of gravitational wave astronomy (GW) has revolutionized the observation of cataclysmic cosmic events, such as black hole mergers and neutron star collisions. The Laser Interferometer Gravitational-Wave Observatory (LIGO) has been at the forefront of these discoveries. However, the immense volume and complexity of gravitational wave data present significant challenges for traditional analysis methods. This paper investigates the growing synergy between artificial intelligence (AI) and GW science, emphasizing how AI enhances signal detection, noise reduction, and data interpretation. It begins with an overview of GW fundamentals and the role of machine learning in increasing detector sensitivity. Notable GW events observed by LIGO are discussed alongside persistent analytical challenges such as data quality, generalization, and computational constraints. A comprehensive performance review of AI techniques, including supervised learning, unsupervised learning, deep learning, and reinforcement learning, is presented based on data spanning 2021 to 2024. Evaluation metrics include accuracy, precision, true positive rate (TPR), false positive rate (FPR), and computational efficiency. Findings indicate that deep learning and supervised learning outperform other approaches, particularly in enhancing TPR and minimizing FPR. While unsupervised and reinforcement learning models offer less precision, they demonstrate high efficiency and potential for real-time applications. The study also explores AI integration into next-generation detectors and waveform reconstruction techniques. Overall, the integration of AI into GW research significantly improves the reliability and speed of event detection, unlocking new possibilities for exploring the dynamic universe. This paper provides a comprehensive outlook on the transformative role of AI in shaping the future of GW astronomy.

astro-ph.GA↗

AutoRAC: Automated Processing-in-Memory Accelerator Design for Recommender Systems

The performance bottleneck of deep-learning-based recommender systems resides in their backbone Deep Neural Networks. By integrating Processing-In-Memory~(PIM) architectures, researchers can reduce data movement and enhance energy efficiency, paving the way for next-generation recommender models. Nevertheless, achieving performance and efficiency gains is challenging due to the complexity of the PIM design space and the intricate mapping of operators. In this paper, we demonstrate that automated PIM design is feasible even within the most demanding recommender model design space, spanning over $10^{54}$ possible architectures. We propose \methodname, which formulates the co-optimization of recommender models and PIM design as a combinatorial search over mixed-precision interaction operations, and parameterizes the search with a one-shot supernet encompassing all mixed-precision options. We comprehensively evaluate our approach on three Click-Through Rate benchmarks, showcasing the superiority of our automated design methodology over manual approaches. Our results indicate up to a 3.36$\times$ speedup, 1.68$\times$ area reduction, and 12.48$\times$ higher power efficiency compared to naively mapped searched designs and state-of-the-art handcrafted designs.

cs.AR↗