Paper uses deep learning to optimize resource allocation in ultra-reliable communications.
problem Optimizing resource allocation for ultra-reliable and low-latency communications.
method Unsupervised deep learning for joint power and bandwidth allocation.
result Deep learning finds an approximated optimal solution with QoS constraints.
This paper tackles URLLC in 6G networks with deep learning.
problem Stringent requirements on end-to-end delay and reliability for mission-critical applications.
method Develops a multi-level architecture combining theoretical models and real-world data, using deep transfer learning and federated learning.
result Demonstrates improved performance in URLLC for mission-critical applications.
Proposes deep-RL with GANs for ultra-reliable low-latency communication.
problem Resource allocation for URLLC with high reliability and low latency.
method Experienced deep-RL framework using GANs to pre-train and optimize resource allocation.
result Deep-RL framework achieves near-optimal reliability and latency under URLLC constraints.
Federated learning optimizes power for reliable V2V communication.
problem Minimizing power consumption for reliable V2V communication.
method Decentralized federated learning for estimating extreme queue lengths.
result Significant reduction in extreme events of queue lengths.
Paper predicts interference for better LA in URLLC.
problem Improving LA for URLLC with strict latency and reliability.
method Exploits time correlation of interference for prediction.
result Predicted interference improves LA for URLLC.
Paper proposes unsupervised learning for optimizing deep neural networks in time-sensitive applications.
problem Inaccurate optimization solutions from supervised learning for real-time applications.
method Proposes unsupervised deep learning to learn latent function with optimization constraints as supervision.
result DNN can optimize variable problems in ultra-reliable communications without supervision labels.
An active learning approach reduces AoI violation in vehicular networks.
problem Dynamic nature of vehicular networks makes resource allocation challenging.
method Gaussian process regression (GPR) for online decentralized active learning.
result Significant improvement in AoI violation probability with at least 50% reduction.
GPU-accelerates multiuser detection for 5G URLLC systems.
problem Efficiently detecting payloads in OFDM frames with ultra-low latency.
method Implemented partially linear multiuser detection in RKHSs on a GPU-accelerated platform.
result Sub-millisecond latency detection in 5G URLLC systems.
Paper tackles ML for non-scheduled URLLC traffic in 5G networks.
problem Coexistence of scheduled and non-scheduled URLLC traffic with stringent reliability and latency requirements.
method Distributed risk-aware ML solution for resource management (RRM).
result 75% increase in data rate for scheduled traffic with 99.99% reliability for both types.
MASnet enhances speech on mobile devices with low latency.
problem Efficiently enhancing speech on mobile devices with low latency.
method MASnet processes linear-scale spectrograms, using ratio masks to enhance noisy frames, and operates in low-latency incremental inference mode.
result MASnet achieves efficient speech enhancement with low latency, reducing FMA/s operations.
Speed bumps reduce but do not fully eliminate investment in fast trading technology.
problem Limiting low-latency trading to curb investment in fast trading technology.
method Built an experimental trading platform to test the effects of speed bumps on investment in fast trading technology.
result Asymmetric speed bumps reduce investment in speed by only 20%, and increasing the magnitude further reduces investment by 8.33%. Symmetric speed bumps have no effect on investment levels.
Study validates low latency's impact on trading profits.
problem Determining the impact of low latency on trading profits.
method Agent-based simulation of trading strategies in a controlled environment.
result Latency inversely affects trading profits; latency rank is key.
CoinTossX is a low-latency, open-source matching engine for financial trading.
problem Efficiently matching orders in financial markets with low latency and high throughput.
method Developed in Java, orders submitted via UDP SBE, low-latency message transport (Aeron Media Driver). Separates order generation and matching.
result Demonstrated low-latency, high-throughput performance in various deployment scenarios.
DEX allows HFTs to quickly acquire speed, improving price discovery without sacrificing liquidity.
problem Low-latency trading's externality and resource inefficiency in centralized exchanges.
method Model of decentralized exchanges with real-time speed acquisition from peer-to-peer networks.
result HFTs on DEX acquire more speed for shorter timespans, decreasing price discovery time and reducing resource lock-in.
Paper presents FPGA implementation for efficient recurrent neural networks.
problem Implementing recurrent neural networks on FPGAs for low latency.
method Developed hls4ml framework to implement LSTM and GRU layers.
result Demonstrated effective designs for both small and large models.
Improved multilingual speech recognition with low latency for nine Indic languages.
problem Imbalance in training data across languages and low latency in interactive applications.
method Conditioning on a language vector and training language-specific adapter layers.
result Lower word error rate than monolingual E2E models and conventional systems.
Select-DC reduces GFLOPS for uncertainty estimation in neural networks.
problem Computational inefficiency in estimating model uncertainty for low-latency applications.
method Select-DC uses a subset of layers to model epistemic uncertainty with MCDC, reducing GFLOPS.
result Significant reduction in GFLOPS required for uncertainty estimation with marginal performance loss.
PHAZE framework uses zkML and hashing for fast, verifiable LHC trigger decisions.
problem Inefficient inference on large machine learning models for LHC trigger performance.
method Cryptographic techniques like hashing and zkML for low latency, certifiable inference.
result Achieves nanosecond-order latency for LHC triggers, enabling dynamic low-level triggers.
Edge devices learn directly from personal data using spiking networks.
problem Processing personal data on edge devices with low latency and energy efficiency.
method Spiking Neural Networks for local training on edge devices.
result Spiking networks enable efficient local training on edge devices without scalability limitations.
Research optimizes C++ patterns for HFT, reducing latency and improving profitability.
problem Optimizing latency-critical code for high-frequency trading systems.
method Creation of a Low-Latency Programming Repository, optimisation of trading strategy, implementation of Disruptor pattern.
result Significant performance improvements in speed and profitability.
Real-time anomaly detection and prediction system using Bayesian Networks.
problem Detect and predict anomalies in real-time systems.
method Develops a supervised machine learning model using Bayesian Network framework.
result Simultaneous anomaly detection and prediction achieved.
FlashIV solves Black-Scholes implied volatility efficiently and accurately.
problem Efficiently calculating implied volatility for financial models.
method Normalizes inputs, uses asymptotic seed, and combines Householder refinement.
result Runs faster than existing methods while maintaining accuracy.
New video compression algorithm outperforms existing codecs.
problem Efficient video compression with low latency.
method End-to-end learned video coding architecture.
result Significantly outperforms existing codecs across bitrate ranges.
New video compression method outperforms traditional approaches.
problem Efficient video compression in low latency mode.
method Feedback Recurrent Autoencoder network architecture.
result State of the art MS-SSIM/rate performance on UVG dataset.
Automated tool reduces FPGA inference latency to 5 μs for deep neural networks.
problem Deploying ultra low-latency, low-power deep neural networks on FPGAs.
method Extending hls4ml library, using model compression techniques like pruning and quantization-aware training.
result Achieved inference latency of 5 μs with 97% resource reduction.
Improves ML efficiency for vast, rapidly growing data.
problem Low latency and cost in ML with distributed, growing data.
method Designs ML systems exploiting ML characteristics, data structures, and data distribution.
result Improves ML latency and cost by 1-2 orders of magnitude.
Kolmogorov-Arnold Networks enable ultrafast online learning with fixed-point quantization.
problem Efficient online learning for high-frequency systems with strict memory constraints.
method Fixed-point online training on FPGAs exploiting B-spline locality in KANs.
result Kolmogorov-Arnold Networks are more efficient and expressive than MLPs for low-latency tasks.
VQ-BNN speeds up BNN inference for data streams.
problem High computational cost of BNN inference for data streams.
method Approximates BNN inference by predicting NN only once and using temporal exponential smoothing of recent predictions.
result VQ-BNN performs faster than BNNs while estimating comparable results.
PolyLUT uses polynomials to reduce FPGA latency.
problem Reducing latency in FPGA-based neural network inference.
method Training neural networks using multivariate polynomials as basic building blocks.
result Achieved significant latency and area improvements.
Collage inference uses redundancy to reduce cloud image classification latency variance.
problem Reducing latency variance in cloud image classification.
method Integrates collage-cnn for low-cost redundancy in multi-image classification.
result Significant reduction in 99th percentile tail latency and inference latency variation.
GOBO compresses 99.9% of BERT model parameters to 3 bits, improving inference efficiency.
problem Efficient execution of attention-based NLP models, especially in terms of latency and energy consumption.
method GOBO quantizes 32-bit floating-point parameters to 3 bits without fine-tuning, using hardware compression and co-designed architectures.
result GOBO maintains model accuracy while significantly reducing inference latency and energy consumption.
Power-SMC reduces inference latency for training-free LLM reasoning.
problem Training-free LLM reasoning with low latency.
method Power-SMC, a training-free Sequential Monte Carlo scheme targeting sequence-level power distribution.
result Power-SMC reduces inference latency from 16-28× to 1.4-3.3× over baseline decoding.
The possibility of latency arbitrage in financial markets has led to the deployment of high-speed communication links between distant financial centers. These links are noisy and so there is a need for coding. In this paper, we develop a gametheoretic model of trading behavior where two traders compete to capture laten…
DCT-SNN uses DCT to reduce inference latency in SNNs.
problem High inference latency in SNNs.
method Proposes a time-based encoding scheme using DCT to reduce timesteps.
result Achieves top-1 accuracy comparable to standard deep learning while reducing inference latency.
iPrescribe offers fast online offer recommendations using deep learning.
problem Online offer recommendation in real-time.
method Ensemble of deep learning and machine learning algorithms, optimized streaming technology stack, and efficient LSTM deployment.
result 90th percentile recommendation latency of 38 milliseconds.
Efficiently handles large support vectors in kernelized online learning.
problem Efficiency in communication for large support vectors in kernelized models.
method Extends a previously proposed protocol to kernelized online learners, introducing a novel communication criterion.
result Communication is bounded by the loss suffered, improving efficiency.
A new method reduces inference cost for FwFM by allowing it to scale with item fields only.
problem High computational cost in FwFM for large field counts.
method Low-rank diagonal plus symmetric decomposition for field-wise interactions.
result Aggressive rank reduction outperforms pruning in accuracy and speed.
Coherent Multiplex analyzes real-time wavelet coherence among multiple signals.
problem Identifying and visualizing coherence among multiple time series.
method Fast spectral similarity based on cosine similarity metrics of Fourier-transformed signals and sparse time-frequency wavelet coherence.
result Scalable real-time system for low-latency inference and monitoring of inter-signal relationships.
Scalable model for slate recommendation learns reward probabilities.
problem Scalable personalized slate recommendation in large action spaces.
method Probabilistic Rank and Reward (PRR) model combining reward, interaction, and rank.
result PRR outperforms existing methods and is scalable to large action spaces.
CADNN optimizes DNN execution on smartphones for real-time inference.
problem Executing Deep Neural Networks on mobile devices with low latency and high accuracy.
method Advanced model compression and architecture-aware optimization.
result CADNN outperforms state-of-the-art frameworks in DNN execution on mobile devices.
GSANet improves semantic segmentation accuracy with selective and global attention.
problem Semantic segmentation accuracy improvement.
method Global and selective attention mechanism with ASPP and sparsemax.
result GSANet achieves state-of-the-art accuracy on ADE20k and Cityscapes datasets.
PRETZEL optimizes machine learning prediction serving systems for better performance.
problem Low latency, high throughput, and graceful performance degradation under heavy load in prediction serving systems.
method Introducing a novel white box architecture enabling both end-to-end and multi-model optimizations.
result Average 5.5x reduction in 99th percentile latency, 25x reduction in memory footprint, and 4.7x increase in throughput compared to state-of-the-art approaches.
Study shows image classifiers struggle with temporal changes in videos.
problem Temporal robustness of image classifiers in videos.
method Constructed datasets and evaluated various classifiers and detection models.
result Median classification accuracy drops of 16-10 points in robust datasets.
Speech recognition simplified by treating audio as images.
problem Identifying voice commands in noisy environments.
method Comparing neural network architectures (CNN, low-latency CNN, adversarially trained CNN) for keyword spotting.
result Demonstrated how to apply image classification techniques to audio recognition.
TinyML models detect RF and cyber threats in spacecraft with low latency.
problem Detecting cyber-RF threats in autonomous spacecraft with low latency.
method Analysis of classical models (RF, LR, SVM, MLP) for latency-accuracy trade-offs.
result Logistic Regression achieves microsecond-level inference with minimal accuracy loss.
Paper proposes an online anomaly detection method for real-time systems.
problem Rare events endanger profitability, safety, and environmental aspects.
method Online inverse cumulative distribution-based approach with dynamic process limits.
result Eliminates common problems of offline anomaly detectors and provides low-latency detection.
CLCNet improves noise reduction in hearing aids with deep learning.
problem Noise reduction in hearing aids is challenging due to real-time and frequency resolution constraints.
method Proposes CLCNet, a deep learning framework based on complex linear coding.
result CLCNet outperforms traditional methods in noisy environments.
Improved anger detection in speech using transfer learning from SoundNet.
problem Detecting anger in speech with limited emotion datasets.
method Transfer learning from SoundNet, a multimodal audio classifier trained on video data.
result Improved performance and generalization on various speech emotion datasets.