Searcharxiv⌕ Search

arXiv subjects

Ning Liu

Publications and source records attributed to Ning Liu.

At least 55 records · Page 3Linked to original sources

Anisotropic dispersion relation of ultralight Bose gases in modified Newtonian dynamics

We investigate the dispersion relation of collective modes in ultralight Bose gases under Modified Newtonian Dynamics (MOND). Starting from the coupled Gross-Pitaevskii and MOND Poisson equations, we derive an anisotropic dispersion relation that depends on the angle between the perturbation wavevector and the background gravitational field. This anisotropy arises directly from the nonlinear structure of the MOND field equation and leads to a direction-dependent Jeans instability, with critical wavelengths and masses varying with orientation. Our results provide a distinctive signature of MOND in a quantum astrophysical context and suggest that ultralight Bose gases can serve as novel probes of modified gravity.

cond-mat.quant-gas↗

Least constraint approach to non-relativistic quantum mechanics

We formulate a variational principle for non-relativistic quantum mechanics inspired by Gauss's principle of least constraint. We define a quantum constraint functional as the probability-weighted square deviation between the actual motion and the unconstrained motion that would arise from external forces alone. In this functional, the quantum potential plays the role of an intrinsic constraint that modifies the acceleration. Minimizing this quantum constraint functional with respect to the acceleration field yields the quantum Euler equations, which together with the continuity equation are equivalent to the Schrödinger equation. The principle is instantaneous and provides a differential characterization of quantum evolution. We demonstrate that this formulation is not a mere rewriting of existing dynamics: it provides a unified and technically economical treatment of geometric constraints and velocity-dependent dissipative forces, neither of which admits a straightforward global variational formulation. Potential applications to a broad range of quantum phenomena are also indicated.

quant-ph↗

Dual Murnaghan-Nakayama rule for Hecke algebras in Type $A$

Let $χ^λ_μ$ be the value of the irreducible character $χ^λ$ of the Hecke algebra of the symmetric group on the conjugacy class of type $μ$. The usual Murnaghan-Nakayama rule provides an iterative algorithm based on reduction of the lower partition $μ$. In this paper, we establish a dual Murnaghan-Nakayama rule for Hecke algebras of type $A$ using vertex operators by applying reduction to the upper partition $λ$. We formulate an explicit recursion of the dual Murnaghan-Nakayama rule by employing the combinatorial model of ``brick tabloids", which refines a previous result by two of us (J. Algebra 598 (2022), 24--47).

math.RT↗

GraphDx: A Cost-Aware Knowledge-Enhanced Multi-Agent Framework for Sequential Diagnosis

Sequential diagnosis requires balancing diagnostic accuracy against resource costs through iterative information gathering. Existing Large Language Model (LLM) approaches exhibit a critical knowledge-reasoning gap: despite encoding extensive medical knowledge, they struggle to reason systematically under cost constraints, often resorting to excessive testing. We propose GraphDx, a knowledge-enhanced framework with two core innovations. First, we design an automated pipeline that leverages LLMs to construct Medical Diagnosis Knowledge Graphs (MDKGs) with quantized typicality, action-centric topology, and dual-objective attributes for both diagnostic relevance and cost-sensitivity. Second, we introduce three collaborative agents (Perception, Reasoning, and Decision) where the Perception and Decision Agents handle language understanding and generation, while the Reasoning Agent performs deterministic evidence scoring and cost-aware planning on the MDKG. Experiments on MedQA and MIMIC-IV across three LLM backbones (DeepSeek-V3, Kimi-k2, Llama-3.3) show that GraphDx improves diagnostic success rates from 50--68% to 79--93% while reducing test costs by 20--54%, providing a robust, economical, and interpretable solution for automated clinical diagnosis.

cs.AI↗

Observer design for classes of nonlinear port-Hamiltonian systems

This paper presents a systematic observer design methodology for a class of port-Hamiltonian (pH) systems with state-dependent input matrices. Such systems can model a wide range of electromechanical systems, including magnetic levitation systems, MEMS devices, and electro-active polymer actuators such as DEA actuators, HASEL actuators, etc. In these applications, state-dependent input matrices naturally arise when the system is modeled under quasi-static electrical assumptions. An LPV polytopic embedding framework, together with LMI-based synthesis conditions, is proposed. The nonlinear error dynamics are represented as a convex combination of linear vertex systems using an integral mean value representation, which enables systematic computation of the observer gains that ensures exponential convergence. Both constant-gain and gain-scheduled observers are derived. Numerical results demonstrate the effectiveness of the proposed observer, with the gain-scheduled design achieving a significant increase in the maximum certifiable decay rate compared with constant-gain approaches, thereby reducing conservatism.

math.OC↗

Physics-guided diffusion models for inverse design of disordered metamaterials

Disordered metamaterials are promising for programming physical properties across diverse applications, yet their inverse design remains challenging due to the non-intuitive structure-property relationships and large design spaces. Recent generative approaches, particularly diffusion models, have shown potential in high-dimensional inverse design tasks. However, existing methods typically rely on carefully crafted training objectives, such as conditional data-driven or physics-informed loss functions. Because these strategies are inherently task-specific, the model must be retrained from scratch whenever the design problem changes (e.g., different governing equations, boundary conditions, or design objectives), severely limiting their flexibility and generalization ability. In this work, we propose physics-guided diffusion models that leverage differentiable physics-based solvers to instantly guide the generative process for inverse design. Drawing inspiration from classifier guidance, we develop a sampling strategy that directly incorporates physics guidance into the reverse stochastic differential equations. Our approach enables task-adaptive generation using gradients from differentiable solvers, while the diffusion model itself needs to be trained only once on unlabeled data. Focusing on disordered foam metamaterials, we present three representative design tasks: (1) achieving target effective thermal conductivity, (2) matching desired load-displacement response, and (3) maximizing energy absorption involving fractures. In each scenario, the proposed method successfully generates foam-like geometries that fulfill the prescribed physical objectives. These results demonstrate the versatility, efficiency, and practicality of physics-guided diffusion models for tackling complex inverse design problems in disordered metamaterials and beyond.

cs.CE↗

Murnaghan-Nakayama rule for the cyclotomic Hecke algebra and applications

We establish a Murnaghan--Nakayama rule for the irreducible characters of the cyclotomic Hecke algebra $\mathscr H_{m,n}(q,u)$ on Shoji's standard elements. Combined with Shoji's determinacy result, our formula provides a direct combinatorial route to the full irreducible character table of $\mathscr H_{m,n}(q,u)$. Our construction is based on our recent multi-parameter Murnaghan--Nakayama rule for Macdonald polynomials and specializes uniformly to several previously known formulas, including those for the complex reflection group of type $G(m,1,n)$ and the Iwahori--Hecke algebras of types $A$ and $B$. In a dual framework, using the vertex operator realization of Schur functions, we also derive a complementary iterative formula for irreducible characters on upper multipartitions, which may be viewed as a dual Murnaghan--Nakayama rule. As applications, we obtain a Regev-type formula and a Lübeck--Prasad--Adin--Roichman-type formula for cyclotomic Hecke algebras, extending the corresponding formulas for the Iwahori--Hecke algebra of type $A$ and the complex reflection group, respectively. We further introduce the notion of multiple bitrace for cyclotomic Hecke algebras and give a general combinatorial formula for the multiple bitrace. As a specialization, this yields the second orthogonality relation for irreducible characters of the complex reflection group $W_{m,n}$. For practical computation, we also include in an appendix a SageMath implementation of our Murnaghan--Nakayama rule, which computes individual character values and the full character table.

math.RT↗

VORL-EXPLORE: A Hybrid Learning Planning Approach to Multi-Robot Exploration in Dynamic Environments

Hierarchical multi-robot exploration commonly decouples frontier allocation from local navigation, which can make the system brittle in dense and dynamic environments. Because the allocator lacks direct awareness of execution difficulty, robots may cluster at bottlenecks, trigger oscillatory replanning, and generate redundant coverage. We propose VORL-EXPLORE, a hybrid learning and planning framework that addresses this limitation through execution fidelity, a shared estimate of local navigability that couples task allocation with motion execution. This fidelity signal is incorporated into a fidelity-coupled Voronoi objective with inter-robot repulsion to reduce contention before it emerges. It also drives a risk-aware adaptive arbitration mechanism between global A* guidance and a reactive reinforcement learning policy, balancing long-range efficiency with safe interaction in confined spaces. The framework further supports online self-supervised recalibration of the fidelity model using pseudo-labels derived from recent progress and safety outcomes, enabling adaptation to non-stationary obstacles without manual risk tuning. We evaluate this capability separately in a dedicated severe-traffic ablation. Extensive experiments in randomized grids and a Gazebo factory scenario show high success rates, shorter path length, lower overlap, and robust collision avoidance. The source code will be made publicly available upon acceptance.

cs.RO↗

Morphological Effects on Bacterial Brownian Motion: Validation of a Chiral Two-Body Model

We systematically investigate how flagellar morphology governs the stability of bacterial Brownian motion, evaluating the effectiveness of a simplified chiral two-body model. This model, which effectively captures the specific bacterial morphology and significantly reduces computational cost, is used for simulating bacterial Brownian motion. Our results demonstrate that the model accurately reproduces the Brownian motion of bacteria for contour lengths $Λ\ge5.0$~\si{μm}, helix radii $0.2\le R\le 0.5$~\si{μm}, and pitch angles $π/6\leθ\le2π/9$. We find that the translational and rotational velocities of bacteria depend linearly on the motor rotation rate, independent of dynamic viscosity. Increasing helix radius and contour length leads to more elongated trajectories and enhances their linearity. Furthermore, longer contour lengths improve the stability of the bacterial forward motion. Collectively, these findings demonstrate the essential role of flagella in stabilizing bacterial Brownian motion and confirm the effectiveness of the chiral two-body model for simulating this phenomenon.

physics.flu-dyn↗

RoboMIND 2.0: A Multimodal, Bimanual Mobile Manipulation Dataset for Generalizable Embodied Intelligence

While data-driven imitation learning has revolutionized robotic manipulation, current approaches remain constrained by the scarcity of large-scale, diverse real-world demonstrations. Consequently, the ability of existing models to generalize across long-horizon bimanual tasks and mobile manipulation in unstructured environments remains limited. To bridge this gap, we present RoboMIND 2.0, a comprehensive real-world dataset comprising over 310K dual-arm manipulation trajectories collected across six distinct robot embodiments and 739 complex tasks. Crucially, to support research in contact-rich and spatially extended tasks, the dataset incorporates 12K tactile-enhanced episodes and 20K mobile manipulation trajectories. Complementing this physical data, we construct high-fidelity digital twins of our real-world environments, releasing an additional 20K-trajectory simulated dataset to facilitate robust sim-to-real transfer. To fully exploit the potential of RoboMIND 2.0, we propose MIND-2 system, a hierarchical dual-system frame-work optimized via offline reinforcement learning. MIND-2 integrates a high-level semantic planner (MIND-2-VLM) to decompose abstract natural language instructions into grounded subgoals, coupled with a low-level Vision-Language-Action executor (MIND-2-VLA), which generates precise, proprioception-aware motor actions.

cs.RO↗

Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance

Graph Edit Distance (GED) is a widely used measure of graph similarity, valued for its flexibility in encoding domain knowledge through operation costs. However, existing learning-based approximation methods follow a modeling paradigm that decouples local candidate match selection from both operation costs and global dependencies between matches. This decoupling undermines their ability to capture the intrinsic flexibility of GED and often forces them to rely on costly iterative refinement to obtain accurate alignments. In this work, we revisit the formulation of GED and revise the prevailing paradigm, and propose Graph Edit Network (GEN), an implementation of the revised formulation that tightly integrates cost-aware expense estimation with globally guided one-step alignment. Specifically, GEN incorporates operation costs into node matching expenses estimation, ensuring match decisions respect the specified cost setting. Furthermore, GEN models match dependencies within and across graphs, capturing each match's impact on the overall alignment. These designs enable accurate GED approximation without iterative refinement. Extensive experiments on real-world and synthetic benchmarks demonstrate that GEN achieves up to a 37.8% reduction in GED predictive errors, while increasing inference throughput by up to 414x. These results highlight GEN's practical efficiency and the effectiveness of the revision. Beyond this implementation, our revision provides a principled framework for advancing learning-based GED approximation.

cs.LG↗

FreqPolicy: Efficient Flow-based Visuomotor Policy via Frequency Consistency

Generative modeling-based visuomotor policies have been widely adopted in robotic manipulation, attributed to their ability to model multimodal action distributions. However, the high inference cost of multi-step sampling limits its applicability in real-time robotic systems. Existing approaches accelerate sampling in generative modeling-based visuomotor policies by adapting techniques originally developed to speed up image generation. However, a major distinction exists: image generation typically produces independent samples without temporal dependencies, while robotic manipulation requires generating action trajectories with continuity and temporal coherence. To this end, we propose FreqPolicy, a novel approach that first imposes frequency consistency constraints on flow-based visuomotor policies. Our work enables the action model to capture temporal structure effectively while supporting efficient, high-quality one-step action generation. Concretely, we introduce a frequency consistency constraint objective that enforces alignment of frequency-domain action features across different timesteps along the flow, thereby promoting convergence of one-step action generation toward the target distribution. In addition, we design an adaptive consistency loss to capture structural temporal variations inherent in robotic manipulation tasks. We assess FreqPolicy on 53 tasks across 3 simulation benchmarks, proving its superiority over existing one-step action generators. We further integrate FreqPolicy into the vision-language-action (VLA) model and achieve acceleration without performance degradation on 40 tasks of LIBERO. Besides, we show efficiency and effectiveness in real-world robotic scenarios with an inference frequency of 93.5 Hz.

cs.RO↗

Disentangled Representation Learning for Parametric Partial Differential Equations

Neural operators (NOs) excel at learning mappings between function spaces, serving as efficient forward solution approximators for PDE-governed systems. However, as black-box solvers, they offer limited insight into the underlying physical mechanism, due to the lack of interpretable representations of the physical parameters that drive the system. To tackle this challenge, we propose a new paradigm for learning disentangled representations from NO parameters, thereby effectively solving an inverse problem. Specifically, we introduce DisentangO, a novel hyper-neural operator architecture designed to unveil and disentangle latent physical factors of variation embedded within the black-box neural operator parameters. At the core of DisentangO is a multi-task NO architecture that distills the varying parameters of the governing PDE through a task-wise adaptive layer, alongside a variational autoencoder that disentangles these variations into identifiable latent factors. By learning these disentangled representations, DisentangO not only enhances physical interpretability but also enables more robust generalization across diverse systems. Empirical evaluations across supervised, semi-supervised, and unsupervised learning contexts show that DisentangO effectively extracts meaningful and interpretable latent features, bridging the gap between predictive performance and physical understanding in neural operator frameworks.

cs.LG↗

Adaptive Reinforcement and Model Predictive Control Switching for Safe Human-Robot Cooperative Navigation

This paper addresses the challenge of human-guided navigation for mobile collaborative robots under simultaneous proximity regulation and safety constraints. We introduce Adaptive Reinforcement and Model Predictive Control Switching (ARMS), a hybrid learning-control framework that integrates a reinforcement learning follower trained with Proximal Policy Optimization (PPO) and an analytical one-step Model Predictive Control (MPC) formulated as a quadratic program safety filter. To enable robust perception under partial observability and non-stationary human motion, ARMS employs a decoupled sensing architecture with a Long Short-Term Memory (LSTM) temporal encoder for the human-robot relative state and a spatial encoder for 360-degree LiDAR scans. The core contribution is a learned adaptive neural switcher that performs context-aware soft action fusion between the two controllers, favoring conservative, constraint-aware QP-based control in low-risk regions while progressively shifting control authority to the learned follower in highly cluttered or constrained scenarios where maneuverability is critical, and reverting to the follower action when the QP becomes infeasible. Extensive evaluations against Pure Pursuit, Dynamic Window Approach (DWA), and an RL-only baseline demonstrate that ARMS achieves an 82.5 percent success rate in highly cluttered environments, outperforming DWA and RL-only approaches by 7.1 percent and 3.1 percent, respectively, while reducing average computational latency by 33 percent to 5.2 milliseconds compared to a multi-step MPC baseline. Additional simulation transfer in Gazebo and initial real-world deployment results further indicate the practicality and robustness of ARMS for safe and efficient human-robot collaboration. Source code and a demonstration video are available at https://github.com/21ning/ARMS.git.

cs.RO↗

$D^2Prune$: Sparsifying Large Language Models via Dual Taylor Expansion and Attention Distribution Awareness

Large language models (LLMs) face significant deployment challenges due to their massive computational demands. % While pruning offers a promising compression solution, existing methods suffer from two critical limitations: (1) They neglect activation distribution shifts between calibration data and test data, resulting in inaccurate error estimations; (2) They overlook the long-tail distribution characteristics of activations in the attention module. To address these limitations, this paper proposes a novel pruning method, $D^2Prune$. First, we propose a dual Taylor expansion-based method that jointly models weight and activation perturbations for precise error estimation, leading to precise pruning mask selection and weight updating and facilitating error minimization during pruning. % Second, we propose an attention-aware dynamic update strategy that preserves the long-tail attention pattern by jointly minimizing the KL divergence of attention distributions and the reconstruction error. Extensive experiments show that $D^2Prune$ consistently outperforms SOTA methods across various LLMs (e.g., OPT-125M, LLaMA2/3, and Qwen3). Moreover, the dynamic attention update mechanism also generalizes well to ViT-based vision models like DeiT, achieving superior accuracy on ImageNet-1K.

cs.LG↗

Ground State and Collective Modes of Bose-Einstein Condensates in Newtonian and MOND-inspired gravitational potentials

We analytically and numerically study the ground state and collective dynamics of Bose-Einstein condensates in two traps: a Newtonian potential and a logarithmic potential inspired by Modified Newtonian Dynamics (MOND). In the ground state, the MOND potential supports bound states only in the deep-MOND regime, where the condensate becomes significantly larger than its Newtonian counterpart. The size increases with repulsive coupling parameter $β$ in both potentials. A clear scaling law of the size with $β^{1/3}$ emerges in the MOND case and is confirmed numerically over a wide parameter range, while for the Newtonian potential no simple scaling law exists as the Thomas-Fermi approximation ceases to be valid. For the dynamics, we derive and solve equations for the monopole collective mode. The larger MOND-bound condensate oscillates at a lower frequency, which scales as $β^{-1/3}$ in the strong-interaction limit. These scaling laws provide insights for quantum-simulation experiments aiming to probe modified-gravity scenarios with cold atoms.

cond-mat.quant-gas↗

LiveProteinBench: A Contamination-Free Benchmark for Assessing Models' Specialized Capabilities in Protein Science

In contrast to their remarkable performance on general knowledge QA, the true abilities of Large Language Models (LLMs) in tasks demanding deep, specialized reasoning, such as in protein biology, have yet to be thoroughly investigated. Current benchmarks suffer from critical deficiencies, such as data contamination due to outdated test sets, insufficient focus on essential protein-specific tasks, and a neglect of multimodal assessments. To resolve these issues, we introduce LiveProteinBench, a contamination-free, multimodal benchmark of 12 tasks for evaluating LLM performance on protein property and function prediction. Its central innovation lies in a test set composed exclusively of proteins validated after the start of 2025, guaranteeing that the data is novel to all tested models. We benchmarked a suite of prominent general-purpose LLMs and specialized biological LLMs using both unimodal and multimodal input schemes. Our results show that: 1) General-purpose proprietary large models demonstrate superior zero-shot performance when encountering new protein data, outperforming their open-source and domain-specific counterparts by over 20\% accuracy. 2) The effective use of multi-view structural information remains a significant challenge, as the inclusion of structural images often fails to provide a consistent benefit and can even degrade performance. This highlights the limitations of current models in effectively fusing information across different modalities. 3) Models' performance scales more directly with the computational cost during inference than with its parameter count, underscoring the critical role of Chain-of-Thought reasoning capabilities for protein-specific tasks. LiveProteinBench delineates the current performance frontiers for LLMs in bioinformatics and presents new challenges for the development of future multimodal foundation models for biology

q-bio.QM↗

HACTS: a Human-As-Copilot Teleoperation System for Robot Learning

Teleoperation is essential for autonomous robot learning, especially in manipulation tasks that require human demonstrations or corrections. However, most existing systems only offer unilateral robot control and lack the ability to synchronize the robot's status with the teleoperation hardware, preventing real-time, flexible intervention. In this work, we introduce HACTS (Human-As-Copilot Teleoperation System), a novel system that establishes bilateral, real-time joint synchronization between a robot arm and teleoperation hardware. This simple yet effective feedback mechanism, akin to a steering wheel in autonomous vehicles, enables the human copilot to intervene seamlessly while collecting action-correction data for future learning. Implemented using 3D-printed components and low-cost, off-the-shelf motors, HACTS is both accessible and scalable. Our experiments show that HACTS significantly enhances performance in imitation learning (IL) and reinforcement learning (RL) tasks, boosting IL recovery capabilities and data efficiency, and facilitating human-in-the-loop RL. HACTS paves the way for more effective and interactive human-robot collaboration and data-collection, advancing the capabilities of robot manipulation.

cs.RO↗