相关论文: The Absent-Minded Passengers Problem via Computer …

One of the most widespread human behavioral biases is the present bias -- the tendency to overestimate current costs by a bias factor. Kleinberg and Oren (2014) introduced an elegant graph-theoretical model of inconsistent planning…

We consider the inverse Ising problem, i.e. the inference of network couplings from observed spin trajectories for a model with continuous time Glauber dynamics. By introducing two sets of auxiliary latent random variables we render the…

Conventional and current wisdom assumes that the brain represents probability as a continuous number to many decimal places. This assumption seems implausible given finite and scarce resources in the brain. Quantization is an information…

A considerable body of work in AI has been concerned with aggregating measures of confirmatory and disconfirmatory evidence for a common set of propositions. Claiming classical probability to be inadequate or inappropriate, several…

Recent advances in AI have been significantly driven by the capabilities of large language models (LLMs) to solve complex problems in ways that resemble human thinking. However, there is an ongoing debate about the extent to which LLMs are…

This work presents a tensor-network formulation of the Traveling Salesman Problem (TSP) and several of its variants. The approach represents candidate tours with tensor-network layers, weights them by Boltzmann factors, and enforces…

Classically, the time complexity of a first-order method is estimated by its number of gradient computations. In this paper, we study a more refined complexity by taking into account the `lingering' of gradients: once a gradient is computed…

Existing human mobility forecasting models follow the standard design of the time-series prediction model which takes a series of numerical values as input to generate a numerical value as a prediction. Although treating this as a…

Data analysis usually suffers from the Missing Not At Random (MNAR) problem, where the cause of the value missing is not fully observed. Compared to the naive Missing Completely At Random (MCAR) problem, it is more in line with the…

The problem of random number generation dates back to von Neumann's work in 1951. Since then, many algorithms have been developed for generating unbiased bits from complex correlated sources as well as for generating arbitrary distributions…

Tensors are widely used to represent multiway arrays of data. The recovery of missing entries in a tensor has been extensively studied, generally under the assumption that entries are missing completely at random (MCAR). However, in most…

We study the evacuation process from a smoky room by means of experiments and simulations. People in a dark or smoky room are mimicked by ``blind'' students wearing eye masks. The evacuation of the disoriented students from the room is…

Several Artificial Intelligence schemes for reasoning under uncertainty explore either explicitly or implicitly asymmetries among probabilities of various states of their uncertain domain models. Even though the correct working of these…

The calculation of transport profiles from experimental measurements belongs in the category of inverse problems which are known to come with issues of ill-conditioning or singularity. A reformulation of the calculation, the matricial…

A fundamental computational task in probabilistic programming is to infer a program's output (posterior) distribution from a given initial (prior) distribution. This problem is challenging, especially for expressive languages that feature…

The classical multi-agent rendezvous problem asks for a deterministic algorithm by which $n$ points scattered in a plane can move about at constant speed and merge at a single point, assuming each point can use only the locations of the…

We consider the probability theory, and in particular the moment problem and universality theorems, for random groups of the sort of that arise or are conjectured to arise in number theory, and in related situations in topology and…

In this paper we consider a Bayesian analysis of contingency tables allowing for the possibility that cells may have probability zero. In this sense we depart from standard log-linear modeling that implicitly assumes a positivity…

Wilf posed the following problem: determine asymptotically as $n\to\infty$ the probability that a randomly chosen part size in a randomly chosen composition of n has multiplicity m. One solution of this problem was given by Hitczenko and…

Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…