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,982 papers · 148 categories

Trend · papers per month

4080119159 · Jun 202019922001200920172026
48 results for latency constraints

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.

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.

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.

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.

Optimizes pipelined computation and communication for edge learning within latency constraints.

problem Balancing data transmission and model training to meet latency requirements.
method Analyzes the optimal packet payload size tradeoff between bias and variance.
result Derives analytical bounds on the expected optimality gap for effective optimization.

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.

New algorithm reduces costs and latency for large language model inference.

problem Optimizing inference costs and latency for large language models with GPU constraints.
method Formulated as an online scheduling problem with endogenous memory growth, introduced fluid model and WAIT algorithms.
result Reduced costs and latency, especially in near-overloaded and overloaded regimes.

Interactive applications incorporating high-data rate sensing and computer vision are becoming possible due to novel runtime systems and the use of parallel computation resources. To allow interactive use, such applications require careful tuning of multiple application parameters to meet required fidelity and latency …

2012-03-15abs ↗pdf ↗

Wireless communication systems operate in complex time-varying environments. Therefore, selecting the optimal configuration parameters in these systems is a challenging problem. For wireless links, \emph{rate selection} is used to select the optimal data transmission rate that maximizes the link throughput subject to a…

2019-02-28abs ↗pdf ↗

A DRL approach optimizes resource allocation in BFL to reduce latency and energy consumption.

problem Energy and CPU constraints of mobile devices and increased training latency due to blockchain mining.
method Deep Reinforcement Learning (DRL) to derive optimal decisions for MLMO.
result Optimal resource allocation and block generation rate to minimize system latency, energy consumption, and incentive cost.

Train one network for efficient deployment across many devices.

problem Efficient inference across diverse devices with minimal resource constraints.
method Once-for-All (OFA) network training and progressive shrinking algorithm.
result OFA network achieves state-of-the-art accuracy with significantly reduced training time and resource usage.

HardCoRe-NAS finds fitting neural networks adhering to hard resource constraints.

problem Finding fitting neural networks that adhere to hard resource constraints.
method Accurate formulation of resource requirement and scalable search method.
result HardCoRe-NAS generates state-of-the-art architectures strictly satisfying hard resource constraints.

Single-Path NAS designs efficient ConvNets for mobile devices in hours.

problem Designing efficient ConvNets for mobile devices under latency constraints.
method Single-Path NAS, a differentiable method that reduces search cost and inference time.
result Achieves state-of-the-art accuracy on ImageNet with 79ms inference latency.

HOLMES improves real-time model serving for ICU patients, balancing accuracy and speed.

problem Real-time model serving is crucial in ICU due to urgency and cost.
method Online model ensemble serving framework for healthcare applications.
result HOLMES achieves high accuracy and sub-second latency for model ensemble serving.

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.

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.

TabNAS improves neural architecture search for tabular datasets by rejecting suboptimal architectures.

problem Finding optimal neural architectures for tabular datasets with resource constraints.
method Develops a reinforcement learning controller motivated by rejection sampling to handle resource constraints.
result TabNAS finds better models that obey resource constraints compared to previous 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.

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.

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.

Paper tackles energy efficiency in FL over wireless networks.

problem Energy efficient transmission and computation resource allocation for FL over wireless networks.
method Formulated as an optimization problem, iterative algorithm derived with closed-form solutions for time, bandwidth, power, and accuracy.
result Proposed algorithms reduce up to 59.5% energy consumption compared to conventional FL methods.

This paper studies optimal market making for large-tick assets in the presence of latency. We consider a random walk model for the asset price, and formulate the market maker's optimization problem using Markov Decision Processes (MDP). We characterize the value of an order and show that it plays the role of one-period…

2018-06-15abs ↗pdf ↗

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.

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…

2015-04-27abs ↗pdf ↗

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.

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.

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.

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.