惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Jina AI
Jina AI
Recent Announcements
Recent Announcements
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
月光博客
月光博客
A
About on SuperTechFans
Vercel News
Vercel News
博客园 - 【当耐特】
爱范儿
爱范儿
Blog — PlanetScale
Blog — PlanetScale
阮一峰的网络日志
阮一峰的网络日志
V
V2EX
D
Docker
博客园 - 叶小钗
The Cloudflare Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
H
Help Net Security
I
InfoQ
博客园 - 三生石上(FineUI控件)
博客园 - Franky
Microsoft Azure Blog
Microsoft Azure Blog
The GitHub Blog
The GitHub Blog
大猫的无限游戏
大猫的无限游戏
MongoDB | Blog
MongoDB | Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
GLRT based Adaptive-Thresholding for CFAR-Detection of Pa...
John Bob Gali, Priyadip Ray, Goutam Das · 2020-02-07 · via math.ST updates on arXiv.org

After Pareto distribution has been validated for sea clutter returns in varied scenarios, some heuristics of adaptive-thresholding appeared in the literature for constant false alarm rate (CFAR) criteria. These schemes used the same adaptive-thresholding form that was originally derived for detecting Swerling-I (exponential) target in exponentially distributed clutter. Statistical procedures obtained under such idealistic assumptions would affect the detection performance when applied to newer target and clutter models, esp. heavy tail distributions like Pareto. Further, in addition to the sea clutter returns, it has also been reported that Generalized Pareto distribution fits best for the measured Radar-cross-section (RCS) data of a SAAB aircraft. Therefore, in Radar application scenarios like Airborne Warning and Control System (AWACS), when both the target and clutter are Pareto distributed, we pose the detection problem as a two-sample, Pareto vs. Pareto composite hypothesis testing problem. We address this problem by corroborating the binary hypothesis framework instead of the conventional way of tweaking the existing adaptive-thresholding CFAR detector. Whereby, for the composite case, considering no knowledge of both scale and shape parameters of Pareto distributed clutter, we derive the new adaptive-thresholding detector based on the generalized likelihood ratio test (GLRT) statistic. We further show that our proposed adaptive-thresholding detector has a CFAR property. We provide extensive simulation results to demonstrate the performance of the proposed detector.