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.

169,341 papers · 148 categories

Trend · papers per month

3673109145 · Jun 202019922001200920182026
48 results for latency reduction

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.

Data mining enhances a heuristic for the Minimum Latency Problem.

problem Finding optimal solutions for the Minimum Latency Problem efficiently.
method Combining GRASP with data mining to find frequent patterns in high-quality solutions.
result Improved solution quality and reduced computational time compared to existing methods.

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.

InstaNAS searches for a distribution of architectures to improve performance and reduce latency.

problem Finding a single architecture that represents the whole dataset with high diversity and variety.
method InstaNAS uses a controller trained to search for a 'distribution of architectures' that assigns each input sample a domain expert architecture.
result InstaNAS achieves up to 48.8% latency reduction without compromising accuracy.

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.

Two solutions improve privacy-preserving inference with reduced latency and wider neural network support.

problem Balancing accuracy, security, and computational complexity in machine learning with sensitive data.
method Combining Homomorphic Encryption with transfer learning and novel data representation methods.
result More than 10x improvement in latency with wider neural network support.

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.

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.

Hierarchical FL reduces latency in HCNs by sharing model updates.

problem Latency and privacy issues in federated learning across heterogeneous cellular networks.
method Hierarchical federated learning, gradient sparsification, periodic averaging.
result Significant reduction in communication latency without compromising model accuracy.

Real-time semantic segmentation for autonomous vehicles on FPGA reduces latency and power consumption.

problem Efficient real-time semantic segmentation for autonomous vehicles.
method Compressed ENet architecture, FPGA deployment, batch processing, filter reduction, quantization-aware training.
result Reduced latency to 3 ms per image with batch size of ten and 40% resource utilization.

A method to reduce latency in DNN-based decision making by gating computations.

problem Resource constraints in test-time deployment of deep neural networks.
method Adaptive gating function that recognizes states for shallow policy sufficiency.
result Up to 5X speed-up in average latency with minimal performance loss.

Paper proposes scalable multi-label classification for edge devices using CNN.

problem Challenges in deploying multi-label CNN models on edge devices due to high computation and memory requirements.
method Extends existing multi-label classification methods with a single CNN model and multiple loss and accuracy layers.
result Achieves comparable accuracy with 1.8x less MACC operations, 0.97x reduction in latency and 0.5x, 0.84x, 0.97x reduction in size for generated CNN models.

TinyLSTMs reduces speech enhancement model size and latency for hearing aids.

problem Large RNNs limit practical deployment in hearing aid hardware.
method Model compression techniques (pruning, integer quantization, state update skipping) for RNN speech enhancement.
result Reduction in model size and operations by 11.9imes imes and 2.9imes imes, respectively, without perceptual degradation.

Optimizes latency and false alarm probability in change detection problems.

problem Balancing latency and false alarms in non-stationary environments.
method Develops order-optimal change detectors under specified latency and false alarm levels.
result Derives a universal lower bound on latency and develops order-optimal detectors.

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.

Research examines how strategic latency manipulation impacts Ethereum's network efficiency and decentralization.

problem Impact of artificial latency on Ethereum's network efficiency and decentralization.
method Comprehensive analysis of MEV-Boost auction system and empirical validation with a pilot.
result Increased profitability for node operators and significant systemic challenges like heightened network inefficiencies and centralization risks.

Meta-ensemble scheme allocates queries to EC nodes for reduced latency.

problem Efficiently allocating queries to EC nodes to minimize latency.
method Combining ensemble models to decide query allocation based on node and query characteristics.
result Meta-ensemble scheme outperforms traditional allocation methods in reducing query processing latency.

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.

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.

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.

Collage-CNN reduces cloud inference latency by 1.47X with 9X reduced latency variation.

problem Reducing latency variance in cloud machine learning inference.
method Proposes a novel Collage-CNN model that combines multiple images for classification, providing redundancy and cost efficiency.
result Significant reduction in 99th percentile tail latency and variation in inference latency.

FrostNet improves INT8 quantization efficiency in mobile networks.

problem The importance of network architecture for optimal INT8 quantization.
method Quantization-aware training (QAT) with StatAssist and GradBoost, hardware-aware NAS.
result FrostNets achieve higher recognition accuracy with comparable latency when quantized.

New strategy improves liquidity takers' performance in markets with latency.

problem Latency affects liquidity takers' ability to execute limit orders effectively.
method Modelled LOB and MLOs as a marked point process, used variational analysis and FBSDEs to find optimal price limits.
result Optimal trading strategy improves marksmanship in markets with latency.

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.

The paper explores how latency affects limit order placement and adverse selection risk.

problem Limit order placement and adverse selection risk.
method Stochastic control framework to exploit liquidity imbalance and measure latency impact.
result The added value of exploiting liquidity imbalance is reduced by latency.

Blockchain trading faces limits due to time-consuming settlement, exposing arbitrageurs to price risk.

problem Time-consuming settlement in blockchain trading limits arbitrage opportunities.
method Analysis of Bitcoin network and order book data.
result Cross-exchange price differences coincide with high settlement latency and low default risk.

New algorithms decode Markov chains with near-optimal performance, even with small latency.

problem Online decoding of nthn^{th} order ergodic Markov chains with latency constraints.
method Deterministic and randomized algorithms using dynamic programs, with lower bounds established.
result Near-optimal performance of algorithms with minimal latency, outperforming existing methods.

This study analyzes satellite communication latency using a stochastic geometry model.

problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.