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

68135203270 · Jun 202019922001200920172026
48 results for model-free inference

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.

New algorithms cluster nodes in SBM graphs faster and more accurately.

problem Efficiently clustering nodes in graphs generated from SBM models.
method Inspired by Lloyd's algorithm, proposes model-free clustering methods for SBM graphs.
result Consistent estimation of node clusters and parameters in SBM graphs.

VSE estimates complex processes from noisy measurements without a model.

problem Estimating states of complex, model-free processes from noisy data.
method Variational state estimation using recurrent neural networks (RNNs) in both learning and inference phases.
result VSE provides a competitive state estimate for a benchmark process (Lorenz system) compared to known and data-driven methods.

New RLHF algorithm identifies optimal policies from human feedback without explicit reward inference.

problem Training large language models with human feedback without reward inference.
method Model-free RLHF algorithm BSAD\mathsf{BSAD} that identifies optimal policies directly from human preference.
result Provable, instance-dependent sample complexity ildeO(cMSA3H3Mlog1δ) ilde{\mathcal{O}}(c_{\mathcal{M}}SA^3H^3M\log\frac{1}δ).

NIPA aims to translate brain learning mechanisms into scalable Bayesian inference.

problem Scalable Bayesian inference for large-scale statistical machine learning problems.
method Neural-inspired algorithm combining model-based, model-free, and episodic-control modules.
result Advances Bayesian methods and facilitates their application to deep learning.

Efficiently find near-optimal medical treatments with less trial and error.

problem Finding effective medical treatments through trial and error.
method Formalizes the problem, uses a causal inference framework, and proposes model-based dynamic programming and greedy algorithms.
result Our methods compare favorably to model-free reinforcement learning, offering a more transparent trade-off between search time and treatment efficacy.

We propose a novel reformulation of the stochastic optimal control problem as an approximate inference problem, demonstrating, that such a interpretation leads to new practical methods for the original problem. In particular we characterise a novel class of iterative solutions to the stochastic optimal control problem …

2010-09-20abs ↗pdf ↗

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.

Dirichlet process mixture models (DPMM) are a cornerstone of Bayesian non-parametrics. While these models free from choosing the number of components a-priori, computationally attractive variational inference often reintroduces the need to do so, via a truncation on the variational distribution. In this paper we presen…

2017-01-13abs ↗pdf ↗

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.

Discovering and exploiting the causal structure in the environment is a crucial challenge for intelligent agents. Here we explore whether causal reasoning can emerge via meta-reinforcement learning. We train a recurrent network with model-free reinforcement learning to solve a range of problems that each contain causal…

2019-01-23abs ↗pdf ↗

Proposes a new model for estimating individual treatment effects.

problem Estimating individual treatment effects from observational data is challenging.
method Integrates diffusion modeling and conformal inference with propensity score and covariate approximation.
result Establishes rigorous theoretical guarantees and demonstrates competitive performance.

Active inference implemented for high-dimensional tasks shows efficient exploration and improved sample efficiency.

problem Achieving efficient exploration and learning in complex, uncertain environments.
method Active inference framework applied to high-dimensional tasks, with Bayesian evidence maximization.
result Order of magnitude increase in sample efficiency over model-free baselines.

New method uses transport maps for efficient Bayesian inference.

problem Efficiently perform sequential Bayesian inference of static model parameters.
method Estimation of structured transport maps to extract conditional distributions.
result Gradient-based characterization of posterior density for online parameter estimation.

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.

Intelligent agents need a physical understanding of the world to predict the impact of their actions in the future. While learning-based models of the environment dynamics have contributed to significant improvements in sample efficiency compared to model-free reinforcement learning algorithms, they typically fail to g…

2019-05-26abs ↗pdf ↗

The paper proposes a new method to estimate optimal policies using MCMC.

problem Estimating the optimal policy for systems with unknown dynamics and reward functions.
method Using Markov Chain Monte Carlo to generate samples from the posterior distribution of parameters conditioned on optimality.
result The method provably converges to the globally optimal stochastic policy with similar variance to policy gradient methods.

We propose a second-order (Hessian or Hessian-free) based optimization method for variational inference inspired by Gaussian backpropagation, and argue that quasi-Newton optimization can be developed as well. This is accomplished by generalizing the gradient computation in stochastic backpropagation via a reparametriza…

2015-09-09abs ↗pdf ↗

Study improves probabilistic circuits using transformations for better predictions.

problem Predictive limitations of probabilistic circuits in robotic scenarios.
method Integrates transformations into joint probability trees, extending their capabilities.
result Achieves higher likelihoods with fewer parameters on various data sets.

Novel framework for Bayesian reinforcement learning infers value function distributions.

problem Bayesian reinforcement learning's challenges in inferring value function distributions.
method Inferential Induction framework for Bayesian reinforcement learning, developing Bayesian Backwards Induction algorithm.
result Proposed algorithm is competitive with state-of-the-art methods.

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.

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.

Proposes inference for DNNs in GNRMs, addressing non-independence issues.

problem Inference for DNN-estimated means in GNRMs under non-independence.
method Develops a DNN estimator and ESM for variance estimation and confidence intervals.
result Demonstrates feasibility of inference under GNRMs with ESM.

We develop a general framework for distribution-free predictive inference in regression, using conformal inference. The proposed methodology allows for the construction of a prediction band for the response variable using any estimator of the regression function. The resulting prediction band preserves the consistency …

2016-04-14abs ↗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.

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 debiasing method improves nonparametric regression's statistical properties.

problem Lack of theoretical guarantees for modern nonparametric regression methods.
method Model-free debiasing method incorporating a correction term.
result Debiased estimator satisfies pointwise and uniform risk convergence, asymptotic normality.

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 ↗