English
Related papers

Related papers: Shape-constrained Estimation of Value Functions

200 papers

We consider the problem of computing the satisfaction probability of a formula for stochastic models with parametric uncertainty. We show that this satisfaction probability is a smooth function of the model parameters. This enables us to…

Logic in Computer Science · Computer Science 2014-10-23 Luca Bortolussi , Dimitrios Milios , Guido Sanguinetti

Truncated conditional expectation functions are objects of interest in a wide range of economic applications, including income inequality measurement, financial risk management, and impact evaluation. They typically involve truncating the…

Econometrics · Economics 2021-09-14 Tomasz Olma

Practitioners use feature importance to rank and eliminate weak predictors during model development in an effort to simplify models and improve generality. Unfortunately, they also routinely conflate such feature importance measures with…

Machine Learning · Computer Science 2020-06-09 Terence Parr , James D. Wilson , Jeff Hamrick

Motivated by the need to analyze continuously updated data sets in the context of time-to-event modeling, we propose a novel nonparametric approach to estimate the conditional hazard function given a set of continuous and discrete…

Methodology · Statistics 2025-07-03 Daphné Aurouet , Valentin Patilea

This paper deals with the unconstrained and constrained cases for continuous-time Markov decision processes under the finite-horizon expected total cost criterion. The state space is denumerable and the transition and cost rates are allowed…

Optimization and Control · Mathematics 2014-08-26 Qingda Wei , Xian Chen

We propose a Bayesian nonparametric approach to modelling and predicting a class of functional time series with application to energy markets, based on fully observed, noise-free functional data. Traders in such contexts conceive profitable…

Applications · Statistics 2016-11-23 Antonio Canale , Matteo Ruggiero

This note provides upper bounds on the number of operations required to compute by value iterations a nearly optimal policy for an infinite-horizon discounted Markov decision process with a finite number of states and actions. For a given…

Optimization and Control · Mathematics 2020-01-29 Eugene A. Feinberg , Gaojin He

This paper presents a tractable algorithm for estimating an unknown Lipschitz function from noisy observations and establishes an upper bound on its convergence rate. The approach extends max-affine methods from convex shape-restricted…

Machine Learning · Statistics 2025-11-20 Gábor Balázs

We consider stochastic dynamic programming problems with high-dimensional, discrete state-spaces and finite, discrete-time horizons that prohibit direct computation of the value function from a given Bellman equation for all states and time…

Optimization and Control · Mathematics 2020-06-05 Denis Lebedev , Paul Goulart , Kostas Margellos

We consider the estimation problem in a regression setting where the outcome variable is subject to nonignorable missingness and identifiability is ensured by the shadow variable approach. We propose a versatile estimation procedure where…

Methodology · Statistics 2019-07-09 Jiwei Zhao , Yanyuan Ma

Suppose that we wish to estimate a finite-dimensional summary of one or more function-valued features of an underlying data-generating mechanism under a nonparametric model. One approach to estimation is by plugging in flexible estimates of…

Methodology · Statistics 2020-08-28 Hongxiang Qiu , Alex Luedtke , Marco Carone

This paper considers a simulation-based estimator for a general class of Markovian processes and explores some strong consistency properties of the estimator. The estimation problem is defined over a continuum of invariant distributions…

Probability · Mathematics 2010-01-14 Manuel S. Santos

In this paper, we propose an approximating framework for analyzing parametric Markov models. Instead of computing complex rational functions encoding the reachability probability and the reward values of the parametric model, we exploit the…

Logic in Computer Science · Computer Science 2023-11-15 Ying Liu , Andrea Turrini , Moritz Hahn , Bai Xue , Lijun Zhang

We introduce a new class of neural networks designed to be convex functions of their inputs, leveraging the principle that any convex function can be represented as the supremum of the affine functions it dominates. These neural networks,…

Machine Learning · Statistics 2024-11-21 Vincent Lemaire , Gilles Pagès , Christian Yeo

We consider an investor who seeks to maximize her expected utility derived from her terminal wealth relative to the maximum performance achieved over a fixed time horizon, and under a portfolio drawdown constraint, in a market with local…

Portfolio Management · Quantitative Finance 2016-10-28 Ankush Agarwal , Ronnie Sircar

We present new convolution based smooth approximations to the absolute value function and apply them to construct gradient based algorithms such as the nonlinear conjugate gradient scheme to obtain sparse, regularized solutions of linear…

Numerical Analysis · Mathematics 2015-07-02 Sergey Voronin , Gorkem Ozkaya , Davis Yoshida

We propose an estimation procedure for linear functionals based on Gaussian model selection techniques. We show that the procedure is adaptive, and we give a non asymptotic oracle inequality for the risk of the selected estimator with…

Statistics Theory · Mathematics 2008-10-27 Béatrice Laurent , Carenne Ludeña , Clémentine Prieur

We present a general principle for estimating a regression function nonparametrically, allowing for a wide variety of data filtering, for example, repeated left truncation and right censoring. Both the mean and the median regression cases…

Statistics Theory · Mathematics 2011-02-10 Oliver Linton , Enno Mammen , Jens Perch Nielsen , Ingrid Van Keilegom

We propose a novel value function approximation technique for Markov decision processes. We consider the problem of compactly representing the state-action value function using a low-rank and sparse matrix model. The problem is to decompose…

Machine Learning · Computer Science 2015-09-02 Hao Yi Ong

We study the problem of estimating the value function of discrete-time switched systems under arbitrary switching. Unlike the switched LQR problem, where both inputs and mode sequences are optimized, we consider the case where switching is…

Optimization and Control · Mathematics 2026-02-05 Léa Ninite , Adrien Banse , Guillaume O. Berger , Raphaël M. Jungers
‹ Prev 1 3 4 5 6 7 10 Next ›