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

1122 · May 201919922001200920172026
21 results for ride-sharing

We address the problem of inverse reinforcement learning in Markov decision processes where the agent is risk-sensitive. In particular, we model risk-sensitivity in a reinforcement learning framework by making use of models of human decision-making having their origins in behavioral psychology, behavioral economics, an…

2017-03-29abs ↗pdf ↗

This chapter reviews statistical tools for reinforcement learning.

problem Applying RL algorithms in healthcare and ride-sharing platforms.
method Statistical inference tools for RL, including hypothesis testing and confidence interval construction.
result Highlighting the value of statistical inference in RL for both communities.

Predicts destinations and routes from partial trajectory data.

problem Predicting destinations and routes from partial trajectory data for applications like parking suggestions and ride-sharing.
method Three-step procedure: k-d tree-based space discretization, recurrent neural network for destination prediction, and route calculation.
result Best models predict destinations with a mean error of 1.3 km and 1.43 km.

A new framework uses multi-agent reinforcement learning for evaluating policies in two-sided markets.

problem Evaluating the effects of different policies in two-sided markets with spatial and temporal interference.
method Introduces a multi-agent reinforcement learning (MARL) framework to address policy evaluation challenges in large-scale fleet management.
result Proposes novel estimators for mean outcomes under different products that are consistent despite high-dimensionality.

The sheer scale of modern datasets has resulted in a dire need for summarization techniques that identify representative elements in a dataset. Fortunately, the vast majority of data summarization tasks satisfy an intuitive diminishing returns condition known as submodularity, which allows us to find nearly-optimal sol…

2018-06-07abs ↗pdf ↗

Efficiently projects points onto polytopes, especially useful in web-scale applications.

problem Efficiently projecting points onto polytopes in large-scale applications.
method Developed a vertex-oriented incremental algorithm for polytope projection, tailored for simplex and unit-box cut polytopes.
result Majority of projections lie on vertices of polytopes, leading to significant performance improvements.

We study Exo-MDPs to reduce sample complexity in reinforcement learning.

problem Reducing sample complexity in reinforcement learning for structured MDPs.
method Introducing Exo-MDPs and proving structural equivalence to linear mixture MDPs, establishing regret bounds.
result Proved O(H3/2dK)O(H^{3/2}d\sqrt{K}) regret bound for Exo-MDPs, matching lower bounds.

ADRL improves participant selection in MCS systems.

problem Designing a participant selection algorithm for different MCS systems with multiple goals.
method Auxiliary-task based deep reinforcement learning (ADRL) using transformers and pointer networks.
result ADRL outperforms other baselines in various MCS settings.

GCF estimates heterogeneous treatment effects for continuous treatments in online marketplaces.

problem Estimating heterogeneous treatment effects for continuous treatments in online marketplaces.
method Kernel-based doubly robust estimator and distance-based splitting criterion.
result GCF estimates heterogeneous treatment effects for continuous treatments effectively.

New framework validates counterfactual estimations in network interference settings.

problem Challenges in causal effect estimation and validation in network interference settings.
method Introduces a distribution-preserving network bootstrap and counterfactual cross-validation procedure.
result Validates counterfactual estimations in diverse network interference settings.

Synthetic control method improves policy evaluation in high-dimensional settings.

problem Evaluating the impact of new policies in large-scale applications.
method Two-phase approach: nearest neighbor matching followed by supervised learning.
result The method successfully improves estimate accuracy in large-scale experiments.