arXiv subjects

Bin Hu

Publications and source records attributed to Bin Hu.

At least 91 records · Page 5Linked to original sources

arXiv2026

The Art of Socratic Inquiry: A Framework for Proactive Template-Guided Therapeutic Conversation Generation

Proactive questioning, where therapists deliberately initiate structured, cognition-guiding inquiries, is a cornerstone of cognitive behavioral therapy (CBT). Yet, current psychological large language models (LLMs) remain overwhelmingly reactive, defaulting to empathetic but superficial responses that fail to surface latent beliefs or guide behavioral change. To bridge this gap, we propose the \textbf{Socratic Inquiry Framework (SIF)}, a lightweight, plug-and-play therapeutic intent planner that transforms LLMs from passive listeners into active cognitive guides. SIF decouples \textbf{when to ask} (via Strategy Anchoring) from \textbf{what to ask} (via Template Retrieval), enabling context-aware, theory-grounded questioning without end-to-end retraining. Complementing SIF, we introduce \textbf{Socratic-QA}, a high-quality dataset of strategy-aligned Socratic sequences that provides explicit supervision for proactive reasoning. Experiments show that SIF significantly enhances proactive questioning frequency, conversational depth, and therapeutic alignment, marking a clear shift from reactive comfort to proactive exploration. Our work establishes a new paradigm for psychologically informed LLMs: not just to respond, but to guide.

cs.CL↗

arXiv2026

SurfAge-Net: A Hierarchical Surface-Based Network for Interpretable Fine-Grained Brain Age Prediction

Brain age prediction serves as a powerful framework for assessing brain status and detecting deviations associated with neurodevelopmental and neurodegenerative disorders. However, most existing approaches emphasize whole-brain age prediction and therefore overlook the pronounced regional heterogeneity of brain maturation that is crucial for detecting localized atypical trajectories. To address this limitation, we propose a novel spherical surface-based brain age prediction network (SurfAge-Net) that leverages multiple morphological metrics to capture region-specific developmental patterns with enhanced robustness and clinical interpretability. SurfAge-Net establishes a new modeling paradigm by incorporating the connectomic principles of cortical organization: it explicitly models both intra- and inter-hemispheric dependencies through a spatial-channel mixing and a lateralization-aware attention mechanism, enabling the network to characterize the coordinate maturation pattern uniquely associated with each target region. Validated on three fetal and neonatal datasets, SurfAge-Net outperforms existing approaches (global MAE = 0.54, regional MAE = 0.45 in gestational/postmenstrual weeks) and demonstrates strong generalizability across external cohorts. Importantly, it provides spatially precise and biologically interpretable maps of cortical maturation, effectively identifying heterogeneous delays and regional-specific abnormalities in atypical developmental populations. These results established fine-grained brain age prediction as a promising paradigm for advancing neurodevelopmental research and supporting early clinical assessment.

q-bio.NC↗

arXiv2026

ReLE: A Scalable System and Structured Benchmark for Diagnosing Capability Anisotropy in Chinese LLMs

Large Language Models (LLMs) have achieved rapid progress in Chinese language understanding, yet accurately evaluating their capabilities remains challenged by benchmark saturation and prohibitive computational costs. While static leaderboards provide snapshot rankings, they often mask the structural trade-offs between capabilities. In this work, we present ReLE (Robust Efficient Live Evaluation), a scalable system designed to diagnose Capability Anisotropy, the non-uniformity of model performance across domains. Using ReLE, we evaluate 304 models (189 commercial, 115 open-source) across a Domain $\times$ Capability orthogonal matrix comprising 207,843 samples. We introduce two methodological contributions to address current evaluation pitfalls: (1) A Symbolic-Grounded Hybrid Scoring Mechanism that eliminates embedding-based false positives in reasoning tasks; (2) A Dynamic Variance-Aware Scheduler based on Neyman allocation with noise correction, which reduces compute costs by 70\% compared to full-pass evaluations while maintaining a ranking correlation of $ρ=0.96$. Our analysis reveals that aggregate rankings are highly sensitive to weighting schemes: models exhibit a Rank Stability Amplitude (RSA) of 11.4 in ReLE versus $\sim$5.0 in traditional benchmarks, confirming that modern models are highly specialized rather than generally superior. We position ReLE not as a replacement for comprehensive static benchmarks, but as a high-frequency diagnostic monitor for the evolving model landscape.

cs.CV↗

arXiv2026

Expression Syntax Information Bottleneck for Math Word Problems

Math Word Problems (MWP) aims to automatically solve mathematical questions given in texts. Previous studies tend to design complex models to capture additional information in the original text so as to enable the model to gain more comprehensive features. In this paper, we turn our attention in the opposite direction, and work on how to discard redundant features containing spurious correlations for MWP. To this end, we design an Expression Syntax Information Bottleneck method for MWP (called ESIB) based on variational information bottleneck, which extracts essential features of expression syntax tree while filtering latent-specific redundancy containing syntax-irrelevant features. The key idea of ESIB is to encourage multiple models to predict the same expression syntax tree for different problem representations of the same problem by mutual learning so as to capture consistent information of expression syntax tree and discard latent-specific redundancy. To improve the generalization ability of the model and generate more diverse expressions, we design a self-distillation loss to encourage the model to rely more on the expression syntax information in the latent space. Experimental results on two large-scale benchmarks show that our model not only achieves state-of-the-art results but also generates more diverse solutions. The code is available in https://github.com/menik1126/math_ESIB.

cs.CL↗

arXiv2025

TrashDet: Iterative Neural Architecture Search for Efficient Waste Detection

This paper addresses trash detection on the TACO dataset under strict TinyML constraints using an iterative hardware-aware neural architecture search framework targeting edge and IoT devices. The proposed method constructs a Once-for-All-style ResDets supernet and performs iterative evolutionary search that alternates between backbone and neck/head optimization, supported by a population passthrough mechanism and an accuracy predictor to reduce search cost and improve stability. This framework yields a family of deployment-ready detectors, termed TrashDets. On a five-class TACO subset (paper, plastic, bottle, can, cigarette), the strongest variant, TrashDet-l, achieves 19.5 mAP50 with 30.5M parameters, improving accuracy by up to 3.6 mAP50 over prior detectors while using substantially fewer parameters. The TrashDet family spans 1.2M to 30.5M parameters with mAP50 values between 11.4 and 19.5, providing scalable detector options for diverse TinyML deployment budgets on resource-constrained hardware. On the MAX78002 microcontroller with the TrashNet dataset, two specialized variants, TrashDet-ResNet and TrashDet-MBNet, jointly dominate the ai87-fpndetector baseline, with TrashDet-ResNet achieving 7525~$μ$J energy per inference at 26.7 ms latency and 37.45 FPS, and TrashDet-MBNet improving mAP50 by 10.2%; together they reduce energy consumption by up to 88%, latency by up to 78%, and average power by up to 53% compared to existing TinyML detectors.

cs.CV↗

arXiv2025

Detection of Performance Interference Among Network Slices in 5G/6G Systems

Recent studies showed that network slices (NSs), which are logical networks supported by shared physical networks, can experience service interference due to sharing of physical and virtual resources. Thus, from the perspective of providing end-to-end (E2E) service quality assurance in 5G/6G systems, it is crucial to discover possible service interference among existing NSs in a timely manner and isolate the potential issues before they can lead to violations of service quality agreements. We study the problem of (a) detecting service interference among NSs in 5G/6G systems and (b) identifying misbehaving NSs and other affected NSs, only using E2E key performance indicator measurements, and propose new algorithms. Our numerical studies demonstrate that, even when the service interference among NSs is weak to moderate, provided that a reasonable number of measurements are available, the proposed algorithms can correctly identify most of shared resources that can lead to service interference among the NSs that utilize the shared resources and misbehaving NSs that can cause potentially adverse service interference and affected NSs.

eess.SP↗

arXiv2025

Quasiparticle interference and spectral function of the UTe$_2$ superconductive surface band

We compute the (0-11) surface spectral function, the surface density of states (DOS), and the quasiparticle interference (QPI) patterns, both in the normal state and superconducting (SC) state of UTe$_2$. We consider all possible non-chiral and chiral order parameters (OPs) that could in principle describe the superconductivity in this compound. We describe the formation of surface states whose maximum intensity energy depends on the nature of the pairing. We study also the QPI patterns resulting from the scattering of these surface states. We show that the main feature distinguishing between various OPs is a QPI peak that is only observed experimentally in the superconducting state. The energy dispersion and the stability of this peak is consistent among the non-chiral OPs only with a $B_{3u}$ pairing. Moreover, $B_{3u}$ is the only non-chiral pairing that shows a peak at zero energy in the DOS, consistent with the experimental observations.

cond-mat.supr-con↗

arXiv2025

Design and Experimental Validation of Closed-Form CBF-Based Safe Control for Stewart Platform Under Multiple Constraints

This letter presents a closed-form solution of Control Barrier Function (CBF) framework for enforcing safety constraints on a Stewart robotic platform. The proposed method simultaneously handles multiple position and velocity constraints through an explicit closed-form control law, eliminating the need to solve a Quadratic Program (QP) at every control step and enabling efficient real-time implementation. This letter derives necessary and sufficient conditions under which the closed-form expression remains non-singular, thereby ensuring well-posedness of the CBF solution to multi-constraint problem. The controller is validated in both simulation and hardware experiments on a custom-built Stewart platform prototype, demonstrating safetyguaranteed performance that is comparable to the QP-based formulation, while reducing computation time by more than an order of magnitude. The results confirm that the proposed approach provides a reliable and computationally lightweight framework for real-time safe control of parallel robotic systems. The experimental videos are available on the project website. (https://nail-uh.github.io/StewartPlatformSafeControl.github.io/)

cs.RO↗

arXiv2025

An Exact, Finite Dimensional Representation for Full-Block, Circle Criterion Multipliers

This paper provides the first finite-dimensional characterization for the complete set of full-block, circle criterion multipliers. We consider the interconnection of a discrete-time, linear time-invariant system in feedback with a non-repeated, sector-bounded nonlinearity. Sufficient conditions for stability and performance can be derived using: (i) dissipation inequalities, and (ii) Quadratic Constraints (QCs) that bound the input/output pairs of the nonlinearity. Larger classes of QCs (or multipliers) reduce the conservatism of the conditions. Full-block, circle criterion multipliers define the complete set of all possible QCs for non-repeated, sector-bounded nonlinearities. These provide the least conservative conditions. However, full-block multipliers are defined by an uncountably infinite number of constraints and hence do not lead to computationally tractable solutions if left in this raw form. This paper provides a new finite-dimensional characterization for the set of full-block, circle criterion multipliers. The key theoretical insight is: the set of all input/output pairs of non-repeated sector-bounded nonlinearities is equal to the set of all incremental pairs for an appropriately constructed piecewise linear function. Our new description for the complete set of multipliers only requires a finite number of matrix copositivity constraints. These conditions have an exact, computationally tractable implementation for problems where the nonlinearity has small input/output dimensions $(\le 4)$. We illustrate the use of our new characterization via a simple example.

eess.SY↗

arXiv2025

Strong Memory, Weak Control: An Empirical Study of Executive Functioning in LLMs

Working memory, or the ability to hold and manipulate information in the mind, is a critical component of human intelligence and executive functioning. It is correlated with performance on various cognitive tasks, including measures of fluid intelligence, which encompasses reasoning and problem solving. We use a comprehensive set of classic working memory tasks to estimate the working memory capacity of large language models (LLMs). We find that in most cases, LLMs exceed normative human scores. However, we do not find that the increased capacity of working memory is associated with higher performance on other executive functioning tasks or problem solving benchmarks. These results suggest that LLMs may have deficits in attentional control and cognitive flexibility, which result in difficulties with inhibiting automatic responses and adapting to shifting information. Our findings suggest that current reasoning models have mixed results in compensating for these deficits.

cs.CL↗

arXiv2025

Enhancing Primordial B-mode Detection: Comprehensive Delensing Pipelines for Improved Sensitivity to $r$

Recognizing the impact of contamination from weak gravitational lensing B-modes induced by Large Scale Structure, we examine delensing methods to enhance sensitivity to the tensor-to-scalar ratio $r$ in primordial B-mode detection experiments. This study presents a realistic pipeline to improve $r$ constraints using foreground-cleaned maps with negligible residuals. The pipeline, based on simulations, is adaptable for future experiments. We focus on two delensing approaches: (1) subtracting the gradient-order lensing B-mode template, computed by convolving the E-mode with the lensing potential, from the observed B-mode signal; and (2) remapping observations using the estimated inverse deflection angle. For parameter constraints, we employ three models to reduce $r$ uncertainty and bias, finding consistent uncertainties across models, though biases vary due to the multipole-dependence of the delensing fraction. %We demonstrate the pipeline using simulated maps from future CMB polarization experiments, including a small-aperture (sub-1m) telescope, a large-aperture (6m) telescope, and a future space mission (3m). We demonstrated this pipeline using simulated observation maps from future CMB polarization experiments, which included current representative ground-based small aperture telescopes (sub-1m), next-generation ground-based large aperture telescopes (6m), and highly competitive future space-based medium aperture missions (3m). Results show a delensing efficiency of 40\% with the small-aperture telescope alone, increasing to 65\% when combined with the large-aperture telescope, and 80\% with the satellite mission. These lead to reductions in $r$ uncertainty by 46\% for ground-based and 63\% for space missions. The most promising method adds the lensing template B-mode as an additional frequency channel, minimizing bias on $r$.

astro-ph.CO↗

arXiv2025

Map-World: Masked Action planning and Path-Integral World Model for Autonomous Driving

Motion planning for autonomous driving must handle multiple plausible futures while remaining computationally efficient. Recent end-to-end systems and world-model-based planners predict rich multi-modal trajectories, but typically rely on handcrafted anchors or reinforcement learning to select a single best mode for training and control. This selection discards information about alternative futures and complicates optimization. We propose MAP-World, a prior-free multi-modal planning framework that couples masked action planning with a path-weighted world model. The Masked Action Planning (MAP) module treats future ego motion as masked sequence completion: past waypoints are encoded as visible tokens, future waypoints are represented as mask tokens, and a driving-intent path provides a coarse scaffold. A compact latent planning state is expanded into multiple trajectory queries with injected noise, yielding diverse, temporally consistent modes without anchor libraries or teacher policies. A lightweight world model then rolls out future BEV semantics conditioned on each candidate trajectory. During training, semantic losses are computed as an expectation over modes, using trajectory probabilities as discrete path weights, so the planner learns from the full distribution of plausible futures instead of a single selected path. On NAVSIM, our method matches anchor-based approaches and achieves state-of-the-art performance among world-model-based methods, while avoiding reinforcement learning and maintaining real-time inference latency.

cs.CV↗

arXiv2025

Fast-Converging and Asymptotic-Preserving DSMC

Improving the efficiency of the direct simulation Monte Carlo (DSMC) method has become increasingly urgent with the rapid development of space exploration. To address this issue, the direct intermittent general synthetic iteration (DIG) scheme has recently been proposed to enable DSMC's rapid and accurate convergence to steady-state solutions, even when the cell size is much larger than the mean free path in near-continuum flow regimes. The first part of the paper is devoted to the mathematical analysis of DIG's fast-converging and asymptotic-preserving properties. Because the Boltzmann equation is analytically intractable, the analysis is conducted using the linearized BGK model. It is found that, in the near continuum flow regime, the DIG method asymptotically recovers the Navier Stokes equations when the cell size is O(1), rather than being constrained by the mean free path. Moreover, after a single cycle of DIG evolution, the deviation from the final steady state solution is reduced by more than a factor of five. In the second part of the paper, the Poiseuille flow and hypersonic flow passing over cylinder are investigated using the DIG scheme, with different time step and cell sizes, thereby demonstrating its efficiency and accuracy in multiscale flow simulation. Specifically, when the Knudsen number is 0.01, the DIG method is found to be faster than the traditional DSMC method by two orders of magnitude. The performance gain becomes even greater at smaller Knudsen numbers. The proposed method holds great potential for engineering applications.

physics.comp-ph↗

arXiv2025

Recent progress of scanning tunneling microscopy/spectroscopy study of pair density wave in superconductors

A pair density wave (PDW) is a superconducting state characterized by an order parameter with finite center-of-mass momentum in the absence of an external magnetic field, thereby breaking the conventional translational symmetry in homogeneous superconductors. It is proposed that PDW emerges from magnetic interactions, strong electron-electron correlations, and their interplay with competing orders. In this review, we highlight recent advances in the detection and study of PDWs using scanning tunneling microscopy and spectroscopy (STM/STS). We focus on how the signatures of PDW have been experimentally visualized across a variety of extraordinary superconductors, including iron-based superconductors, cuprate superconductors, spin-triplet superconductors, kagome-lattice superconductors, and transition metal dichalcogenides. Beginning with an introduction to the fundamental concept of PDWs and the unique capabilities of STM/STS, particularly its atomic-scale spatial resolution and advanced data analysis techniques, we discuss key experimental findings, including the direct visualization of charge density modulations associated with PDWs. Finally, we discuss emerging challenges and future directions, aiming to inspire future research into the nature of PDWs in superconductors.

cond-mat.supr-con↗

arXiv2025

Discrete-Time Stability Analysis of ReLU Feedback Systems via Integral Quadratic Constraints

This paper analyzes internal stability of a discrete-time feedback system with a ReLU nonlinearity. This feedback system is motivated by recurrent neural networks. We first review existing static quadratic constraints (QCs) for slope-restricted nonlinearities. Next, we derive hard integral quadratic constraints (IQCs) for scalar ReLU by using finite impulse filters and structured matrices. These IQCs are combined with a dissipation inequality leading to an LMI condition that certifies internal stability. We show that our new dynamic IQCs for ReLU are a superset of the well-known Zames-Falb IQCs specified for slope-restricted nonlinearities. Numerical results show that the proposed hard IQCs give less conservative stability margins than Zames-Falb multipliers and prior static QC methods, sometimes dramatically so.

eess.SY↗

arXiv2025

Toward Engineering AGI: Benchmarking the Engineering Design Capabilities of LLMs

Modern engineering, spanning electrical, mechanical, aerospace, civil, and computer disciplines, stands as a cornerstone of human civilization and the foundation of our society. However, engineering design poses a fundamentally different challenge for large language models (LLMs) compared with traditional textbook-style problem solving or factual question answering. Although existing benchmarks have driven progress in areas such as language understanding, code synthesis, and scientific problem solving, real-world engineering design demands the synthesis of domain knowledge, navigation of complex trade-offs, and management of the tedious processes that consume much of practicing engineers' time. Despite these shared challenges across engineering disciplines, no benchmark currently captures the unique demands of engineering design work. In this work, we introduce EngDesign, an Engineering Design benchmark that evaluates LLMs' abilities to perform practical design tasks across nine engineering domains. Unlike existing benchmarks that focus on factual recall or question answering, EngDesign uniquely emphasizes LLMs' ability to synthesize domain knowledge, reason under constraints, and generate functional, objective-oriented engineering designs. Each task in EngDesign represents a real-world engineering design problem, accompanied by a detailed task description specifying design goals, constraints, and performance requirements. EngDesign pioneers a simulation-based evaluation paradigm that moves beyond textbook knowledge to assess genuine engineering design capabilities and shifts evaluation from static answer checking to dynamic, simulation-driven functional verification, marking a crucial step toward realizing the vision of engineering Artificial General Intelligence (AGI).

cs.CE↗

arXiv2025

Two-Stage Learning of Stabilizing Neural Controllers via Zubov Sampling and Iterative Domain Expansion

Learning-based neural network (NN) control policies have shown impressive empirical performance. However, obtaining stability guarantees and estimates of the region of attraction of these learned neural controllers is challenging due to the lack of stable and scalable training and verification algorithms. Although previous works in this area have achieved great success, much conservatism remains in their frameworks. In this work, we propose a novel two-stage training framework to jointly synthesize a controller and a Lyapunov function for continuous-time systems. By leveraging a Zubov-inspired region of attraction characterization to directly estimate stability boundaries, we propose a novel training-data sampling strategy and a domain-updating mechanism that significantly reduces the conservatism in training. Moreover, unlike existing works on continuous-time systems that rely on an SMT solver to formally verify the Lyapunov condition, we extend state-of-the-art neural network verifier $α,\!β$-CROWN with the capability of performing automatic bound propagation through the Jacobian of dynamical systems and a novel verification scheme that avoids expensive bisection. To demonstrate the effectiveness of our approach, we conduct numerical experiments by synthesizing and verifying controllers on several challenging nonlinear systems across multiple dimensions. We show that our training can yield region of attractions with volume $5 - 1.5\cdot 10^{5}$ times larger compared to the baselines, and our verification on continuous systems can be up to $40-10{,}000$ times faster compared to the traditional SMT solver dReal. Our code is available at https://github.com/Verified-Intelligence/Two-Stage_Neural_Controller_Training.

cs.LG↗

arXiv2025

End-to-End Design and Validation of a Low-Cost Stewart Platform with Nonlinear Estimation and Control

This paper presents the complete design, control, and experimental validation of a low-cost Stewart platform prototype developed as an affordable yet capable robotic testbed for research and education. The platform combines off the shelf components with 3D printed and custom fabricated parts to deliver full six degrees of freedom motions using six linear actuators connecting a moving platform to a fixed base. The system software integrates dynamic modeling, data acquisition, and real time control within a unified framework. A robust trajectory tracking controller based on feedback linearization, augmented with an LQR scheme, compensates for the platform's nonlinear dynamics to achieve precise motion control. In parallel, an Extended Kalman Filter fuses IMU and actuator encoder feedback to provide accurate and reliable state estimation under sensor noise and external disturbances. Unlike prior efforts that emphasize only isolated aspects such as modeling or control, this work delivers a complete hardware-software platform validated through both simulation and experiments on static and dynamic trajectories. Results demonstrate effective trajectory tracking and real-time state estimation, highlighting the platform's potential as a cost effective and versatile tool for advanced research and educational applications.

cs.RO↗