One-Step Estimation with Scaled Proximal Methods
نویسندگان
چکیده
We study statistical estimators computed using iterative optimization methods that are not run until completion. Classical results on maximum likelihood (MLEs) assert a one-step estimator (OSE), in which single Newton-Raphson iteration is performed from starting point with certain properties, asymptotically equivalent to the MLE. further develop these early-stopping by deriving properties of defined scaled proximal methods. Our main show asymptotic equivalence likelihood-based and various By interpreting OSEs as last sequence iterates, our provide insight scaling numerical tolerance sample size. setting contains gradient descent applied composite models special case, making applicable many problems practical interest. Additionally, support for utility Moreau envelope smoother quasi-Newton method envelope.
منابع مشابه
Block Implicit One - Step Methods
A class of one-step methods which obtain a block of r new values at each step are studied. The asymptotic behavior of both implicit and predictor-corrector procedures is examined.
متن کاملOne-Step R-Estimation in Linear Models with Stable Errors
Classical estimation techniques for linear models either are inconsistent, or perform rather poorly, under αstable error densities; most of them are not even rate-optimal. In this paper, we propose an original one-step R-estimation method and investigate its asymptotic performances under stable densities. Contrary to traditional least squares, the proposed R-estimators remain root-n consistent ...
متن کاملOne - way Large Range Step Methods forHelmholtz
A useful approach for long range computation of the Helmholtz equation in a waveguide is to re-formulate it as the operator diierential Riccati equation for the Dirichlet-to-Neumann (DtN) map. For waveguides with slow range dependence, the piecewise range independent approximation is used to derive a second order range stepping method for this one-way re-formulation. The range marching formulas...
متن کاملTheory and Methods for One -step Odes
where f is continuous and outputs an Rd vector. approximation on grid functions Let y(t) be the true solution. LetH be the grid dened by step-sizes: h1 , . . . , hN such that 0 < t1 < . . . < tN satises t i = ∑ l=1 h i .1 Let ∣H∣ = maxi h i . 1 is is just the obvious grid where h i = t i − t i−1 . We are parameterizing it by the step-sizes h i instead of times because h is what shows up in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2022
ISSN: ['0364-765X', '1526-5471']
DOI: https://doi.org/10.1287/moor.2021.1212