SearcharxivSearch

arXiv subjects

Mehdi Rostami

Publications and source records attributed to Mehdi Rostami.

7 recordsLinked to original sources

Essential contractibility of Banach algebras

In this paper, a new notion, essential contractibility of Banach algebras, is introduced and some of its properties are examined. The main result is to investigate the essential contractibility of (symmetric abstract) Segal algebras.

math.FA

Non-reflexivity of the Banach space $\Lambda BV^{(p)}$

In this paper, we show that the Waterman-Shiba space is non-reflexive. In fact, Prus-Wi\'sniowski and Ruckle, in \cite{1}, generalized the well-known fact that states the space of bounded variation functions is non-reflexive. Here, an improvement of that result is provided.

math.FA

Multiply Robust Estimator Circumvents Hyperparameter Tuning of Neural Network Models in Causal Inference

Estimation of the Average Treatment Effect (ATE) is often carried out in 2 steps, wherein the first step, the treatment and outcome are modeled, and in the second step the predictions are inserted into the ATE estimator. In the first steps, numerous models can be fit to the treatment and outcome, including using machine learning algorithms. However, it is a difficult task to choose among the hyperparameter sets which will result in the best causal effect estimation and inference. Multiply Robust (MR) estimator allows us to leverage all the first-step models in a single estimator. We show that MR estimator is $n^r$ consistent if one of the first-step treatment or outcome models is $n^r$ consistent. We also show that MR is the solution to a broad class of estimating equations, and is asymptotically normal if one of the treatment models is $\sqrt{n}$-consistent. The standard error of MR is also calculated which does not require a knowledge of the true models in the first step. Our simulations study supports the theoretical findings.

stat.ME

A Feature Selection Method that Controls the False Discovery Rate

The problem of selecting a handful of truly relevant variables in supervised machine learning algorithms is a challenging problem in terms of untestable assumptions that must hold and unavailability of theoretical assurances that selection errors are under control. We propose a distribution-free feature selection method, referred to as Data Splitting Selection (DSS) which controls False Discovery Rate (FDR) of feature selection while obtaining a high power. Another version of DSS is proposed with a higher power which "almost" controls FDR. No assumptions are made on the distribution of the response or on the joint distribution of the features. Extensive simulation is performed to compare the performance of the proposed methods with the existing ones.

stat.ME

Normalized Augmented Inverse Probability Weighting with Neural Network Predictions

The estimation of Average Treatment Effect (ATE) as a causal parameter is carried out in two steps, where in the first step, the treatment and outcome are modeled to incorporate the potential confounders, and in the second step, the predictions are inserted into the ATE estimators such as the Augmented Inverse Probability Weighting (AIPW) estimator. Due to the concerns regarding the nonlinear or unknown relationships between confounders and the treatment and outcome, there has been an interest in applying non-parametric methods such as Machine Learning (ML) algorithms instead. Some literature proposes to use two separate Neural Networks (NNs) where there's no regularization on the network's parameters except the Stochastic Gradient Descent (SGD) in the NN's optimization. Our simulations indicate that the AIPW estimator suffers extensively if no regularization is utilized. We propose the normalization of AIPW (referred to as nAIPW) which can be helpful in some scenarios. nAIPW, provably, has the same properties as AIPW, that is, the double-robustness and orthogonality properties. Further, if the first step algorithms converge fast enough, under regulatory conditions, nAIPW will be asymptotically normal. We also compare the performance of AIPW and nAIPW in terms of the bias and variance when small to moderate L1 regularization is imposed on the NNs.

stat.ME

The Bias-Variance Tradeoff of Doubly Robust Estimator with Targeted $L_1$ regularized Neural Networks Predictions

The Doubly Robust (DR) estimation of ATE can be carried out in 2 steps, where in the first step, the treatment and outcome are modeled, and in the second step the predictions are inserted into the DR estimator. The model misspecification in the first step has led researchers to utilize Machine Learning algorithms instead of parametric algorithms. However, existence of strong confounders and/or Instrumental Variables (IVs) can lead the complex ML algorithms to provide perfect predictions for the treatment model which can violate the positivity assumption and elevate the variance of DR estimators. Thus the ML algorithms must be controlled to avoid perfect predictions for the treatment model while still learn the relationship between the confounders and the treatment and outcome. We use two Neural network architectures and investigate how their hyperparameters should be tuned in the presence of confounders and IVs to achieve a low bias-variance tradeoff for ATE estimators such as DR estimator. Through simulation results, we will provide recommendations as to how NNs can be employed for ATE estimation.

stat.ME

Convolutions on the Haagerup tensor products of Fourier algebras

We study the ranges of the maps of convolution $u\otimes v\mapsto u\ast v$ and a `twisted' convolution $u\otimes v\mapsto u\ast \check{v}$ ($\check{u}(s)=u(s^{-1})$) and on the Haagerup tensor product of a Fourier algebra of a compact group $A(G)$ with itself. We compare the results to result of factoring these maps through projective and operator projective tensor products. We notice that $(A(G),\ast)$ is an operator algebra and observe an unexpected set of spectral synthesis.

math.FA