SearcharxivSearch

arXiv subjects

Nick Zhang

Publications and source records attributed to Nick Zhang.

6 recordsLinked to original sources

Bayesian Conway-Maxwell-Poisson model with spike-and slab priors for dispersed count data with application to football scores

Statistical modeling for goals scored in football is typically achieved using the Poisson distribution and its variants. Here we propose a Bayesian framework for modeling under- and over-dispersion in count data by combining the Conway-Maxwell-Poisson (CMP) likelihood with a spikeand-slab (SAS) prior on unit-specific dispersion parameters. The proposed methodology generalizes Poisson-based count data models by treating equidispersion as an explicit baseline, and offering probabilistic quantification of departures from this regime, while simultaneously estimating their magnitude. Posterior inference is performed through a tailored Metropolis-within-Gibbs sampler that handles the doubly-intractable likelihood and provides efficient posterior exploration. The new method is examined using simulated data to confirm its ability to capture non-equidispersion, and applied to English Premier League (EPL) data. Dispersion is modeled at the team level and linked to goal-scoring behavior, and allows for thresholding mechanisms to distinguish teams based on their posterior probability of non-equidispersion. The results reveal heterogeneities in team-specific dispersion in the EPL, and demonstrate improvements in both model fit and predictive performance with respect to the standard Poisson model.

stat.ME

Knowledge Consilience: One Culture, Two Cultures or Many Cultures?

The hostility between the two cultures, scientific and literary, was framed by C.P. Snow in 1959 and later by others. The scientific culture is nowadays often identified with STEM (Science, Technology, Engineering and Mathematics) whereas the literary culture generally refers to humanities and social sciences. Wilson expressed the wish for the unity of knowledge. We put forward the notions of knowledge distance and knowledge consilience threshold to quantitatively measure distance and coupling process between different branches of knowledge. Our findings suggest that the gulf between the two cultures is widening.

cs.DL

Multitask Neuroevolution for Reinforcement Learning with Long and Short Episodes

Studies have shown evolution strategies (ES) to be a promising approach for reinforcement learning (RL) with deep neural networks. However, the issue of high sample complexity persists in applications of ES to deep RL over long horizons. This paper is the first to address the shortcoming of today's methods via a novel neuroevolutionary multitasking (NuEMT) algorithm, designed to transfer information from a set of auxiliary tasks (of short episode length) to the target (full length) RL task at hand. The auxiliary tasks, extracted from the target, allow an agent to update and quickly evaluate policies on shorter time horizons. The evolved skills are then transferred to guide the longer and harder task towards an optimal policy. We demonstrate that the NuEMT algorithm achieves data-efficient evolutionary RL, reducing expensive agent-environment interaction data requirements. Our key algorithmic contribution in this setting is to introduce, for the first time, a multitask skills transfer mechanism based on the statistical importance sampling technique. In addition, an adaptive resource allocation strategy is utilized to assign computational resources to auxiliary tasks based on their gleaned usefulness. Experiments on a range of continuous control tasks from the OpenAI Gym confirm that our proposed algorithm is efficient compared to recent ES baselines.

cs.NE

Growth Rates of Knowledge

This is an evolving document. It is devoted to summarizing patterns and laws of knowledge growth. By examining a variety of parameters in data sources such as Wikipedia and Microsoft Academic Graph, we can get deeper insights of how knowledge evolves.

cs.DL

50 Years of Computational Complexity: Hao Wang and the Theory of Computation

If Turing's groundbreaking paper in 1936 laid the foundation of the theory of computation (ToC), it is no exaggeration to say that Cook's paper in 1971, "The complexity of theorem proving procedures", [4] has pioneered the study of computational complexity. So computational complexity, as an independent research field, is 50 years old now (2021) if we date from Cook's article. This year coincides with the 100th birthday of Cook's mentor Hao Wang, one of the most important logicians. This paper traces the origin of computational complexity, and meanwhile, tries to sort out the instrumental role that Wang played in the process.

cs.GL

Moore's Law is dead, long live Moore's Law!

Moore's Law has been used by semiconductor industry as predicative indicators of the industry and it has become a self-fulfilling prophecy. Now more people tend to agree that the original Moore's Law started to falter. This paper proposes a possible quantitative modification to Moore's Law. It can cover other derivative laws of Moore's Law as well. It intends to more accurately predict the roadmap of chip's performance and energy consumption.

cs.GL