An official website of the United States government
Gatherings of thousands to millions of people frequently occur for an enormous variety of educational, social, sporting, and political events, and automated counting of these high-density crowds is useful for safety, management, and measuring significance of an event. In this work, we show that the regularly accepted labeling scheme of crowd density maps for training deep neural networks may not be the most effective one. We propose an alternative inverse k-nearest neighbor (i[Formula: see text]NN) map mechanism that, even when used directly in existing state-of-the-art network structures, shows superior performance. We also provide new network architecture mechanisms that we demonstrate in our own MUD-i[Formula: see text]NN network architecture, which uses multi-scale drop-in replacement upsampling via transposed convolutions to take full advantage of the provided i[Formula: see text]NN labeling. This upsampling combined with the i[Formula: see text]NN maps further improves crowd counting accuracy. We further analyze several variations of the i[Formula: see text]NN labeling mechanism, which apply transformations on the [Formula: see text]NN measure before generating the map, in order to consider the impact of camera perspective views, image resolutions, and the changing rates of the mapping functions. To alleviate the effects of crowd density changes in each image, we also introduce an attenuation mechanism in the i[Formula: see text]NN mapping. Experimentally, we show that inverse square root [Formula: see text]NN map variation (iR[Formula: see text]NN) provides the best performance. Discussions are provided on computational complexity, label resolutions, the gains in mapping and upsampling, and details of critical cases such as various crowd counts, uneven crowd densities, and crowd occlusions.
more »
« less
Benchmarking a neutral-atom quantum computer
In this study, we simulated the algorithmic performance of a small neutral atom quantum computer and compared its performance when operating with all-to-all versus nearest-neighbor connectivity. This comparison was made using a suite of algorithmic benchmarks developed by the Quantum Economic Development Consortium. Circuits were simulated with a noise model consistent with experimental data from [Nature 604, 457 (2022)]. We find that all-to-all connectivity improves simulated circuit fidelity by [Formula: see text]–[Formula: see text], compared to nearest-neighbor connectivity.
more »
« less
- PAR ID:
- 10505994
- Publisher / Repository:
- World Scientific
- Date Published:
- Journal Name:
- International Journal of Quantum Information
- ISSN:
- 0219-7499
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In this work, we consider the popular tree-based search strategy within the framework of reinforcement learning, the Monte Carlo tree search (MCTS), in the context of the infinite-horizon discounted cost Markov decision process (MDP). Although MCTS is believed to provide an approximate value function for a given state with enough simulations, the claimed proof of this property is incomplete. This is because the variant of MCTS, the upper confidence bound for trees (UCT), analyzed in prior works, uses “logarithmic” bonus term for balancing exploration and exploitation within the tree-based search, following the insights from stochastic multiarm bandit (MAB) literature. In effect, such an approach assumes that the regret of the underlying recursively dependent nonstationary MABs concentrates around their mean exponentially in the number of steps, which is unlikely to hold, even for stationary MABs. As the key contribution of this work, we establish polynomial concentration property of regret for a class of nonstationary MABs. This in turn establishes that the MCTS with appropriate polynomial rather than logarithmic bonus term in UCB has a claimed property. Interestingly enough, empirically successful approaches use a similar polynomial form of MCTS as suggested by our result. Using this as a building block, we argue that MCTS, combined with nearest neighbor supervised learning, acts as a “policy improvement” operator; that is, it iteratively improves value function approximation for all states because of combining with supervised learning, despite evaluating at only finitely many states. In effect, we establish that to learn an ε approximation of the value function with respect to [Formula: see text] norm, MCTS combined with nearest neighbor requires a sample size scaling as [Formula: see text], where d is the dimension of the state space. This is nearly optimal because of a minimax lower bound of [Formula: see text], suggesting the strength of the variant of MCTS we propose here and our resulting analysis.more » « less
-
Starting with a vertex-weighted pointed graph [Formula: see text], we form the free loop algebra [Formula: see text] defined in Hartglass–Penneys’ article on canonical [Formula: see text]-algebras associated to a planar algebra. Under mild conditions, [Formula: see text] is a non-nuclear simple [Formula: see text]-algebra with unique tracial state. There is a canonical polynomial subalgebra [Formula: see text] together with a Dirac number operator [Formula: see text] such that [Formula: see text] is a spectral triple. We prove the Haagerup-type bound of Ozawa–Rieffel to verify [Formula: see text] yields a compact quantum metric space in the sense of Rieffel. We give a weighted analog of Benjamini–Schramm convergence for vertex-weighted pointed graphs. As our [Formula: see text]-algebras are non-nuclear, we adjust the Lip-norm coming from [Formula: see text] to utilize the finite dimensional filtration of [Formula: see text]. We then prove that convergence of vertex-weighted pointed graphs leads to quantum Gromov–Hausdorff convergence of the associated adjusted compact quantum metric spaces. As an application, we apply our construction to the Guionnet–Jones–Shyakhtenko (GJS) [Formula: see text]-algebra associated to a planar algebra. We conclude that the compact quantum metric spaces coming from the GJS [Formula: see text]-algebras of many infinite families of planar algebras converge in quantum Gromov–Hausdorff distance.more » « less
-
A homology class [Formula: see text] of a complex flag variety [Formula: see text] is called a line degree if the moduli space [Formula: see text] of 0-pointed stable maps to X of degree d is also a flag variety [Formula: see text]. We prove a quantum equals classical formula stating that any n-pointed (equivariant, [Formula: see text]-theoretic, genus zero) Gromov–Witten invariant of line degree on X is equal to a classical intersection number computed on the flag variety [Formula: see text]. We also prove an n-pointed analogue of the Peterson comparison formula stating that these invariants coincide with Gromov–Witten invariants of the variety of complete flags [Formula: see text]. Our formulas make it straightforward to compute the big quantum [Formula: see text]-theory ring [Formula: see text] modulo the ideal [Formula: see text] generated by degrees d larger than line degrees.more » « less
-
Microwave loss in niobium metallic structures used for superconducting quantum circuits is limited by a native surface oxide layer formed over a timescale of minutes when exposed to an ambient environment. In this work, we show that nitrogen plasma treatment forms a niobium nitride layer at the metal–air interface, which prevents such oxidation. X-ray photoelectron spectroscopy confirms the doping of nitrogen more than 5 nm into the surface and a suppressed oxygen presence. This passivation remains stable after aging for 15 days in an ambient environment. Cryogenic microwave characterization shows an average filling-factor-adjusted two-level-system loss tangent [Formula: see text] of [Formula: see text] for resonators with a 3 [Formula: see text]m center strip and [Formula: see text] for a 20 [Formula: see text]m center strip, exceeding the performance of unpassivated samples by a factor of four.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1142/S0219749924500011
