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

Trend · papers per month

7142128 · Jun 202019922001200920172026
48 results for vehicle rollout

SUPAID automates vehicle rollout decisions for fleet managers.

problem Automating supervisor's vehicle rollout decisions to prevent costly mistakes.
method Rule mining approach based on 'one-way efficiency' assumption.
result SUPAID significantly reduces costs in a real transit agency setting.

New approach uses dynamic programming to efficiently discover failures in autonomous vehicle simulations.

problem Efficiently discovering rare failure events in autonomous vehicle simulations.
method Approximate dynamic programming and scene decomposition to estimate failure distribution.
result Increased number of failures discovered compared to baseline approaches.

Improves data efficiency in multi-agent control tasks using model-based reinforcement learning.

problem Limited data efficiency in reinforcement learning for multi-agent tasks.
method Decentralized model-based policy optimization (DMPO) framework.
result DMPO achieves superior data efficiency and matches model-free methods using true models.

Temporal prediction is critical for making intelligent and robust decisions in complex dynamic environments. Motion prediction needs to model the inherently uncertain future which often contains multiple potential outcomes, due to multi-agent interactions and the latent goals of others. Towards these goals, we introduc…

2019-11-04abs ↗pdf ↗

BASIS improves LLM reasoning by sharing batchwise rollout info, reducing MSE by 69%.

problem Improving large language model reasoning with limited rollouts and batch information.
method BASIS samples only one rollout per prompt but uses batch information to improve value function estimation.
result BASIS reduces MSE in value function estimation by 69% compared to REINFORCE++.

Efficiently reduces computational burden of rollout acquisition functions in Bayesian optimization.

problem Expensive computation of rollout acquisition functions in Bayesian optimization.
method Combines quasi-Monte Carlo, common random numbers, and control variates to reduce computational burden. Formulates a policy-search approach to eliminate the need to optimize the rollout acquisition function.
result Significant reduction in computational burden of rollout acquisition functions.

The recently presented idea to learn heuristics for combinatorial optimization problems is promising as it can save costly development. However, to push this idea towards practical implementation, we need better models and better ways of training. We contribute in both directions: we propose a model based on attention …

2018-03-22abs ↗pdf ↗

Paper proposes a forecasting solution for network-rollout planning.

problem Accurate estimation of milestone completion times for network-rollout planning.
method Partition-based regression models incorporating data-driven statistical models.
result The proposed approach outperforms alternative models in terms of performance and model complexity.

A new method reduces compounding errors in model-based reinforcement learning.

problem Compounding errors in long horizon predictions from model-based reinforcement learning.
method Maximum Entropy Model Rollouts (MEMR) with non-uniform sampling and prioritized experience replay.
result Significantly reduces computation requirements compared to other model-based methods.

There are two halves to RL systems: experience collection time and policy learning time. For a large number of samples in rollouts, experience collection time is the major bottleneck. Thus, it is necessary to speed up the rollout generation time with multi-process architecture support. Our work, dubbed WALL-E, utilizes…

2019-01-18abs ↗pdf ↗

Study on indexability of restless multi-armed bandits and rollout policy performance.

problem Maximizing discounted rewards in finite state restless multi-armed bandit problems.
method Decouple the problem into single-armed restless bandits, analyze using value iteration, and compare with Whittle index policy.
result Demonstrates conditions for indexability and compares performance of index policy and rollout policy.

Optimal sample complexity for autoregressive chain-of-thought learning proven.

problem Determining the minimum number of samples needed for accurate autoregressive chain-of-thought learning.
method Proved upper bound on sample complexity using Daniely-Shalev-Shwartz dimension and roll-out stable parity dimension.
result The sample complexity is bounded by the local next-token class rate, with no dependence on rollout length.

SFPO optimizes LLM reasoning by repositioning before updating, improving stability and efficiency.

problem Noisy gradients from low-quality rollouts cause instability and inefficient exploration in on-policy RL algorithms.
method Decomposes each step into three stages: a short fast trajectory, repositioning, and slow correction, preserving the objective and rollout process unchanged.
result SFPO consistently improves stability, reduces rollouts, and accelerates convergence, outperforming GRPO on math reasoning benchmarks.

Rapid growth in delivery and freight transportation is increasing in urban areas; as a result the use of delivery trucks and light commercial vehicles is evolving. Major cities can use traffic counting as a tool to monitor the presence of delivery vehicles in order to implement intelligent city planning measures. Class…

2019-06-04abs ↗pdf ↗

Adaptive framework generates challenging adversarial scenarios for autonomous vehicles.

problem Lack of efficient and adaptable evaluation methods for autonomous vehicles.
method Adaptive evaluation framework using ensemble models and nonparametric Bayesian clustering.
result Adversarial scenarios significantly degrade tested autonomous vehicles' performance.

VTrackIt creates a synthetic dataset with infrastructure and vehicle info for AVs.

problem Lack of infrastructure and pooled vehicle info in existing AV datasets.
method Developed VTrackIt, a synthetic dataset with intelligent infrastructure and pooled vehicle info, and introduced InfraGAN for trajectory predictions.
result VTrackIt reduces high-risk edge cases in AV trajectory predictions.

Model-based reinforcement learning (MBRL) aims to learn a dynamic model to reduce the number of interactions with real-world environments. However, due to estimation error, rollouts in the learned model, especially those of long horizons, fail to match the ones in real-world environments. This mismatching has seriously…

2019-09-25abs ↗pdf ↗

Generative model learns vehicle trajectory distributions for better data generalization.

problem Data sparsity and privacy issues in urban vehicle trajectory analysis.
method Generative adversarial imitation learning framework for urban vehicle trajectory generation.
result TrajGAIL model produces synthetic trajectories similar to real ones, achieving significant performance gains.

Proposes CTSDG model for better vehicle intention prediction across domains.

problem Domain generalization for vehicle intention prediction in dynamic environments.
method Structural causal model with recurrent latent variable integration.
result Consistent improvement in prediction accuracy compared to state-of-the-art methods.

Thermalizer stabilizes autoregressive models for long-term predictions in chaotic systems.

problem Long-term predictions in chaotic spatiotemporal systems are unreliable due to trajectory divergence.
method Diffusion models are used to implicitly estimate the score of an invariant measure, which stabilizes autoregressive emulators by applying denoising during inference.
result Thermalization extends the time horizon of stable predictions by an order of magnitude in chaotic systems.

Autonomous Vehicles(AV) are one of the brightest promises of the future which would help cut down fatalities and improve travel time while working in harmony. Autonomous vehicles will face with challenging situations and experiences not seen before. These experiences should be converted to knowledge and help the vehicl…

2018-08-16abs ↗pdf ↗

CoDistill-GRPO improves small models in GRPO by distilling knowledge from a larger model.

problem Small models in GRPO struggle with sparse rewards on difficult tasks.
method Simultaneously trains a large and small model using co-distillation and GRPO objectives.
result Significant improvement in small model performance over standard GRPO on mathematical benchmarks.

This paper presents a method for testing the decision making systems of autonomous vehicles. Our approach involves perturbing stochastic elements in the vehicle's environment until the vehicle is involved in a collision. Instead of applying direct Monte Carlo sampling to find collision scenarios, we formulate the probl…

2019-02-05abs ↗pdf ↗

Study examines how COVID-19 vaccine companies' popularity affects their stock prices.

problem Impact of COVID-19 vaccine development and rollout on stock prices and company popularity.
method Used Python and various libraries to analyze Google Trends data and stock prices of five vaccine companies.
result Significant correlation between Google Trend data and stock prices, with post-rollout periods showing a slight negative correlation.

Predict real-time crash risks during hurricane evacuations using connected vehicle data.

problem Mitigate crash risks during hurricane evacuations by predicting high-risk locations.
method Used connected vehicle data to predict crash risks in real-time, considering weather and traffic features.
result Gaussian Process Boosting and Extreme Gradient Boosting models performed best, with recall of 0.91.

This paper compares machine learning methods for recognizing lane change intentions from vehicle trajectories.

problem Accurately detecting and predicting lane change processes in autonomous vehicles.
method Comparison of different machine learning methods on high-dimensional time series data.
result Ensemble methods reduce Type II and Type III classification errors, while LightGBM outperforms XGBoost in training efficiency.

An active area of research is to increase the safety of self-driving vehicles. Although safety cannot be guarenteed completely, the capability of a vehicle to predict the future trajectories of its surrounding vehicles could help ensure this notion of safety to a greater deal. We cast the trajectory forecast problem in…

2019-02-09abs ↗pdf ↗

Theory for RLHF generalization under reward shift and clipped KL.

problem Theoretical understanding of RLHF generalization, especially with reward shift and clipped KL.
method Developed generalization theory for RLHF, accounting for reward shift and clipped KL.
result Presented generalization bounds for RLHF, suggesting generalization error from sampling, reward shift, and KL clipping.

A DRL-based strategy improves vehicle tracking accuracy while saving energy.

problem Enhancing vehicle tracking accuracy in WSNs without increasing energy consumption.
method Decentralized strategy with dynamic reinforcement learning to adjust sensing areas.
result Simulation results demonstrate superior performance of DRL-aided design.

Accurately predicting the possible behaviors of traffic participants is an essential capability for future autonomous vehicles. The majority of current researches fix the number of driving intentions by considering only a specific scenario. However, distinct driving environments usually contain various possible driving…

2018-04-10abs ↗pdf ↗

New machine learning pipeline solves dynamic vehicle routing problems efficiently.

problem Efficiently handling same day deliveries in e-commerce logistics.
method Combination of machine learning and combinatorial optimization.
result Ranked first in the EURO Meets NeurIPS Vehicle Routing Competition.