arXiv subjects

Lili Chen

Publications and source records attributed to Lili Chen.

At least 37 records · Page 2Linked to original sources

arXiv2024

Graph Neural Networks for Power Allocation in Wireless Networks with Full Duplex Nodes

Due to mutual interference between users, power allocation problems in wireless networks are often non-convex and computationally challenging. Graph neural networks (GNNs) have recently emerged as a promising approach to tackling these problems and an approach that exploits the underlying topology of wireless networks. In this paper, we propose a novel graph representation method for wireless networks that include full-duplex (FD) nodes. We then design a corresponding FD Graph Neural Network (F-GNN) with the aim of allocating transmit powers to maximise the network throughput. Our results show that our F-GNN achieves state-of-art performance with significantly less computation time. Besides, F-GNN offers an excellent trade-off between performance and complexity compared to classical approaches. We further refine this trade-off by introducing a distance-based threshold for inclusion or exclusion of edges in the network. We show that an appropriately chosen threshold reduces required training time by roughly 20% with a relatively minor loss in performance.

cs.NI↗

arXiv2023

PlayFusion: Skill Acquisition via Diffusion from Language-Annotated Play

Learning from unstructured and uncurated data has become the dominant paradigm for generative approaches in language and vision. Such unstructured and unguided behavior data, commonly known as play, is also easier to collect in robotics but much more difficult to learn from due to its inherently multimodal, noisy, and suboptimal nature. In this paper, we study this problem of learning goal-directed skill policies from unstructured play data which is labeled with language in hindsight. Specifically, we leverage advances in diffusion models to learn a multi-task diffusion model to extract robotic skills from play data. Using a conditional denoising diffusion process in the space of states and actions, we can gracefully handle the complexity and multimodality of play data and generate diverse and interesting robot behaviors. To make diffusion models more useful for skill learning, we encourage robotic agents to acquire a vocabulary of skills by introducing discrete bottlenecks into the conditional behavior generation process. In our experiments, we demonstrate the effectiveness of our approach across a wide variety of environments in both simulation and the real world. Results visualizations and videos at https://play-fusion.github.io

cs.RO↗

arXiv2023

Study of the nonleptonic charmless $B$ ${\to}$ $SS$ decays with the QCD factorization approach

Inspired by the brilliant prospects of the ongoing $B$ meson experiments, the hadronic charmless $B$ ${\to}$ $SS$ decays are studied by considering the next-to-leading (NLO) contributions with the QCD factorization approach, where $S$ denotes the scalar mesons $K_{0}^{\ast}(1430)$ and $a_{0}(1450)$. Branching ratios and $CP$ violating asymmetries are estimated with the updated values of hadronic parameters obtained from a covariant light-front quark model, for two scenarios where the scalar mesons are the $1^{3}P_{0}$ and $2^{3}P_{0}$ states. It is found that the NLO contributions are very important for the $B$ ${\to}$ $SS$ decays; For the $B$ ${\to}$ $a_{0}(1450)K_{0}^{\ast}(1430)$ and $B_{s}$ ${\to}$ $K_{0}^{\ast}(1430)\overline{K}_{0}^{\ast}(1430)$ decays, branching ratios can reach up to the order of ${\cal O}(10^{-5})$ by assuming that the scalar mesons are the $1P$ states, and should first be investigated in the future experiments.

hep-ph↗

arXiv2023

Affordances from Human Videos as a Versatile Representation for Robotics

Building a robot that can understand and learn to interact by watching humans has inspired several vision problems. However, despite some successful results on static datasets, it remains unclear how current models can be used on a robot directly. In this paper, we aim to bridge this gap by leveraging videos of human interactions in an environment centric manner. Utilizing internet videos of human behavior, we train a visual affordance model that estimates where and how in the scene a human is likely to interact. The structure of these behavioral affordances directly enables the robot to perform many complex tasks. We show how to seamlessly integrate our affordance model with four robot learning paradigms including offline imitation learning, exploration, goal-conditioned learning, and action parameterization for reinforcement learning. We show the efficacy of our approach, which we call VRB, across 4 real world environments, over 10 different tasks, and 2 robotic platforms operating in the wild. Results, visualizations and videos at https://robo-affordances.github.io/

cs.RO↗

arXiv2022

Towards Correlated Sequential Rules

The goal of high-utility sequential pattern mining (HUSPM) is to efficiently discover profitable or useful sequential patterns in a large number of sequences. However, simply being aware of utility-eligible patterns is insufficient for making predictions. To compensate for this deficiency, high-utility sequential rule mining (HUSRM) is designed to explore the confidence or probability of predicting the occurrence of consequence sequential patterns based on the appearance of premise sequential patterns. It has numerous applications, such as product recommendation and weather prediction. However, the existing algorithm, known as HUSRM, is limited to extracting all eligible rules while neglecting the correlation between the generated sequential rules. To address this issue, we propose a novel algorithm called correlated high-utility sequential rule miner (CoUSR) to integrate the concept of correlation into HUSRM. The proposed algorithm requires not only that each rule be correlated but also that the patterns in the antecedent and consequent of the high-utility sequential rule be correlated. The algorithm adopts a utility-list structure to avoid multiple database scans. Additionally, several pruning strategies are used to improve the algorithm's efficiency and performance. Based on several real-world datasets, subsequent experiments demonstrated that CoUSR is effective and efficient in terms of operation time and memory consumption.

cs.AI↗

arXiv2022

Dosimetric Evaluation of a New Rotating Gamma System for Stereotactic Radiosurgery

Purpose: A novel rotating gamma stereotactic radiosurgery (SRS) system (Galaxy RTi) with real-time image guidance technology has been developed for high-precision SRS and frameless fractionated stereotactic radiotherapy (SRT). This work investigated the dosimetric quality of Galaxy by comparing both the machine treatment parameters and plan dosimetry parameters with those of the widely used Leksell Gamma Knife (LGK) systems for SRS. Methods: The Galaxy RTi system uses 30 cobalt-60 sources on a rotating gantry to deliver non-coplanar, non-overlapping arcs simultaneously while the LGK 4C uses 201 static cobalt-60 sources to deliver noncoplanar beams. Ten brain cancer patients were unarchived from our clinical database, which were previously treated on the LGK 4C. The lesion volume for these cases varied from 0.1 cm3 to 15.4 cm3. Galaxy plans were generated using the Prowess TPS (Prowess, Concord, CA) with the same dose constraints and optimization parameters. Treatment quality metrics such as target coverage (%volume receiving the prescription dose), conformity index (CI), cone size, shots number, beam-on time were compared together with DVH curves and dose distributions. Results: Superior treatment plans were generated for the Galaxy system that met our clinical acceptance criteria. For the 10 patients investigated, the mean CI and dose coverage for Galaxy was 1.77 and 99.24 compared to 1.94 and 99.19 for LGK, respectively. The beam-on time for Galaxy was 17.42 minutes compared to 21.34 minutes for LGK (both assuming dose rates at the initial installation). The dose fall-off is much faster for Galaxy, compared with LGK. Conclusion: The Galaxy RTi system can provide dose distributions with similar quality to that of LGK with less beam-on time and faster dose fall-off. The system is also capable of real-time image guidance at treatment position to ensure accurate dose delivery for SRS.

physics.med-ph↗

arXiv2022

Form factors of $P\to T$ transition within the light-front quark models

In this paper, we calculate the vector, axial-vector and tensor form factors of $P\to T$ transition within the standard light-front~(SLF) and covariant light-front~(CLF) quark models~(QMs). The self-consistency and Lorentz covariance of CLF QM with two types of correspondence schemes are investigated. The zero-mode effects and the spurious $ω$-dependent contributions to the form factors of $P\to T$ transition are analyzed. Employing a self-consistent CLF QM, we present our numerical predictions for the vector, axial-vector and tensor form factors of $c\to (q,s)$~($q=u,d$) induced $D \to (a_2,K^*_2)$, $D_s \to (K^*_2,f'_{2})$, $η_c(1S) \to (D^*_2,D^*_{s2})$, $ B_c \to (B^*_2,B^*_{s2})$ transitions and $b\to (q,s,c)$ induced $B \to (a_2,K^*_2,D^*_2)$, $B_s \to (K^*_2,f'_2,D^*_{s2})$, $B_c \to (D^*_2,D^*_{s2},χ_{c2}(1P))$, $η_b(1S) \to (B^*_2,B^*_{s2})$ transitions. Finally, in order to test the obtained form factors, the semileptonic $B\to \bar{D}_2^*(2460)\ell^+ν_\ell$~($\ell=e,μ$) and $\bar{D}_2^*(2460)τ^+ν_τ$ decays are studied. It is expected that our results for the form factors of $P\to T$ transition can be applied further to the relevant phenomenological studies of meson decays.

hep-ph↗

arXiv2022

MAF-GNN: Multi-adaptive Spatiotemporal-flow Graph Neural Network for Traffic Speed Forecasting

Traffic forecasting is a core element of intelligent traffic monitoring system. Approaches based on graph neural networks have been widely used in this task to effectively capture spatial and temporal dependencies of road networks. However, these approaches can not effectively define the complicated network topology. Besides, their cascade network structures have limitations in transmitting distinct features in the time and space dimensions. In this paper, we propose a Multi-adaptive Spatiotemporal-flow Graph Neural Network (MAF-GNN) for traffic speed forecasting. MAF-GNN introduces an effective Multi-adaptive Adjacency Matrices Mechanism to capture multiple latent spatial dependencies between traffic nodes. Additionally, we propose Spatiotemporal-flow Modules aiming to further enhance feature propagation in both time and space dimensions. MAF-GNN achieves better performance than other models on two real-world datasets of public traffic network, METR-LA and PeMS-Bay, demonstrating the effectiveness of the proposed approach.

cs.LG↗

arXiv2021

Study of $ B_{u,d,s} \to K_0^(1430) P $ and $K_0^(1430) V$ decays within QCD factorization

We study the nonleptonic charmless $B_{u,d,s} \to K_0^*(1430)P$ $(P=K\,, π)$ and $ K_0^*(1430)V$ $ (V=K^*\,, ρ\,, ω\,, ϕ)$ decays. The amplitudes are calculated within the QCD factorization, and the non-perturbative quantities are evaluated by using a covariant light-front approach. The branching fractions and CP asymmetries of theses decay modes are calculated, some decay modes are first predicted, and some useful relations based on $SU(3)$ flavor symmetry are discussed. Comparing the theoretical results with the current available experimental data, it is found that $K_0^*(1430)$ can be described as the lowest-lying p-wave $(s,u/d)$ state rather than the first excited one.

hep-ph↗

arXiv2021

Anomaly Rule Detection in Sequence Data

Analyzing sequence data usually leads to the discovery of interesting patterns and then anomaly detection. In recent years, numerous frameworks and methods have been proposed to discover interesting patterns in sequence data as well as detect anomalous behavior. However, existing algorithms mainly focus on frequency-driven analytic, and they are challenging to be applied in real-world settings. In this work, we present a new anomaly detection framework called DUOS that enables Discovery of Utility-aware Outlier Sequential rules from a set of sequences. In this pattern-based anomaly detection algorithm, we incorporate both the anomalousness and utility of a group, and then introduce the concept of utility-aware outlier sequential rule (UOSR). We show that this is a more meaningful way for detecting anomalies. Besides, we propose some efficient pruning strategies w.r.t. upper bounds for mining UOSR, as well as the outlier detection. An extensive experimental study conducted on several real-world datasets shows that the proposed DUOS algorithm has a better effectiveness and efficiency. Finally, DUOS outperforms the baseline algorithm and has a suitable scalability.

cs.DB↗

arXiv2021

Flexible Pattern Discovery and Analysis

Based on the analysis of the proportion of utility in the supporting transactions used in the field of data mining, high utility-occupancy pattern mining (HUOPM) has recently attracted widespread attention. Unlike high-utility pattern mining (HUPM), which involves the enumeration of high-utility (e.g., profitable) patterns, HUOPM aims to find patterns representing a collection of existing transactions. In practical applications, however, not all patterns are used or valuable. For example, a pattern might contain too many items, that is, the pattern might be too specific and therefore lack value for users in real life. To achieve qualified patterns with a flexible length, we constrain the minimum and maximum lengths during the mining process and introduce a novel algorithm for the mining of flexible high utility-occupancy patterns. Our algorithm is referred to as HUOPM+. To ensure the flexibility of the patterns and tighten the upper bound of the utility-occupancy, a strategy called the length upper-bound (LUB) is presented to prune the search space. In addition, a utility-occupancy nested list (UO-nlist) and a frequency-utility-occupancy table (FUO-table) are employed to avoid multiple scans of the database. Evaluation results of the subsequent experiments confirm that the proposed algorithm can effectively control the length of the derived patterns, for both real-world and synthetic datasets. Moreover, it can decrease the execution time and memory consumption.

cs.DB↗

arXiv2021

Improving Computational Efficiency in Visual Reinforcement Learning via Stored Embeddings

Recent advances in off-policy deep reinforcement learning (RL) have led to impressive success in complex tasks from visual observations. Experience replay improves sample-efficiency by reusing experiences from the past, and convolutional neural networks (CNNs) process high-dimensional inputs effectively. However, such techniques demand high memory and computational bandwidth. In this paper, we present Stored Embeddings for Efficient Reinforcement Learning (SEER), a simple modification of existing off-policy RL methods, to address these computational and memory requirements. To reduce the computational overhead of gradient updates in CNNs, we freeze the lower layers of CNN encoders early in training due to early convergence of their parameters. Additionally, we reduce memory requirements by storing the low-dimensional latent vectors for experience replay instead of high-dimensional images, enabling an adaptive increase in the replay buffer capacity, a useful technique in constrained-memory settings. In our experiments, we show that SEER does not degrade the performance of RL agents while significantly saving computation and memory across a diverse set of DeepMind Control environments and Atari games.

cs.LG↗

arXiv2021

Decision Transformer: Reinforcement Learning via Sequence Modeling

We introduce a framework that abstracts Reinforcement Learning (RL) as a sequence modeling problem. This allows us to draw upon the simplicity and scalability of the Transformer architecture, and associated advances in language modeling such as GPT-x and BERT. In particular, we present Decision Transformer, an architecture that casts the problem of RL as conditional sequence modeling. Unlike prior approaches to RL that fit value functions or compute policy gradients, Decision Transformer simply outputs the optimal actions by leveraging a causally masked Transformer. By conditioning an autoregressive model on the desired return (reward), past states, and actions, our Decision Transformer model can generate future actions that achieve the desired return. Despite its simplicity, Decision Transformer matches or exceeds the performance of state-of-the-art model-free offline RL baselines on Atari, OpenAI Gym, and Key-to-Door tasks.

cs.LG↗

arXiv2021

State Entropy Maximization with Random Encoders for Efficient Exploration

Recent exploration methods have proven to be a recipe for improving sample-efficiency in deep reinforcement learning (RL). However, efficient exploration in high-dimensional observation spaces still remains a challenge. This paper presents Random Encoders for Efficient Exploration (RE3), an exploration method that utilizes state entropy as an intrinsic reward. In order to estimate state entropy in environments with high-dimensional observations, we utilize a k-nearest neighbor entropy estimator in the low-dimensional representation space of a convolutional encoder. In particular, we find that the state entropy can be estimated in a stable and compute-efficient manner by utilizing a randomly initialized encoder, which is fixed throughout training. Our experiments show that RE3 significantly improves the sample-efficiency of both model-free and model-based RL methods on locomotion and navigation tasks from DeepMind Control Suite and MiniGrid benchmarks. We also show that RE3 allows learning diverse behaviors without extrinsic rewards, effectively improving sample-efficiency in downstream tasks. Source code and videos are available at https://sites.google.com/view/re3-rl.

cs.LG↗

arXiv2020

Ising Model Optimization Problems on a FPGA Accelerated Restricted Boltzmann Machine

Optimization problems, particularly NP-Hard Combinatorial Optimization problems, are some of the hardest computing problems with no known polynomial time algorithm existing. Recently there has been interest in using dedicated hardware to accelerate the solution to these problems, with physical annealers and quantum adiabatic computers being some of the state of the art. In this work we demonstrate usage of the Restricted Boltzmann Machine (RBM) as a stochastic neural network capable of solving these problems efficiently. We show that by mapping the RBM onto a reconfigurable Field Programmable Gate Array (FPGA), we can effectively hardware accelerate the RBM's stochastic sampling algorithm. We benchmark the RBM against the DWave 2000Q Quantum Adiabatic Computer and the Optical Coherent Ising Machine on two such optimization problems: the MAX-CUT problem and finding the ground state of a Sherrington-Kirkpatrick (SK) spin glass. On these problems, the hardware accelerated RBM shows best in class performance compared to these other accelerators, with an empirical scaling performance of $\mathcal{O}(e^{-N})$ for probability of reaching the ground state compared to a similar empirical $\mathcal{O}(e^{-N})$ for the CIM (with the RBM showing a constant factor of improvement over the CIM) and empirical $\mathcal{O}(e^{-N^2})$ for the DWave Annealer. The results show up to $10^7$x and $10^5$x time to solution improvement compared to the DWave 2000Q on the MAX-CUT and SK problems respectively, along with a $150$x and $1000$x performance increase compared to the Coherent Ising Machine annealer on those problems. By using commodity hardware running at room temperature for acceleration, the RBM also has greater potential for immediate and scalable use.

cs.AR↗

arXiv2020

Pushing the Physical Limits of IoT Devices with Programmable Metasurfaces

Small, low-cost IoT devices are typically equipped with only a single, low-quality antenna, significantly limiting communication range and link quality. In particular, these antennas are typically linearly polarized and therefore susceptible to polarization mismatch, which can easily cause 10-15 dBm of link loss on communication to and from such devices. In this work, we highlight this under-appreciated issue and propose the augmentation of IoT deployment environments with programmable, RF-sensitive surfaces made of metamaterials. Our smart meta-surface mitigates polarization mismatch by rotating the polarization of signals that pass through or reflect off the surface. We integrate our metasurface into an IoT network as LAMA, a Low-power Lattice of Actuated Metasurface Antennas, designed for the pervasively used 2.4 GHz ISM band. We optimize LAMA's metasurface design for both low transmission loss and low cost, to facilitate deployment at scale. We then build an end-to-end system that actuates the metasurface structure to optimize for link performance in real time. Our experimental prototype-based evaluation demonstrates gains in link power of up to 15 dBm, and wireless capacity improvements of 100 and 180 Kbit/s/Hz in through-surface and surface-reflective scenarios, respectively, attributable to the polarization rotation properties of LAMA'S metasurface.

cs.NI↗

arXiv2020

Discovering High Utility-Occupancy Patterns from Uncertain Data

It is widely known that there is a lot of useful information hidden in big data, leading to a new saying that "data is money." Thus, it is prevalent for individuals to mine crucial information for utilization in many real-world applications. In the past, studies have considered frequency. Unfortunately, doing so neglects other aspects, such as utility, interest, or risk. Thus, it is sensible to discover high-utility itemsets (HUIs) in transaction databases while utilizing not only the quantity but also the predefined utility. To find patterns that can represent the supporting transaction, a recent study was conducted to mine high utility-occupancy patterns whose contribution to the utility of the entire transaction is greater than a certain value. Moreover, in realistic applications, patterns may not exist in transactions but be connected to an existence probability. In this paper, a novel algorithm, called High-Utility-Occupancy Pattern Mining in Uncertain databases (UHUOPM), is proposed. The patterns found by the algorithm are called Potential High Utility Occupancy Patterns (PHUOPs). This algorithm divides user preferences into three factors, including support, probability, and utility occupancy. To reduce memory cost and time consumption and to prune the search space in the algorithm as mentioned above, probability-utility-occupancy list (PUO-list) and probability-frequency-utility table (PFU-table) are used, which assist in providing the downward closure property. Furthermore, an original tree structure, called support count tree (SC-tree), is constructed as the search space of the algorithm. Finally, substantial experiments were conducted to evaluate the performance of proposed UHUOPM algorithm on both real-life and synthetic datasets, particularly in terms of effectiveness and efficiency.

cs.DB↗

arXiv2020

SASO: Joint 3D Semantic-Instance Segmentation via Multi-scale Semantic Association and Salient Point Clustering Optimization

We propose a novel 3D point cloud segmentation framework named SASO, which jointly performs semantic and instance segmentation tasks. For semantic segmentation task, inspired by the inherent correlation among objects in spatial context, we propose a Multi-scale Semantic Association (MSA) module to explore the constructive effects of the semantic context information. For instance segmentation task, different from previous works that utilize clustering only in inference procedure, we propose a Salient Point Clustering Optimization (SPCO) module to introduce a clustering procedure into the training process and impel the network focusing on points that are difficult to be distinguished. In addition, because of the inherent structures of indoor scenes, the imbalance problem of the category distribution is rarely considered but severely limits the performance of 3D scene perception. To address this issue, we introduce an adaptive Water Filling Sampling (WFS) algorithm to balance the category distribution of training data. Extensive experiments demonstrate that our method outperforms the state-of-the-art methods on benchmark datasets in both semantic segmentation and instance segmentation tasks.

cs.CV↗