Zobrazeno 1 - 10
of 116
pro vyhledávání: '"He, William"'
How time and pollster history affect U.S. election forecasts under a compartmental modeling approach
Autor:
Branstetter, Ryan, Chian, Samuel, Cromp, Joseph, He, William L, Lee, Christopher M, Liu, Mengqi, Mansell, Emma, Paranjape, Manas, Pattanashetty, Thanmaya, Rodrigues, Alexia, Volkening, Alexandria
In the months leading up to political elections in the United States, forecasts are widespread and take on multiple forms, including projections of what party will win the popular vote, state ratings, and predictions of vote margins at the state leve
Externí odkaz:
http://arxiv.org/abs/2411.01730
We continue the study of the approximate $k$-wise independence of random reversible circuits as permutations of $\{\pm1\}^n$. Our main result is the first construction of a natural class of random reversible circuits with a sublinear-in-$n$ dependenc
Externí odkaz:
http://arxiv.org/abs/2409.14614
Adverse event (AE) extraction following COVID-19 vaccines from text data is crucial for monitoring and analyzing the safety profiles of immunizations. Traditional deep learning models are adept at learning intricate feature representations and depend
Externí odkaz:
http://arxiv.org/abs/2406.18049
We prove that the permutation computed by a reversible circuit with $\tilde{O}(nk\cdot \log(1/\varepsilon))$ random $3$-bit gates is $\varepsilon$-approximately $k$-wise independent. Our bound improves on currently known bounds in the regime when the
Externí odkaz:
http://arxiv.org/abs/2406.08499
Autor:
He, William, O'Donnell, Ryan
We study pseudorandomness properties of permutations on $\{0,1\}^n$ computed by random circuits made from reversible $3$-bit gates (permutations on $\{0,1\}^3$). Our main result is that a random circuit of depth $n \cdot \tilde{O}(k^2)$, with each la
Externí odkaz:
http://arxiv.org/abs/2404.14648
Indoor autonomous driving testbeds have emerged to complement expensive outdoor testbeds and virtual simulations, offering scalable and cost-effective solutions for research in navigation, traffic optimization, and swarm intelligence. However, they o
Externí odkaz:
http://arxiv.org/abs/2402.17933
Autor:
He, William, Nadimpalli, Shivam
We consider the basic statistical problem of detecting truncation of the uniform distribution on the Boolean hypercube by juntas. More concretely, we give upper and lower bounds on the problem of distinguishing between i.i.d. sample access to either
Externí odkaz:
http://arxiv.org/abs/2308.13992
Karger (STOC 1995) gave the first FPTAS for the network (un)reliability problem, setting in motion research over the next three decades that obtained increasingly faster running times, eventually leading to a $\tilde{O}(n^2)$-time algorithm (Karger,
Externí odkaz:
http://arxiv.org/abs/2304.06552
Autor:
He, William, Rossman, Benjamin
We study the formula complexity of the word problem $\mathsf{Word}_{S_n,k} : \{0,1\}^{kn^2} \to \{0,1\}$: given $n$-by-$n$ permutation matrices $M_1,\dots,M_k$, compute the $(1,1)$-entry of the matrix product $M_1\cdots M_k$. An important feature of
Externí odkaz:
http://arxiv.org/abs/2211.15520
We give an almost-linear time algorithm for the Steiner connectivity augmentation problem: given an undirected graph, find a smallest (or minimum weight) set of edges whose addition makes a given set of terminals $\tau$-connected (for any given $\tau
Externí odkaz:
http://arxiv.org/abs/2211.05769