Related papers: Proper local scoring rules
A family of m independent identically distributed random variables indexed by a chemical potential \phi\in[0,\gamma] represents piles of particles. As \phi increases to \gamma, the mean number of particles per site converges to a maximal…
The arm of this paper is to establish the strong law of large numbers (SLLN) of $m$-dependent random variables under the framework of sub-linear expectations. We establish the SLLN for a sequence of independent, but not necessarily…
Standard Bayesian analyses can be difficult to perform when the full likelihood, and consequently the full posterior distribution, is too complex and difficult to specify or if robustness with respect to data or to model misspecifications…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
In this paper, we study well-posedness of McKean-Vlasov stochastic differential equations (SDE) whose drift depends pointwisely on marginal density and satisfies a local integrability condition in time-space variables. The drift and noise…
Most real world dynamic networks are evolved very fast with time. It is not feasible to collect the entire network at any given time to study its characteristics. This creates the need to propose local algorithms to study various properties…
Given a set of items and a set of evaluators who all individually rank them, how do we aggregate these evaluations into a single societal ranking? Work in social choice and statistics has produced many aggregation methods for this problem,…
We study the problem of deriving policies, or rules, that when enacted on a complex system, cause a desired outcome. Absent the ability to perform controlled experiments, such rules have to be inferred from past observations of the system's…
The main result of the article reads: the distribution of a continuous starting from zero local martingale whose quadratic characteristic is almost surely absolutely continuous with respect to some non-random increasing continuous function…
We provide theoretical convergence guarantees for score-based generative models (SGMs) such as denoising diffusion probabilistic models (DDPMs), which constitute the backbone of large-scale real-world generative models such as DALL$\cdot$E…
We study the regularity of the score function in score-based generative models and show that it naturally adapts to the smoothness of the data distribution. Under minimal assumptions, we establish Lipschitz estimates that directly support…
We give an improved theoretical analysis of score-based generative modeling. Under a score estimate with small $L^2$ error (averaged across timesteps), we provide efficient convergence guarantees for any data distribution with second-order…
The statistics of records for a time series generated by a continuous time random walk is studied, and found to be independent of the details of the jump length distribution, as long as the latter is continuous and symmetric. However, the…
We study distribution dependent stochastic differential equation driven by a continuous process, without any specification on its law, following the approach initiated in [16]. We provide several criteria for existence and uniqueness of…
We discuss the limiting spectral density of real symmetric random matrices. Other than in standard random matrix theory the upper diagonal entries are not assumed to be independent, but we will fill them with the entries of a stochastic…
We revisit the mathematical foundations of proper scoring rules (PSRs) and Bregman divergences and present their characteristic properties in a unified theoretical framework. In many situations it is preferable not to generate a PSR…
This article will devise data-driven, mathematical laws that generate optimal, statistical classification systems which achieve minimum error rates for data distributions with unchanging statistics. Thereby, I will design learning machines…
The use of continuous probability distributions has been widespread in problems with purely discrete nature. In general, such distributions are not appropriate in this scenario. In this paper, we introduce a class of discrete and asymmetric…
Prior-weighted logistic regression has become a standard tool for calibration in speaker recognition. Logistic regression is the optimization of the expected value of the logarithmic scoring rule. We generalize this via a parametric family…
We study the problem of distributed control of large-scale robotic swarms which can be modeled as continuum densities evolving under the continuity equation. We propose a formalization of distributed controllers as (generally nonlinear)…