Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

236473709945 · Jun 202019922001200920172026
48 results for 5G networks

Pioneers a new network slicing solution for beyond-5G networks.

problem Ensuring diverse service level agreements (SLAs) in a multi-tenant environment with varying latency and throughput requirements.
method Leverages a multi-armed-bandit-based (MAB) orchestrator, LACO, that makes adaptive resource slicing decisions based on system structure information.
result Near-optimal results in resource slicing decisions with no prior knowledge of traffic demand or channel quality statistics.

Develops deep learning for optimizing 5G radio resource allocation.

problem Optimizing 5G base station radio resources for diverse QoS requirements.
method Cascaded neural network structure with deep transfer learning for non-stationary conditions.
result Cascaded neural networks outperform fully connected neural networks in QoS guarantee.

Paper uses deep reinforcement learning for network slicing and traffic prediction.

problem Managing dynamic network slices while maintaining QoS in a 5G environment.
method Integrates LSTM for traffic prediction and DDRL for distributed decision-making.
result Significant improvements in network performance, reducing QoS violations.

This article improves communication efficiency in distributed ML over wireless networks.

problem Achieving high ML inference accuracy at scale with zero communication latency.
method Optimizing communication payload types, techniques, scheduling, and ML architectures.
result Communication-efficient and distributed learning frameworks are presented.

ReQuestNet simplifies 5G channel estimation with a unified model.

problem Complex channel estimation in 5G systems with varying conditions.
method Unified neural architecture that handles dynamic resource blocks and transmit layers.
result Significantly outperforms legacy methods, achieving up to 10dB gain at high SNRs.

Prophet predicts device qualities for FL to reduce training latency.

problem Bad candidate-selection leads to large training and reporting latency in FL.
method Each device predicts its own training and reporting phases using LSTM. The algorithm is implemented with DRL.
result The proposed approach outperforms reactive algorithms in real-world experiments.

New approach improves convergence of online learning for ARIMA models.

problem Pitfalls in computational complexity and convergence of Online Newton Step optimization method.
method Proposes a new approach combining different Online Gradient Descent learners for iterative training of ARIMA models.
result The proposed approach outperforms existing methods resulting in lower prediction error.

Paper proposes a risk-aware decision-making framework for real-world sequential decisions.

problem Real-world sequential decision-making problems often have critical constraints that learning solutions often neglect.
method Actor multi-critic architecture with risk characterization.
result Our approach consistently satisfies system constraints with minimal performance toll.

This paper analyzes energy and carbon footprints in distributed and federated learning.

problem High energy costs and carbon emissions in centralized AI methods.
method A novel framework quantifying energy and carbon footprints in vanilla and consensus-based FL methods.
result Optimal bounds and operational points for green FL designs and sustainability assessment.

This paper improves indoor positioning accuracy by deploying reference nodes to ensure Line-of-Sight.

problem Systematic bias errors in indoor positioning due to non-LoS propagation.
method Model indoor service area as a graph, partition into cliques for reference nodes, set minimum distance and angle parameters.
result Guaranteed LoS to reference nodes improves indoor positioning accuracy and precision.

A deep learning model for traffic forecasting in telecommunication networks.

problem Complex spatial-temporal dependency in traffic forecasting.
method Spatio-Temporal Hybrid Graph Convolutional Network (STHGCN) combining GRUs and hybrid-GCN.
result The proposed model outperforms classical and state-of-the-art methods.

Paper introduces metrics to evaluate missing data imputation without ground truth.

problem Handling missing data in time series without ground truth.
method Introduces Wasserstein distance (WD) and Jensen-Shannon divergence (JSD) as metrics to evaluate imputation quality.
result WD and JSD are effective metrics for assessing missing data imputation quality.

Framework predicts and prepares for rain-induced microwave link attenuation.

problem Severe signal attenuation due to weather conditions degrades network performance.
method Predictive Network Reconfiguration (PNR) framework using LSTM for attenuation prediction and MSNR for dynamic routing.
result Framework improves network utilization by more than 200% compared to reactive algorithms.

Orthogonal frequency division multiplexing (OFDM) has been widely applied in current communication systems. The artificial intelligence (AI)-aided OFDM receivers are currently brought to the forefront to replace and improve the traditional OFDM receivers. In this study, we first compare two AI-aided OFDM receivers, nam…

2018-12-17abs ↗pdf ↗

This paper proposes an unsupervised learning method to solve heat equations on chips.

problem Critical need for solving heat transfer equations on chips for 5G and AI.
method Hybrid framework of Auto Encoder and Image Gradient for unsupervised learning.
result Framework can solve heat transfer problems with a single training process and predict unseen cases.

TimeAutoML learns effective representations for irregularly sampled MTS data without manual tuning.

problem Learning effective representations for multivariate time series with irregular sampling rates and variable lengths.
method Autonomous representation learning pipeline with negative sample generation and auxiliary classification task.
result TimeAutoML achieves up to 20% performance improvement in anomaly detection on UCR datasets.

Paper proposes a multi-phase pruning pipeline for deep ensemble learning on IIoT devices.

problem Computational limitations of IoT devices for deep learning models.
method Generates diverse pruned models, applies integer quantization, and uses clustering-based pruning.
result Significant reduction in model size (up to 90%) and improved performance (up to 7%) on IIoT devices.

New algorithm for shareable arms with load-dependent rewards in stochastic bandits.

problem Learning optimal play strategy with shareable finite-capacity arms in stochastic bandits.
method Developed a capacity estimator and online learning algorithm for MP-MAB with shareable arms.
result Regret upper bound matches the lower bound, validating the algorithm's performance.

Study lifts periodic mapping classes under alternating group actions on surfaces.

problem Classifying subgroups of mapping class groups isomorphic to alternating groups.
method Derived conditions for periodic mapping classes to lift under alternating group actions.
result For n7n \geq 7, no subgroup of Mod(Sg)\mathrm{Mod}(S_g) can have an irreducible periodic mapping class.

RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.

problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.

This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.

problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.

Chemical networks outperform spiking neural networks in classification tasks.

problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.