arXiv research

Paper speeds up visualization of uncertain data.

We develop importance sampling based efficient simulation techniques for three commonly encountered rare event probabilities associated with random walks having i.i.d. regularly varying increments; namely, 1) the large deviation probabilities, 2) the level crossing probabilities, and 3) the level crossing probabilities…

The level crossing and inverse statistics analysis of DAX and oil price time series are given. We determine the average frequency of positive-slope crossings, $ν_α^+$, where $T_α =1/ν_α^+$ is the average waiting time for observing the level $α$ again. We estimate the probability $P(K, α)$, which provides us the probab…

The so-called level crossing analysis has been used to investigate the empirical data set. But there is a lack of interpretation for what is reflected by the level crossing results. The fractional Gaussian noise as a well-defined stochastic series could be a suitable benchmark to make the level crossing findings more s…

We introduce a unified framework for solving first passage times of time-homogeneous diffusion processes. According to the killed version potential theory and the perturbation theory, we are able to deduce closed-form solutions for probability densities of single-sided level crossing problem. The framework is applicabl…

We investigate the average frequency of positive slope $ν_α^{+}$, crossing for the returns of market prices. The method is based on stochastic processes which no scaling feature is explicitly required. Using this method we define new quantity to quantify stage of development and activity of stocks exchange. We compare …

This paper deals with prediction of anopheles number, the main vector of malaria risk, using environmental and climate variables. The variables selection is based on an automatic machine learning method using regression trees, and random forests combined with stratified two levels cross validation. The minimum threshol…

We propose a novel technique to assess functional brain connectivity in EEG/MEG signals. Our method, called Sparsely-Connected Sources Analysis (SCSA), can overcome the problem of volume conduction by modeling neural data innovatively with the following ingredients: (a) the EEG is assumed to be a linear mixture of corr…

This paper addresses the challenging task of video captioning which aims to generate descriptions for video data. Recently, the attention-based encoder-decoder structures have been widely used in video captioning. In existing literature, the attention weights are often built from the information of an individual modali…

In this study, we propose an automatic learning method for variables selection based on Lasso in epidemiology context. One of the aim of this approach is to overcome the pretreatment of experts in medicine and epidemiology on collected data. These pretreatment consist in recoding some variables and to choose some inter…

Study examines how institutional differences and crises affect volatility in ASEAN stock markets.

CoSimGNN improves graph similarity computation for large graphs.

This paper develops a path-first theory using signatures and jump lifts for self-exiting processes.

Study evaluates cross-validation methods for clinical ECG classification, finding leave-source-out more reliable.

New concept of attitude towards probability introduced in risk sharing problems.

Non-trivialization probability of arc system in 3D space

There are many advantages to use probability method for nonlinear system identification, such as the noises and outliers in the data set do not affect the probability models significantly; the input features can be extracted in probability forms. The biggest obstacle of the probability model is the probability distribu…

Identifies conditions for multiple invariant probabilities in Markov kernels.

NT probability measures knotting in 3D arc systems.

We give an overview of two approaches to probability theory where lower and upper probabilities, rather than probabilities, are used: Walley's behavioural theory of imprecise probabilities, and Shafer and Vovk's game-theoretic account of probability. We show that the two theories are more closely related than would be …

This work improves deep neural network probability estimation methods.

This paper studies geometrical structure of the manifold of escort probability distributions and shows its new applicability to information science. In order to realize escort probabilities we use a conformal transformation that flattens so-called alpha-geometry of the space of discrete probability distributions, which…

A new method for adapting to label shifts using class probability matching.

Study classifies submanifolds in probability simplex.

Study generalizes property elicitation to imprecise probabilities.

Study on the probability of immunity and its bounds.

This work presents a new classifier that is specifically designed to be fully interpretable. This technique determines the probability of a class outcome, based directly on probability assignments measured from the training data. The accuracy of the predicted probability can be improved by measuring more probability es…

Investigates statistical properties of perturb-softmax and perturb-argmax distributions.

Categorical d-separation criterion simplifies probability graph analysis.

Paper constructs unfaithful probability distributions in binary causal graphs.

Study improves estimation of rare language model outputs.

The study examines Fisher-Riemann geodesics for nonparametric probability densities.

AI can learn true probabilities if data and assumptions align.

Quantum probability metrics improve distribution comparison in high dimensions.

A method for diffusion on probability simplex for generative models.

Bayesian approach approximates probability functions of Gaussian mixtures.

We describe a Groebner basis of relations among conditional probabilities in a discrete probability space, with any set of conditioned-upon events. They may be specialized to the partially-observed random variable case, the purely conditional case, and other special cases. We also investigate the connection to generali…

We study the minimax optimal rates for estimating a range of Integral Probability Metrics (IPMs) between two unknown probability measures, based on $n$ independent samples from them. Curiously, we show that estimating the IPM itself between probability measures, is not significantly easier than estimating the probabili…

The problem of categorical data analysis in high dimensions is considered. A discussion of the fundamental difficulties of probability modeling is provided, and a solution to the derivation of high dimensional probability distributions based on Bayesian learning of clique tree decomposition is presented. The main contr…

Implied posterior probability of a given model (say, Support Vector Machines (SVM)) at a point $\bf{x}$ is an estimate of the class posterior probability pertaining to the class of functions of the model applied to a given dataset. It can be regarded as a score (or estimate) for the true posterior probability, which ca…

One of the central themes in the classification task is the estimation of class posterior probability at a new point $\bf{x}$. The vast majority of classifiers output a score for $\bf{x}$, which is monotonically related to the posterior probability via an unknown relationship. There are many attempts in the literature …

Obtaining accurate and well calibrated probability estimates from classifiers is useful in many applications, for example, when minimising the expected cost of classifications. Existing methods of calibrating probability estimates are applied globally, ignoring the potential for improvements by applying a more fine-gra…

We study the problem of identifying a probability distribution for some given randomly sampled data in the limit, in the context of algorithmic learning theory as proposed recently by Vinanyi and Chater. We show that there exists a computable partial learner for the computable probability measures, while by Bienvenu, M…

Paper simplifies calculating causation probabilities and ranks root causes.

The paper explores geometry of probability measures and barycenter maps.

We propose a betting strategy based on Bayesian logistic regression modeling for the probability forecasting game in the framework of game-theoretic probability by Shafer and Vovk (2001). We prove some results concerning the strong law of large numbers in the probability forecasting game with side information based on …

This study redefines probability for finite outcomes using axioms and examples.

The law of total probability may be deployed in binary classification exercises to estimate the unconditional class probabilities if the class proportions in the training set are not representative of the population class proportions. We argue that this is not a conceptually sound approach and suggest an alternative ba…