paper-with-me

홈 › Papers

Differentiable High-Order Markov Models for Spectrum Prediction

2024-11-30 · Vincent Corlay, Tatsuya Nakazato, Kanako Yamaguchi, Akinori Nakajima

The advent of deep learning and recurrent neural networks revolutionized the field of time-series processing. Therefore, recent research on spectrum prediction has focused on the use of these tools. However, spectrum prediction, which involves forecasting wireless spectrum availability, is an older field where many "classical" tools were considered around the 2010s, such as Markov models. This work revisits high-order Markov models for spectrum prediction in dynamic wireless environments. We introduce a framework to address mismatches between sensing length and model order as well as state-space complexity arising with large order. Furthermore, we extend this Markov framework by enabling fine-tuning of the probability transition matrix through gradient-based supervised learning, offering a hybrid approach that bridges probabilistic modeling and modern machine learning. Simulations on real-world Wi-Fi traffic demonstrate the competitive performance of high-order Markov models compared to deep learning methods, particularly in scenarios with constrained datasets containing outliers.

📄 PDF Abstract BibTeX arXiv:2412.00328

Code (1)

corlay-MERCE/Datasets-Paper-Differentiable-High-Order-Markov-Models-for-Spectrum-Prediction 공식 구현

Tasks

Prediction

Similar Papers 제목 키워드 기반

Scalable Spectrum Availability Prediction using a Markov Chain Framework and ITU-R Propagation Models

2025-07-30 · Abir Ray arxiv

Spectrum resources are often underutilized across time and space, motivating dynamic spectrum access strategies that allow secondary users to exploit unused frequencies. A key challenge is predicting when and where spect…

Computational Efficiency

Markov Equivalence and Consistency in Differentiable Structure Learning

2024-10-08 · Chang Deng, Kevin Bello, Pradeep Ravikumar, Bryon Aragam

Existing approaches to differentiable structure learning of directed acyclic graphs (DAGs) rely on strong identifiability assumptions in order to guarantee that global minimizers of the acyclicity-constrained optimizatio…

When Should Agents Coordinate in Differentiable Sequential Decision Problems?

2026-02-03 · Caleb Probine, Su Ann Low, David Fridovich-Keil, Ufuk Topcu arxiv

Multi-robot teams must coordinate to operate effectively. When a team operates in an uncoordinated manner, and agents choose actions that are only individually optimal, the team's outcome can suffer. However, in many dom…

Efficiently predicting high resolution mass spectra with graph neural networks

2023-01-26 · Michael Murphy, Stefanie Jegelka, Ernest Fraenkel, Tobias Kind 외

Identifying a small molecule from its mass spectrum is the primary open problem in computational metabolomics. This is typically cast as information retrieval: an unknown spectrum is matched against spectra predicted com…

Graph ClassificationInformation RetrievalPredictionRetrieval+1

Differentiable Physics-Neural Models enable Learning of Non-Markovian Closures for Accelerated Coarse-Grained Physics Simulations

2025-11-26 · Tingkai Xue, Chin Chun Ooi, Zhengwei Ge, Fong Yew Leong 외 arxiv

Numerical simulations provide key insights into many physical, real-world problems. However, while these simulations are solved on a full 3D domain, most analysis only require a reduced set of metrics (e.g. plane-level c…