arXiv subjects

Yanjun Li

Publications and source records attributed to Yanjun Li.

70 records · Page 4Linked to original sources

arXiv2017

Unified Theory for Recovery of Sparse Signals in a General Transform Domain

Compressed sensing provided a data-acquisition paradigm for sparse signals. Remarkably, it has been shown that practical algorithms provide robust recovery from noisy linear measurements acquired at a near optimal sampling rate. In many real-world applications, a signal of interest is typically sparse not in the canonical basis but in a certain transform domain, such as wavelets or the finite difference. The theory of compressed sensing was extended to the analysis sparsity model but known extensions are limited to specific choices of sensing matrix and sparsifying transform. In this paper, we propose a unified theory for robust recovery of sparse signals in a general transform domain by convex programming. In particular, our results apply to general acquisition and sparsity models and show how the number of measurements for recovery depends on properties of measurement and sparsifying transforms. Moreover, we also provide extensions of our results to the scenarios where the atoms in the transform has varying incoherence parameters and the unknown signal exhibits a structured sparsity pattern. In particular, for the partial Fourier recovery of sparse signals over a circulant transform, our main results suggest a uniformly random sampling. Numerical results demonstrate that the variable density random sampling by our main results provides superior recovery performance over known sampling strategies.

cs.IT↗

arXiv2017

Strategically knowing how

In this paper, we propose a single-agent logic of goal-directed knowing how extending the standard epistemic logic of knowing that with a new knowing how operator. The semantics of the new operator is based on the idea that knowing how to achieve $ϕ$ means that there exists a (uniform) strategy such that the agent knows that it can make sure $ϕ$. We give an intuitive axiomatization of our logic and prove the soundness, completeness, and decidability of the logic. The crucial axioms relating knowing that and knowing how illustrate our understanding of knowing how in this setting. This logic can be used in representing both knowledge-that and knowledge-how.

cs.AI↗

arXiv2016

Joint Dimensionality Reduction for Two Feature Vectors

Many machine learning problems, especially multi-modal learning problems, have two sets of distinct features (e.g., image and text features in news story classification, or neuroimaging data and neurocognitive data in cognitive science research). This paper addresses the joint dimensionality reduction of two feature vectors in supervised learning problems. In particular, we assume a discriminative model where low-dimensional linear embeddings of the two feature vectors are sufficient statistics for predicting a dependent variable. We show that a simple algorithm involving singular value decomposition can accurately estimate the embeddings provided that certain sample complexities are satisfied, without specifying the nonlinear link function (regressor or classifier). The main results establish sample complexities under multiple settings. Sample complexities for different link functions only differ by constant factors.

stat.ML↗

arXiv2016

Achieving while maintaining: A logic of knowing how with intermediate constraints

In this paper, we propose a ternary knowing how operator to express that the agent knows how to achieve $ϕ$ given $ψ$ while maintaining $χ$ in-between. It generalizes the logic of goal-directed knowing how proposed by Yanjing Wang 2015 'A logic of knowing how'. We give a sound and complete axiomatization of this logic.

cs.LO↗

arXiv2016

A Dynamic Epistemic Framework for Conformant Planning

In this paper, we introduce a lightweight dynamic epistemic logical framework for automated planning under initial uncertainty. We reduce plan verification and conformant planning to model checking problems of our logic. We show that the model checking problem of the iteration-free fragment is PSPACE-complete. By using two non-standard (but equivalent) semantics, we give novel model checking algorithms to the full language and the iteration-free language.

cs.AI↗

arXiv2016

Stability and steady state analysis of distributed cooperative droop controlled DC microgrids

Distributed cooperative droop control consisting of the primary decentralized droop control and the {secondary} distributed correction control is studied in this paper, which aims to achieve an exact current sharing between generators, worked in the voltage control mode, of DC microgrids. For the DC microgrids with the distributed cooperative droop control, the dynamic stability has not been well investigated although its steady performance has been widely reported. This paper focuses on the stability problem and shows it is equivalent to the semistability problem of a class of second-order matrix systems. Some further sufficient conditions as well followed. The steady state is analyzed deeply for some special cases. A DC microgrid of three nodes is simulated on the Matlab/Simulink platform to illustrate the efficacy of analytic results.

math.OC↗

arXiv2016

Cooperative output regulation of multi-agent network systems with dynamic edges

This paper investigates a new class of linear multi-agent network systems, in which nodes are coupled by dynamic edges in the sense that each edge has a dynamic system attached as well. The outputs of the edge dynamic systems form the external inputs of the node dynamic systems, which are termed "neighboring inputs" representing the coupling actions between nodes. The outputs of the node dynamic systems are the inputs of the edge dynamic systems. Several cooperative output regulation problems are posed, including output synchronization, output cooperation and master-slave output cooperation. Output cooperation is specified as making the neighboring input, a weighted sum of edge outputs, track a predefined trajectory by cooperation of node outputs. Distributed cooperative output regulation controllers depending on local state and neighboring inputs are presented, which are designed by combining feedback passivity theories and the internal model principle. A simulation example on the cooperative current control of an electrical network illustrates the potential applications of the analytical results.

math.DS↗

arXiv2015

Identifiability and Stability in Blind Deconvolution under Minimal Assumptions

Blind deconvolution (BD) arises in many applications. Without assumptions on the signal and the filter, BD does not admit a unique solution. In practice, subspace or sparsity assumptions have shown the ability to reduce the search space and yield the unique solution. However, existing theoretical analysis on uniqueness in BD is rather limited. In an earlier paper, we provided the first algebraic sample complexities for BD that hold for almost all bases or frames. We showed that for BD of a pair of vectors in $\mathbb{C}^n$, with subspace constraints of dimensions $m_1$ and $m_2$, respectively, a sample complexity of $n\geq m_1m_2$ is sufficient. This result is suboptimal, since the number of degrees of freedom is merely $m_1+m_2-1$. We provided analogus results, with similar suboptimality, for BD with sparsity or mixed subspace and sparsity constraints. In this paper, taking advantage of the recent progress on the information-theoretic limits of unique low-rank matrix recovery, we finally bridge this gap, and derive an optimal sample complexity result for BD with generic bases or frames. We show that for BD of an arbitrary pair (resp. all pairs) of vectors in $\mathbb{C}^n$, with sparsity constraints of sparsity levels $s_1$ and $s_2$, a sample complexity of $n > s_1+s_2$ (resp. $n > 2(s_1+s_2)$) is sufficient. We also present analogous results for BD with subspace constraints or mixed constraints, with the subspace dimension replacing the sparsity level. Last but not least, in all the above scenarios, if the bases or frames follow a probabilistic distribution specified in the paper, the recovery is not only unique, but also stable against small perturbations in the measurements, under the same sample complexities.

cs.IT↗

arXiv2015

Optimal Sample Complexity for Blind Gain and Phase Calibration

Blind gain and phase calibration (BGPC) is a structured bilinear inverse problem, which arises in many applications, including inverse rendering in computational relighting (albedo estimation with unknown lighting), blind phase and gain calibration in sensor array processing, and multichannel blind deconvolution. The fundamental question of the uniqueness of the solutions to such problems has been addressed only recently. In a previous paper, we proposed studying the identifiability in bilinear inverse problems up to transformation groups. In particular, we studied several special cases of blind gain and phase calibration, including the cases of subspace and joint sparsity models on the signals, and gave sufficient and necessary conditions for identifiability up to certain transformation groups. However, there were gaps between the sample complexities in the sufficient conditions and the necessary conditions. In this paper, under a mild assumption that the signals and models are generic, we bridge the gaps by deriving tight sufficient conditions with optimal sample complexities.

cs.IT↗

arXiv2015

Blind Recovery of Sparse Signals from Subsampled Convolution

Subsampled blind deconvolution is the recovery of two unknown signals from samples of their convolution. To overcome the ill-posedness of this problem, solutions based on priors tailored to specific application have been developed in practical applications. In particular, sparsity models have provided promising priors. However, in spite of empirical success of these methods in many applications, existing analyses are rather limited in two main ways: by disparity between the theoretical assumptions on the signal and/or measurement model versus practical setups; or by failure to provide a performance guarantee for parameter values within the optimal regime defined by the information theoretic limits. In particular, it has been shown that a naive sparsity model is not a strong enough prior for identifiability in the blind deconvolution problem. Instead, in addition to sparsity, we adopt a conic constraint, which enforces spectral flatness of the signals. Under this prior, we provide an iterative algorithm that achieves guaranteed performance in blind deconvolution at near optimal sample complexity. Numerical results show the empirical performance of the iterative algorithm agrees with the performance guarantee.

cs.IT↗

arXiv2015

RF-Based Charger Placement for Duty Cycle Guarantee in Battery-Free Sensor Networks

Battery-free sensor networks have emerged as a promising solution to conquer the lifetime limitation of battery-powered systems. In this paper, we study a sensor network built from battery-free sensor nodes which harvest energy from radio frequency (RF) signals transmitted by RF-based chargers, e.g., radio frequency identification (RFID) readers. Due to the insufficiency of harvested energy, the sensor nodes have to work in duty cycles to harvest enough energy before turning active and performing tasks. One fundamental issue in this kind of network design is how to deploy the chargers to ensure that the battery-free nodes can maintain a designated duty cycle for continuous operation. Based on a new wireless recharge model, we formulate the charger placement problem for node's duty cycle guarantee as a constrained optimization problem. We develop both greedy and efficient heuristics for solving the problem and validate our solutions through extensive simulations. The simulation results show that the proposed particle swarm optimization (PSO)-based divide-and-conquer approach can effectively reduce the number of chargers compared with the greedy approach.

cs.NI↗

arXiv2015

The Universality of Cancer

Cancer has been characterized as a constellation of hundreds of diseases differing in underlying mutations and depending on cellular environments. Carcinogenesis as a stochastic physical process has been studied for over sixty years, but there is no accepted standard model. We show that the hazard rates of all cancers are characterized by a simple dynamic stochastic process on a half-line, with a universal linear restoring force balancing a universal simple Brownian motion starting from a universal initial distribution. Only a critical radius defining the transition from normal to tumorigenic genomes distinguishes between different cancer types when time is measured in cell--cycle units. Reparametrizing to chronological time units introduces two additional parameters: the onset of cellular senescence with age and the time interval over which this cessation in replication takes place. This universality implies that there may exist a finite separation between normal cells and tumorigenic cells in all tissue types that may be a viable target for both early detection and preventive therapy.

q-bio.TO↗

arXiv2015

Identifiability in Blind Deconvolution with Subspace or Sparsity Constraints

Blind deconvolution (BD), the resolution of a signal and a filter given their convolution, arises in many applications. Without further constraints, BD is ill-posed. In practice, subspace or sparsity constraints have been imposed to reduce the search space, and have shown some empirical success. However, existing theoretical analysis on uniqueness in BD is rather limited. As an effort to address the still mysterious question, we derive sufficient conditions under which two vectors can be uniquely identified from their circular convolution, subject to subspace or sparsity constraints. These sufficient conditions provide the first algebraic sample complexities for BD. We first derive a sufficient condition that applies to almost all bases or frames. For blind deconvolution of vectors in $\mathbb{C}^n$, with two subspace constraints of dimensions $m_1$ and $m_2$, the required sample complexity is $n\geq m_1m_2$. Then we impose a sub-band structure on one basis, and derive a sufficient condition that involves a relaxed sample complexity $n\geq m_1+m_2-1$, which we show to be optimal. We present the extensions of these results to BD with sparsity constraints or mixed constraints, with the sparsity level replacing the subspace dimension. The cost for the unknown support in this case is an extra factor of 2 in the sample complexity.

cs.IT↗

arXiv2015

A Unified Framework for Identifiability Analysis in Bilinear Inverse Problems with Applications to Subspace and Sparsity Models

Bilinear inverse problems (BIPs), the resolution of two vectors given their image under a bilinear mapping, arise in many applications. Without further constraints, BIPs are usually ill-posed. In practice, properties of natural signals are exploited to solve BIPs. For example, subspace constraints or sparsity constraints are imposed to reduce the search space. These approaches have shown some success in practice. However, there are few results on uniqueness in BIPs. For most BIPs, the fundamental question of under what condition the problem admits a unique solution, is yet to be answered. For example, blind gain and phase calibration (BGPC) is a structured bilinear inverse problem, which arises in many applications, including inverse rendering in computational relighting (albedo estimation with unknown lighting), blind phase and gain calibration in sensor array processing, and multichannel blind deconvolution (MBD). It is interesting to study the uniqueness of such problems. In this paper, we define identifiability of a BIP up to a group of transformations. We derive necessary and sufficient conditions for such identifiability, i.e., the conditions under which the solutions can be uniquely determined up to the transformation group. Applying these results to BGPC, we derive sufficient conditions for unique recovery under several scenarios, including subspace, joint sparsity, and sparsity models. For BGPC with joint sparsity or sparsity constraints, we develop a procedure to compute the relevant transformation groups. We also give necessary conditions in the form of tight lower bounds on sample complexities, and demonstrate the tightness of these bounds by numerical experiments. The results for BGPC not only demonstrate the application of the proposed general framework for identifiability analysis, but are also of interest in their own right.

cs.IT↗

arXiv2013

Synchronized output regulation of nonlinear multi-agent systems

This paper considers the synchronized output regulation (SOR) problem of nonlinear multi-agent systems with switching graph. The SOR means that all agents regulate their outputs to synchronize on the output of a predefined common exosystem. Each agent constructs its local exosystem with the same dynamics as that of the common exosystem and exchanges the state information of the local exosystem. It is shown that the SOR is solvable under the assumptions same as that for nonlinear output regulation of a single agent, if the switching graph satisfies the bounded interconnectivity times condition. Both state feedback and output feedback are addressed. A numerical simulation is made to show the efficacy of the analytic results.

math.OC↗

arXiv2008

Wireless Sensor/Actuator Network Design for Mobile Control Applications

Wireless sensor/actuator networks (WSANs) are emerging as a new generation of sensor networks. Serving as the backbone of control applications, WSANs will enable an unprecedented degree of distributed and mobile control. However, the unreliability of wireless communications and the real-time requirements of control applications raise great challenges for WSAN design. With emphasis on the reliability issue, this paper presents an application-level design methodology for WSANs in mobile control applications. The solution is generic in that it is independent of the underlying platforms, environment, control system models, and controller design. To capture the link quality characteristics in terms of packet loss rate, experiments are conducted on a real WSAN system. From the experimental observations, a simple yet efficient method is proposed to deal with unpredictable packet loss on actuator nodes. Trace-based simulations give promising results, which demonstrate the effectiveness of the proposed approach.

cs.NI↗