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

Trend · papers per month

6.6%13.2%19.7%26.3% · Feb 202519922001200920182026
48 results for Variable Speed Limits

Proposes a deep reinforcement learning model for efficient variable speed limits control.

problem Improving traffic flow, safety, and emissions on freeways with varying speed limits.
method Uses a novel actor-critic architecture for deep reinforcement learning to manage dynamic speed limits.
result The proposed method enhances efficiency, safety, and emissions compared to traditional control methods.

A new model predicts wind speed using multiple meteorological variables.

problem Precise wind speed forecasting for wind power producers and grid operators.
method Multi-variable Stacked Long Short-Term Memory (LSTM) network.
result The proposed MSLSTM model outperforms traditional methods in wind speed prediction.

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.

In recent years, there is a growing interest in learning Bayesian networks with continuous variables. Learning the structure of such networks is a computationally expensive procedure, which limits most applications to parameter learning. This problem is even more acute when learning networks with hidden variables. We p…

2012-07-11abs ↗pdf ↗

Improved spectral methods of moments for robust latent variable model learning.

problem Limited robustness of spectral methods of moments to model misspecification.
method Hierarchical approach using approximate joint diagonalization instead of tensor decomposition.
result Our method outperforms previous tensor decomposition methods in speed and model quality.

New method speeds up sparse Gaussian processes for large datasets.

problem Efficiently modeling large datasets with many inducing variables.
method Projecting a GP onto B-spline basis functions for sparse linear algebra.
result Efficiently models fast-varying spatial phenomena with tens of thousands of inducing variables.

Improved image reconstruction from sparse measurements using generative models.

problem Signal recovery from limited compressed measurements.
method Generative model with constrained latent variables for stable signal reconstruction.
result Improved reconstruction accuracy and preservation of realistic features.

Mini-batch EM algorithm speeds up convergence for large datasets.

problem Efficiently processing large datasets in latent variable models.
method Proposes mini-batch version of Stochastic Approximation EM algorithm for exponential models.
result Converges under classical conditions with mini-batch sampling.

Study short-term wind power and speed predictions using machine learning.

problem Accurate short-term wind power and speed predictions for energy systems.
method Combining numerical weather prediction models with local observations, using machine learning for variable selection and forecasting.
result Improved wind power and speed predictions for 4-hour ahead using machine learning.

VADD enhances discrete diffusion models by capturing inter-dimensional correlations, improving sample quality.

problem Limited modeling of inter-dimensional dependencies in MDMs degrades performance with few denoising steps.
method Introduces an auxiliary recognition model for latent variable modeling, enabling stable training via variational lower bounds maximization and amortized inference.
result VADD consistently outperforms MDM baselines in sample quality with few denoising steps.

New analysis shows surprising results on adaptation speed of causal models.

problem Investigate the adaptation speed of causal models under interventions.
method Use convergence rates from stochastic optimization to measure adaptation speed.
result Surprising findings: anticausal model can be faster than causal model under certain conditions.

Researchers use Gaussian Process Regression to improve accuracy of a low-cost hot-wire anemometer.

problem Improving accuracy of low-cost hot-wire anemometers in varying temperatures.
method Probabilistic calibration using Gaussian Process Regression.
result The method provides good performance in estimating actual wind speeds, including uncertainty.

Network embedding helps predict speed limits on incomplete Danish road network.

problem Incomplete speed limit data on Danish roads limits machine learning applications.
method Applied node2vec network embedding to Danish road network.
result Network embedding can derive useful features for predicting speed limits.

Modeling vessel speed to balance efficiency and environmental risks in Arctic shipping.

problem Balancing vessel speed with environmental and ecological risks in Arctic shipping.
method Inverse control constrained optimization framework with risk parameters estimated from AIS data.
result Distinct decision-making patterns across vessel types and navigational statuses, with varying sensitivity to ice and whale risks.

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.

Improved Kalman filtering with hierarchical variational approach.

problem Inconsistent process covariance estimation and slow convergence speed in traditional variational Kalman filtering.
method Introducing a surrogate variable for process-noise-free state, reformulating CAVI, and sliding-window hyperparameter estimation.
result Enhanced convergence speed and superior estimation accuracy compared to existing methods.

Generative model improves wind field downscaling from coarse climate models.

problem Limited spatial resolution and biases in GCMs for wind energy studies.
method SerpentFlow for domain alignment and conditional fine-scale learning.
result Improved spatial coherence, inter-variable consistency, robustness under climate change.

Meta-learn causal structures based on adaptation speed to sparse distributional changes.

problem Learning cause-effect relationships from sparse distributional changes.
method Meta-learn causal structures based on adaptation speed to modified distributions.
result Sparse expected gradients and lower effective degrees of freedom lead to faster adaptation.

A new method speeds up factor analysis for high-dimensional data.

problem Estimating covariance parameters in high-dimensional Gaussian data with limited observations.
method Matrix-free likelihood method using implicitly restarted Lanczos and limited-memory quasi-Newton algorithms.
result Our method is faster than EM without sacrificing accuracy.

New method improves matrix factorization speed and accuracy.

problem Matrix factorization optimization problems suffer from biased solutions and lack of convergence guarantees.
method Proposes a novel Bregman distance for matrix factorization, enabling non-alternating schemes with convergence proof.
result Convergence to a stationary point proved for matrix factorization problems.

Quantum algorithms speed up reinforcement learning policies in large state-action spaces.

problem Limitations of quantum access in training reinforcement learning policies.
method Designing quantum algorithms to train reinforcement learning policies.
result Quantum algorithms offer full quadratic speed-ups in sample complexity for well-behaved policies.

This paper presents an acceleration framework for packing linear programming problems where the amount of data available is limited, i.e., where the number of constraints m is small compared to the variable dimension n. The framework can be used as a black box to speed up linear programming solvers dramatically, by two…

2017-11-17abs ↗pdf ↗

TM-CNN predicts lane-level traffic speeds considering volume impact.

problem Aggregated lane-level traffic speed prediction and volume impact.
method Two-stream multi-channel CNN, data conversion, two-stream deep neural network, loss function.
result TM-CNN outperforms existing models in multi-lane traffic speed prediction.

HGP models traffic speed uncertainty better than current methods.

problem Highly variable measurement noise in crowdsourced traffic data.
method Heteroscedastic Gaussian processes (HGP) conditioned on sample size and traffic regime (SRC-HGP).
result SRC-HGP produces significantly better predictive distributions.

Quantum algorithms for multi-armed bandits are explored with limited reward access.

problem Exploring quantum speed-ups in multi-armed bandit problems with limited reward information.
method Introduced new bandit models and showed query complexity equivalence with classical algorithms.
result No quadratic speed-up is possible for multi-armed bandits with limited reward access.

Quantum LS-SVM simplifies matrix inversion for faster machine learning.

problem Speeding up machine learning algorithms for large datasets.
method Introduces a novel quantum algorithm using continuous variables to simplify matrix inversion in LS-SVM, and proposes a hybrid quantum-classical approach for sparse solutions.
result Quantum LS-SVM achieves exponential speed-up and can solve classically difficult tasks.

New method speeds up solving machine learning problems by splitting variables randomly.

problem Solving large-scale machine learning and signal processing problems efficiently.
method Randomized Multi-Block ADMM (RAC-MBADMM) for convex and nonconvex quadratic optimization.
result RAC-MBADMM converges linearly and outperforms other algorithms in solution time and quality.

A scalable framework for inference in continuous Cox processes using Gaussian processes.

problem Inference in inhomogeneous Poisson processes with continuous intensity functions.
method Structured variational approximation of likelihood through augmentation with superposition of Poisson processes.
result Structured variational approximation captures dependencies across variables and outperforms mean-field methods and sampling schemes.

Study shows critical initialisation not crucial for ReLU networks under dropout limits.

problem Effect of initialisation on training speed and generalisation in ReLU networks.
method Large-scale statistical analysis of over 12,000 trained networks.
result Non-critical initialisations perform similarly to critical initialisations in terms of performance.

High dimensional regression benefits from sparsity promoting regularizations. Screening rules leverage the known sparsity of the solution by ignoring some variables in the optimization, hence speeding up solvers. When the procedure is proven not to discard features wrongly the rules are said to be \emph{safe}. In this …

2015-06-11abs ↗pdf ↗

New MCMC method speeds up quantum physics simulations by a factor of 100.

problem Simulating quantum many-body systems with high computational complexity.
method FFT-accelerated MCMC with coupled particle and auxiliary variables.
result Achieves O(NlogN)O(N \log N) scaling, significantly faster than traditional O(N3)O(N^3) methods.

The paper develops a neural network to predict wind speed from visual observations.

problem Accurate wind speed prediction for renewable energy and weather forecasting.
method Coupled Convolutional and Recurrent Neural Network architecture trained on visual flow-structure interactions.
result The model accurately predicts wind speeds with low error compared to cup anemometer measurements.