Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Golestani, S. Jamaloddin"'
We consider the problem of federated learning in a one-shot setting in which there are $m$ machines, each observing $n$ sample functions from an unknown distribution on non-convex loss functions. Let $F:[-1,1]^d\to\mathbb{R}$ be the expected loss fun
Externí odkaz:
http://arxiv.org/abs/2108.08677
Autor:
Raeis, Majid, Golestani, S. Jamaloddin
Information exchange is a crucial component of many real-world multi-agent systems. However, the communication between the agents involves two major challenges: the limited bandwidth, and the shared communication medium between the agents, which rest
Externí odkaz:
http://arxiv.org/abs/2102.08814
Publikováno v:
33rd Conference on Neural Information Processing Systems (NeurIPS 2019), Vancouver, Canada
We consider distributed statistical optimization in one-shot setting, where there are $m$ machines each observing $n$ i.i.d. samples. Based on its observed samples, each machine then sends an $O(\log(mn))$-length message to a server, at which a param
Externí odkaz:
http://arxiv.org/abs/1911.00731
Consider a partition of $R^n$ into finitely many polyhedral regions $D_i$ and associated drift vectors $\mu_i\in R^n$. We study ``hybrid'' dynamical systems whose trajectories have a constant drift, $\dot x=\mu_i$, whenever $x$ is in the interior of
Externí odkaz:
http://arxiv.org/abs/1905.12361
We investigate sensitivity to cumulative perturbations for a few dynamical system classes of practical interest. A system is said to have bounded sensitivity to cumulative perturbations (bounded sensitivity, for short) if an additive disturbance lead
Externí odkaz:
http://arxiv.org/abs/1905.11746
We consider distributed statistical optimization in one-shot setting, where there are $m$ machines each observing $n$ i.i.d. samples. Based on its observed samples, each machine sends a $B$-bit-long message to a server. The server then collects messa
Externí odkaz:
http://arxiv.org/abs/1905.04634
We consider a multi-hop switched network operating under a Max-Weight (MW) scheduling policy, and show that the distance between the queue length process and a fluid solution remains bounded by a constant multiple of the deviation of the cumulative a
Externí odkaz:
http://arxiv.org/abs/1810.09180
This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellation is relaxed. We study the channel coefficients estimation subspace ge
Externí odkaz:
http://arxiv.org/abs/1707.01063
Considering a network with $n$ nodes, where each node initially votes for one (or more) choices out of $K$ possible choices, we present a Distributed Multi-choice Voting/Ranking (DMVR) algorithm to determine either the choice with maximum vote (the v
Externí odkaz:
http://arxiv.org/abs/1703.08838
In distributed function computation, each node has an initial value and the goal is to compute a function of these values in a distributed manner. In this paper, we propose a novel token-based approach to compute a wide class of target functions to w
Externí odkaz:
http://arxiv.org/abs/1703.08831