Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Schwartzman, Gregory"'
We introduce a novel concept termed "stochastic distance" for property testing. Diverging from the traditional definition of distance, where a distance $t$ implies that there exist $t$ edges that can be added to ensure a graph possesses a certain pro
Externí odkaz:
http://arxiv.org/abs/2407.14080
Autor:
Schwartzman, Gregory
We report that ChatGPT 4 and 4o are susceptible to a prompt injection attack that allows an attacker to exfiltrate users' personal data. It is applicable without the use of any 3rd party tools and all users are currently affected. This vulnerability
Externí odkaz:
http://arxiv.org/abs/2406.00199
Autor:
Schwartzman, Gregory
We present the first mini-batch algorithm for maximizing a non-negative monotone decomposable submodular function, $F=\sum_{i=1}^N f^i$, under a set of constraints. We consider two sampling approaches: uniform and weighted. We first show that mini-ba
Externí odkaz:
http://arxiv.org/abs/2401.12478
Autor:
Schwartzman, Gregory
We bound the smoothed running time of the FLIP algorithm for local Max-Cut as a function of $\alpha$, the arboricity of the input graph. We show that, with high probability and in expectation, the following holds (where $n$ is the number of nodes and
Externí odkaz:
http://arxiv.org/abs/2311.00182
Autor:
Schwartzman, Gregory
We answer the question: "Does local progress (on batches) imply global progress (on the entire dataset) for mini-batch $k$-means?". Specifically, we consider mini-batch $k$-means which terminates only when the improvement in the quality of the cluste
Externí odkaz:
http://arxiv.org/abs/2304.00419
We consider global problems, i.e. problems that take at least diameter time, even when the bandwidth is not restricted. We show that all problems considered admit efficient solutions in low-treewidth graphs. By ``efficient'' we mean that the running
Externí odkaz:
http://arxiv.org/abs/2205.14897
Autor:
Han, Wenchen, Feng, Vic, Schwartzman, Gregory, Mitzenmacher, Michael, Yu, Minlan, Ben-Basat, Ran
Distributed protocols are widely used to support network functions such as clock synchronization and multicast. As the network gets larger and faster, it is increasingly challenging for these protocols to react quickly to network events. The theory c
Externí odkaz:
http://arxiv.org/abs/2204.14138
Autor:
Schwartzman, Gregory
We prove that stochastic gradient descent (SGD) finds a solution that achieves $(1-\epsilon)$ classification accuracy on the entire dataset. We do so under two main assumptions: (1. Local progress) The model accuracy improves on average over batches.
Externí odkaz:
http://arxiv.org/abs/2111.05478
In the load balancing problem, each node in a network is assigned a load, and the goal is to equally distribute the loads among the nodes, by preforming local load exchanges. While load balancing was extensively studied in static networks, only recen
Externí odkaz:
http://arxiv.org/abs/2105.13194
Autor:
Schwartzman, Gregory, Sudo, Yuichi
In this work, we initiate the study of \emph{smoothed analysis} of population protocols. We consider a population protocol model where an adaptive adversary dictates the interactions between agents, but with probability $p$ every such interaction may
Externí odkaz:
http://arxiv.org/abs/2105.12262