Sciweavers

123 search results - page 8 / 25
» Robust binary least squares: Relaxations and algorithms
Sort
View
ICML
2009
IEEE
15 years 10 months ago
Binary action search for learning continuous-action control policies
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
Jason Pazis, Michail G. Lagoudakis
ICASSP
2008
IEEE
15 years 3 months ago
Low-rank covariance matrix tapering for robust adaptive beamforming
Covariance matrix tapering (CMT) is a popular approach to improve the robustness of adaptive beamformers against moving or wideband interferers. In this paper, we develop a comput...
Michael Rübsamen, Christian Gerlach, Alex B. ...
INFORMATICALT
2000
99views more  INFORMATICALT 2000»
14 years 9 months ago
Closed-loop Robust Identification Using the Direct Approach
Abstract. The aim of the given paper is a development of the direct approach used for the estimation of parameters of a closed-loop discrete-time dynamic system in the case of addi...
Rimantas Pupeikis
CVPR
2005
IEEE
15 years 11 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
14 years 9 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....