Search Results for author: Vladimir Spokoiny

Found 8 papers, 4 papers with code

High dimensional change-point detection: a complete graph approach

no code implementations16 Mar 2022 Yang-Wen Sun, Katerina Papagiannouli, Vladimir Spokoiny

We propose a complete graph-based, change-point detection algorithm to detect change of mean and variance from low to high-dimensional online data with a variable scanning window.

Change Point Detection Vocal Bursts Intensity Prediction

Manifold-based time series forecasting

1 code implementation15 Dec 2020 Nikita Puchkin, Aleksandr Timofeev, Vladimir Spokoiny

Prediction for high dimensional time series is a challenging task due to the curse of dimensionality problem.

Denoising Time Series Forecasting Statistics Theory Statistics Theory

Reinforced optimal control

no code implementations24 Nov 2020 Christian Bayer, Denis Belomestny, Paul Hager, Paolo Pigato, John Schoenmakers, Vladimir Spokoiny

Least squares Monte Carlo methods are a popular numerical approximation method for solving stochastic control problems.

Math regression

Adaptive Gradient Descent for Convex and Non-Convex Stochastic Optimization

1 code implementation19 Nov 2019 Aleksandr Ogaltsov, Darina Dvinskikh, Pavel Dvurechensky, Alexander Gasnikov, Vladimir Spokoiny

In this paper we propose several adaptive gradient methods for stochastic optimization.

Optimization and Control

Structure-adaptive manifold estimation

1 code implementation12 Jun 2019 Nikita Puchkin, Vladimir Spokoiny

We consider a problem of manifold estimation from noisy observations.

Optimal stopping via reinforced regression

no code implementations7 Aug 2018 Denis Belomestny, John Schoenmakers, Vladimir Spokoiny, Bakhyt Zharkynbay

In this note we propose a new approach towards solving numerically optimal stopping problems via reinforced regression based Monte Carlo algorithms.

regression

An adaptive multiclass nearest neighbor classifier

no code implementations8 Apr 2018 Nikita Puchkin, Vladimir Spokoiny

We consider a problem of multiclass classification, where the training sample $S_n = \{(X_i, Y_i)\}_{i=1}^n$ is generated from the model $\mathbb P(Y = m | X = x) = \eta_m(x)$, $1 \leq m \leq M$, and $\eta_1(x), \dots, \eta_M(x)$ are unknown $\alpha$-Holder continuous functions. Given a test point $X$, our goal is to predict its label.

Adaptive Nonparametric Clustering

1 code implementation26 Sep 2017 Kirill Efimov, Larisa Adamyan, Vladimir Spokoiny

The idea is to identify the clustering structure by checking at different points and for different scales on departure from local homogeneity.

Clustering Nonparametric Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.