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

6.3%12.5%18.8%25.0% · Mar 199319922001200920172026
48 results for evaluation speed

Presents SPEED, an algorithm for optimal policy evaluation in linear bandits with heteroscedastic noise.

problem Optimal data collection for policy evaluation in linear bandits with heteroscedastic reward noise.
method Formulated an optimal design for weighted least squares estimates, derived the optimal sample allocation, introduced SPEED algorithm, and derived regret bounds.
result SPEED leads to policy evaluation with MSE comparable to oracle strategy and significantly lower than random policy execution.

LaRT models LLMs' response accuracy and CoT length to evaluate reasoning ability and speed.

problem Valid evaluation of Large Language Models (LLMs) via response accuracy and chain-of-thought length.
method Introduces Latency-Response Theory (LaRT) to jointly model response accuracy and CoT length using latent ability and latent speed.
result LaRT yields higher estimation accuracy and shorter confidence intervals for latent traits compared to IRT.

HollowFlow speeds up likelihood evaluation for large-scale models.

problem Prohibitive scaling of sample likelihood computations in flow-based models.
method Introduces HollowFlow, a flow-based generative model using a NoBGNN with a block-diagonal Jacobian structure.
result Achieves up to O(n^2) speed-up in likelihood evaluation for large systems.

DistPre predicts traffic speeds efficiently for large networks.

problem Fine-grained, accurate speed prediction for large-scale transportation networks.
method Customizes LSTM models on a cluster, sharing trained models between detectors.
result Efficient and accurate fine-grained traffic-speed prediction.

A scalable portfolio approach speeds up Bayesian optimization for noisy functions.

problem Efficiently selecting multiple designs in parallel for noisy, expensive black-box optimization.
method A portfolio approach that balances exploration and exploitation, using a scalable allocation strategy.
result Significant speed improvements over existing methods, with similar or better performance.

NoTMF forecasts sparse urban road movement speeds with nonstationary temporal matrix factorization.

problem Sparse and nonstationary movement speed data from urban roads.
method Nonstationary Temporal Matrix Factorization (NoTMF) model.
result NoTMF outperforms baseline models in forecasting urban road movement speeds.

The paper proposes a technique to speed up evolutionary algorithms by using lower-cost approximations of the objective function.

problem Evolutionary algorithms require many evaluations to solve computationally expensive black-box optimization problems.
method The paper introduces a technique to choose an appropriate approximate function cost during the execution of the optimization algorithm.
result The proposed approach can reach the same objective value in less than half the time in certain cases.

Study uses CNNs to upscale wind speed data from 100 km to 3 km, improving subgrid-scale variability.

problem Recovering fine-scale wind speed information from coarse data.
method Convolutional neural networks (CNNs) with different input configurations (coarse wind speed, fine-scale topography, diurnal cycle) were tested.
result CNN models with coarse wind and fine topography inputs perform best in generalizing to unseen regions.

Recurrent neural networks (RNNs) can model natural language by sequentially 'reading' input tokens and outputting a distributed representation of each token. Due to the sequential nature of RNNs, inference time is linearly dependent on the input length, and all inputs are read regardless of their importance. Efforts to…

2019-03-20abs ↗pdf ↗

Gaussian process regression (GPR) is a non-parametric Bayesian technique for interpolating or fitting data. The main barrier to further uptake of this powerful tool rests in the computational costs associated with the matrices which arise when dealing with large data sets. Here, we derive some simple results which we h…

2016-04-05abs ↗pdf ↗

In this paper, we propose a speed-up approach for subclass discriminant analysis and formulate a novel efficient multi-view solution to it. The speed-up approach is developed based on graph embedding and spectral regression approaches that involve eigendecomposition of the corresponding Laplacian matrix and regression …

2019-05-02abs ↗pdf ↗

A hybrid ASR system using conformer architecture improves word-error-rate and training speed.

problem Improving word-error-rate and training efficiency for hybrid ASR systems.
method Used conformer architecture, applied time downsampling, and transposed convolutions.
result Conformer-based hybrid model achieves competitive results and significantly outperforms BLSTM-based hybrid model.

New method speeds up diffusion models without requiring complex assumptions.

problem Slow sampling in diffusion models due to high computational cost.
method Training-free acceleration scheme under minimal assumptions.
result Provable acceleration within O~(d5/4/ε)\widetilde{O}(d^{5/4}/\sqrt{\varepsilon}) iterations.

Sparse perturbations improve convergence in SZO methods for faster training.

problem Dependency of SZO methods on function dimensionality limits their convergence speed.
method Sparse perturbations reduce the effective dimensionality of the optimization problem.
result Sparse SZO optimization leads to faster convergence in training loss and test accuracy.

Stochastic variance-reduced gradient (SVRG) is an optimization method originally designed for tackling machine learning problems with a finite sum structure. SVRG was later shown to work for policy evaluation, a problem in reinforcement learning in which one aims to estimate the value function of a given policy. SVRG m…

2019-06-09abs ↗pdf ↗

Many reinforcement learning applications involve the use of data that is sensitive, such as medical records of patients or financial information. However, most current reinforcement learning methods can leak information contained within the (possibly sensitive) data on which they are trained. To address this problem, w…

2019-02-01abs ↗pdf ↗

Stochastic variational inference (SVI) employs stochastic optimization to scale up Bayesian computation to massive data. Since SVI is at its core a stochastic gradient-based algorithm, horizontal parallelism can be harnessed to allow larger scale inference. We propose a lock-free parallel implementation for SVI which a…

2018-01-12abs ↗pdf ↗

Predicting structured outputs can be computationally onerous due to the combinatorially large output spaces. In this paper, we focus on reducing the prediction time of a trained black-box structured classifier without losing accuracy. To do so, we train a speedup classifier that learns to mimic a black-box classifier u…

2018-06-11abs ↗pdf ↗

MTFL improves UA and speeds convergence in personalised DNNs on edge devices.

problem Non-IID user data harms FL convergence and global UA is not always the goal.
method Introduces non-federated BN layers into federated DNNs for personalised training.
result MTFL reduces UA rounds by up to 5x and convergence time by up to 3x.

Data application developers and data scientists spend an inordinate amount of time iterating on machine learning (ML) workflows -- by modifying the data pre-processing, model training, and post-processing steps -- via trial-and-error to achieve the desired model performance. Existing work on accelerating machine learni…

2018-08-03abs ↗pdf ↗

We propose a fast, model agnostic method for finding interpretable counterfactual explanations of classifier predictions by using class prototypes. We show that class prototypes, obtained using either an encoder or through class specific k-d trees, significantly speed up the the search for counterfactual instances and …

2019-07-03abs ↗pdf ↗

A new Metropolis-Hastings algorithm uses Gaussian Processes to speed up sampling from complex models.

problem Sampling from computationally expensive probabilistic models.
method Two-stage Metropolis-Hastings algorithm with a Gaussian Process surrogate model.
result The approach learns the target distribution while sampling, eliminating the need for pre-training.

Wind speed prediction improved using a novel deep ensemble learning model inspired by jet aerodynamics.

problem Accurate wind speed forecasting for renewable energy production.
method Proposes a novel Deep Ensemble Learning using Jet-like Architecture (DEL-Jet) to enhance robustness and generalization of a learning system.
result The DEL-Jet technique improves the robustness and generalization of the learning system, as shown by performance evaluations.

AlgoPerf competition evaluates neural network training speed-ups.

problem Improving neural network training speed using better algorithms.
method Compared 18 diverse submissions from 10 teams on multiple workloads.
result Schedule Free AdamW algorithm achieved best results in self-tuning ruleset.

Outlier detection is a crucial part of robust evaluation for crowdsourceable assessment of Quality of Experience (QoE) and has attracted much attention in recent years. In this paper, we propose some simple and fast algorithms for outlier detection and robust QoE evaluation based on the nonconvex optimization principle…

2017-07-18abs ↗pdf ↗

We developed efficient methods to compute gradients for Neural SDEs, improving training speed and accuracy.

problem Training Neural SDEs requires accurate and efficient computation of gradients, which is challenging due to the complexity of SDEs.
method We introduced a reversible Heun method for solving backwards-in-time SDEs and a Brownian Interval for sampling and reconstructing Brownian motion.
result Our methods significantly improve training speed and accuracy for Neural SDEs, outperforming state-of-the-art techniques.

We present an approximation scheme for support vector machine models that use an RBF kernel. A second-order Maclaurin series approximation is used for exponentials of inner products between support vectors and test instances. The approximation is applicable to all kernel methods featuring sums of kernel evaluations and…

2014-03-04abs ↗pdf ↗

LEEP measures transferability of learned representations efficiently.

problem Evaluating the transferability of learned representations in machine learning.
method LEEP: Log Expected Empirical Prediction, a simple measure requiring one pass through the target data set.
result LEEP predicts transfer and meta-transfer learning performance and convergence speed, outperforming existing measures.

MSCT predicts post-crash traffic speed using causal inference.

problem Time-varying confounding bias in post-crash traffic prediction.
method Marginal Structural Causal Transformer (MSCT) incorporating Marginal Structural Models and balanced loss function.
result MSCT outperforms state-of-the-art models in multi-step-ahead prediction.