REVIEW 6 cited by
Context-Aware Adaptive Sampling for Intelligent Data Acquisition Systems Using DQN
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Multi-sensor systems are widely used in the Internet of Things, environmental monitoring, and intelligent manufacturing. However, traditional fixed-frequency sampling strategies often lead to severe data redundancy, high energy consumption, and limited adaptability, failing to meet the dynamic sensing needs of complex environments. To address these issues, this paper proposes a DQN-based multi-sensor adaptive sampling optimization method. By leveraging a reinforcement learning framework to learn the optimal sampling strategy, the method balances data quality, energy consumption, and redundancy. We first model the multi-sensor sampling task as a Markov Decision Process (MDP), then employ a Deep Q-Network to optimize the sampling policy. Experiments on the Intel Lab Data dataset confirm that, compared with fixed-frequency sampling, threshold-triggered sampling, and other reinforcement learning approaches, DQN significantly improves data quality while lowering average energy consumption and redundancy rates. Moreover, in heterogeneous multi-sensor environments, DQN-based adaptive sampling shows enhanced robustness, maintaining superior data collection performance even in the presence of interference factors. These findings demonstrate that DQN-based adaptive sampling can enhance overall data acquisition efficiency in multi-sensor systems, providing a new solution for efficient and intelligent sensing.
Forward citations
Cited by 6 Pith papers
-
Optimal Resource Allocation for ML Model Training and Deployment under Concept Drift
Optimal training uses a single front-loaded burst when concept durations are DMRL, and back-loading when they are IMRL; deployment schedules are treated as quasi-convex optimization problems.
-
Graph-Based Spectral Decomposition for Parameter Coordination in Language Model Fine-Tuning
Parameter graph Laplacian spectral regularization and low-pass gradient filtering are proposed for LLM fine-tuning, with reported gains over full fine-tuning, adapters, and LoRA.
-
Context-Guided Dynamic Retrieval for Improving Generation Quality in RAG Models
A state-aware query reformulation with soft attention retrieval is claimed to improve BLEU and ROUGE-L in RAG, but the experimental comparison omits a static retrieval baseline.
-
Deep Probabilistic Modeling of User Behavior for Anomaly Detection via Mixture Density Networks
A mixture density network with negative log-likelihood scoring is claimed to outperform neural baselines on UNSW-NB15, but the experimental support is not auditable.
-
Intelligent Task Scheduling for Microservices via A3C-Based Reinforcement Learning
Applying standard A3C reinforcement learning to microservice scheduling is claimed to reduce task delay and improve success rate, but no reproducible evidence is provided.
-
DeepSORT-Driven Visual Tracking Approach for Gesture Recognition in Interactive Systems
The paper re-describes DeepSORT and reports a small, undocumented comparison table claiming it beats Fast-RCNN, Mask-RCNN, and YOLOv5 on gesture and eye tracking.
Discussion (0). Continue with ORCID to comment.