Preprints, Reports, Technical Reports

A. Ogaltsov, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, V. Spokoiny, Adaptive gradient descent for convex and nonconvex stochastic optimization, Preprint no. 2655, WIAS, Berlin, 2019, DOI 10.20347/WIAS.PREPRINT.2655 .
Abstract, PDF (538 kByte)
In this paper we propose several adaptive gradient methods for stochastic optimization. Our methods are based on Armijotype line search and they simultaneously adapt to the unknown Lipschitz constant of the gradient and variance of the stochastic approximation for the gradient. We consider an accelerated gradient descent for convex problems and gradient descent for nonconvex problems. In the experiments we demonstrate superiority of our methods to existing adaptive methods, e.g. AdaGrad and Adam. 
D. Belomestny, J.G.M. Schoenmakers, V. Spokoiny, Y. Tavyrikov, Optimal stopping via deeply boosted backward regression, Preprint no. 2530, WIAS, Berlin, 2018, DOI 10.20347/WIAS.PREPRINT.2530 .
Abstract, PDF (209 kByte)
In this note we propose a new approach towards solving numerically optimal stopping problems via boosted regression based Monte Carlo algorithms. The main idea of the method is to boost standard linear regression algorithms in each backward induction step by adding new basis functions based on previously estimated continuation values. The proposed methodology is illustrated by several numerical examples from finance.
Articles in Refereed Journals

K. Efimov, L. Adamyan, V. Spokoiny, Adaptive nonparametric clustering, IEEE Transactions on Information Theory, 65 (2019), pp. 48754892, DOI 10.1109/TIT.2019.2903113 .
Abstract
This paper presents a new approach to nonparametric cluster analysis called adaptive weights? clustering. The method is fully adaptive and does not require to specify the number of clusters or their structure. The clustering results are not sensitive to noise and outliers, and the procedure is able to recover different clusters with sharp edges or manifold structure. The method is also scalable and computationally feasible. Our intensive numerical study shows a stateoftheart performance of the method in various artificial examples and applications to text data. The idea of the method is to identify the clustering structure by checking at different points and for different scales on departure from local homogeneity. The proposed procedure describes the clustering structure in terms of weights $w_ij$ , and each of them measures the degree of local inhomogeneity for two neighbor local clusters using statistical tests of ?no gap? between them. The procedure starts from very local scale, and then, the parameter of locality grows by some factor at each step. We also provide a rigorous theoretical study of the procedure and state its optimal sensitivity to deviations from local homogeneity. 
F. Götze, A. Naumov, V. Spokoiny, V. Ulyanov, Large ball probabilities, Gaussian comparison and anticoncentration, Bernoulli. Official Journal of the Bernoulli Society for Mathematical Statistics and Probability, 25 (2019), pp. 25382563, DOI 10.3150/18BEJ1062 .
Abstract
We derive tight nonasymptotic bounds for the Kolmogorov distance between the probabilities of two Gaussian elements to hit a ball in a Hilbert space. The key property of these bounds is that they are dimensionfree and depend on the nuclear (Schattenone) norm of the difference between the covariance operators of the elements and on the norm of the mean shift. The obtained bounds significantly improve the bound based on Pinsker?s inequality via the Kullback?Leibler divergence. We also establish an anticoncentration bound for a squared norm of a noncentered Gaussian element in Hilbert space. The paper presents a number of examples motivating our results and applications of the obtained bounds to statistical inference and to highdimensional CLT. 
A. Naumov, V. Spokoiny, V. Ulyanov, Bootstrap confidence sets for spectral projectors of sample covariance, Probability Theory and Related Fields, 174 (2019), pp. 10911132, DOI 10.1007/s0044001808772 .

V. Spokoiny, N. Willrich, Bootstrap tuning in Gaussian ordered model selection, The Annals of Statistics, 47 (2019), pp. 13511380, DOI 10.1214/18AOS1717 .
Abstract
In the problem of model selection for a given family of linear estimators, ordered by their variance, we offer a new “smallest accepted” approach motivated by Lepski's device and the multiple testing idea. The procedure selects the smallest model which satisfies the acceptance rule based on comparison with all larger models. The method is completely datadriven and does not use any prior information about the variance structure of the noise: its parameters are adjusted to the underlying possibly heterogeneous noise by the so called “propagation condition” using bootstrap multiplier method. The validity of the bootstrap calibration is proved for finite samples with an explicit error bound. We provide a comprehensive theoretical study of the method and describe in details the set of possible values of the selector ( hatm ). We also establish some precise oracle error bounds for the corresponding estimator ( hattheta = tildetheta_hatm ) which equally applies to estimation of the whole parameter vectors, its subvector or linear mapping, as well as estimation of a linear functional. 
A. Naumov, V. Spokoiny, Y. Tavyrikov, V. Ulyanov, Nonasymptotic estimates of the closeness of Gaussian measures on the balls, Doklady Mathematics. Maik Nauka/Interperiodica Publishing, Moscow. English. Translation of the Mathematics Section of: Doklady Akademii Nauk. (Formerly: Russian Academy of Sciences. Doklady. Mathematics)., 98 (2018), pp. 490493.

A. Naumov, V. Spokoiny, V. Ulyanov, Bootstrap confidence sets for spectral projectors of sample covariance, Probability Theory and Related Fields, pp. published online on 26.10.2018, urlhttps://doi.org/10.1007/s0044001808772, DOI 10.1007/s0044001808772 .
Abstract
Let X1,?,Xn be i.i.d. sample in ?p with zero mean and the covariance matrix ?. The problem of recovering the projector onto an eigenspace of ? from these observations naturally arises in many applications. Recent technique from [Koltchinskii, Lounici, 2015] helps to study the asymptotic distribution of the distance in the Frobenius norm ?Pr?P?r?2 between the true projector Pr on the subspace of the rth eigenvalue and its empirical counterpart P?r in terms of the effective rank of ?. This paper offers a bootstrap procedure for building sharp confidence sets for the true projector Pr from the given data. This procedure does not rely on the asymptotic distribution of ?Pr?P?r?2 and its moments. It could be applied for small or moderate sample size n and large dimension p. The main result states the validity of the proposed procedure for finite samples with an explicit error bound for the error of bootstrap approximation. This bound involves some new sharp results on Gaussian comparison and Gaussian anticoncentration in highdimensional spaces. Numeric results confirm a good performance of the method in realistic examples. 
A. Naumov, V. Spokoiny, V. Ulyanov, Confidence sets for spectral projectors of covariance matrices, Doklady Mathematics. Maik Nauka/Interperiodica Publishing, Moscow. English. Translation of the Mathematics Section of: Doklady Akademii Nauk. (Formerly: Russian Academy of Sciences. Doklady. Mathematics)., 98 (2018), pp. 511514.

I. Silin, V. Spokoiny, Bayesian inference for spectral projectors of covariance matrix, Electronic Journal of Statistics, 12 (2018), pp. 19481987, DOI 10.1214/18EJS1451 .

A. Andresen, V. Spokoiny, Convergence of an alternating maximization procedure, Journal of Machine Learning Research (JMLR). MIT Press, Cambridge, MA. English, English abstracts., 53 (2017), pp. 389429, DOI 10.1214/15AIHP720 .

Y. Nesterov, V. Spokoiny, Random gradientfree minimization of convex functions, Foundations of Computational Mathematics. The Journal of the Society for the Foundations of Computational Mathematics, 17 (2017), pp. 527566.
Abstract
Summary: In this paper, we prove new complexity bounds for methods of convex optimization based only on computation of the function value. The search directions of our schemes are normally distributed random Gaussian vectors. It appears that such methods usually need at most nn times more iterations than the standard gradient methods, where nn is the dimension of the space of variables. This conclusion is true for both nonsmooth and smooth problems. For the latter class, we present also an accelerated scheme with the expected rate of convergence O(n2k2)O(n2k2), where kk is the iteration counter. For stochastic optimization, we propose a zeroorder scheme and justify its expected rate of convergence O(nk1/2)O(nk1/2). We give also some bounds for the rate of convergence of the random gradientfree methods to stationary points of nonconvex functions, for both smooth and nonsmooth cases. Our theoretical results are supported by preliminary computational experiments. 
V. Spokoiny, Penalized maximum likelihood estimation and effective dimension, Annales de l'Institut Henri Poincare. Probabilites et Statistiques, 53 (2017), pp. 389429, DOI 10.1214/15AIHP720 .

A. Kalinina, A. Suvorikova, V. Spokoiny, M. Gelfand, Detection of homologous recombination in closely related strains, Journal of Bioinformatics and Computational Biology, 14 (2016), pp. 1641001/11641001/12.

A. Andresen, V. Spokoiny, Convergence for an alternation maximization procedure, Journal of Machine Learning Research (JMLR). MIT Press, Cambridge, MA. English, English abstracts., 17 (2016), pp. 153.

A. Gasnikov, P. Dvurechensky, V. Spokoiny, P. Stetsyuk, A. Suvorikova, Superposition of the balancing algorithm and the universal gradient method for search of the regularized Wasserstein barycenter and equilibria in multistage transport models, Proceedings of Moscow Institute of Physics and Technology, 8 (2016), pp. 524.

Y. Chen, V. Spokoiny, Modeling nonstationary and leptokurtic financial time series, Econometric Theory, (2015), pp. 703728.

A. Gasnikov, Y. Nesterov, V. Spokoiny, On the efficiency of a randomized mirror descent algorithm in online optimization problems, Computational Mathematics and Mathematical Physics, 55 (2015), pp. 580596.

A. Gasnikov, P. Dvurechensky, D. Kamzolov, Y. Nesterov, V. Spokoiny, P. Stetsyuk, A. Suvorikova, A. Chernov, Searching for equilibriums in multistage transport models (in Russian), Proceedings of Moscow Institute of Physics and Technology, 7 (2015), pp. 143155.

V.G. Gitis, A.B. Derendyaev, S.A. Pirogov, V. Spokoiny, E.F. Yurkov, Adaptive estimation of seismic parameter fields from earthquakes catalogs, Journal of Communications Technology and Electronics, 60 (2015), pp. 14591465.

M. Panov, V. Spokoiny, Finite sample Bernsteinvon Mises theorem for semiparametric problems, Bayesian Analysis, 10 (2015), pp. 665710.

P. Dvurechensky, Y. Nesterov, V. Spokoiny, Primaldual methods for solving infinitedimensional games, Journal of Optimization Theory and Applications, 166 (2015), pp. 2351.

V. Spokoiny, M. Zhilova, Bootstrap confidence sets under a model misspecification, The Annals of Statistics, 43 (2015), pp. 26532675.
Abstract
A multiplier bootstrap procedure for construction of likelihoodbased confidence sets is considered for finite samples and possible model misspecification. Theoretical results justify the bootstrap consistency for small or moderate sample size and allow to control the impact of the parameter dimension: the bootstrap approximation works if the ratio of cube of the parameter dimension to the sample size is small. The main result about bootstrap consistency continues to apply even if the underlying parametric model is misspecified under the so called Small Modeling Bias condition. In the case when the true model deviates significantly from the considered parametric family, the bootstrap procedure is still applicable but it becomes a bit conservative: the size of the constructed confidence sets is increased by the modeling bias. We illustrate the results with numerical examples of misspecified constant and logistic regressions. 
A. Andresen, V. Spokoiny, Critical dimension in profile semiparametric estimation, Electronic Journal of Statistics, 8 (2014), pp. 30773125.

N. Baldin, V. Spokoiny, Bayesian model selection and the concentration of the posterior of hyperparameters, Journal of Mathematical Sciences (New York), 203 (2014), pp. 761776.

D. Belomestny, V. Spokoiny, Concentration inequalities for smooth random fields, Theory of Probability and its Applications, 58 (2014), pp. 314323.
Abstract
In this note we derive a sharp concentration inequality for the supremum of a smooth random field over a finite dimensional set. It is shown that this supremum can be bounded with high probability by the value of the field at some deterministic point plus an intrinsic dimension of the optimisation problem. As an application we prove the exponential inequality for a function of the maximal eigenvalue of a random matrix is proved. 
G. Milshteyn, V. Spokoiny, Construction of meanselffinancing strategies for European options under regimeswitching, SIAM Journal on Financial Mathematics, ISSN 1945497X, 5 (2014), pp. 532556.
Abstract
The paper focuses on the problem of pricing and hedging a European contingent claim for an incomplete market model, in which evolution of price processes for a saving account and stocks depends on an observable Markov chain. The pricing function is evaluated using the martingale approach. The equivalent martingale measure is introduced in a way that the Markov chain remains the historical one. Due to the Markovian structure of the considered model, the pricing function satisfies the Cauchy problem for a system of linear parabolic partial differential equations. It is shown that any European contingent claim is attainable using a generalized replicating strategy which is selffinancing in mean. For such a strategy, apart from the initial endowment and trading, some additional funds are required both stepwise at the jump moments of the Markov chain and continuously between the jump moments. The connection of the considered pricing and hedging problems with partial differential equations is very useful for computations. 
A. Zaytsev, E. Burnaev, V. Spokoiny, Properties of the Bayesian parameter estimation of a regression based on Gaussian processes, Journal of Mathematical Sciences (New York), 203 (2014), pp. 789798.

M. Zhilova, V. Spokoiny, Uniform properties of the local maximum likelihood estimate, Automation and Remote Control, 74 (2013), pp. 16561669.

D. Belomestny, V. Spokoiny, Concentration inequalities for smooth random fields, Theory of Probability and its Applications, (2013), pp. 401410.

E. Burnaev, A. Zaytsev, V. Spokoiny, Nonasymptotic properties for Gaussian field regression, Automation and Remote Control, 74 (2013), pp. 16451655.

E. Burnaev, A. Zaitsev, V. Spokoiny, Bernsteinvon Mises theorem for regression based on Gaussian processes, Russian Mathematical Surveys, 68 (2013), pp. 954956.

E. Diederichs, A. Juditsky, A. Nemirovski, V. Spokoiny, Sparse non Gaussian component analysis by semidefinite programming, Journal of Machine Learning Research (JMLR). MIT Press, Cambridge, MA. English, English abstracts., (2013), pp. 128.

F. Gach, R. Nickl, V. Spokoiny, Spatially adaptive density estimation by localised Haar projections, Annales de l'Institut Henri Poincare. Probabilites et Statistiques, 49 (2013), pp. 900914.

A. Zaitsev, E. Burnaev, V. Spokoiny, Properties of the posterior distribution of a regression model based on Gaussian random fields, Automation and Remote Control, 74 (2013), pp. 16451655.

V. Spokoiny, M. Zhilova, Sharp deviation bounds for quadratic forms, Mathematical Methods of Statistics, 22 (2013), pp. 100113.

V. Spokoiny, W. Wang, W. Härdle, Local quantile regression (with rejoinder), Journal of Statistical Planning and Inference, 143 (2013), pp. 11091129.

V. Spokoiny, Parametric estimation. Finite sample theory, The Annals of Statistics, 40 (2012), pp. 28772909.

Y. Chen, W. Härdle, V. Spokoiny, GHICA  Risk analysis with GH distributions and independent components, Journal of Empirical Finance, 17 (2010), pp. 255269.

E. Diederichs, A. Juditsky, V. Spokoiny, Ch. Schütte, Sparse nonGaussian component analysis, IEEE Transactions on Information Theory, 56 (2010), pp. 30333047.

P. Čížek, W. Härdle, V. Spokoiny, Adaptive pointwise estimation in timeinhomogeneous conditional heteroscedasticity models, The Econometrics Journal, 12 (2009), pp. 248271.

E. Giacomini, W. Härdle, V. Spokoiny, Inhomogeneous dependency modelling with time varying copulae, Journal of Business & Economic Statistics, 27 (2009), pp. 224234.
Abstract
Measuring dependence in a multivariate time series is tantamount to modelling its dynamic structure in space and time. In the context of a multivariate normally distributed time series, the evolution of the covariance (or correlation) matrix over time describes this dynamic. A wide variety of applications, though, requires a modelling framework different from the multivariate normal. In risk management the nonnormal behaviour of most financial time series calls for nonlinear dependency. The correct modelling of nongaussian dependencies is therefore a key issue in the analysis of multivariate time series. In this paper we use copulae functions with adaptively estimated time varying parameters for modelling the distribution of returns, free from the usual normality assumptions. Further, we apply copulae to estimation of ValueatRisk (VaR) of a portfolio and show its better performance over the RiskMetrics approach, a widely used methodology for VaR estimation 
Y. Golubev, V. Spokoiny, Exponential bounds for minimum contrast estimators, Electronic Journal of Statistics, 3 (2009), pp. 712746.

D. Belomestny, G.N. Milstein, V. Spokoiny, Regression methods in pricing American and Bermudan options using consumption processes, Quantitative Finance, 9 (2009), pp. 315327.
Abstract
Here we develop methods for efficient pricing multidimensional discretetime American and Bermudan options by using regression based algorithms together with a new approach towards constructing upper bounds for the price of the option. Applying sample space with payoffs at the optimal stopping times, we propose sequential estimates for continuation values, values of the consumption process, and stopping times on the sample paths. The approach admits constructing both low and upper bounds for the price by Monte Carlo simulations. The methods are illustrated by pricing Bermudan swaptions and snowballs in the Libor market model. 
V. Spokoiny, C. Vial, Parameter tuning in pointwise adaptation using a propagation approach, The Annals of Statistics, 37 (2009), pp. 27832807.
Abstract, PDF (550 kByte)
This paper discusses the problem of adaptive estimating a univariate object like the value of a regression function at a given point or a linear functional in a linear inverse problem. We consider an adaptive procedure originated from Lepski (1990) which selects in a datadriven way one estimate out of a given class of estimates ordered by their variability. A serious problem with using this and similar procedures is the choice of some tuning parameters like thresholds. Numerical results show that the theoretically recommended proposals appear to be too conservative and lead to a strong oversmoothing effects. A careful choice of the parameters of the procedure is extremely important for getting the reasonable quality of estimation. The main contribution of this paper is the new approach for choosing the parameters of the procedure by providing the prescribed behavior of the resulting estimate in the simple parametric situation. We establish a nonasymptotical “oracle” bound which shows that the estimation risk is, up to a logarithmic multiplier, equal to the risk of the “oracle” estimate which is optimally selected from the given family. A numerical study demonstrates the nice performance of the resulting procedure in a number of simulated examples. 
V. Spokoiny, Multiscale local change point detection with applications to ValueatRisk, The Annals of Statistics, 37 (2009), pp. 14051436.
Abstract, PDF (640 kByte)
This paper offers a new procedure for nonparametric estimation and forecasting of time series with applications to volatility modeling for financial data. The approach is based on the assumption of local homogeneity: for every time point there exists a historical emphinterval of homogeneity, in which the volatility parameter can be well approximated by a constant. The procedure recovers this interval from the data using the local change point (LCP) analysis. Afterwards the estimate of the volatility can be simply obtained by local averaging. The approach carefully addresses the question of choosing the tuning parameters of the procedure using the so called “propagation” condition. The main result claims a new “oracle” inequality in terms of the modeling bias which measures the quality of the local constant approximation. This result yields the optimal rate of estimation for smooth and piecewise constant volatility functions. Then the new procedure is applied to some data sets and a comparison with a standard GARCH model is also provided. Finally we discuss applications of the new method to the Value at Risk problem. The numerical results demonstrate a very reasonable performance of the new method. 
K. Tabelow, J. Polzehl, V. Spokoiny, H.U. Voss, Diffusion tensor imaging: Structural adaptive smoothing, NeuroImage, 39 (2008), pp. 17631773.
Abstract
Diffusion Tensor Imaging (DTI) data is characterized by a high noise level. Thus, estimation errors of quantities like anisotropy indices or the main diffusion direction used for fiber tracking are relatively large and may significantly confound the accuracy of DTI in clinical or neuroscience applications. Besides pulse sequence optimization, noise reduction by smoothing the data can be pursued as a complementary approach to increase the accuracy of DTI. Here, we suggest an anisotropic structural adaptive smoothing procedure, which is based on the PropagationSeparation method and preserves the structures seen in DTI and their different sizes and shapes. It is applied to artificial phantom data and a brain scan. We show that this method significantly improves the quality of the estimate of the diffusion tensor and hence enables one either to reduce the number of scans or to enhance the input for subsequent analysis such as fiber tracking. 
A. Dalalyan, A. Juditsky, V. Spokoiny, A new algorithm for estimating the effective dimensionreduction subspace, Journal of Machine Learning Research (JMLR). MIT Press, Cambridge, MA. English, English abstracts., 9 (2008), pp. 16471678.
PDF (290 kByte) 
I.G. Grama, V. Spokoiny, Statistics of extremes by oracle estimation, The Annals of Statistics, 36 (2008), pp. 16191648.
Abstract, PDF (3712 kByte)
We use the fitted Pareto law to construct an accompanying approximation of the excess distribution function. A selection rule of the location of the excess distribution function is proposed based on a stagewise lackoffit testing procedure. Our main result is an oracle type inequality for the KullbackLeibler loss of the obtained adaptive estimator. 
V. Katkovnik, V. Spokoiny, Spatially adaptive estimation via fitted local likelihood techniques, IEEE Transactions on Signal Processing, 56 (2008), pp. 873886.
Abstract, PDF (1230 kByte)
This paper offers a new technique for spatially adaptive estimation. The local likelihood is exploited for nonparametric modelling of observations and estimated signals. The approach is based on the assumption of a local homogeneity of the signal: for every point there exists a neighborhood in which the signal can be well approximated by a constant. The fitted local likelihood statistics is used for selection of an adaptive size of this neighborhood. The algorithm is developed for quite a general class of observations subject to the exponential distribution. The estimated signal can be uni and multivariable. We demonstrate a good performance of the new algorithm for Poissonian image denoising and compare of the new method versus the intersection of confidence interval (ICI) technique that also exploits a selection of an adaptive neighborhood for estimation. 
Y. Chen, W. Härdle, V. Spokoiny, Portfolio value at risk based on independent components analysis, Journal of Computational and Applied Mathematics, 205 (2007), pp. 594607.
Abstract, PDF (446 kByte)
Risk management technology applied to highdimensional portfolios needs simple and fast methods for calculation of value at risk (VaR). The multivariate normal framework provides a simple offtheshelf methodology but lacks the heavytailed distributional properties that are observed in data. A principle componentbased method (tied closely to the elliptical structure of the distribution) is therefore expected to be unsatisfactory. Here, we propose and analyze a technology that is based on independent component analysis (ICA). We study the proposed ICVaR methodology in an extensive simulation study and apply it to a highdimensional portfolio situation. Our analysis yields very accurate VaRs. 
G.N. Milstein, J.G.M. Schoenmakers, V. Spokoiny, Forward and reverse representations for Markov chains, Stochastic Processes and their Applications, 117 (2007), pp. 10521075.
Abstract, PDF (274 kByte)
In this paper we carry over the concept of reverse probabilistic representations developed in Milstein, Schoenmakers, Spokoiny (2004) for diffusion processes, to discrete time Markov chains. We outline the construction of reverse chains in several situations and apply this to processes which are connected with jumpdiffusion models and finite state Markov chains. By combining forward and reverse representations we then construct transition density estimators for chains which have rootN accuracy in any dimension and consider some applications. 
D. Belomestny, V. Spokoiny, Spatial aggregation of local likelihood estimates with applications to classification, The Annals of Statistics, 35 (2007), pp. 22872311.
Abstract, PDF (373 kByte)
This paper presents a new method for spatially adaptive local (constant) likelihood estimation which applies to a broad class of nonparametric models, including the Gaussian, Poisson and binary response models. The main idea of the method is given a sequence of local likelihood estimates (”weak” estimates), to construct a new aggregated estimate whose pointwise risk is of order of the smallest risk among all “weak” estimates. We also propose a new approach towards selecting the parameters of the procedure by providing the prescribed behavior of the resulting estimate in the simple parametric situation. We establish a number of important theoretical results concerning the optimality of the aggregated estimate. In particular, our “oracle” results claims that its risk is up to some logarithmic multiplier equal to the smallest risk for the given family of estimates. The performance of the procedure is illustrated by application to the classification problem. A numerical study demonstrates its nice performance in simulated and real life examples. 
K. Tabelow, J. Polzehl, H.U. Voss, V. Spokoiny, Analyzing fMRI experiments with structural adaptive smoothing procedures, NeuroImage, 33 (2006), pp. 5562.
Abstract, PDF (281 kByte)
Data from functional magnetic resonance imaging (fMRI) consists of time series of brain images which are characterized by a low signaltonoise ratio. In order to reduce noise and to improve signal detection the fMRI data is spatially smoothed. However, the common application of a Gaussian filter does this at the cost of loss of information on spatial extent and shape of the activation area. We suggest to use the propagationseparation procedures introduced by Polzehl and Spokoiny (2006) instead. We show that this significantly improves the information on the spatial extent and shape of the activation region with similar results for the noise reduction. To complete the statistical analysis, signal detection is based on thresholds defined by random field theory. Effects of ad aptive and nonadaptive smoothing are illustrated by artificial examples and an analysis of experimental data. 
G. Blanchard, M. Kawanabe, M. Sugiyama, V. Spokoiny, K.R. Müller, In search of nonGaussian components of a highdimensional distribution, Journal of Machine Learning Research (JMLR). MIT Press, Cambridge, MA. English, English abstracts., 7 (2006), pp. 247282.
Abstract, PDF (1502 kByte)
Finding nonGaussian components of highdimensional data is an important preprocessing step for efficient information processing. This article proposes a new em linear method to identify the “nonGaussian subspace” within a very general semiparametric framework. Our proposed method, called NGCA (NonGaussian Component Analysis), is essentially based on the fact that we can construct a linear operator which, to any arbitrary nonlinear (smooth) function, associates a vector which belongs to the low dimensional nonGaussian target subspace up to an estimation error. By applying this operator to a family of different nonlinear functions, one obtains a family of different vectors lying in a vicinity of the target space. As a final step, the target space itself is estimated by applying PCA to this family of vectors. We show that this procedure is consistent in the sense that the estimaton error tends to zero at a parametric rate, uniformly over the family. Numerical examples demonstrate the usefulness of our method. 
A. Goldenshluger, V. Spokoiny, Recovering convex edges of image from noisy tomographic data, IEEE Transactions on Information Theory, 52 (2006), pp. 13221334.
PDF (906 kByte) 
J. Polzehl, V. Spokoiny, Propagationseparation approach for local likelihood estimation, Probability Theory and Related Fields, 135 (2006), pp. 335362.
Abstract, PDF (793 kByte)
The paper presents a unified approach to local likelihood estimation for a broad class of nonparametric models, including, e.g., regression, density, Poisson and binary response models. The method extends the adaptive weights smoothing (AWS) procedure introduced by the authors [Adaptive weights smoothing with applications to image sequentation. J. R. Stat. Soc., Ser. B 62, 335354 (2000)] in the context of image denoising. The main idea of the method is to describe a greatest possible local neighborhood of every design point in which the local parametric assumption is justified by the data. The method is especially powerful for model functions having large homogeneous regions and sharp discontinuities. The performance of the proposed procedure is illustrated by numerical examples for density estimation and classification. We also establish some remarkable theoretical nonasymptotic results on properties of the new algorithm. This includes the “propagation” property which particularly yields the root$n$ consistency of the resulting estimate in the homogeneous case. We also state an “oracle” result which implies rate optimality of the estimate under usual smoothness conditions and a “separation” result which explains the sensitivity of the method to structural changes. 
A. Samarov, V. Spokoiny, C. Vial, Component identification and estimation in nonlinear highdimensional regression models by structural adaptation, Journal of the American Statistical Association, 100 (2005), pp. 429445.
PDF (454 kByte) 
M. Giurcanu, V. Spokoiny, Confidence estimation of the covariance function of stationary and locally stationary processes, Statistics & Decisions. International Journal for Statistical Theory and Related Fields, 22 (2004), pp. 283300.
PDF (224 kByte) 
A. Goldenshluger, V. Spokoiny, On the shapefrommoments problem and recovering edges from noisy Radon data, Probability Theory and Related Fields, 128 (2004), pp. 123140.
PDF (148 kByte) 
G.N. Milstein, J.G.M. Schoenmakers, V. Spokoiny, Transition density estimation for stochastic differential equations via forwardreverse representations, Bernoulli. Official Journal of the Bernoulli Society for Mathematical Statistics and Probability, 10 (2004), pp. 281312.
Abstract, PDF (274 kByte)
The general reverse diffusion equations are derived and applied to the problem of transition density estimation of diffusion processes between two fixed states. For this problem we propose density estimation based on forward?reverse representations and show that this method allows essentially better results to be achieved than the usual kernel or projection estimation based on forward representations only. 
V. Spokoiny, D. Mercurio, Statistical inference for timeinhomogeneous volatility models, The Annals of Statistics, 32 (2004), pp. 577602.
PDF (438 kByte) 
W. Härdle, H. Herwatz, V. Spokoiny, Time inhomogeneous multiple volatility modelling, Journal of Financial Econometrics, 1 (2003), pp. 5595.

J. Polzehl, V. Spokoiny, Image denoising: Pointwise adaptive approach, The Annals of Statistics, 31 (2003), pp. 3057.
Abstract, PDF (507 kByte)
A new method of pointwise adaptation has been proposed and studied in Spokoiny (1998) in context of estimation of piecewise smooth univariate functions. The present paper extends that method to estimation of bivariate greyscale images composed of large homogeneous regions with smooth edges and observed with noise on a gridded design. The proposed estimator $, hatf(x) ,$ at a point $, x ,$ is simply the average of observations over a window $, hatU(x) ,$ selected in a datadriven way. The theoretical properties of the procedure are studied for the case of piecewise constant images. We present a nonasymptotic bound for the accuracy of estimation at a specific grid point $, x ,$ as a function of the number of pixel $n$, of the distance from the point of estimation to the closest boundary and of smoothness properties and orientation of this boundary. It is also shown that the proposed method provides a near optimal rate of estimation near edges and inside homogeneous regions. We briefly discuss algorithmic aspects and the complexity of the procedure. The numerical examples demonstrate a reasonable performance of the method and they are in agreement with the theoretical issues. An example from satellite (SAR) imaging illustrates the applicability of the method. 
J.L. Horowitz, V. Spokoiny, An adaptive, rateoptimal test of linearity for median regression models, Journal of the American Statistical Association, 97 (2002), pp. 822835.
PDF (282 kByte), Postscript (694 kByte) 
R. Liptser, A.Y. Veretennikov, V. Spokoiny, FreidlinWentzell type moderate deviations for smooth processes, Markov Processes and Related Fields, 8 (2002), pp. 611636.
PDF (348 kByte), Postscript (343 kByte) 
V. Spokoiny, Variance estimation for highdimensional regression models, Journal of Multivariate Analysis, 82 (2002), pp. 111133.
PDF (295 kByte), Postscript (278 kByte) 
L. Dümbgen, V. Spokoiny, Multiscale testing of qualitative hypotheses, The Annals of Statistics, 29 (2001), pp. 124152.
PDF (324 kByte) 
W. Härdle, S. Sperlich, V. Spokoiny, Structural tests for additive regression, Journal of the American Statistical Association, 96 (2001), pp. 13331347.
PDF (382 kByte) 
J.L. Horowitz, V. Spokoiny, An adaptive, rateoptimal test of a parametric meanregression model against a nonparametric alternative, Econometrica. Journal of the Econometric Society, 69 (2001), pp. 599631.
PDF (422 kByte), Postscript (1830 kByte) 
M. Hristache, A. Juditsky, J. Polzehl, V. Spokoiny, Structure adaptive approach for dimension reduction, The Annals of Statistics, 29 (2001), pp. 15371566.
Abstract, PDF (265 kByte)
We propose a new method of effective dimension reduction for a multiindex model which is based on iterative improvement of the family of average derivative estimates. The procedure is computationally straightforward and does not require any prior information about the structure of the underlying model. We show that in the case when the effective dimension $m$ of the index space does not exceed $3$, this space can be estimated with the rate $n^1/2$ under rather mild assumptions on the model. 
M. Hristache, A. Juditsky, V. Spokoiny, Direct estimation of the index coefficient in a singleindex model, The Annals of Statistics, 29 (2001), pp. 595623.
PDF (247 kByte) 
J. Polzehl, V. Spokoiny, Functional and dynamic Magnetic Resonance Imaging using vector adaptive weights smoothing, Journal of the Royal Statistical Society. Series C. Applied Statistics, 50 (2001), pp. 485501.
Abstract, PDF (371 kByte)
We consider the problem of statistical inference for functional and dynamic Magnetic Resonance Imaging (MRI). A new approach is proposed which extends the adaptive weights smoothing (AWS) procedure from Polzehl and Spokoiny (2000) originally designed for image denoising. We demonstrate how the AWS method can be applied for time series of images, which typically occur in functional and dynamic MRI. It is shown how signal detection in functional MRI and analysis of dynamic MRI can benefit from spatially adaptive smoothing. The performance of the procedure is illustrated using real and simulated data. 
V. Spokoiny, Data driven testing the fit of linear models, Mathematical Methods of Statistics, 10 (2001), pp. 465497.
PDF (373 kByte), Postscript (421 kByte) 
R. Liptser, V. Spokoiny, Deviation probability bound for martingales with applications to statistical estimation, Statistics & Probability Letters, 46 (2000), pp. 347357.
PDF (269 kByte) 
R. Liptser, V. Spokoiny, On estimating a dynamic function of a stochastic system with averaging, Statistical Inference for Stochastic Processes. An International Journal Devoted to Time Series Analysis and the Statistics of Continuous Time Processes and Dynamical Systems, 3 (2000), pp. 225249.
PDF (331 kByte), Postscript (344 kByte) 
J. Polzehl, V. Spokoiny, Adaptive Weights Smoothing with applications to image restoration, Journal of the Royal Statistical Society. Series B. Statistical Methodology, 62 (2000), pp. 335354.
Abstract, PDF (5980 kByte)
We propose a new method of nonparametric estimation which is based on locally constant smoothing with an adaptive choice of weights for every pair of datapoints. Some theoretical properties of the procedure are investigated. Then we demonstrate the performance of the method on some simulated univariate and bivariate examples and compare it with other nonparametric methods. Finally we discuss applications of this procedure to magnetic resonance and satellite imaging. 
V. Spokoiny, Adaptive drift estimation for nonparametric diffusion model, The Annals of Statistics, 28 (2000), pp. 815836.
PDF (160 kByte)

R. Liptser, V. Spokoiny, Moderate deviations type evaluation for integral functionals of diffusion processes, Electron. J. Probab., 4(17) (1999) 25pp. (electronic)
PDF(284 kByte) 
O. Lepski, V. Spokoiny, Minimax nonparametric hypothesis testing: the case of an inhomogeneous alternative, Bernoulli, 5 (1999) pp. 333358.
PDF(304 kByte) 
Y. Kutoyants, V. Spokoiny, Optimal choice of observation window for Poisson observations, Statist. Probab. Lett., 44 (1999) pp. 291298.
PDF(162 kByte) 
O. Lepski, A. Nemerovski, V. Spokoiny, On estimation of the $L_r$ norm of a regression function, Probab. Theory Related Fields, 113 (1999) pp. 245273.
PDF(327 kByte) 
A. Puhalskii, V. Spokoiny, On largedeviation efficiency in statistical inference, Bernoulli, 4 (1998) pp. 203272.
PDF(556 kByte) 
V. Spokoiny, Adaptive and spatially adaptive testing of a nonparametric hypothesis, Math. Methods Statist., 7 (1998) pp. 245273.
PDF(323 kByte) 
V. Spokoiny, Estimation of a function with discontinuities via local polynomial fit with an adaptive window choice, Ann. Statist., 26 (1998) pp. 13561378.
PDF(176 kByte) 
O. Lepski, V. Spokoiny, Optimal pointwise adaptive methods in nonparametric estimation, Ann. Statist., 25 (1997) pp. 25122546.
PDF(216 kByte) 
O. Lepski, E. Mammen, V. Spokoiny, Optimal spatial adaptation to inhomogeneous smoothness: an approach based on kernel estimates with variable bandwidth selectors, Ann. Statist., 25 (1997) pp. 929947.
PDF(319 kByte) 
W. Härdle, V. Spokoiny, S. Sperlich, Semiparametric single index versus fixed link function modelling, Ann. Statist., 25 (1997) pp. 212243.
PDF(538 kByte) 
A. Shiryaev, V. Spokoiny, On sequential estimation of an autoregressive parameter, Stochastics Stochastics Rep., 60 (1997) pp. 219240.
PDF(422 kByte) 
A. Korostelev, V. Spokoiny, Exact asymptotics of minimax Bahdur risk in Lipschitz regression, Statistics, 28 (1996) pp. 1324.
PDF(180 kByte) 
V. Spokoiny, Adaptive hypothesis testing using wavelets, Ann. Statist., 24 (1996) pp. 24772498.
PDF(360 kByte)