Zobrazeno 1 - 10
of 417
pro vyhledávání: '"A. H. Hubert"'
Autor:
Chan, T-H. Hubert, Xue, Quan
We present a comprehensive framework that unifies several research areas within the context of vertex-weighted bipartite graphs, providing deeper insights and improved solutions. The fundamental solution concept for each problem involves refinement,
Externí odkaz:
http://arxiv.org/abs/2406.17964
Blockchains have popularized automated market makers (AMMs). An AMM exchange is an application running on a blockchain which maintains a pool of crypto-assets and automatically trades assets with users governed by some pricing function that prices th
Externí odkaz:
http://arxiv.org/abs/2402.09357
We examine a private ADMM variant for (strongly) convex objectives which is a primal-dual iterative method. Each iteration has a user with a private function used to update the primal variable, masked by Gaussian noise for local privacy, without dire
Externí odkaz:
http://arxiv.org/abs/2312.08685
We study game-theoretically secure protocols for the classical ordinal assignment problem (aka matching with one-sided preference), in which each player has a total preference order on items. To achieve the fairness notion of equal treatment of equal
Externí odkaz:
http://arxiv.org/abs/2304.13338
Autor:
Ma, Pui-Wai, Chan, T. -H. Hubert
We devise a new type of feedforward neural network. It is equivariant with respect to the unitary group $U(n)$. The input and output can be vectors in $\mathbb{C}^n$ with arbitrary dimension $n$. No convolution layer is required in our implementation
Externí odkaz:
http://arxiv.org/abs/2208.12146
Vector mean estimation is a central primitive in federated analytics. In vector mean estimation, each user $i \in [n]$ holds a real-valued vector $v_i\in [-1, 1]^d$, and a server wants to estimate the mean of all $n$ vectors. Not only so, we would li
Externí odkaz:
http://arxiv.org/abs/2112.03449
Autor:
Chan, T-H. Hubert, Lee, Chui Shan
Recently, Abebe et al. (KDD 2018) and Chan et al. (WWW 2019) have considered an opinion dynamics optimization problem that is based on a popular model for social opinion dynamics, in which each agent has some fixed innate opinion, and a resistance th
Externí odkaz:
http://arxiv.org/abs/2105.04105
Autor:
Abebe, Rediet, Chan, T-H. Hubert, Kleinberg, Jon, Liang, Zhibin, Parkes, David, Sozio, Mauro, Tsourakakis, Charalampos E.
A long line of work in social psychology has studied variations in people's susceptibility to persuasion -- the extent to which they are willing to modify their opinions on a topic. This body of literature suggests an interesting perspective on theor
Externí odkaz:
http://arxiv.org/abs/2011.02583
We propose a conceptually simple oblivious sort and oblivious random permutation algorithms called bucket oblivious sort and bucket oblivious random permutation. Bucket oblivious sort uses $6n\log n$ time (measured by the number of memory accesses) a
Externí odkaz:
http://arxiv.org/abs/2008.01765
Autor:
CHAN, T.-H. HUBERT1 hubert@cs.hku.hk, KAI-MIN CHUNG2 kmchung@iis.sinica.edu.tw, MAGGS, BRUCE3 bmm@cs.duke.edu, SHI, ELAINE4 runting@gmail.com
Publikováno v:
Journal of the ACM. Jul2022, Vol. 69 Issue 4, p1-49. 49p.
