Optimization of loading factor preventing target cancellation
- URL: http://arxiv.org/abs/2010.07010v1
- Date: Fri, 9 Oct 2020 14:04:48 GMT
- Title: Optimization of loading factor preventing target cancellation
- Authors: Boris N. Oreshkin and Peter A. Bakulev
- Abstract summary: The paper presents an iterative algorithm for loading factor optimization based on sample of empirical signal to interference plus noise ratio (SINR)
The proposed solution does not rely on any assumptions regarding the structure empirical covariance matrix and signal penetration model.
- Score: 11.193504036335503
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Adaptive algorithms based on sample matrix inversion belong to an important
class of algorithms used in radar target detection to overcome prior
uncertainty of interference covariance. Sample matrix inversion problem is
generally ill conditioned. Moreover, the contamination of the empirical
covariance matrix by the useful signal leads to significant degradation of
performance of this class of adaptive algorithms. Regularization, also known in
radar literature as sample covariance loading, can be used to combat both ill
conditioning of the original problem and contamination of the empirical
covariance by the desired signal. However, the optimum value of loading factor
cannot be derived unless strong assumptions are made regarding the structure of
covariance matrix and useful signal penetration model. In this paper an
iterative algorithm for loading factor optimization based on the maximization
of empirical signal to interference plus noise ratio (SINR) is proposed. The
proposed solution does not rely on any assumptions regarding the structure of
empirical covariance matrix and signal penetration model. The paper also
presents simulation examples showing the effectiveness of the proposed
solution.
Related papers
- $\ell_0$ factor analysis [25.14792952830999]
We formulate an optimization problem using the nuclear norm for the low-rank component.
An alternating minimization algorithm is designed for the solution of the optimization problem.
The effectiveness of the algorithm is verified via simulations on synthetic and real datasets.
arXiv Detail & Related papers (2024-11-13T09:40:23Z) - Regularized Projection Matrix Approximation with Applications to Community Detection [1.3761665705201904]
This paper introduces a regularized projection matrix approximation framework designed to recover cluster information from the affinity matrix.
We investigate three distinct penalty functions, each specifically tailored to address bounded, positive, and sparse scenarios.
Numerical experiments conducted on both synthetic and real-world datasets reveal that our regularized projection matrix approximation approach significantly outperforms state-of-the-art methods in clustering performance.
arXiv Detail & Related papers (2024-05-26T15:18:22Z) - Weakly supervised covariance matrices alignment through Stiefel matrices
estimation for MEG applications [64.20396555814513]
This paper introduces a novel domain adaptation technique for time series data, called Mixing model Stiefel Adaptation (MSA)
We exploit abundant unlabeled data in the target domain to ensure effective prediction by establishing pairwise correspondence with equivalent signal variances between domains.
MSA outperforms recent methods in brain-age regression with task variations using magnetoencephalography (MEG) signals from the Cam-CAN dataset.
arXiv Detail & Related papers (2024-01-24T19:04:49Z) - Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem.
We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
arXiv Detail & Related papers (2023-02-13T19:57:17Z) - Learning Large Causal Structures from Inverse Covariance Matrix via
Sparse Matrix Decomposition [2.403264213118039]
This paper focuses on learning causal structures from the inverse covariance matrix.
The proposed method, called ICID, is based on continuous optimization of a matrix decomposition model.
We show that ICID efficiently identifies the sought directed acyclic graph (DAG) assuming the knowledge of noise variances.
arXiv Detail & Related papers (2022-11-25T16:32:56Z) - Exploring the Algorithm-Dependent Generalization of AUPRC Optimization
with List Stability [107.65337427333064]
optimization of the Area Under the Precision-Recall Curve (AUPRC) is a crucial problem for machine learning.
In this work, we present the first trial in the single-dependent generalization of AUPRC optimization.
Experiments on three image retrieval datasets on speak to the effectiveness and soundness of our framework.
arXiv Detail & Related papers (2022-09-27T09:06:37Z) - Unitary Approximate Message Passing for Matrix Factorization [90.84906091118084]
We consider matrix factorization (MF) with certain constraints, which finds wide applications in various areas.
We develop a Bayesian approach to MF with an efficient message passing implementation, called UAMPMF.
We show that UAMPMF significantly outperforms state-of-the-art algorithms in terms of recovery accuracy, robustness and computational complexity.
arXiv Detail & Related papers (2022-07-31T12:09:32Z) - False Correlation Reduction for Offline Reinforcement Learning [115.11954432080749]
We propose falSe COrrelation REduction (SCORE) for offline RL, a practically effective and theoretically provable algorithm.
We empirically show that SCORE achieves the SoTA performance with 3.1x acceleration on various tasks in a standard benchmark (D4RL)
arXiv Detail & Related papers (2021-10-24T15:34:03Z) - Adaptive filters for the moving target indicator system [10.152838128195468]
Two approaches to improve the convergence of adaptive algorithms are presented.
The proposed approach is based on an empirical signal to interference plus noise ratio (SINR)
Its effectiveness is demonstrated using simulated data.
arXiv Detail & Related papers (2020-12-31T04:22:55Z) - Understanding Implicit Regularization in Over-Parameterized Single Index
Model [55.41685740015095]
We design regularization-free algorithms for the high-dimensional single index model.
We provide theoretical guarantees for the induced implicit regularization phenomenon.
arXiv Detail & Related papers (2020-07-16T13:27:47Z) - Sparse recovery by reduced variance stochastic approximation [5.672132510411465]
We discuss application of iterative quadratic optimization routines to the problem of sparse signal recovery from noisy observation.
We show how one can straightforwardly enhance reliability of the corresponding solution by using Median-of-Means like techniques.
arXiv Detail & Related papers (2020-06-11T12:31:20Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.