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

Trend · papers per month

200400600800 · Jun 202019922001200920172026
48 results for throughput optimization

The paper optimizes LLM inference systems through queueing theory.

problem Efficient LLM inference for AI agents under various routing topologies.
method Developed a fluid-limit framework for multi-class batched processing networks under K-FCFS scheduling.
result Proved that work-conserving scheduling algorithms maximize throughput for LLM inference.

Deep reinforcement learning boosts throughput in RF-powered cognitive radio networks.

problem Maximizing throughput in large-scale, decentralized RF-powered cognitive radio networks.
method Proposes deep reinforcement learning to find optimal policies for network throughput maximization.
result Deep reinforcement learning outperforms existing techniques in large-scale RF-CRN environments.

A new method selects inducing points to optimize high-throughput Bayesian optimisation.

problem Current inducing point selection methods sacrifice high-fidelity modeling of promising regions.
method Information-theoretic criterion to select inducing points maximizing global and maximum value uncertainties.
result Surrogate models support high-precision high-throughput Bayesian optimisation.

High-throughput 3D control training system achieves 100,000 FPS.

problem Lack of efficient, single-machine reinforcement learning systems.
method Sample Factory combines asynchronous sampling and off-policy correction.
result Achieves 100,000 FPS on 3D control problems without sacrificing sample efficiency.

Deep learning is extremely computationally intensive, and hardware vendors have responded by building faster accelerators in large clusters. Training deep learning models at petaFLOPS scale requires overcoming both algorithmic and systems software challenges. In this paper, we discuss three systems-related optimization…

2018-11-16abs ↗pdf ↗

New algorithm tackles resource allocation in multi-armed bandits to balance speed and throughput.

problem Balancing speed and throughput in stochastic multi-armed bandits with limited resources.
method Proposes an algorithm that trades off between information accumulation and throughput.
result Upper bounds the time taken to find the best arm with a given target success probability.

Proposes a model for identifying 4G cells with network throughput problems.

problem Challenges in identifying 4G cells with network throughput issues due to network complexity and privacy concerns.
method Data-driven model using clustering and Deep Neural Networks (DNNs). Model parameters are learned from a small number of expert-labeled data. Multiple clustering models capture common features for problematic cells.
result The proposed model outperforms a simple classifier in identifying cells with network throughput problems.

Machine learning methods have shown promise in predicting molecular properties, and given sufficient training data machine learning approaches can enable rapid high-throughput virtual screening of large libraries of compounds. Graph-based neural network architectures have emerged in recent years as the most successful …

2018-07-26abs ↗pdf ↗

New method optimizes Gaussian process allocation for BO.

problem Existing methods for inducing point allocation in BO hinder performance.
method Proposes a new allocation strategy using quality-diversity decomposition.
result Demonstrates improved BO performance through local high-fidelity modeling.

We introduce a new, high-throughput, synchronous, distributed, data-parallel, stochastic-gradient-descent learning algorithm. This algorithm uses amortized inference in a compute-cluster-specific, deep, generative, dynamical model to perform joint posterior predictive inference of the mini-batch gradient computation ti…

2018-03-12abs ↗pdf ↗

Improves matrix multiplication throughput for asymmetric bit-width operands.

problem Matrix multiplications between asymmetric bit-width operands, especially 8- and 4-bit, are not efficiently handled by existing SIMD instructions.
method Proposes a new SIMD matrix multiplication instruction that uses mixed precision on inputs (8- and 4-bit) and accumulates into 16-bit output, improving throughput.
result Offers 2x improvement in throughput compared to existing symmetric-operand-size instructions, with negligible overflow.

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 ↗

Cactus improves auto-regressive decoding speed without sacrificing quality.

problem Accelerating auto-regressive decoding while maintaining output quality.
method Formalizes speculative sampling as constrained optimization and proposes Cactus for controlled divergence from the verifier distribution.
result Empirically validated effectiveness across various benchmarks.

High-speed model accurately simulates neuromorphic devices.

problem Accurately modeling stochastic synapses in large-scale neuromorphic systems.
method Generative vector autoregressive model based on resistive memory cell data.
result Fast, high-throughput model reproduces synaptic parameters and correlations.

This paper evaluates quantization techniques for deep learning inference.

problem Reducing the size and improving inference of deep neural networks.
method Review and empirical evaluation of quantization parameters for various neural network models.
result 8-bit quantization maintains accuracy within 1% of floating-point models.

We present the OpenAI Remote Rendering Backend (ORRB), a system that allows fast and customizable rendering of robotics environments. It is based on the Unity3d game engine and interfaces with the MuJoCo physics simulation library. ORRB was designed with visual domain randomization in mind. It is optimized for cloud de…

2019-06-26abs ↗pdf ↗

PIMA autoencoders discover shared features in multimodal scientific data.

problem Discovering shared information in high-throughput scientific datasets.
method Physics-informed multimodal autoencoders (PIMA) with Gaussian mixture prior and product of experts formulation.
result Accurate cross-modal inference between images and mechanical stress-strain response in lattice metamaterials.

Hydra boosts efficiency for long-context reasoning in resource-constrained settings.

problem Quadratic complexity of transformers limits long-context reasoning in resource-constrained systems.
method Hydra uses a modular architecture with adaptive routing between sparse global attention, mixture-of-experts, and dual memories.
result Hydra achieves significant throughput and accuracy improvements for long-context reasoning.

High throughput screening of compounds (chemicals) is an essential part of drug discovery [7], involving thousands to millions of compounds, with the purpose of identifying candidate hits. Most statistical tools, including the industry standard B-score method, work on individual compound plates and do not exploit cross…

2017-09-28abs ↗pdf ↗

A method predicts GNS of transformer layers using normalization layer norms.

problem Estimating gradient noise scale with minimal variance.
method Simultaneously compute per-example gradient norms and parameter gradients.
result Total GNS is predicted well by normalization layer GNS.

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.

Hi-RES framework extracts medical relations from articles and EHRs.

problem Manual annotation bottleneck in relation extraction.
method Labeling sentences, creating improved negative samples, using pretrained language models, and combining EHR embeddings.
result Significant accuracy increases in relation extraction, up to 0.998 for disorder-location relations.

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.

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.

KATA improves associative recall by optimizing feature maps derived from nonnegative attention weights.

problem Linear attention's poor performance on associative recall tasks.
method Formulates attention recall as a spherical-packing problem and introduces Kernelized Linear Attention Activations (KATA).
result KATA features offer a favorable capacity-interference tradeoff, enabling efficient associative recall.

A matching in a two-sided market often incurs an externality: a matched resource may become unavailable to the other side of the market, at least for a while. This is especially an issue in online platforms involving human experts as the expert resources are often scarce. The efficient utilization of experts in these p…

2017-03-02abs ↗pdf ↗

This study optimizes quantized neural networks by considering model architecture and quantization types.

problem Optimizing quantized neural networks for low-power, high-throughput applications.
method Holistic approach including training methods and quantization-friendly architecture design.
result Deeper models are more sensitive to activation quantization, while wider models improve resilience to both weight and activation quantization.

With ongoing developments and innovations in single-cell RNA sequencing methods, advancements in sequencing performance could empower significant discoveries as well as new emerging possibilities to address biological and medical investigations. In the study, we will be using the dataset collected by the authors of Sys…

2019-12-18abs ↗pdf ↗

We present Caffe con Troll (CcT), a fully compatible end-to-end version of the popular framework Caffe with rebuilt internals. We built CcT to examine the performance characteristics of training and deploying general-purpose convolutional neural networks across different hardware architectures. We find that, by employi…

2015-04-16abs ↗pdf ↗

This work improves wireless network learning by using side-information about interference.

problem Improving online learning algorithms in wireless networks.
method Exploiting side-information like interference levels to improve learning algorithms.
result Improved learning algorithms achieve higher throughput with fewer samples.

Machine learning (ML) needs industry-standard performance benchmarks to support design and competitive evaluation of the many emerging software and hardware solutions for ML. But ML training presents three unique benchmarking challenges absent from other domains: optimizations that improve training throughput can incre…

2019-10-02abs ↗pdf ↗