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

1122 · Feb 202019922001200920172026
21 results for repositioning

Optimal vehicle repositioning policy found for shared mobility services.

problem Matching fixed supply with spatial customer demand under uncertain and correlated demand.
method Base-stock repositioning policy, asymptotic optimality, regret analysis, adaptive repositioning algorithm.
result Surrogate Optimization and Adaptive Repositioning algorithm achieves optimal regret of O(n2.5T)O(n^{2.5} \sqrt{T}).

Blockchain scaling reduces gas fees, allowing more frequent liquidity updates and concentration.

problem Adverse selection risk and high gas fees on decentralized exchanges.
method Instrumental variables analysis using blockchain scaling solutions (Arbitrum, Polygon) as instruments.
result Higher repositioning intensity and precision lead to greater liquidity concentration, benefiting small trades.

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.

The paper tackles ride-hailing fleet repositioning with a calibrated demand approach.

problem Repositioning idle supply before future demand is observed in ride-hailing.
method A predict-then-optimize approach using calibrated demand regimes, a similarity gate, and spatial queue-regret decomposition.
result The spatial gate reduces mean wait time to 82.3s compared to 85.3s for a hand-tuned similarity gate and 85.8s for a distributional-only baseline.

DeepVir uses deep matrix factorization to predict antivirals for COVID-19.

problem Predicting effective antivirals for COVID-19 using known drug-virus associations.
method Graphical deep matrix factorization with HyPALM optimization.
result DeepVir outperforms state-of-the-art techniques in predicting antivirals for COVID-19.

Deep RL optimizes sensor placement in digital twins for dynamic data acquisition.

problem Limited applicability of traditional sensor placement techniques for online applications.
method Formulates sensor placement as a Markov decision process and uses deep reinforcement learning.
result Improves predictive accuracy and reliability of digital twins through adaptive sensor repositioning.

A new drug embedding method using hierarchical drug relations and chemical structures.

problem Learning accurate drug representations from chemical structures and hierarchies.
method Semi-supervised drug embedding using VAE in hyperbolic space.
result The method accurately places drugs in a hierarchy and predicts side-effects.

New findings show modern neural networks have finite sample complexity in o-minimal structures.

problem Understanding the learnability of modern neural networks in a broad context.
method Analyzing feedforward neural networks definable in o-minimal structures.
result Modern neural networks, including MLPs, CNNs, GNNs, and transformers, have finite sample complexity in the agnostic PAC setting.

Adversarial CBO optimizes under interventions by adversaries and non-stationarities.

problem Optimizing in the presence of adversaries and non-stationary factors.
method Formalizes CBO as ACBO, introduces CBO-MW algorithm combining online learning and causal modeling.
result First algorithm with bounded regret for ACBO, achieving superior performance in synthetic and real-world environments.

Safe-M3^3-UCRL learns safe policies for multi-agent systems with global constraints.

problem Global constraints in mean-field reinforcement learning for multi-agent systems.
method Safe-M3^3-UCRL uses epistemic uncertainty and log-barrier approach to ensure constraints satisfaction.
result Safe-M3^3-UCRL learns safe policies for multi-agent systems with global constraints.

Study on-chain peak shaving to reduce Ethereum transaction costs.

problem Reducing transaction costs in blockchain networks, especially during congested periods.
method Analyzing transaction-level data from multiple firms across various industries to understand scheduling responses and cost management strategies.
result Firms' scheduling responses to congestion vary, leading to different fee savings and residual costs.