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

推荐订阅源

美团技术团队
B
Blog RSS Feed
博客园_首页
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Google DeepMind News
Google DeepMind News
D
Docker
Blog — PlanetScale
Blog — PlanetScale
M
MIT News - Artificial intelligence
C
Check Point Blog
The Cloudflare Blog
T
Tailwind CSS Blog
大猫的无限游戏
大猫的无限游戏
量子位
The GitHub Blog
The GitHub Blog
Microsoft Azure Blog
Microsoft Azure Blog
I
InfoQ
T
The Blog of Author Tim Ferriss
博客园 - 【当耐特】
Vercel News
Vercel News
P
Proofpoint News Feed
Hugging Face - Blog
Hugging Face - Blog
V
V2EX
博客园 - 司徒正美

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
Minimum bias multiple taper spectral estimation
Kurt S. Riedel, Alexander Sidorenko · 2018-03-12 · via math.ST updates on arXiv.org

Two families of orthonormal tapers are proposed for multi-taper spectral analysis: minimum bias tapers, and sinusoidal tapers $\{ \bf{v}^{(k)}\}$, where $v_n^{(k)}=\sqrt{\frac{2}{N+1}}\sin\frac{πkn}{N+1}$, and $N$ is the number of points. The resulting sinusoidal multitaper spectral estimate is $\hat{S}(f)=\frac{1}{2K(N+1)} \sum_{j=1}^K |y(f+\frac{j}{2N+2}) -y(f-\frac{j}{2N+2})|^2$, where $y(f)$ is the Fourier transform of the stationary time series, $S(f)$ is the spectral density, and $K$ is the number of tapers. For fixed $j$, the sinusoidal tapers converge to the minimum bias tapers like $1/N$. Since the sinusoidal tapers have analytic expressions, no numerical eigenvalue decomposition is necessary. Both the minimum bias and sinusoidal tapers have no additional parameter for the spectral bandwidth. The bandwidth of the $j$th taper is simply $\frac{1}{N}$ centered about the frequencies $\frac{\pm j}{2N+2}$. Thus the bandwidth of the multitaper spectral estimate can be adjusted locally by simply adding or deleting tapers. The band limited spectral concentration, $\int_{-w}^w |V(f)|^2 df$, of both the minimum bias and sinusoidal tapers is very close to the optimal concentration achieved by the Slepian tapers. In contrast, the Slepian tapers can have the local bias, $\int_{-1/2}^{1/2} f^2 |V(f)|^2 df$, much larger than of the minimum bias tapers and the sinusoidal tapers.