Searcharxiv⌕ Search

arXiv subjects

Xiao Ma

Publications and source records attributed to Xiao Ma.

At least 163 records · Page 9Linked to original sources

Discriminative Particle Filter Reinforcement Learning for Complex Partial Observations

Deep reinforcement learning is successful in decision making for sophisticated games, such as Atari, Go, etc. However, real-world decision making often requires reasoning with partial information extracted from complex visual observations. This paper presents Discriminative Particle Filter Reinforcement Learning (DPFRL), a new reinforcement learning framework for complex partial observations. DPFRL encodes a differentiable particle filter in the neural network policy for explicit reasoning with partial observations over time. The particle filter maintains a belief using learned discriminative update, which is trained end-to-end for decision making. We show that using the discriminative update instead of standard generative models results in significantly improved performance, especially for tasks with complex visual observations, because they circumvent the difficulty of modeling complex observations that are irrelevant to decision making. In addition, to extract features from the particle belief, we propose a new type of belief feature based on the moment generating function. DPFRL outperforms state-of-the-art POMDP RL models in Flickering Atari Games, an existing POMDP RL benchmark, and in Natural Flickering Atari Games, a new, more challenging POMDP RL benchmark introduced in this paper. Further, DPFRL performs well for visual navigation with real-world data in the Habitat environment.

cs.LG↗

Analysis on Computation-Intensive Status Update in Mobile Edge Computing

In status update scenarios, the freshness of information is measured in terms of age-of-information (AoI), which essentially reflects the timeliness for real-time applications to transmit status update messages to a remote controller. For some applications, computational expensive and time consuming data processing is inevitable for status information of messages to be displayed. Mobile edge servers are equipped with adequate computation resources and they are placed close to users. Thus, mobile edge computing (MEC) can be a promising technology to reduce AoI for computation-intensive messages. In this paper, we study the AoI for computation-intensive messages with MEC, and consider three computing schemes: local computing, remote computing at the MEC server, and partial computing, i.e., some part of computing tasks are performed locally, and the rest is executed at the MEC server. Zero-wait policy is adopted in all three schemes. Specifically, in local computing, a new message is generated immediately after the previous one is revealed by computing. While in remote computing and partial computing, a new message is generated once the previous one is received by the remote MEC server. With infinite queue size and exponentially distributed transmission time, closed-form average AoI for exponentially distributed computing time is derived for the three computing schemes. For deterministic computing time, the average AoI is analyzed numerically. Simulation results show that by carefully partitioning the computing tasks, the average AoI in partial computing is the smallest compared to local computing and remote computing. The results also indicate numerically the conditions on which remote computing attains smaller average AoI compared with local computing.

cs.IT↗

AoI-Delay Tradeoff in Mobile Edge Caching with Freshness-Aware Content Refreshing

Mobile edge caching can effectively reduce service delay but may introduce information staleness, calling for timely content refreshing. However, content refreshing consumes additional transmission resources and may degrade the delay performance of mobile systems. In this work, we propose a freshness-aware refreshing scheme to balance the service delay and content freshness measured by Age of Information (AoI). Specifically, the cached content items will be refreshed to the up-to-date version upon user requests if the AoI exceeds a certain threshold (named as refreshing window). The average AoI and service delay are derived in closed forms approximately, which reveals an AoI-delay tradeoff relationship with respect to the refreshing window. In addition, the refreshing window is optimized to minimize the average delay while meeting the AoI requirements, and the results indicate to set a smaller refreshing window for the popular content items. Extensive simulations are conducted on the OMNeT++ platform to validate the analytical results. The results indicate that the proposed scheme can restrain frequent refreshing as the request arrival rate increases, whereby the average delay can be reduced by around 80% while maintaining the AoI below one second in heavily-loaded scenarios.

cs.NI↗

Cooperative Service Caching and Workload Scheduling in Mobile Edge Computing

Mobile edge computing is beneficial to reduce service response time and core network traffic by pushing cloud functionalities to network edge. Equipped with storage and computation capacities, edge nodes can cache services of resource-intensive and delay-sensitive mobile applications and process the corresponding computation tasks without outsourcing to central clouds. However, the heterogeneity of edge resource capacities and inconsistence of edge storage and computation capacities make it difficult to jointly fully utilize the storage and computation capacities when there is no cooperation among edge nodes. To address this issue, we consider cooperation among edge nodes and investigate cooperative service caching and workload scheduling in mobile edge computing. This problem can be formulated as a mixed integer nonlinear programming problem, which has non-polynomial computation complexity. To overcome the challenges of subproblem coupling, computation-communication tradeoff, and edge node heterogeneity, we develop an iterative algorithm called ICE. This algorithm is designed based on Gibbs sampling, which has provably near-optimal results, and the idea of water filling, which has polynomial computation complexity. Simulations are conducted and the results demonstrate that our algorithm can jointly reduce the service response time and the outsourcing traffic compared with the benchmark algorithms.

cs.NI↗

Systematic Convolutional Low Density Generator Matrix Code

In this paper, we propose a systematic low density generator matrix (LDGM) code ensemble, which is defined by the Bernoulli process. We prove that, under maximum likelihood (ML) decoding, the proposed ensemble can achieve the capacity of binary-input output symmetric (BIOS) memoryless channels in terms of bit error rate (BER). The proof technique reveals a new mechanism, different from lowering down frame error rate (FER), that the BER can be lowered down by assigning light codeword vectors to light information vectors. The finite length performance is analyzed by deriving an upper bound and a lower bound, both of which are shown to be tight in the high signal-to-noise ratio (SNR) region. To improve the waterfall performance, we construct the systematic convolutional LDGM (SC-LDGM) codes by a random splitting process. The SC-LDGM codes are easily configurable in the sense that any rational code rate can be realized without complex optimization. As a universal construction, the main advantage of the SC-LDGM codes is their near-capacity performance in the waterfall region and predictable performance in the error-floor region that can be lowered down to any target as required by increasing the density of the uncoupled LDGM codes. Numerical results are also provided to verify our analysis.

cs.IT↗

Particle Filter Recurrent Neural Networks

Recurrent neural networks (RNNs) have been extraordinarily successful for prediction with sequential data. To tackle highly variable and noisy real-world data, we introduce Particle Filter Recurrent Neural Networks (PF-RNNs), a new RNN family that explicitly models uncertainty in its internal structure: while an RNN relies on a long, deterministic latent state vector, a PF-RNN maintains a latent state distribution, approximated as a set of particles. For effective learning, we provide a fully differentiable particle filter algorithm that updates the PF-RNN latent state distribution according to the Bayes rule. Experiments demonstrate that the proposed PF-RNNs outperform the corresponding standard gated RNNs on a synthetic robot localization dataset and 10 real-world sequence prediction datasets for text classification, stock price prediction, etc.

cs.LG↗

Cancellations of Resonances and Long Time Dynamics of Cubic Schrödinger Equation on $\mathbb{T}$

We prove a vanishing property of the normal form transformation of the 1D cubic nonlinear Schrödinger (NLS) equation with periodic boundary conditions on $[0,L]$. We apply this property to quintic resonance interactions and obtain a description of dynamics for time up to $T=\frac{L^2}{ε^4}$, if $L$ is sufficiently large and size of initial data $ε$ is small enough. Since $T$ is the characteristic time of wave turbulence, this result implies the absence of wave turbulence behavior of 1D cubic NLS. Our approach can be adapted to other integrable systems without too many difficulties. In the proof, we develop a correspondence between Feynman diagrams and terms in normal forms, which allows us to calculate the coefficients inductively.

math.AP↗

Ergodic optimization theory for Axiom A flows

In this article, we consider the weighted ergodic optimization problem Axiom A attractors of a $C^2$ flow on a compact smooth manifold. The main result obtained in this paper is that for a generic observable from function space $\mc C^{0,\a}$ ($\a\in(0,1]$) or $\mc C^1$ the minimizing measure is unique and is supported on a periodic orbit.

math.DS↗

Ergodic optimization theory for a class of typical maps

In this article, we consider the weighted ergodic optimization problem of a class of dynamical systems $T:X\to X$ where $X$ is a compact metric space and $T$ is Lipschitz continuous. We show that once $T:X\to X$ satisfies both the {\em Anosov shadowing property }({\bf ASP}) and the {\em Mañé-Conze-Guivarc'h-Bousch property }({\bf MCGBP}), the minimizing measures of generic Hölder observables are unique and supported on a periodic orbit. Moreover, if $T:X\to X$ is a subsystem of a dynamical system $f:M\to M$ (i.e. $X\subset M$ and $f|_X=T$) where $M$ is a compact smooth manifold, the above conclusion holds for $C^1$ observables. Note that a broad class of classical dynamical systems satisfies both ASP and MCGBP, which includes {\em Axiom A attractors, Anosov diffeomorphisms }and {\em uniformly expanding maps}. Therefore, the open problem proposed by Yuan and Hunt in \cite{YH} for $C^1$-observables is solved consequentially.

math.DS↗

Neural Architecture Search Over a Graph Search Space

Neural Architecture Search (NAS) enabled the discovery of state-of-the-art architectures in many domains. However, the success of NAS depends on the definition of the search space. Current search spaces are defined as a static sequence of decisions and a set of available actions for each decision. Each possible sequence of actions defines an architecture. We propose a more expressive class of search space: directed graphs. In our formalism, each decision is a vertex and each action is an edge. This allows us to model iterative and branching architecture design decisions. We demonstrate in simulation, and on image classification experiments, basic iterative and branching search structures, and show that the graph representation improves sample efficiency.

cs.LG↗

AMAD: Adversarial Multiscale Anomaly Detection on High-Dimensional and Time-Evolving Categorical Data

Anomaly detection is facing with emerging challenges in many important industry domains, such as cyber security and online recommendation and advertising. The recent trend in these areas calls for anomaly detection on time-evolving data with high-dimensional categorical features without labeled samples. Also, there is an increasing demand for identifying and monitoring irregular patterns at multiple resolutions. In this work, we propose a unified end-to-end approach to solve these challenges by combining the advantages of Adversarial Autoencoder and Recurrent Neural Network. The model learns data representations cross different scales with attention mechanisms, on which an enhanced two-resolution anomaly detector is developed for both instances and data blocks. Extensive experiments are performed over three types of datasets to demonstrate the efficacy of our method and its superiority over the state-of-art approaches.

cs.LG↗

Free Ride on LDPC Coded Transmission

In this paper, we formulate a new problem to cope with the transmission of extra bits over an existing coded transmission link (referred to as coded payload link) without any cost of extra transmission energy or extra bandwidth. This is possible since a gap to the channel capacity typically exists for a practical code. A new concept, termed as accessible capacity, is introduced to specify the maximum rate at which the superposition transmission of extra bits is reliable and has a negligible effect on the performance of the coded payload link. For a binary-input output-symmetric (BIOS) memoryless channel, the accessible capacity can be characterized as the difference between the channel capacity and the mutual information rate of the coded payload link, which can be numerically evaluated for very short payload codes. For a general payload code, we present a simple lower bound on the accessible capacity, given by the channel capacity minus the coding rate of the payload code. We then focus on the scenarios where low-density parity-check (LDPC) codes are implemented for the payload link. We propose to transmit extra bits by random superposition for encoding, and exhaustive search (with the aid of statistical learning) for decoding. We further propose, by establishing an auxiliary channel (called syndrome channel) induced from "zero-forcing" over the binary field, to transmit extra bits with structured codes such as repetition codes and first-order Reed-Muller (RM) codes. Numerical results show that up to 60 extra bits can be reliably transmitted along with a rate-1/2 LDPC code of length 8064.

cs.IT↗

Network models for characterization of trabecular bone

Trabecular bone is a lightweight, compliant material organized as a web of struts and rods (trabeculae) that erode with age and the onset of bone diseases like osteoporosis, leading to increased fracture risk. The traditional diagnostic marker of osteoporosis, bone mineral density (BMD), has been shown in ex vivo experiments to correlate poorly with fracture resistance when considered on its own, while structural features in conjunction with BMD can explain more of the variation in trabecular bone strength. We develop a network-based model of trabecular bone by creating graphs from micro-computed tomography images of human bone, with weighted links representing trabeculae and nodes representing branch points. These graphs enable calculation of quantitative network metrics to characterize trabecular structure. We also create finite element models of the networks in which each link is represented by a beam, facilitating analysis of the mechanical response of the bone samples to simulated loading. We examine the structural and mechanical properties of trabecular bone at the scale of individual trabeculae (of order 0.1 mm) and at the scale of selected volumes of interest (approximately a few mm), referred to as VOIs. At the VOI scale, we find significant correlations between the stiffness of VOIs and 10 different structural metrics. Individually, the volume fraction of each VOI is most strongly correlated to the stiffness of the VOI. We use multiple linear regression to identify the smallest subset of variables needed to capture the variation in stiffness. In a linear fit, we find that node degree, weighted node degree, Z-orientation, weighted Z-orientation, trabecular spacing, link length, and the number of links are the structural metrics that are most significant (p < 0.05) in capturing the variation of stiffness in trabecular networks.

physics.med-ph↗

Clustered Reinforcement Learning

Exploration strategy design is one of the challenging problems in reinforcement learning~(RL), especially when the environment contains a large state space or sparse rewards. During exploration, the agent tries to discover novel areas or high reward~(quality) areas. In most existing methods, the novelty and quality in the neighboring area of the current state are not well utilized to guide the exploration of the agent. To tackle this problem, we propose a novel RL framework, called \underline{c}lustered \underline{r}einforcement \underline{l}earning~(CRL), for efficient exploration in RL. CRL adopts clustering to divide the collected states into several clusters, based on which a bonus reward reflecting both novelty and quality in the neighboring area~(cluster) of the current state is given to the agent. Experiments on a continuous control task and several \emph{Atari 2600} games show that CRL can outperform other state-of-the-art methods to achieve the best performance in most cases.

cs.LG↗

Differentiable Algorithm Networks for Composable Robot Learning

This paper introduces the Differentiable Algorithm Network (DAN), a composable architecture for robot learning systems. A DAN is composed of neural network modules, each encoding a differentiable robot algorithm and an associated model; and it is trained end-to-end from data. DAN combines the strengths of model-driven modular system design and data-driven end-to-end learning. The algorithms and models act as structural assumptions to reduce the data requirements for learning; end-to-end learning allows the modules to adapt to one another and compensate for imperfect models and algorithms, in order to achieve the best overall system performance. We illustrate the DAN methodology through a case study on a simulated robot system, which learns to navigate in complex 3-D environments with only local visual observations and an image of a partially correct 2-D floor map.

cs.LG↗

When Do People Trust Their Social Groups?

Trust facilitates cooperation and supports positive outcomes in social groups, including member satisfaction, information sharing, and task performance. Extensive prior research has examined individuals' general propensity to trust, as well as the factors that contribute to their trust in specific groups. Here, we build on past work to present a comprehensive framework for predicting trust in groups. By surveying 6,383 Facebook Groups users about their trust attitudes and examining aggregated behavioral and demographic data for these individuals, we show that (1) an individual's propensity to trust is associated with how they trust their groups, (2) smaller, closed, older, more exclusive, or more homogeneous groups are trusted more, and (3) a group's overall friendship-network structure and an individual's position within that structure can also predict trust. Last, we demonstrate how group trust predicts outcomes at both individual and group level such as the formation of new friendship ties.

cs.SI↗

Asymptotic stability of harmonic maps between 2D hyperbolic spaces under the wave map equation. II. Small energy case

In this paper, we prove that the small energy harmonic maps from $\Bbb H^2$ to $\Bbb H^2$ are asymptotically stable under the wave map equation in the subcritical perturbation class. This result may be seen as an example supporting the soliton resolution conjecture for geometric wave equations without equivariant assumptions on the initial data. In this paper, we construct Tao's caloric gauge in the case when nontrivial harmonic map occurs. With the "dynamic separation" the master equation of the heat tension field appears as a semilinear magnetic wave equation. By the endpoint and weighted Strichartz estimates for magnetic wave equations obtained by the first author \cite{Lize1}, the asymptotic stability follows by a bootstrap argument.

math.AP↗