Ali H. Sayed

Bio: Ali H. Sayed is an academic researcher from École Polytechnique Fédérale de Lausanne. The author has contributed to research in topics: Adaptive filter & Optimization problem. The author has an hindex of 81, co-authored 728 publications receiving 36030 citations. Previous affiliations of Ali H. Sayed include Harbin Engineering University & University of California, Los Angeles.

Distributed Policy Evaluation Under Multiple Behavior Strategies

Abstract: We apply diffusion strategies to develop a fully-distributed cooperative reinforcement learning algorithm in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment. The algorithm can also be applied to off-policy learning, meaning that the agents can predict the response to a behavior different from the actual policies they are following. The proposed distributed strategy is efficient, with linear complexity in both computation time and memory footprint. We provide a mean-square-error performance analysis and establish convergence under constant step-size updates, which endow the network with continuous learning capabilities. The results show a clear gain from cooperation: when the individual agents can estimate the solution, cooperation increases stability and reduces bias and variance of the prediction error; but, more importantly, the network is able to approach the optimal solution even when none of the individual agents can (e.g., when the individual behavior policies restrict each agent to sample a small portion of the state space).

A Minimum Co-User Interference Approach for Multi-User MIMO Downlink Precoding

Abstract: This paper proposes multi-user precoding schemes for MIMO wireless networks. We design precoders that minimize the interference power caused by a user on all other users, as opposed to forcefully nulling the interference. The resulting scheme relaxes the traditional constraint on the number of transmit and receive antennas.

Mitigation of clipping in sensors

Abstract: One major source of nonlinear distortion in analog-to-digital converters (ADCs) is clipping. The problem introduces spurious noise across the bandwidth of the sampled data. Prior works recover the signal from the acquired samples by relying on oversampling or on the assumption of vacant frequency bands and on the use of sparse signal representations. In this work, we propose a different approach, which uses two streams of data to mitigate the clipping distortion. Simulation results show an SNR improvement of 9dB, while the conventional approaches may even degrade the SNR in some situations.

Multi-Agent Fully Decentralized Off-Policy Learning with Linear Convergence Rates.

Abstract: This work develops a fully decentralized multi-agent algorithm for policy evaluation. The proposed scheme can be applied to two distinct scenarios. In the first scenario, a collection of agents have distinct datasets gathered following different behavior policies (none of which is required to explore the full state space) in different instances of the same environment and they all collaborate to evaluate a common target policy. The network approach allows for efficient exploration of the state space and allows all agents to converge to the optimal solution even in situations where neither agent can converge on its own without cooperation. The second scenario is that of multi-agent games, in which the state is global and rewards are local. In this scenario, agents collaborate to estimate the value function of a target team policy. The proposed algorithm combines off-policy learning, eligibility traces and linear function approximation. The proposed algorithm is of the variance-reduced kind and achieves linear convergence with $O(1)$ memory requirements. The linear convergence of the algorithm is established analytically, and simulations are used to illustrate the effectiveness of the method.

Post-translational regulation enables robust p53 regulation

Abstract: The tumor suppressor protein p53 plays important roles in DNA damage repair, cell cycle arrest and apoptosis. Due to its critical functions, the level of p53 is tightly regulated by a negative feedback mechanism to increase its tolerance towards fluctuations and disturbances. Interestingly, the p53 level is controlled by post-translational regulation rather than transcriptional regulation in this feedback mechanism. We analyzed the dynamics of this feedback to understand whether post-translational regulation provides any advantages over transcriptional regulation in regard to disturbance rejection. When a disturbance happens, even though negative feedback reduces the steady-state error, it can cause a system to become less stable and transiently overshoots, which may erroneously trigger downstream reactions. Therefore, the system needs to balance the trade-off between steady-state and transient errors. Feedback control and adaptive estimation theories revealed that post-translational regulation achieves a better trade-off than transcriptional regulation, contributing to a more steady level of p53 under the influence of noise and disturbances. Furthermore, post-translational regulation enables cells to respond more promptly to stress conditions with consistent amplitude. However, for better disturbance rejection, the p53- Mdm2 negative feedback has to pay a price of higher stochastic noise. Our analyses suggest that the p53-Mdm2 feedback favors regulatory mechanisms that provide the optimal trade-offs for dynamic control.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Tensor Decompositions and Applications

Abstract: This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or $N$-way array. Decompositions of higher-order tensors (i.e., $N$-way arrays with $N \geq 3$) have applications in psycho-metrics, chemometrics, signal processing, numerical linear algebra, computer vision, numerical analysis, data mining, neuroscience, graph analysis, and elsewhere. Two particular tensor decompositions can be considered to be higher-order extensions of the matrix singular value decomposition: CANDECOMP/PARAFAC (CP) decomposes a tensor as a sum of rank-one tensors, and the Tucker decomposition is a higher-order form of principal component analysis. There are many other tensor decompositions, including INDSCAL, PARAFAC2, CANDELINC, DEDICOM, and PARATUCK2 as well as nonnegative variants of all of the above. The N-way Toolbox, Tensor Toolbox, and Multilinear Engine are examples of software packages for working with tensors.

Random graphs

Abstract: We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Table Of Integrals Series And Products

Abstract: Thank you very much for downloading table of integrals series and products. Maybe you have knowledge that, people have look hundreds times for their chosen books like this table of integrals series and products, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some harmful virus inside their laptop. table of integrals series and products is available in our book collection an online access to it is set as public so you can get it instantly. Our book servers saves in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the table of integrals series and products is universally compatible with any devices to read.