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

0111 · Jun 202019922001200920172026
8 results for Off-Dynamics

Proposes a method to improve few-shot transfer in off-dynamics RL.

problem Traditional RL struggles with transferring policies between environments with different dynamics.
method Introduces a penalty to regulate source-trained policies in target environments with limited data.
result Improves performance in various off-dynamics RL scenarios compared to existing methods.

Enhances RL in target domains with limited data using augmented return.

problem Utilize data from an accessible source domain to improve policy learning in a target domain with scarce data.
method Return Augmented Decision Transformer (REAG) method, which augments the return in the source domain to align with the target domain's optimal trajectory distribution.
result The proposed REAG method achieves the same level of suboptimality as without a dynamics shift, enhancing DT type frameworks' performance in off-dynamics RL.

We develop a robust RL algorithm for off-dynamics environments with improved suboptimality bounds and computational efficiency.

problem Learning policies robust to uncertainties in transition dynamics between training and deployment environments.
method Distributionally robust Markov decision processes (DRMDPs) with a novel algorithm We-DRIVE-U.
result Improved suboptimality bound of O~(dHmin{1/ρ,H}/K)\widetilde{\mathcal{O}}\big({d H \cdot \min \{1/ρ, H\}/\sqrt{K} }\big), near-optimal up to O(H)\mathcal{O}(\sqrt{H}).

Study online RL with mismatched dynamics, achieving sublinear regret.

problem Exploration challenges in online RL with mismatched training and deployment dynamics.
method Introduce supremal visitation ratio, propose efficient algorithm with ff-divergence.
result Achieves sublinear regret in online RMDPs with optimal dependence on supremal visitation ratio and interaction episodes.

A new method for reinforcement learning that adapts to different domains using auxiliary classifiers.

problem Training reinforcement learning agents to perform well in different domains with varying dynamics.
method Learning auxiliary classifiers to distinguish source-domain from target-domain transitions and modifying the reward function accordingly.
result The approach improves transfer performance in reinforcement learning tasks with varying dynamics.

Paper tackles bias-variance trade-off in missing data, proposing a dynamic framework.

problem Missing data in practical applications deteriorates model performance.
method Develops a fine-grained dynamic learning framework to jointly optimize bias and variance.
result Theoretical and empirical validation of joint bias-variance optimization.

Recovering edge activities from node activity data in temporal networks.

problem Recovering lost edge activity data from aggregated node activity data in temporal networks.
method Analyzing the relationship between edge activity and node activity data, using both theoretical and empirical methods to show recovery is possible and under what conditions.
result Recovery of edge activities from node activities is possible with surprising accuracy, even when network density increases.