Zobrazeno 1 - 10
of 22 457
pro vyhledávání: '"A. Mendelson"'
Sparse and patch adversarial attacks were previously shown to be applicable in realistic settings and are considered a security risk to autonomous systems. Sparse adversarial perturbations constitute a setting in which the adversarial perturbations a
Externí odkaz:
http://arxiv.org/abs/2411.16162
The widely used ReLU is favored for its hardware efficiency, {as the implementation at inference is a one bit sign case,} yet suffers from issues such as the ``dying ReLU'' problem, where during training, neurons fail to activate and constantly remai
Externí odkaz:
http://arxiv.org/abs/2411.10573
The problem of detecting fake data inspires the following seemingly simple mathematical question. Sample a data point $X$ from the standard normal distribution in $\mathbb{R}^n$. An adversary observes $X$ and corrupts it by adding a vector $rt$, wher
Externí odkaz:
http://arxiv.org/abs/2410.18880
Autor:
Haim, Mendelson, Mingxi, Zhu
Online lending has garnered significant attention in IS literature, particularly platform lending, but direct (balance sheet) lending is increasingly critical. This paper explores optimal information acquisition strategies for direct online lenders,
Externí odkaz:
http://arxiv.org/abs/2410.05539
Hybrid hospitals offer on-site and remote hospitalization through telemedicine. These new healthcare models require novel operational policies to balance costs, efficiency, and patient well-being. Our study addresses two first-order questions: (i) ho
Externí odkaz:
http://arxiv.org/abs/2408.12431
Autor:
Abdalla, Pedro, Mendelson, Shahar
We construct an estimator $\widehat{\Sigma}$ for covariance matrices of unknown, centred random vectors X, with the given data consisting of N independent measurements $X_1,...,X_N$ of X and the wanted confidence level. We show under minimal assumpti
Externí odkaz:
http://arxiv.org/abs/2402.08288
Autor:
Kuang, Xu, Mendelson, Gal
Being able to detect service slowdowns is crucial to many operational problems. We study how to use observational congestion data to detect service slowdown in a multi-server system, and in particular, the statistical implications of running adaptive
Externí odkaz:
http://arxiv.org/abs/2401.07305
Autor:
Bartl, Daniel, Mendelson, Shahar
We show that under minimal assumption on a class of functions $\mathcal{H}$ defined on a probability space $(\mathcal{X},\mu)$, there is a threshold $\Delta_0$ satisfying the following: for every $\Delta\geq\Delta_0$, with probability at least $1-2\e
Externí odkaz:
http://arxiv.org/abs/2312.06442
Autor:
Amy, Matthew, Glaudell, Andrew N., Kelso, Shaun, Maxwell, William, Mendelson, Samuel S., Ross, Neil J.
Let $n\geq 8$ be divisible by 4. The Clifford-cyclotomic gate set $\mathcal{G}_n$ is the universal gate set obtained by extending the Clifford gates with the $z$-rotation $T_n = \mathrm{diag}(1,\zeta_n)$, where $\zeta_n$ is a primitive $n$-th root of
Externí odkaz:
http://arxiv.org/abs/2311.07741
We define a graph to be $S$-regular if it contains an equitable partition given by a matrix $S$. These graphs are generalizations of both regular and bipartite, biregular graphs. An $S$-regular matrix is defined then as a matrix on an $S$-regular gra
Externí odkaz:
http://arxiv.org/abs/2311.07675