SearcharxivSearch

arXiv subjects

Hang Yu

Publications and source records attributed to Hang Yu.

At least 145 records · Page 8Linked to original sources

How to Fine-tune the Model: Unified Model Shift and Model Bias Policy Optimization

Designing and deriving effective model-based reinforcement learning (MBRL) algorithms with a performance improvement guarantee is challenging, mainly attributed to the high coupling between model learning and policy optimization. Many prior methods that rely on return discrepancy to guide model learning ignore the impacts of model shift, which can lead to performance deterioration due to excessive model updates. Other methods use performance difference bound to explicitly consider model shift. However, these methods rely on a fixed threshold to constrain model shift, resulting in a heavy dependence on the threshold and a lack of adaptability during the training process. In this paper, we theoretically derive an optimization objective that can unify model shift and model bias and then formulate a fine-tuning process. This process adaptively adjusts the model updates to get a performance improvement guarantee while avoiding model overfitting. Based on these, we develop a straightforward algorithm USB-PO (Unified model Shift and model Bias Policy Optimization). Empirical results show that USB-PO achieves state-of-the-art performance on several challenging benchmark tasks.

cs.LG

Towards Multi-Subsession Conversational Recommendation

Conversational recommendation systems (CRS) could acquire dynamic user preferences towards desired items through multi-round interactive dialogue. Previous CRS mainly focuses on the single conversation (subsession) that user quits after a successful recommendation, neglecting the common scenario where user has multiple conversations (multi-subsession) over a short period. Therefore, we propose a novel conversational recommendation scenario named Multi-Subsession Multi-round Conversational Recommendation (MSMCR), where user would still resort to CRS after several subsessions and might preserve vague interests, and system would proactively ask attributes to activate user interests in the current subsession. To fill the gap in this new CRS scenario, we devise a novel framework called Multi-Subsession Conversational Recommender with Activation Attributes (MSCAA). Specifically, we first develop a context-aware recommendation module, comprehensively modeling user interests from historical interactions, previous subsessions, and feedback in the current subsession. Furthermore, an attribute selection policy module is proposed to learn a flexible strategy for asking appropriate attributes to elicit user interests. Finally, we design a conversation policy module to manage the above two modules to decide actions between asking and recommending. Extensive experiments on four datasets verify the effectiveness of our MSCAA framework for the MSMCR setting.

cs.IR

Twin Graph-based Anomaly Detection via Attentive Multi-Modal Learning for Microservice System

Microservice architecture has sprung up over recent years for managing enterprise applications, due to its ability to independently deploy and scale services. Despite its benefits, ensuring the reliability and safety of a microservice system remains highly challenging. Existing anomaly detection algorithms based on a single data modality (i.e., metrics, logs, or traces) fail to fully account for the complex correlations and interactions between different modalities, leading to false negatives and false alarms, whereas incorporating more data modalities can offer opportunities for further performance gain. As a fresh attempt, we propose in this paper a semi-supervised graph-based anomaly detection method, MSTGAD, which seamlessly integrates all available data modalities via attentive multi-modal learning. First, we extract and normalize features from the three modalities, and further integrate them using a graph, namely MST (microservice system twin) graph, where each node represents a service instance and the edge indicates the scheduling relationship between different service instances. The MST graph provides a virtual representation of the status and scheduling relationships among service instances of a real-world microservice system. Second, we construct a transformer-based neural network with both spatial and temporal attention mechanisms to model the inter-correlations between different modalities and temporal dependencies between the data points. This enables us to detect anomalies automatically and accurately in real-time. The source code of MSTGAD is publicly available at https://github.com/alipay/microservice_system_twin_graph_based_anomaly_detection.

cs.LG

NeuSort: An Automatic Adaptive Spike Sorting Approach with Neuromorphic Models

Objective. Spike sorting, a critical step in neural data processing, aims to classify spiking events from single electrode recordings based on different waveforms. This study aims to develop a novel online spike sorter, NeuSort, using neuromorphic models, with the ability to adaptively adjust to changes in neural signals, including waveform deformations and the appearance of new neurons. Approach. NeuSort leverages a neuromorphic model to emulate template-matching processes. This model incorporates plasticity learning mechanisms inspired by biological neural systems, facilitating real-time adjustments to online parameters. Results. Experimental findings demonstrate NeuSort's ability to track neuron activities amidst waveform deformations and identify new neurons in real-time. NeuSort excels in handling non-stationary neural signals, significantly enhancing its applicability for long-term spike sorting tasks. Moreover, its implementation on neuromorphic chips guarantees ultra-low energy consumption during computation. Significance. NeuSort caters to the demand for real-time spike sorting in brain-machine interfaces through a neuromorphic approach. Its unsupervised, automated spike sorting process makes it a plug-and-play solution for online spike sorting.

cs.NE

MSAT: Matrix stability analysis tool for shock-capturing schemes

The simulation of supersonic or hypersonic flows often suffers from numerical shock instabilities if the flow field contains strong shocks, limiting the further application of shock-capturing schemes. In this paper, we develop the unified matrix stability analysis method for schemes with three-point stencils and present MSAT, an open-source tool to quantitatively analyze the shock instability problem. Based on the finite-volume approach on the structured grid, MSAT can be employed to investigate the mechanism of the shock instability problem, evaluate the robustness of numerical schemes, and then help to develop robust schemes. Also, MSAT has the ability to analyze the practical simulation of supersonic or hypersonic flows, evaluate whether it will suffer from shock instabilities, and then assist in selecting appropriate numerical schemes accordingly. As a result, MSAT is a helpful tool that can investigate the shock instability problem and help to cure it.

math.NA

Numerical stability analysis of shock-capturing methods for strong shocks II: high-order finite-volume schemes

The shock instability problem commonly arises in flow simulations involving strong shocks, particularly when employing high-order schemes, limiting their applications in hypersonic flow simulations. This study focuses on exploring the numerical characteristics and underlying mechanisms of shock instabilities in fifth-order finite-volume WENO schemes. To this end, for the first time, we have established the matrix stability analysis method for the fifth-order scheme. By predicting the evolution of perturbation errors in the exponential growth stage, this method provides quantitative insights into the behavior of shock-capturing and helps elucidate the mechanisms that cause shock instabilities. Results reveal that even dissipative solvers also suffer from shock instabilities when the spatial accuracy is increased to fifth-order. Further investigation indicates that this is due to the excessively high spatial accuracy of the WENO scheme near the numerical shock structure. Moreover, the shock instability problem of fifth-order schemes is demonstrated to be a multidimensional coupling problem. To stably capture strong shocks, it is crucial to have sufficient dissipation on transverse faces and ensure at least two points within the numerical shock structure in the direction perpendicular to the shock. The source location of instability is also clarified by the matrix stability analysis method, revealing that the instability arises from the numerical shock structure. Additionally, stability analysis demonstrates that local characteristic decomposition helps mitigate shock instabilities in high-order schemes, although the instability still persists. These conclusions pave the way for a better understanding of the shock instability in fifth-order schemes and provide guidance for the development of more reliable high-order shock-capturing methods for compressible flows with high Mach numbers.

math.NA

Multiband Gravitational Wave Cosmography with Dark Sirens

Gravitational waves might help resolve the tension between early and late Universe measurements of the Hubble constant, and this possibility can be enhanced with a gravitational wave detector in the decihertz band as we will demonstrate in this study. Such a detector is particularly suitable for the multiband observation of stellar-mass black hole binaries between space and ground, which would significantly improve the source localization accuracy thanks to a long baseline for timing triangulation, hence promoting the "dark siren" cosmology. Proposed decihertz concepts include DECIGO/B-DECIGO, TianGO, and others. We consider here the prospects of multiband observation of dark siren binaries with a variety of network configurations. We find that a multiband observation can uniquely identify a black hole binary to a single galaxy to a cosmological distance, and thus a dark siren behaves as if it had an electromagnetic counterpart. Considering only fully localized dark sirens, we use a Fisher matrix approach to estimate the error in the Hubble constant and matter density parameter. We find that a decihertz detector substantially improves our ability to measure cosmological parameters because it enables host galaxies to be identified out to a larger distance without the systematics from statistical techniques based on comparing the population distribution.

gr-qc

Large Dynamical Tide Amplitudes from Small Kicks at Pericenter

The effect of dynamical tide ``kicks" on eccentric binary orbits is considered using the orbital mapping method. It is demonstrated that when mode damping is negligible the mode amplitude will generically grow in time for all values of orbital eccentricity and semi-major axis, even for small kicks outside the regime exhibiting diffusive growth. The origin of the small-kick growth is the change in kick size from orbit to orbit, an effect quadratic in the mode amplitude. When damping of the mode is included, the growth is shut off when the damping time is shorter than the growth time. Hence, in practice, kicks of sufficient size and long mode damping times are required for interesting levels of growth to occur. Application to the circularization of hot Jupiters is discussed. Previous investigations found that diffusive growth of the planetary f-mode in the large-kick regime would lead to rapid orbital shrinkage, but upon exiting the diffusive regime at $e \sim 0.9$ the theory would predict a large population of highly eccentric orbits. Simulations presented here show that subsequent orbital evolution relying on the small-kick regime may further decrease the eccentricity to $e \sim 0.2$ on timescales much less than the Gyrs ages of these systems.

astro-ph.EP

Optimal subsampling for large scale Elastic-net regression

Datasets with sheer volume have been generated from fields including computer vision, medical imageology, and astronomy whose large-scale and high-dimensional properties hamper the implementation of classical statistical models. To tackle the computational challenges, one of the efficient approaches is subsampling which draws subsamples from the original large datasets according to a carefully-design task-specific probability distribution to form an informative sketch. The computation cost is reduced by applying the original algorithm to the substantially smaller sketch. Previous studies associated with subsampling focused on non-regularized regression from the computational efficiency and theoretical guarantee perspectives, such as ordinary least square regression and logistic regression. In this article, we introduce a randomized algorithm under the subsampling scheme for the Elastic-net regression which gives novel insights into L1-norm regularized regression problem. To effectively conduct consistency analysis, a smooth approximation technique based on alpha absolute function is firstly employed and theoretically verified. The concentration bounds and asymptotic normality for the proposed randomized algorithm are then established under mild conditions. Moreover, an optimal subsampling probability is constructed according to A-optimality. The effectiveness of the proposed algorithm is demonstrated upon synthetic and real data datasets.

math.ST

Orbital Decay of Hot Jupiters due to Weakly Nonlinear Tidal Dissipation

We study tidal dissipation in hot Jupiter host stars due to the nonlinear damping of tidally driven $g$-modes, extending the calculations of Essick & Weinberg (2016) to a wide variety of non-solar type hosts. This process causes the planet's orbit to decay and has potentially important consequences for the evolution and fate of hot Jupiters. Previous studies either only accounted for linear dissipation processes or assumed that the resonantly excited primary mode becomes strongly nonlinear and breaks as it approaches the stellar center. However, the great majority of hot Jupiter systems are in the weakly nonlinear regime in which the primary mode does not break but instead excites a sea of secondary modes via three-mode interactions. We simulate these nonlinear interactions and calculate the net mode dissipation for stars that range in mass from $0.5 M_\odot \le M_\star \le 2.0 M_\odot$ and in age from the early main sequence to the subgiant phase. For stars with $M_\star \lesssim 1.0 M_\odot$ of nearly any age, we find that the orbital decay time is $\lesssim 100 \textrm{ Myr}$ for orbital periods $P_{\rm orb} \lesssim 1 \textrm{ day}$. For $M_\star \gtrsim 1.2 M_\odot$, the orbital decay time only becomes short on the subgiant branch, where it can be $\lesssim 10 \textrm{ Myr}$ for $P_{\rm orb} \lesssim 2 \textrm{ days}$ and result in significant transit time shifts. We discuss these results in the context of known hot Jupiter systems and examine the prospects for detecting their orbital decay with transit timing measurements.

astro-ph.EP

Numerical stability analysis of shock-capturing methods for strong shocks I: second-order MUSCL schemes

Modern shock-capturing schemes often suffer from numerical shock anomalies if the flow field contains strong shocks, which may limit their further application in hypersonic flow computations. In the current study, we devote our efforts to exploring the primary numerical characteristics and the underlying mechanism of shock instability for second-order finite-volume schemes. To this end, we, for the first time, develop the matrix stability analysis method for the finite-volume MUSCL approach. Such a linearized analysis method allows to investigate the shock instability problem of the finite-volume shock-capturing schemes in a quantitative and efficient manner. Results of the stability analysis demonstrate that the shock stability of second-order scheme is strongly related to the Riemann solver, Mach number, limiter function, numerical shock structure, and computational grid. Unique stability characteristics associated with these factors for second-order methods are revealed quantitatively with the established method. Source location of instability is also clarified by the matrix stability analysis method. Results show that the shock instability originates from the numerical shock structure. Such conclusions pave the way to better understand the shock instability problem and may shed new light on developing more reliable shock-capturing methods for compressible flows with high Mach number.

math.NA

Efficient Variational Bayes Learning of Graphical Models with Smooth Structural Changes

Estimating time-varying graphical models are of paramount importance in various social, financial, biological, and engineering systems, since the evolution of such networks can be utilized for example to spot trends, detect anomalies, predict vulnerability, and evaluate the impact of interventions. Existing methods require extensive tuning of parameters that control the graph sparsity and temporal smoothness. Furthermore, these methods are computationally burdensome with time complexity $O(NP^3)$ for $P$ variables and $N$ time points. As a remedy, we propose a low-complexity tuning-free Bayesian approach, named BASS. Specifically, we impose temporally-dependent spike-and-slab priors on the graphs such that they are sparse and varying smoothly across time. A variational inference algorithm is then derived to learn the graph structures from the data automatically. Owning to the pseudo-likelihood and the mean-field approximation, the time complexity of BASS is only $O(NP^2)$. Additionally, by identifying the frequency-domain resemblance to the time-varying graphical models, we show that BASS can be extended to learning frequency-varying inverse spectral density matrices, and yields graphical models for multivariate stationary time series. Numerical results on both synthetic and real data show that that BASS can better recover the underlying true graphs, while being more efficient than the existing methods, especially for high-dimensional cases.

stat.ML

BALANCE: Bayesian Linear Attribution for Root Cause Localization

Root Cause Analysis (RCA) plays an indispensable role in distributed data system maintenance and operations, as it bridges the gap between fault detection and system recovery. Existing works mainly study multidimensional localization or graph-based root cause localization. This paper opens up the possibilities of exploiting the recently developed framework of explainable AI (XAI) for the purpose of RCA. In particular, we propose BALANCE (BAyesian Linear AttributioN for root CausE localization), which formulates the problem of RCA through the lens of attribution in XAI and seeks to explain the anomalies in the target KPIs by the behavior of the candidate root causes. BALANCE consists of three innovative components. First, we propose a Bayesian multicollinear feature selection (BMFS) model to predict the target KPIs given the candidate root causes in a forward manner while promoting sparsity and concurrently paying attention to the correlation between the candidate root causes. Second, we introduce attribution analysis to compute the attribution score for each candidate in a backward manner. Third, we merge the estimated root causes related to each KPI if there are multiple KPIs. We extensively evaluate the proposed BALANCE method on one synthesis dataset as well as three real-world RCA tasks, that is, bad SQL localization, container fault localization, and fault type diagnosis for Exathlon. Results show that BALANCE outperforms the state-of-the-art (SOTA) methods in terms of accuracy with the least amount of running time, and achieves at least $6\%$ notably higher accuracy than SOTA methods for real tasks. BALANCE has been deployed to production to tackle real-world RCA problems, and the online results further advocate its usage for real-time diagnosis in distributed data systems.

cs.LG

6-DoF Robotic Grasping with Transformer

Robotic grasping aims to detect graspable points and their corresponding gripper configurations in a particular scene, and is fundamental for robot manipulation. Existing research works have demonstrated the potential of using a transformer model for robotic grasping, which can efficiently learn both global and local features. However, such methods are still limited in grasp detection on a 2D plane. In this paper, we extend a transformer model for 6-Degree-of-Freedom (6-DoF) robotic grasping, which makes it more flexible and suitable for tasks that concern safety. The key designs of our method are a serialization module that turns a 3D voxelized space into a sequence of feature tokens that a transformer model can consume and skip-connections that merge multiscale features effectively. In particular, our method takes a Truncated Signed Distance Function (TSDF) as input. After serializing the TSDF, a transformer model is utilized to encode the sequence, which can obtain a set of aggregated hidden feature vectors through multi-head attention. We then decode the hidden features to obtain per-voxel feature vectors through deconvolution and skip-connections. Voxel feature vectors are then used to regress parameters for executing grasping actions. On a recently proposed pile and packed grasping dataset, we showcase that our transformer-based method can surpass existing methods by about 5% in terms of success rates and declutter rates. We further evaluate the running time and generalization ability to demonstrate the superiority of the proposed method.

cs.RO

AvoidBench: A high-fidelity vision-based obstacle avoidance benchmarking suite for multi-rotors

Obstacle avoidance is an essential topic in the field of autonomous drone research. When choosing an avoidance algorithm, many different options are available, each with their advantages and disadvantages. As there is currently no consensus on testing methods, it is quite challenging to compare the performance between algorithms. In this paper, we propose AvoidBench, a benchmarking suite which can evaluate the performance of vision-based obstacle avoidance algorithms by subjecting them to a series of tasks. Thanks to the high fidelity of multi-rotors dynamics from RotorS and virtual scenes of Unity3D, AvoidBench can realize realistic simulated flight experiments. Compared to current drone simulators, we propose and implement both performance and environment metrics to reveal the suitability of obstacle avoidance algorithms for environments of different complexity. To illustrate AvoidBench's usage, we compare three algorithms: Ego-planner, MBPlanner, and Agile-autonomy. The trends observed are validated with real-world obstacle avoidance experiments.

cs.RO

Beyond the linear tide: impact of the non-linear tidal response of neutron stars on gravitational waveforms from binary inspirals

Tidal interactions in coalescing binary neutron stars modify the dynamics of the inspiral and hence imprint a signature on their gravitational wave (GW) signals in the form of an extra phase shift. We need accurate models for the tidal phase shift in order to constrain the supranuclear equation of state from observations. In previous studies, GW waveform models were typically constructed by treating the tide as a linear response to a perturbing tidal field. In this work, we incorporate non-linear corrections due to hydrodynamic three- and four-mode interactions and show how they can improve the accuracy and explanatory power of waveform models. We set up and numerically solve the coupled differential equations for the orbit and the modes and analytically derive solutions of the system's equilibrium configuration. Our analytical solutions agree well with the numerical ones up to the merger and involve only algebraic relations, allowing for fast phase shift and waveform evaluations for different equations of state over a large parameter space. We find that, at Newtonian order, non-linear fluid effects can enhance the tidal phase shift by $\gtrsim 1\,{\rm radian}$ at a GW frequency of 1000 Hz, corresponding to a $10-20\%$ correction to the linear theory. The scale of the additional phase shift near the merger is consistent with the difference between numerical relativity and theoretical predictions that account only for the linear tide. Non-linear fluid effects are thus important when interpreting the results of numerical relativity and in the construction of waveform models for current and future GW detectors.

gr-qc

Improving Embedded Knowledge Graph Multi-hop Question Answering by introducing Relational Chain Reasoning

Knowledge Graph Question Answering (KGQA) aims to answer user-questions from a knowledge graph (KG) by identifying the reasoning relations between topic entity and answer. As a complex branch task of KGQA, multi-hop KGQA requires reasoning over the multi-hop relational chain preserved in KG to arrive at the right answer. Despite recent successes, the existing works on answering multi-hop complex questions still face the following challenges: i) The absence of an explicit relational chain order reflected in user-question stems from a misunderstanding of a user's intentions. ii) Incorrectly capturing relational types on weak supervision of which dataset lacks intermediate reasoning chain annotations due to expensive labeling cost. iii) Failing to consider implicit relations between the topic entity and the answer implied in structured KG because of limited neighborhoods size constraint in subgraph retrieval-based algorithms.To address these issues in multi-hop KGQA, we propose a novel model herein, namely Relational Chain based Embedded KGQA (Rce-KGQA), which simultaneously utilizes the explicit relational chain revealed in natural language question and the implicit relational chain stored in structured KG. Our extensive empirical study on three open-domain benchmarks proves that our method significantly outperforms the state-of-the-art counterparts like GraftNet, PullNet and EmbedKGQA. Comprehensive ablation experiments also verify the effectiveness of our method on the multi-hop KGQA task. We have made our model's source code available at github: https://github.com/albert-jin/Rce-KGQA.

cs.CL

Influence of Pre-bottleneck Diversion Devices on Pedestrian Flow

The existence of bottlenecks often leads to the stagnation of pedestrian gatherings, which seriously affects the efficiency of traffic and reduces the flow of pedestrians. Some studies have shown that setting devices in front of bottlenecks can promote pedestrian evacuation under certain conditions. In this paper, the effect of setting diversion devices in front of the exit on pedestrian flow is studied. From our observation, these diversion devices can form a buffer zone before the exit and affect pedestrian behaviors. The evacuation times are found to decrease as the devices became farther away from the exit. In our experiments, it is found that the effect of shunt piles on evacuation is better than in the case of safety barriers and without device conditions. Under the condition of setting up safety barriers approximately 1m and 3m in front of the exit, the evacuation times are extended by 0.88% and 2.67%. For shunt piles, the evacuation times are 11.53% and 14.96% shorter than that of those without a device regarding the different distances to exit (1m and 3m, respectively). In addition, setting up shunt piles reduces the time interval between two consecutive pedestrians. To sum up, in our experimental settings, the diversion devices can effectively improve the average speed ahead of the exit and promote evacuation to become more orderly, which reduces the congestion in the later period of evacuation. In other words, this study demonstrates that a reasonable layout of facilities can not only meet the daily functional requirements but also improve the efficient use of space in emergencies, reducing the probability of crowd conventions and jams.

physics.soc-ph