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

Trend · papers per month

3016019021,202 · Jun 202019922001200920172026
48 results for model-free methods

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.

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 ↗

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.

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.

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.

A new feature selection method using random forest and Kolmogorov filter.

problem Ultra-high dimensional data feature selection.
method Fused Kolmogorov filter with random forest based recursive feature elimination.
result Selection and L2L_2 consistency under weak conditions.

A new model-free variable importance method (IGCS) is introduced for high-dimensional data.

problem Model-free variable importance for high-dimensional data, especially when prediction functions are proprietary or expensive.
method Integrated Gradient (IG) version of Cohort Shapley (CS) method with O(nd)\mathcal{O}(nd) cost.
result IGCS closely matches Cohort Shapley (CS) in performance, especially for binary predictors.

A new method selects a representative subsample for efficient kernel density estimation.

problem Selecting a representative subsample without model assumptions.
method Optimal transport techniques for model-free subsampling with an efficient algorithm.
result The selected subsample can be used for efficient density estimation with derived convergence rates and optimal bandwidth.

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.

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.

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 ↗

AOP combines model-based planning with model-free learning to handle lifelong learning challenges.

problem Learning control in an online reset-free lifelong learning scenario where mistakes can compound and dynamics change.
method Adaptive Online Planning (AOP) that combines model-based planning with model-free learning, approximating uncertainty to call upon planning only when necessary.
result Achieves strong performance in lifelong learning challenges, gracefully adapting behaviors in the face of unpredictable changes.

Paper shows intrinsic motivation boosts exploration efficiency in HRL.

problem Efficient exploration and subgoal discovery in model-free HRL.
method Unsupervised learning over agent's experiences for subgoal discovery.
result Intrinsic motivation learning improves exploration efficiency.

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.

New method for robust inference on optimal treatment regimes without model specification.

problem Inference on optimal treatment regimes without specifying outcome regression models.
method Smoothed robust estimator and resampling-based inference.
result Asymptotic normal distribution and accurate inference for optimal treatment regimes.

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.

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.

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 methods such as the Proximal Policy Optimization algorithm (PPO) have successfully applied in complex decision-making problems such as Atari games. However, these methods suffer from high variances and high sample complexity. On the other hand, model-based reinforcement learning method…

2018-11-18abs ↗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.

A new method for matrix completion with model-free weights.

problem Matrix completion under non-uniform missing structures.
method Constructs weights via convex optimization to adjust for non-uniformity without modeling observation probabilities.
result Recover matrix with stronger theoretical guarantees, especially in heterogeneous missing settings.

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.

The paper tackles model-based RL's inaccuracy issue by dynamically adjusting planning horizons.

problem Model-based RL's failure due to model inaccuracy over long planning horizons.
method State-dependent planning horizon, learning cumulative model errors with Temporal Difference methods.
result The proposed method successfully adapts planning horizons to state-dependent model accuracy, improving policy learning efficiency.

Adversarial methods for imitation learning have been shown to perform well on various control tasks. However, they require a large number of environment interactions for convergence. In this paper, we propose an end-to-end differentiable adversarial imitation learning algorithm in a Dyna-like framework for switching be…

2019-03-08abs ↗pdf ↗

Recent advances in policy gradient methods and deep learning have demonstrated their applicability for complex reinforcement learning problems. However, the variance of the performance gradient estimates obtained from the simulation is often excessive, leading to poor sample efficiency. In this paper, we apply the stoc…

2017-10-17abs ↗pdf ↗

Neural networks can find financial arbitrage opportunities without needing market models.

problem Finding arbitrage opportunities in financial markets without using market models.
method Used neural networks to solve convex semi-infinite programs and detect arbitrage opportunities.
result Neural networks can detect model-free static arbitrage strategies in financial markets.

A model-free hedging method using stock crowding scores.

problem Designing costless portfolio strategies to hedge market risk.
method Network analysis of fund holdings to compute crowding scores, constructing long-short portfolios without numerical optimization.
result Long-short portfolios provide protection against both small and large market price fluctuations.