Searcharxiv⌕ Search

arXiv subjects

Chen Wang

Publications and source records attributed to Chen Wang.

At least 487 records · Page 27Linked to original sources

Sequential Dexterity: Chaining Dexterous Policies for Long-Horizon Manipulation

Many real-world manipulation tasks consist of a series of subtasks that are significantly different from one another. Such long-horizon, complex tasks highlight the potential of dexterous hands, which possess adaptability and versatility, capable of seamlessly transitioning between different modes of functionality without the need for re-grasping or external tools. However, the challenges arise due to the high-dimensional action space of dexterous hand and complex compositional dynamics of the long-horizon tasks. We present Sequential Dexterity, a general system based on reinforcement learning (RL) that chains multiple dexterous policies for achieving long-horizon task goals. The core of the system is a transition feasibility function that progressively finetunes the sub-policies for enhancing chaining success rate, while also enables autonomous policy-switching for recovery from failures and bypassing redundant stages. Despite being trained only in simulation with a few task objects, our system demonstrates generalization capability to novel object shapes and is able to zero-shot transfer to a real-world robot equipped with a dexterous hand. Code and videos are available at https://sequential-dexterity.github.io

cs.RO↗

VoxDet: Voxel Learning for Novel Instance Detection

Detecting unseen instances based on multi-view templates is a challenging problem due to its open-world nature. Traditional methodologies, which primarily rely on 2D representations and matching techniques, are often inadequate in handling pose variations and occlusions. To solve this, we introduce VoxDet, a pioneer 3D geometry-aware framework that fully utilizes the strong 3D voxel representation and reliable voxel matching mechanism. VoxDet first ingeniously proposes template voxel aggregation (TVA) module, effectively transforming multi-view 2D images into 3D voxel features. By leveraging associated camera poses, these features are aggregated into a compact 3D template voxel. In novel instance detection, this voxel representation demonstrates heightened resilience to occlusion and pose variations. We also discover that a 3D reconstruction objective helps to pre-train the 2D-3D mapping in TVA. Second, to quickly align with the template voxel, VoxDet incorporates a Query Voxel Matching (QVM) module. The 2D queries are first converted into their voxel representation with the learned 2D-3D mapping. We find that since the 3D voxel representations encode the geometry, we can first estimate the relative rotation and then compare the aligned voxels, leading to improved accuracy and efficiency. In addition to method, we also introduce the first instance detection benchmark, RoboTools, where 20 unique instances are video-recorded with camera extrinsic. RoboTools also provides 24 challenging cluttered scenarios with more than 9k box annotations. Exhaustive experiments are conducted on the demanding LineMod-Occlusion, YCB-video, and RoboTools benchmarks, where VoxDet outperforms various 2D baselines remarkably with faster speed. To the best of our knowledge, VoxDet is the first to incorporate implicit 3D knowledge for 2D novel instance detection tasks.

cs.CV↗

MimicPlay: Long-Horizon Imitation Learning by Watching Human Play

Imitation learning from human demonstrations is a promising paradigm for teaching robots manipulation skills in the real world. However, learning complex long-horizon tasks often requires an unattainable amount of demonstrations. To reduce the high data requirement, we resort to human play data - video sequences of people freely interacting with the environment using their hands. Even with different morphologies, we hypothesize that human play data contain rich and salient information about physical interactions that can readily facilitate robot policy learning. Motivated by this, we introduce a hierarchical learning framework named MimicPlay that learns latent plans from human play data to guide low-level visuomotor control trained on a small number of teleoperated demonstrations. With systematic evaluations of 14 long-horizon manipulation tasks in the real world, we show that MimicPlay outperforms state-of-the-art imitation learning methods in task success rate, generalization ability, and robustness to disturbances. Code and videos are available at https://mimic-play.github.io

cs.RO↗

CUEING: a lightweight model to Capture hUman attEntion In driviNG

Discrepancies in decision-making between Autonomous Driving Systems (ADS) and human drivers underscore the need for intuitive human gaze predictors to bridge this gap, thereby improving user trust and experience. Existing gaze datasets, despite their value, suffer from noise that hampers effective training. Furthermore, current gaze prediction models exhibit inconsistency across diverse scenarios and demand substantial computational resources, restricting their on-board deployment in autonomous vehicles. We propose a novel adaptive cleansing technique for purging noise from existing gaze datasets, coupled with a robust, lightweight convolutional self-attention gaze prediction model. Our approach not only significantly enhances model generalizability and performance by up to 12.13% but also ensures a remarkable reduction in model complexity by up to 98.2% compared to the state-of-the art, making in-vehicle deployment feasible to augment ADS decision visualization and performance.

cs.CV↗

How to Rationally Select Your Delegatee in PoS

This paper centers around a simple yet crucial question for everyday users: How should one choose their delegated validators within proof-of-stake (PoS) protocols, particularly in the context of Ethereum 2.0? This has been a long-overlooked gap, as existing studies have primarily focused on inter-committee (validator set) behaviors and activities, while neglecting the dynamic formation of committees, especially for individual stakeholders seeking reliable validators. Our study bridges this gap by diving into the delegation process (normal users delegate their small-value tokens to delegatees who later act as validators) before entering an actual consensus phase. We propose a Bayesian model to quantify normal users' trust in delegatees, which we further incorporate into a game-theoretical model to simulate users' reactions against a set of critical factors identified through extensive research (including 10+ staking service provider as well as 30+ PoS blockchains). Our results reveal that users tend to choose their delegatees and utilize their tokens by carefully weighing the delegation cost, the behaviors of other users, and the reputation of delegatees, ultimately reaching a Nash equilibrium. Unfortunately, the collective trend significantly increases the likelihood of token concentration on a small number of delegatees.

cs.CR↗

A High-Mass Young Star-forming Core Escaping from Its Parental Filament

We studied the unique kinematic properties in massive filament G352.63-1.07 at $10^3$-AU spatial scale with the dense molecular tracers observed with the Atacama Large Millimeter/submillimeter Array (ALMA). We find the central massive core M1 (12 $M_\odot$) being separated from the surrounding filament with a velocity difference of $v- {v}_{sys}=-2$ km/s and a transverse separation within 3 arcsec. Meanwhile, as shown in multiple dense-gas tracers, M1 has a spatial extension closely aligned with the main filament and is connected to the filament towards its both ends. M1 thus represents a very beginning state for a massive young star-forming core escaping from the parental filament, within a time scale of $\sim 4000$ years. Based on its kinetic energy ($3.5\times10^{44}$ erg), the core escape is unlikely solely due to the original filament motion or magnetic field, but requires more energetic events such as a rapid intense anisotropic collapse. The released energy also seems to noticeably increase the environmental turbulence. This may help the filament to become stabilized again.

astro-ph.GA↗

Valuation Duration of the Stock Market

At the peak of the tech bubble, only 0.57% of market valuation comes from dividends in the next year. Taking the ratio of total market value to the value of one-year dividends, we obtain a valuation-based duration of 175 years. In contrast, at the height of the global financial crisis, more than 2.2% of market value is from dividends in the next year, implying a duration of 46 years. What drives valuation duration? We find that market participants have limited information about cash flow beyond one year. Therefore, an increase in valuation duration is due to a decrease in the discount rate rather than good news about long-term growth. Accordingly, valuation duration negatively predicts annual market return with an out-of-sample R2 of 15%, robustly outperforming other predictors in the literature. While the price-dividend ratio reflects the overall valuation level, our valuation-based measure of duration captures the slope of the valuation term structure. We show that valuation duration, as a discount rate proxy, is a critical state variable that augments the price-dividend ratio in spanning the (latent) state space for stock-market dynamics.

q-fin.PR↗

The FAST Galactic Plane Pulsar Snapshot Survey: III. Timing results of 30 FAST-GPPS discovered pulsars

Timing observations are crucial for determining the basic parameters of newly discovered pulsars. Using the Five-hundred-meter Aperture Spherical radio Telescope (FAST) with the L-band 19-beam receiver covering the frequency range of 1.0--1.5 GHz, the FAST Galactic Plane Pulsar Snapshot (GPPS) Survey has discovered more than 600 faint pulsars with flux densities of only a few or a few tens of $μ$Jy at 1.25 GHz. To obtain accurate position, spin parameters and dispersion measure of a pulsar, and to calculate derived parameters such as the characteristic age and surface magnetic field, we collect available FAST pulsar data obtained either through targeted follow-up observations or through coincidental survey observations with one of the 19 beams of the receiver. From these data we obtain time of arrival (TOA) measurements for 30 newly discovered pulsars as well as for 13 known pulsars. We demonstrate that the TOA measurements acquired by the FAST from any beams of the receiver in any observation mode (e.g. the tracking mode or the snapshot mode) can be combined to get timing solutions. We update the ephemerides of 13 previously known pulsars and obtain the first phase-coherent timing results for 30 isolated pulsars discovered in the FAST GPPS Survey. Notably, PSR J1904+0853 is an isolated millisecond pulsar, PSR J1906+0757 is a disrupted recycled pulsar, and PSR J1856+0211 has a long period of 9.89 s that can constrain pulsar death lines. Based on these timing solutions, all available FAST data have been added together to obtain the best pulse profiles for these pulsars.

astro-ph.HE↗

The FAST Galactic Plane Pulsar Snapshot Survey: II. Discovery of 76 Galactic rotating radio transients and their enigma

We are carrying out the GPPS survey by using the FAST, the most sensitive systematic pulsar survey in the Galactic plane. In addition to about 500 pulsars already discovered through normal periodical search, we report here the discovery of 76 new transient radio sources with sporadic strong pulses, detected by using the newly developed module for a sensitive single pulse search. Their small DM values suggest that they all are the Galactic RRATs. More radio pulses have been detected from 26 transient radio sources but no periods can be found due to a limited small number of pulses from all FAST observations. The following-up observations show that 16 transient sources are newly identified as being the prototypes of RRATs with a period already determined from more detected sporadic pulses, 10 sources are extremely nulling pulsars, and 24 sources are weak pulsars with sparse strong pulses. On the other hand, 48 previously known RRATs have been detected by the FAST. Except for 1 RRAT with four pulses detected in a session of five minute observation and 4 RRATs with only one pulse detected in a session, sensitive FAST observations reveal that 43 RRATs are just generally weak pulsars with sporadic strong pulses or simply very nulling pulsars, so that the previously known RRATs always have an extreme emission state together with a normal hardly detectable weak emission state. This is echoed by the two normal pulsars J1938+2213 and J1946+1449 with occasional brightening pulses. Though strong pulses of RRATs are very outstanding in the energy distribution, their polarization angle variations follow the polarization angle curve of the averaged normal pulse profile, suggesting that the predominant sparse pulses of RRATs are emitted in the same region with the same geometry as normal weak pulsars.

astro-ph.HE↗

Patterns Induce Injectivity: A New Thinking in Constructing Injective Local Rules of 1D Cellular Automata over $\mathbb{F}_2$

We discovered that certain patterns called injective patterns remain stable during the revolution process, allowing us to create many reversible CA simply by using them to design the revolution rules. By examining injective patterns, we investigated their structural stability during revolutions. This led us to discover extended patterns and pattern mixtures that can create more reversible cellular automata. Furthermore, our research proposed a new way to study the reversibility of CA by observing the structure of local rule $f$. In this paper, we will explicate our study and propose an efficient method for finding the injective patterns. Our algorithms can find injective rules and generate local rule $f$ by traversing $2^{N}$, instead of $2^{2^{N}}$ to check all injective rules and pick the injective ones.

cs.CC↗

PyPose v0.6: The Imperative Programming Interface for Robotics

PyPose is an open-source library for robot learning. It combines a learning-based approach with physics-based optimization, which enables seamless end-to-end robot learning. It has been used in many tasks due to its meticulously designed application programming interface (API) and efficient implementation. From its initial launch in early 2022, PyPose has experienced significant enhancements, incorporating a wide variety of new features into its platform. To satisfy the growing demand for understanding and utilizing the library and reduce the learning curve of new users, we present the fundamental design principle of the imperative programming interface, and showcase the flexible usage of diverse functionalities and modules using an extremely simple Dubins car example. We also demonstrate that the PyPose can be easily used to navigate a real quadruped robot with a few lines of code.

cs.RO↗

Co-GAIL: Learning Diverse Strategies for Human-Robot Collaboration

We present a method for learning a human-robot collaboration policy from human-human collaboration demonstrations. An effective robot assistant must learn to handle diverse human behaviors shown in the demonstrations and be robust when the humans adjust their strategies during online task execution. Our method co-optimizes a human policy and a robot policy in an interactive learning process: the human policy learns to generate diverse and plausible collaborative behaviors from demonstrations while the robot policy learns to assist by estimating the unobserved latent strategy of its human collaborator. Across a 2D strategy game, a human-robot handover task, and a multi-step collaborative manipulation task, our method outperforms the alternatives in both simulated evaluations and when executing the tasks with a real human operator in-the-loop. Supplementary materials and videos at https://sites.google.com/view/co-gail-web/home

cs.RO↗

DreamEditor: Text-Driven 3D Scene Editing with Neural Fields

Neural fields have achieved impressive advancements in view synthesis and scene reconstruction. However, editing these neural fields remains challenging due to the implicit encoding of geometry and texture information. In this paper, we propose DreamEditor, a novel framework that enables users to perform controlled editing of neural fields using text prompts. By representing scenes as mesh-based neural fields, DreamEditor allows localized editing within specific regions. DreamEditor utilizes the text encoder of a pretrained text-to-Image diffusion model to automatically identify the regions to be edited based on the semantics of the text prompts. Subsequently, DreamEditor optimizes the editing region and aligns its geometry and texture with the text prompts through score distillation sampling [29]. Extensive experiments have demonstrated that DreamEditor can accurately edit neural fields of real-world scenes according to the given text prompts while ensuring consistency in irrelevant areas. DreamEditor generates highly realistic textures and geometry, significantly surpassing previous works in both quantitative and qualitative evaluations.

cs.CV↗

The molecular clouds in a section of the third Galactic quadrant: observational properties and chemical abundance ratio between CO and its isotopologues

We compare the observational properties between $^{12}$CO, $^{13}$CO, and C$^{18}$O and summarize the observational parameters based on 7069 clouds sample from the Milky Way Imaging Scroll Painting (MWISP) CO survey in a section of the third Galactic quadrant. We find that the $^{13}$CO angular area ($A_{\rm ^{13}CO}$) generally increases with that of $^{12}$CO ($A_{\rm ^{12}CO}$), and the ratio of $A_{\rm ^{13}CO}$ to $A_{\rm ^{12}CO}$ is 0.38 by linear fitting. We find that the $^{12}$CO and $^{13}$CO flux are tightly correlated as $F_{\rm ^{13}CO}~=~0.17~ F_{\rm ^{12}CO}$ with both fluxes calculated within the $^{13}$CO-bright region. This indicates that the abundance $X_{\rm ^{13}CO}$ is a constant to be 6.5$^{+0.1}_{-0.5}$ $\times 10^{-7}$ for all samples under assumption of local thermodynamic equilibrium (LTE). Additionally, we observed that the X-factor is approximately constant in large sample molecular clouds. Similarly, we find $F_{\rm C^{18}O}~=~0.11~F_{\rm ^{13}CO}$ with both fluxes calculated within C$^{18}$O-bright region, which indicates that the abundance ratios ${X_{\rm ^{13}CO}/X_{\rm C^{18}O}}$ stays the same value 9.7$^{+0.6}_{-0.8}$ across the molecular clouds under LTE assumption. The linear relationships of $F_{\rm ^{12}CO}$ vs. $F_{\rm ^{13}CO}$ and $F_{\rm ^{13}CO}$ vs. $F_{\rm C^{18}O}$ hold not only for the $^{13}$CO-bright region or C$^{18}$O-bright region, but also for the entire molecular cloud scale with lower flux ratio. The abundance ratio ${X_{\rm ^{13}CO}/X_{\rm C^{18}O}}$ inside clouds shows a strong correlation with column density and temperature. This indicates that the ${X_{\rm ^{13}CO}/X_{\rm C^{18}O}}$ is dominated by a combination of chemical fractionation, selectively dissociation, and self-shielding effect inside clouds.

astro-ph.GA↗

Compatibility and combination of world W-boson mass measurements

The compatibility of W-boson mass measurements performed by the ATLAS, LHCb, CDF, and D0 experiments is studied using a coherent framework with theory uncertainty correlations. The measurements are combined using a number of recent sets of parton distribution functions (PDF), and are further combined with the average value of measurements from the Large Electron-Positron collider. The considered PDF sets generally have a low compatibility with a suite of global rapidity-sensitive Drell-Yan measurements. The most compatible set is CT18 due to its larger uncertainties. A combination of all mW measurements yields a value of mW = 80394.6 +- 11.5 MeV with the CT18 set, but has a probability of compatibility of 0.5% and is therefore disfavoured. Combinations are performed removing each measurement individually, and a 91% probability of compatibility is obtained when the CDF measurement is removed. The corresponding value of the W boson mass is 80369.2 +- 13.3 MeV, which differs by 3.6 sigma from the CDF value determined using the same PDF set.

hep-ex↗

Graph-based Alignment and Uniformity for Recommendation

Collaborative filtering-based recommender systems (RecSys) rely on learning representations for users and items to predict preferences accurately. Representation learning on the hypersphere is a promising approach due to its desirable properties, such as alignment and uniformity. However, the sparsity issue arises when it encounters RecSys. To address this issue, we propose a novel approach, graph-based alignment and uniformity (GraphAU), that explicitly considers high-order connectivities in the user-item bipartite graph. GraphAU aligns the user/item embedding to the dense vector representations of high-order neighbors using a neighborhood aggregator, eliminating the need to compute the burdensome alignment to high-order neighborhoods individually. To address the discrepancy in alignment losses, GraphAU includes a layer-wise alignment pooling module to integrate alignment losses layer-wise. Experiments on four datasets show that GraphAU significantly alleviates the sparsity issue and achieves state-of-the-art performance. We open-source GraphAU at https://github.com/YangLiangwei/GraphAU.

cs.IR↗

Contrastive Counterfactual Learning for Causality-aware Interpretable Recommender Systems

The field of generating recommendations within the framework of causal inference has seen a recent surge, with recommendations being likened to treatments. This approach enhances insights into the influence of recommendations on user behavior and helps in identifying the underlying factors. Existing research has often leveraged propensity scores to mitigate bias, albeit at the risk of introducing additional variance. Others have explored the use of unbiased data from randomized controlled trials, although this comes with assumptions that may prove challenging in practice. In this paper, we first present the causality-aware interpretation of recommendations and reveal how the underlying exposure mechanism can bias the maximum likelihood estimation (MLE) of observational feedback. Recognizing that confounders may be elusive, we propose a contrastive self-supervised learning to minimize exposure bias, employing inverse propensity scores and expanding the positive sample set. Building on this foundation, we present a novel contrastive counterfactual learning method (CCL) that incorporates three unique positive sampling strategies grounded in estimated exposure probability or random counterfactual samples. Through extensive experiments on two real-world datasets, we demonstrate that our CCL outperforms the state-of-the-art methods.

cs.IR↗

Group Identification via Transitional Hypergraph Convolution with Cross-view Self-supervised Learning

With the proliferation of social media, a growing number of users search for and join group activities in their daily life. This develops a need for the study on the group identification (GI) task, i.e., recommending groups to users. The major challenge in this task is how to predict users' preferences for groups based on not only previous group participation of users but also users' interests in items. Although recent developments in Graph Neural Networks (GNNs) accomplish embedding multiple types of objects in graph-based recommender systems, they, however, fail to address this GI problem comprehensively. In this paper, we propose a novel framework named Group Identification via Transitional Hypergraph Convolution with Graph Self-supervised Learning (GTGS). We devise a novel transitional hypergraph convolution layer to leverage users' preferences for items as prior knowledge when seeking their group preferences. To construct comprehensive user/group representations for GI task, we design the cross-view self-supervised learning to encourage the intrinsic consistency between item and group preferences for each user, and the group-based regularization to enhance the distinction among group embeddings. Experimental results on three benchmark datasets verify the superiority of GTGS. Additional detailed investigations are conducted to demonstrate the effectiveness of the proposed framework.

cs.IR↗