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

推荐订阅源

WordPress大学
WordPress大学
博客园 - 司徒正美
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
A
About on SuperTechFans
Google DeepMind News
Google DeepMind News
T
Tailwind CSS Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
M
MIT News - Artificial intelligence
L
LangChain Blog
aimingoo的专栏
aimingoo的专栏
Engineering at Meta
Engineering at Meta
Martin Fowler
Martin Fowler
H
Help Net Security
B
Blog
Y
Y Combinator Blog
小众软件
小众软件
S
SegmentFault 最新的问题
I
InfoQ
爱范儿
爱范儿
Hugging Face - Blog
Hugging Face - Blog
D
Docker
博客园 - 【当耐特】
J
Java Code Geeks
阮一峰的网络日志
阮一峰的网络日志

stat updates on arXiv.org

A Refined Generalization Analysis for Extreme Multi-class Supervised Contrastive Representation Learning Ensemble Distributionally Robust Bayesian Optimisation The Proxy Presumption: From Semantic Embeddings to Valid Social Measures Modulated learning for private and distributed regression with just a single sample per client device Query-efficient model evaluation using cached responses Functional-prior-based approaches to Bayesian PDE-constrained inversion using physics-informed neural networks Optimal Experiments for Partial Causal Effect Identification Order-Agnostic Autoregressive Modelling with Missing Data Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Tuning Derivatives for Causal Fairness in Machine Learning Spherical Flows for Sampling Categorical Data Bayesian Rain Field Reconstruction using Commercial Microwave Links and Diffusion Model Priors GRALIS: A Unified Canonical Framework for Linear Attribution Methods via Riesz Representation Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning Jacobian-Velocity Bounds for Deployment Risk Under Covariate Drift Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics Perturbation is All You Need for Extrapolating Language Models Adapt or Forget: Provable Tradeoffs Between Adam and SGD in Nonstationary Optimization Realizable Bayes-Consistency for General Metric Losses Graph Convolutional Support Vector Regression for Robust Spatiotemporal Forecasting of Urban Air Pollution Segmenting Human-LLM Co-authored Text via Change Point Detection Stochastic Schrödinger Diffusion Models for Pure-State Ensemble Generation Understanding Self-Supervised Learning via Latent Distribution Matching The Geometric Mechanics of Contrastive Representation Learning: Alignment Potentials, Entropic Dispersion, and Cross-modal Divergence Imbalanced Classification under Capacity Constraints On the Spectral Structure and Objective Equivalence of Orthogonal Multilabel Fisher Discriminants Partially Observed Structural Causal Models First-Order Efficiency for Probabilistic Value Estimation via A Statistical Viewpoint Robust and Fast Training via Per-Sample Clipping
Unifying Adaptive Fourier and Möbius-Based Models for Eff...
[Submitted on 16 Jun 2026] · 2026-06-24 · via stat updates on arXiv.org

View PDF HTML (experimental)

Abstract:Oscillatory biomedical signals such as electrocardiograms (ECG) and electroencephalograms (EEG) call for decompositions that are both computationally efficient and interpretable. This paper establishes a formal connection between two finite-order frameworks that have largely evolved independently: Adaptive Fourier Decomposition (AFD), based on orthonormal Takenaka-Malmquist expansions, and the Frequency-Modulated Mobius (FMM) model, a parametric decomposition built on Mobius transforms with morphologically meaningful parameters. We prove that finite-order AFD and FMM decompositions are mathematically equivalent. Under mild regularity assumptions, we further show that their associated estimation procedures solve the same underlying optimization problem when FMM is formulated with independent Gaussian noise. The results are extended to multi-channel signals, which are central in multilead bioelectric recordings. Practically, the equivalence clarifies how fast AFD approximations, including FFT-based implementations, relate to FMM-style parametrization and component interpretability. We illustrate these implications with an EEG example evaluating approximation behavior as the number of components increases, and with an ECG use case comparing five-component decompositions on representative beats, contrasting unlabeled AFD components with physiologically identified FMM components. Overall, the proposed equivalence provides a principled basis to leverage the computational advantages of AFD alongside the interpretability of FMM in biomedical signal analysis.

Submission history

From: Christian Canedo Ortega [view email]
[v1] Tue, 16 Jun 2026 07:04:07 UTC (680 KB)