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

1223 · Nov 201919922001200920172026
12 results for mmWave

Federated LIDAR aided beam selection reduces mmWave beam search overhead.

problem Efficient link configuration in mmWave communication systems with reduced beam search overhead.
method Federated learning of LIDAR data to train a shared neural network for beam selection.
result Proposed method significantly outperforms previous works in performance and complexity.

New learning-based methods improve spectral efficiency in mmWave full-duplex systems.

problem Residual self-interference and high pathloss in mmWave full-duplex systems.
method Proposed two learning schemes (ELM-HBF and CNN-HBF) using ADMM and MM algorithms for SI cancellation and joint HBF optimization.
result Learning-based schemes achieve at least 22.1% higher spectral efficiency and faster online prediction and training times.

Millimeter wave (mmWave) communication with large antenna arrays is a promising technique to enable extremely high data rates due to the large available bandwidth in mmWave frequency bands. In addition, given the knowledge of an optimal directional beamforming vector, large antenna arrays have been shown to overcome bo…

2018-12-19abs ↗pdf ↗

mmFall detects falls using mmWave radar and a hybrid VRAE, achieving high accuracy.

problem Detecting falls accurately and privately using mmWave radar.
method Uses mmWave radar for body point cloud and centroid, combined with a hybrid VRAE for anomaly detection.
result Achieves 98% fall detection with 2 false alarms out of 50 falls.

New algorithm optimizes beam and rate allocation in mmWave systems for multiple users.

problem Optimizing beam and rate allocation in mmWave systems for multiple users with limited feedback.
method Introducing SAT-CTS, a combinatorial semi-bandit policy with satisficing objective.
result SAT-CTS achieves finite-time regret bounds and reduces satisficing regret in mmWave systems.

New algorithm reduces regret in multi-armed bandit problems with Gaussian rewards.

problem Optimizing decisions in multi-armed bandit problems with Gaussian rewards.
method Proposed TSCG and UTSCG algorithms using Thompson Sampling with Gaussian prior.
result Achieved lower regret bounds for optimal arm selection.

Few-shot domain adaptation improves autoencoder performance in changing wireless channels.

problem Frequent retraining of autoencoder for low decoding error rate in changing channel conditions is impractical.
method Uses Gaussian mixture density network and class and component-conditional affine transformations for few-shot adaptation.
result Effective adaptation using very small number of target domain samples, improving performance in real mmWave setups.