arXiv subjects

Budhi Arta Surya

Publications and source records attributed to Budhi Arta Surya.

6 recordsLinked to original sources

arXiv2023

Maximum likelihood smoothing estimation in state-space models: An incomplete-information based approach

This paper revisits classical works of Rauch (1963, et al. 1965) and develops a novel method for maximum likelihood (ML) smoothing estimation from incomplete information/data of stochastic state-space systems. Score function and conditional observed information matrices of incomplete data are introduced and their distributional identities are established. Using these identities, the ML smoother $\widehat{x}_{k\vert n}^s =\argmax_{x_k} \log f(x_k,\widehat{x}_{k+1\vert n}^s, y_{0:n}\vertθ)$, $k\leq n-1$, is presented. The result shows that the ML smoother gives an estimate of state $x_k$ with more adherence of loglikehood having less standard errors than that of the ML state estimator $\widehat{x}_k=\argmax_{x_k} \log f(x_k,y_{0:k}\vertθ)$, with $\widehat{x}_{n\vert n}^s=\widehat{x}_n$. Recursive estimation is given in terms of an EM-gradient-particle algorithm which extends the work of \cite{Lange} for ML smoothing estimation. The algorithm has an explicit iteration update which lacks in (\cite{Ramadan}) EM-algorithm for smoothing. A sequential Monte Carlo method is developed for valuation of the score function and observed information matrices. A recursive equation for the covariance matrix of estimation error is developed to calculate the standard errors. In the case of linear systems, the method shows that the Rauch-Tung-Striebel (RTS) smoother is a fully efficient smoothing state-estimator whose covariance matrix coincides with the Cramér-Rao lower bound, the inverse of expected information matrix. Furthermore, the RTS smoother coincides with the Kalman filter having less covariance matrix. Numerical studies are performed, confirming the accuracy of the main results.

stat.ME↗

arXiv2022

Maximum likelihood recursive state estimation in state-space models: A new approach based on statistical analysis of incomplete data

This paper revisits the work of Rauch et al. (1965) and develops a novel method for recursive maximum likelihood particle filtering for general state-space models. The new method is based on statistical analysis of incomplete observations of the systems. Score function and conditional observed information of the incomplete observations/data are introduced and their distributional properties are discussed. Some identities concerning the score function and information matrices of the incomplete data are derived. Maximum likelihood estimation of state-vector is presented in terms of the score function and observed information matrices. In particular, to deal with nonlinear state-space, a sequential Monte Carlo method is developed. It is given recursively by an EM-gradient-particle filtering which extends the work of Lange (1995) for state estimation. To derive covariance matrix of state-estimation errors, an explicit form of observed information matrix is proposed. It extends Louis (1982) general formula for the same matrix to state-vector estimation. Under (Neumann) boundary conditions of state transition probability distribution, the inverse of this matrix coincides with the Cramer-Rao lower bound on the covariance matrix of estimation errors of unbiased state-estimator. In the case of linear models, the method shows that the Kalman filter is a fully efficient state estimator whose covariance matrix of estimation error coincides with the Cramer-Rao lower bound. Some numerical examples are discussed to exemplify the main results.

stat.ME↗

arXiv2022

Some results on maximum likelihood from incomplete data: finite sample properties and improved M-estimator for resampling

This paper presents some results on the maximum likelihood (ML) estimation from incomplete data. Finite sample properties of conditional observed information matrices are established. They possess positive definiteness and the same Loewner partial ordering as the expected information matrices do. An explicit form of the observed Fisher information (OFI) is derived for the calculation of standard errors of the ML estimates. It simplifies Louis (1982) general formula for the OFI matrix. To prevent from getting an incorrect inverse of the OFI matrix, which may be attributed by the lack of sparsity and large size of the matrix, a monotone convergent recursive equation for the inverse matrix is developed which in turn generalizes the algorithm of Hero and Fessler (1994) for the Cramér-Rao lower bound. To improve the estimation, in particular when applying repeated sampling to incomplete data, a robust M-estimator is introduced. A closed form sandwich estimator of covariance matrix is proposed to provide the standard errors of the M-estimator. By the resulting loss of information presented in finite-sample incomplete data, the sandwich estimator produces smaller standard errors for the M-estimator than the ML estimates. In the case of complete information or absence of re-sampling, the M-estimator coincides with the ML estimates. Application to parameter estimation of a regime switching conditional Markov jump process is discussed to verify the results. The simulation study confirms the accuracy and asymptotic properties of the M-estimator.

stat.ME↗

arXiv2020

The Leland-Toft optimal capital structure model under Poisson observations

We revisit the optimal capital structure model with endogenous bankruptcy first studied by Leland \cite{Leland94} and Leland and Toft \cite{Leland96}. Differently from the standard case, where shareholders observe continuously the asset value and bankruptcy is executed instantaneously without delay, we assume that the information of the asset value is updated only at intervals, modeled by the jump times of an independent Poisson process. Under the spectrally negative Lévy model, we obtain the optimal bankruptcy strategy and the corresponding capital structure. A series of numerical studies are given to analyze the sensitivity of observation frequency on the optimal solutions, the optimal leverage and the credit spreads.

q-fin.PR↗

arXiv2014

Optimal Selling Time of a Stock under Capital Gains Taxes

We investigate the impact of capital gains taxes on optimal investment decisions in a quite simple model. Namely, we consider a risk neutral investor who owns one risky stock from which she assumes that it has a lower expected return than the riskless bank account and determine the optimal stopping time at which she sells the stock to invest the proceeds in the bank account up to the maturity date. In the case of linear taxes and a positive riskless interest rate, the problem is nontrivial because at the selling time the investor has to realize book profits which triggers tax payments. We derive a boundary that is continuous and increasing in time and decreasing in the volatility of the stock such that the investor sells the stock at the first time its price is smaller or equal to this boundary.

q-fin.PM↗

arXiv2013

Optimal Capital Structure with Scale Effects under Spectrally Negative Levy Models

The optimal capital structure model with endogenous bankruptcy was first studied by Leland (1994) and Leland and Toft (1996), and was later extended to the spectrally negative Levy model by Hilberink and Rogers (2002) and Kyprianou and Surya (2007). This paper incorporates the scale effects by allowing the values of bankruptcy costs and tax benefits to be dependent on the firm's asset value. By using the fluctuation identities for the spectrally negative Levy process, we obtain a candidate bankruptcy level as well as a sufficient condition for optimality. The optimality holds in particular when, monotonically in the asset value, the value of tax benefits is increasing, the loss amount at bankruptcy is increasing, and its proportion relative to the asset value is decreasing. The solution admits a semi-explicit form in terms of the scale function. A series of numerical studies are given to analyze the impacts of scale effects on the default strategy and the optimal capital structure.

q-fin.GN↗