Related papers: Resilience for the Littlewood-Offord Problem
We perform the a posteriori error analysis of residual type of a transmission problem with sign changing coefficients. According to [6] if the contrast is large enough, the continuous problem can be transformed into a coercive one. We…
In a classical optimal stopping problem in continuous time, the agent can choose any stopping time without constraint. Dupuis and Wang (Optimal stopping with random intervention times, Advances in Applied Probability, 34, 141--157, 2002)…
In this note we obtain lower bounds for $\P(\xi\geq 0)$ and $\P(\xi>0)$ under assumptions on the moments of a centered random variable $\xi$. The obtained estimates are shown to be optimal and improve results from the literature. The…
We will study a population of individuals playing the infinitely repeated Prisoner's Dilemma under replicator dynamics. The population consists of three kinds of individuals using the following reactive strategies: ALLD (individuals which…
For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…
Let $\{\xi_1,\xi_2,\ldots\}$ be a sequence of independent random variables, and $\eta$ be a counting random variable independent of this sequence. We consider conditions for $\{\xi_1,\xi_2,\ldots\}$ and $\eta$ under which the distribution…
In this paper we consider the contextual multi-armed bandit problem for linear payoffs under a risk-averse criterion. At each round, contexts are revealed for each arm, and the decision maker chooses one arm to pull and receives the…
This paper studies the problem of detecting adversarial perturbations in a sequence of observations. Given a data sample $X_1, \ldots, X_n$ drawn from a standard normal distribution, an adversary, after observing the sample, can perturb…
We prove a strong concentration result about the natural collision estimator, which counts the number of collisions that occur within an iid sample. This estimator is at the heart of algorithms used for uniformity testing and entropy…
How attention scarcity effects the outcomes of a game? We present our findings on a version of the Iterated Prisoners Dilemma (IPD) game in which players can accept or refuse to play with their partner. We study the memory size effect on…
We calculate the susceptibility amplitude ratio near a generic higher character Lifshitz point up to one-loop order. We employ a renormalization group treatment with $L$ independent scaling transformations associated to the various…
In $\mathcal{X}$-armed bandit problem an agent sequentially interacts with environment which yields a reward based on the vector input the agent provides. The agent's goal is to maximise the sum of these rewards across some number of time…
Current techniques in machine learning are so far are unable to learn classifiers that are robust to adversarial perturbations. However, they are able to learn non-robust classifiers with very high accuracy, even in the presence of random…
In the communication problem $\mathbf{UR}$ (universal relation) [KRW95], Alice and Bob respectively receive $x, y \in\{0,1\}^n$ with the promise that $x\neq y$. The last player to receive a message must output an index $i$ such that…
Restless bandit problems are instances of non-stationary multi-armed bandits. These problems have been studied well from the optimization perspective, where the goal is to efficiently find a near-optimal policy when system parameters are…
Dirichlet problem in an $n$-dimensional billiard space is investigated. In particular, the system of ODEs $\ddot x(t) = f(t,x(t))$ together with Dirichlet boundary conditions $x(0) = A$, $x(T) = B$ in an $n$-dimensional interval $K$ with…
We study the adversarial robustness in offline reinforcement learning. Given a batch dataset consisting of tuples $(s, a, r, s')$, an adversary is allowed to arbitrarily modify $\epsilon$ fraction of the tuples. From the corrupted dataset…
In this work, we study the reduction by a Lie group of symmetries of variational collision avoidance probelms of multiple agents evolving on a Riemannian manifold and derive necessary conditions for the reduced extremals. The problem…
We study the existence, uniqueness, and regularity of weak solutions to a class of obstacle problems, where the obstacle condition can be imposed on a subset of the domain. In particular, we establish the optimal H\"older regularity for…
Let $X$ be a smooth complex projective variety, $a\colon X\rightarrow A$ a morphism to an abelian variety such that $\mathrm{Pic}^0(A)$ injects into $\mathrm{Pic}^0(X)$ and let $L$ be a line bundle on $X$; denote by $h^0_a(X,L)$ the minimum…