Search for: All records

Grounded in self-determination theory, our study explored how personality traits interacted with perceived need satisfaction, influencing students’ enjoyment and future participation intention in a leaderboard-based gamified learning context. A sample of 109 undergraduate students participated in a leaderboard-based math activity and completed surveys measuring their personality traits, perceived need satisfaction, enjoyment, and intention for future participation. The results indicated that the trait of emotional stability was a crucial moderator of the relationships between perceived need satisfaction and enjoyment. Additionally, the trait of agreeableness moderated the relationship between perceived autonomy and future participation intention. The study contributes to a more comprehensive understanding of the underlying mechanism of leaderboards and highlights the importance of theory-based investigation into the influence of personality traits in gamified environments. 

Abstract Large machine learning models are revolutionary technologies of artificial intelligence whose bottlenecks include huge computational expenses, power, and time used both in the pre-training and fine-tuning process. In this work, we show that fault-tolerant quantum computing could possibly provide provably efficient resolutions for generic (stochastic) gradient descent algorithms, scaling as$${{{{{{{\mathcal{O}}}}}}}}({T}^{2}\times {{{{{{{\rm{polylog}}}}}}}}(n))$$ $O\left(T^2\times \mathrm{polylog}\left(n\right)\right)$ , wherenis the size of the models andTis the number of iterations in the training, as long as the models are both sufficiently dissipative and sparse, with small learning rates. Based on earlier efficient quantum algorithms for dissipative differential equations, we find and prove that similar algorithms work for (stochastic) gradient descent, the primary algorithm for machine learning. In practice, we benchmark instances of large machine learning models from 7 million to 103 million parameters. We find that, in the context of sparse training, a quantum enhancement is possible at the early stage of learning after model pruning, motivating a sparse parameter download and re-upload scheme. Our work shows solidly that fault-tolerant quantum algorithms could potentially contribute to most state-of-the-art, large-scale machine-learning problems. 

Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics. 

Abstract Reversible phenotypic flexibility allows organisms to better match phenotypes to prevailing environmental conditions and may produce fitness benefits. Costs and constraints of phenotypic flexibility may limit the capacity for flexible responses but are not well understood nor documented. Costs could include expenses associated with maintaining the flexible system or with generating the flexible response. One potential cost of maintaining a flexible system is an energetic cost reflected in the basal metabolic rate (BMR), with elevated BMR in individuals with more flexible metabolic responses. We accessed data from thermal acclimation studies of birds where BMR and/or M_sum(maximum cold-induced metabolic rate) were measured before and after acclimation, as a measure of metabolic flexibility, to test the hypothesis that flexibility in BMR (ΔBMR), M_sum(ΔM_sum), or metabolic scope (M_sum − BMR; ΔScope) is positively correlated with BMR. When temperature treatments lasted at least three weeks, three of six species showed significant positive correlations between ΔBMR and BMR, one species showed a significant negative correlation, and two species showed no significant correlation. ΔM_sumand BMR were not significantly correlated for any species and ΔScope and BMR were significantly positively correlated for only one species. These data suggest that support costs exist for maintaining high BMR flexibility for some bird species, but high flexibility in M_sumor metabolic scope does not generally incur elevated maintenance costs.