Portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 2
Published in Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences), 2019
Description
Download here
Published in Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences), 2020
This paper proves that using properly chosen threshold for group-hard thresholding estimator yields the optimal constant in front of parametric rate ($p/n$) in the risk bound for the expected error between the true mean value of Gaussian distribution and our estimator.
Download here
Published in Annals of Statistics (to appear), 2021
This paper presents a new robust estimator called Iteratively Re-weighted Mean (IRM) which enjoys 5 key properties desired for a robust estimator: computationally tractable, equivariant under similarity transformations, have a breakdown point around $0.28$, minimax optimal (up to logarithmic factor) and asymptotically efficient. IRM is obtained by an iterative reweighting approach assigning weights by solving a convex optimization problem (SDP). Dimension-free non-asymptotic risk bound for the expected error of the proposed estimator is proved. The results are extended for sub-Gaussian distributions, as well as for unknown contamination level or unknown covariance matrix. Joint work with A. S. Dalalyan.
Download here
Published in Electronic Journal of Statistics (submitted), 2021
We consider the problem of finding the matching map between two sets of $d$ dimensional vectors from noisy observations, where the second set contains outliers. The main result shows that, in the high-dimensional setting, a detection region of unknown injection can be characterized by the sets of vectors for which the inlier-inlier distance is of order at least $d^{1/4}$ and the inlier-outlier distance is of order at least $d^{1/2}$. These rates are achieved using the estimated matching minimizing the sum of logarithms of distances between matched pairs of points. We also prove lower bounds establishing optimality of these rates. Joint work with T. Galstyan and A. S. Dalalyan.
Download here
Published:
This is a description of your talk, which is a markdown files that can be all markdown-ified like any other post. Yay markdown!
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
Undergraduate course, University 1, Department, 2014
This is a description of a teaching experience. You can use markdown like any other post.
Workshop, University 1, Department, 2015
This is a description of a teaching experience. You can use markdown like any other post.