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

3867731,1591,545 · Jun 202019922001200920172026
48 results for Model-free learning

New model-free DR-RL algorithm with finite sample complexity.

problem Limited model-free DR-RL methods with convergence guarantees or sample complexities.
method Integrates Multi-level Monte Carlo (MLMC) technique with threshold mechanism.
result First model-free DR-RL approach with finite sample complexity for total variation and Chi-square divergence.

A new model-free algorithm achieves near-optimal regret for infinite-horizon MDPs.

problem Model-free reinforcement learning for infinite-horizon average-reward MDPs.
method Exploration Enhanced Q-learning (EE-QL) for weakly communicating MDPs.
result Achieves O(T)O(\sqrt{T}) regret bound for general weakly communicating MDPs.

Model-free Reinforcement Learning (RL) algorithms such as Q-learning [Watkins, Dayan 92] have been widely used in practice and can achieve human level performance in applications such as video games [Mnih et al. 15]. Recently, equipped with the idea of optimism in the face of uncertainty, Q-learning algorithms [Jin, Al…

2019-05-01abs ↗pdf ↗

New model-free algorithms learn representations for low-rank MDPs efficiently.

problem Learning representations in reinforcement learning for low-rank MDPs.
method Developed minimax representation learning objective and interleaved with reward-free exploration.
result Proven sample efficiency and scalability to complex environments.

We study an exploration method for model-free RL that generalizes the counter-based exploration bonus methods and takes into account long term exploratory value of actions rather than a single step look-ahead. We propose a model-free RL method that modifies Delayed Q-learning and utilizes the long-term exploration bonu…

2018-08-31abs ↗pdf ↗

Optimizes control of noisy discrete systems without system matrix knowledge.

problem Optimal control of discrete-time systems with additive and multiplicative noises.
method Stochastic Lyapunov and Riccati equations, model-free reinforcement learning.
result Model-free reinforcement learning algorithm converges to optimal control policy.

New algorithms for model selection in off-policy evaluation of reinforcement learning.

problem Hyperparameter tuning for off-policy evaluation methods in reinforcement learning.
method Developed new model-free and model-based selectors with theoretical guarantees and a new experimental protocol.
result New model-free selector, LSTD-Tournament, demonstrates promising empirical performance.

Simple model-based reinforcement learning outperforms model-free methods in complex tasks.

problem Lagging performance of model-based reinforcement learning agents in non-trivial environments.
method Combining soft value estimates with stochastic value gradients.
result Simple model-based agents achieve state-of-the-art results in a high-dimensional humanoid control task.

The OGY method is one of control methods for a chaotic system. In the method, we have to calculate a stabilizing periodic orbit embedded in its chaotic attractor. Thus, we cannot use this method in the case where a precise mathematical model of the chaotic system cannot be identified. In this case, the delayed feedback…

2019-07-16abs ↗pdf ↗

New algorithm borrows future randomness to stabilize model-free control.

problem Double sampling problem in model-free control with nonlinear approximations.
method Borrowing from the future (BFF) algorithm to approximate re-sampling of next states.
result BFF is close to unbiased SGD under smooth dynamics, validated by simulations.

Improved model-free reinforcement learning with decision-estimation coefficient.

problem Interactive decision making, including structured bandits and reinforcement learning.
method Combining Estimation-to-Decisions with optimistic estimation to achieve better regret bounds.
result Regret bounds for model-free reinforcement learning with value function approximation.

Study compares model-free valuation to actual financial outcomes, finds it slightly conservative.

problem Evaluating the quality of model-free valuation approaches for financial derivatives.
method Empirical analysis using historical option prices from S&P 500 constituents.
result Model-free valuation approaches are only marginally more conservative than industry-standard models.

We provide the first solution for model-free reinforcement learning of ω-regular objectives for Markov decision processes (MDPs). We present a constructive reduction from the almost-sure satisfaction of ω-regular objectives to an almost- sure reachability problem and extend this technique to learning how to control an …

2018-09-26abs ↗pdf ↗

This paper compares model-based and model-free control methods using neural networks.

problem Comparing model-based and model-free control methods for unknown nonlinear systems.
method Utilizes Deep Koopman Representation (DKRC) and Deep Deterministic Policy Gradient (DDPG) for control.
result DKRC outperforms DDPG in terms of control strategies and accuracy for unknown dynamics.

DREAM learns optimal strategies in imperfect games without needing a simulator.

problem Learning optimal strategies in imperfect-information games with multiple agents.
method DREAM is a deep reinforcement learning algorithm that converges to Nash Equilibria and coarse correlated equilibria.
result DREAM achieves state-of-the-art performance in benchmark games and is competitive with simulator-based algorithms.

Develops model-free methods for event history analysis and efficient covariate adjustment.

problem Estimating treatment effects while accounting for confounding and understanding event history.
method Model-free prediction techniques, Local Covariance Measure (LCM), Debiased Outcome-adapted Propensity Estimator (DOPE), Aalen Covariance Measure (ACM).
result Demonstrates the effectiveness and robustness of the proposed methods in various settings.

Unified Latent Dynamics unifies model-free and model-based reinforcement learning.

problem Combining the efficiency of model-free methods with the representational strengths of model-based approaches.
method Embedding state-action pairs into a latent space where the true value function is approximately linear, using synchronized updates of encoder, value, and policy networks.
result ULD achieves cross-domain competence with minimal tuning and a fraction of the parameter footprint.

A new model-free subsampling method using uniform designs is proposed.

problem Model-based subsampling methods are often dependent on model assumptions.
method Developed a criterion (GEFD) and a model-free subsampling method based on uniform designs.
result The proposed method outperforms random sampling and is robust under diverse model specifications.

Breiman's paper sparked debate on the future of statistics and machine learning.

problem The tension between traditional statistical modeling and model-free machine learning approaches.
method Discussion of the implications of machine learning's success and the need for new inferential approaches.
result The importance of understanding 'why' and 'if' questions in machine learning is now recognized.

Model-free reinforcement learning (RL) algorithms, such as Q-learning, directly parameterize and update value functions or policies without explicitly modeling the environment. They are typically simpler, more flexible to use, and thus more prevalent in modern deep RL than model-based approaches. However, empirical wor…

2018-07-10abs ↗pdf ↗

This research evaluates learning models for bionic robots, focusing on transfer function identification.

problem Developers need guidance on selecting and constructing transfer functions for bionic robots.
method Comprehensive evaluation strategy including data collection, learning model selection, comparative analysis, and transfer function identification.
result A framework for effectively dealing with multi-input multi-output robotic data.

Efficient Reinforcement Learning usually takes advantage of demonstration or good exploration strategy. By applying posterior sampling in model-free RL under the hypothesis of GP, we propose Gaussian Process Posterior Sampling Reinforcement Learning(GPPSTD) algorithm in continuous state space, giving theoretical justif…

2018-12-11abs ↗pdf ↗

PPOPT uses pretraining to speed up reinforcement learning in physics simulations.

problem High computational costs and inefficiency in reinforcement learning with small training samples.
method A novel policy neural network architecture that combines pretraining and fully-connected networks.
result PPOPT outperforms classic PPO on small training samples in terms of rewards and stability.

Combines model-based and model-free RL for better financial market performance.

problem Challenges of Reinforcement Learning in volatile financial markets.
method Adapts model-based RL with model-free RL, incorporating contextual signals and walk-forward analysis.
result Outperforms traditional financial models in various metrics.