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

Trend · papers per month

1122 · Jun 202119922001200920172026
11 results for offline-online

Algorithm learns from offline data to improve performance in target environment.

problem Learning from offline data in a target environment with unknown shifts.
method Adaptive algorithm that uses offline data to improve performance when informative.
result Algorithm provably improves performance over purely online learning when offline data are informative.

Framework optimizes battery storage for markets by separating long-term degradation from short-term market dynamics.

problem Intractable computation due to timescale mismatch between battery degradation and market dynamics.
method Approximate dynamic programming with value function approximation and pseudo-time encoding.
result Policy outperforms benchmarks in real-time market scenarios.

Paper addresses RLHF alignment challenges with novel algorithms.

problem Challenges in RLHF alignment, especially in strategic exploration.
method Develops a reverse-KL regularized contextual bandit formulation and proposes efficient algorithms with theoretical guarantees.
result Proposed methods significantly outperform existing RLHF algorithms in real-world experiments.

Efficiently learns and transports posterior densities for real-time inference.

problem High computational cost of Bayesian inference for complex posterior densities.
method Tensor-train (TT) format for offline learning, conditional transport for online inference.
result Significant improvement in inference performance for high-dimensional problems.

A new method estimates time-varying parameters in earth system models using offline and online data assimilation.

problem Estimating time-varying parameters in complex earth system models.
method Hybrid Offline Online Parameter Estimation with Particle Filtering (HOOPE-PF)
result HOOPE-PF outperforms existing methods, especially with small ensemble sizes.

This paper bridges offline and online RL by studying policy finetuning with a reference policy.

problem Sample-efficient reinforcement learning in online and offline settings.
method Design of policy finetuning algorithms and analysis of sample complexity.
result Theoretical analysis shows that the optimal policy finetuning algorithm is either offline reduction or purely online RL.