Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

55111166221 · Jun 202019922001200920172026
48 results for cumulative probabilities

New method calibrates classifier probabilities with guaranteed coverage.

problem Inaccurate probability estimates by classifiers in high-risk applications.
method Adaptive temperature scaling algorithm for conformal prediction.
result Improves calibration error measures and standard metrics across various tasks.

We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on which several probability distributions agree. Instead of minimizing an objective f…

2011-08-06abs ↗pdf ↗

We study the rank distribution, the cumulative probability, and the probability density of returns of stock prices of listed firms traded in four stock markets. We find that the rank distribution and the cumulative probability of stock prices traded in are consistent approximately with the Zipf's law or a power law. It…

2004-12-01abs ↗pdf ↗

The paper develops methods to predict the probability of achieving a user goal in a task, ensuring the system alerts when the probability falls below a threshold.

problem Ensuring an autonomous system achieves the user's goal with calibrated probability estimates.
method Invertible conformal prediction using Probability-space Conformalized Quantile Regression (PCQR) to produce well-calibrated conditional prediction intervals.
result The method produces well-calibrated probabilities that the cumulative reward will fall within a user-specified target interval, with finite-sample guarantees.

This paper investigates the rank distribution, cumulative probability, and probability density of price returns for the stocks traded in the KSE and the KOSDAQ market. This research demonstrates that the rank distribution is consistent approximately with the Zipf's law with exponent α=1.00α= -1.00 (KSE) and -1.31 (KOSDAQ),…

2004-05-18abs ↗pdf ↗

Paper converts quantiles to cumulative distribution functions to simplify risk measures.

problem Technical assumptions in risk measure calculations.
method Invention of converting integrated quantiles to integrated cumulative distribution functions.
result Avoids the need for probability density function existence.

ECOD detects outliers without parameters, fast and simple.

problem Detecting outliers in large, high-dimensional datasets efficiently and interpretably.
method ECOD estimates empirical cumulative distribution functions per dimension, then computes tail probabilities and outlier scores.
result ECOD outperforms state-of-the-art methods in accuracy, efficiency, and scalability.

The paper evaluates functions of stable Lévy processes and their extrema efficiently.

problem Efficiently evaluating functions of stable Lévy processes and their extrema.
method Integral representations, conformal acceleration technique, simplified trapezoid rule.
result Efficient numerical procedures for cumulative probability distribution functions (cpdfs) are developed.

Bayesian methods improve inference for cumulative probit models on large datasets.

problem Challenges in Bayesian inference for large cumulative probit models.
method Proposed scalable algorithms using Variational Bayes and Expectation Propagation.
result Superior computational performance and accuracy compared to MCMC.

This paper describes an agent-based model of interacting firms, in which interacting firm agents rationally invest capital and labor in order to maximize payoff. Both transactions and production are taken into account in this model. First, the performance of individual firms on a real transaction network was simulated.…

2006-07-31abs ↗pdf ↗

SEEDA optimizes dose allocation in clinical trials to balance efficacy and safety.

problem Complex relationships between efficacy and toxicity in new drug trials.
method Adaptive clinical trial methodology that maximizes cumulative efficacy while ensuring safety constraints.
result SEEDA outperforms existing methods in finding optimal doses with higher success rates and fewer patients.

This paper analyzes regret bounds for Gaussian process Thompson sampling.

problem Analyzing the performance of Gaussian process Thompson sampling (GP-TS) in Bayesian optimization.
method The paper derives several regret bounds for GP-TS, including a lower bound, upper bounds on the second moment of cumulative regret, expected lenient regret, and improved cumulative regret.
result The paper provides improved regret upper bounds for GP-TS, showing that it suffers from a polynomial dependence on 1/δ1/δ with probability δδ.

New method corrects bias in datasets using cumulative distribution functions.

problem Varying domains and biased datasets lead to differences between training and target distributions.
method Empirical cumulative distribution function estimates of the target distribution, rigorously generalized.
result Method is more robust, not reliant on parameter tuning, and performs similarly to state-of-the-art techniques.

New algorithms minimize simple and cumulative regret in contextual bandits.

problem Minimizing simple and cumulative regret in contextual bandit settings.
method Proposed new algorithms using conformal arm sets (CASs).
result Near-optimal minimax guarantees for simple regret and state-of-the-art guarantees for cumulative regret.

Cumulant expansion is used to derive accurate closed-form approximation for Monthly Sum Options in case of constant volatility model. Payoff of Monthly Sum Option is based on sum of NN caped (and probably floored) returns. It is noticed, that 1/N1/\sqrt{N} can be used as a small parameter in Edgeworth expansion. First …

2010-11-17abs ↗pdf ↗

Within the framework of the cumulative prospective theory of Kahneman and Tversky, this paper considers a continuous-time behavioral portfolio selection problem whose model includes both running and terminal terms in the objective functional. Despite the existence of S-shaped utility functions and probability distortio…

2017-10-31abs ↗pdf ↗

Unified approach to tensor PCA and related problems using tensor cumulants.

problem Statistical inference on invariant distributions, particularly tensor PCA.
method Definition and analysis of tensor cumulants to unify and extend previous results.
result Unified explanation of hardness and subexponential-time algorithms for tensor PCA.

Directed acyclic graphs (DAGs) are a popular framework to express multivariate probability distributions. Acyclic directed mixed graphs (ADMGs) are generalizations of DAGs that can succinctly capture much richer sets of conditional independencies, and are especially useful in modeling the effects of latent variables im…

2010-08-31abs ↗pdf ↗

A new bandit problem where experiments can be interrupted if results are not promising.

problem Interruptible multi-armed bandit problem with a threshold for cumulative reward.
method Formalized survival regret, identified key components (regret and probability of ruin), derived lower bounds and optimal policies.
result No policy can achieve sublinear survival regret, but optimal policies minimize survival regret in a Pareto sense.

We investigate the distribution function and the cumulative probability for Korean household incomes, i.e., the current, labor, and property incomes. For our case, the distribution functions are consistent with a power law. It is also showed that the probability density of income growth rates almost has the form of a e…

2004-03-05abs ↗pdf ↗

A method to monitor probability predictions for calibration loss in image classification models.

problem Maintaining calibration in machine learning predictions over time.
method Cumulative sum-based approach with dynamic limits for early detection of miscalibration.
result Early detection of operational context changes impacting image classification performance.

The paper introduces a spline-based method for calibrating neural networks.

problem Ensuring neural network outputs are reliable for safety-critical applications.
method Approximating the empirical cumulative distribution function using splines to map network outputs to calibrated probabilities.
result The spline-based recalibration consistently outperforms existing methods on calibration measures.

Develops deep learning for fast, accurate option pricing models.

problem Computational efficiency and accuracy in option pricing models.
method Neural network generators solving backward Kolmogorov equations for TPDFs.
result Ultra-fast, highly accurate option pricing models for various asset models.

Develops methods for integrating multivariate normals and computing classification measures.

problem Computing performance of multivariate normal models is challenging due to lack of general analytical expressions.
method Mathematical results and open-source software for integrating and analyzing multivariate normal distributions.
result Provides tools for calculating classification errors, discriminability, and reliability.

Bayesian algorithms minimize cumulative regret in decentralized multi-agent bandits.

problem Minimizing cumulative regret in a decentralized multi-agent multi-armed bandit problem.
method Proposed decentralized Bayesian multi-armed bandit framework, including Thompson Sampling and Bayes-UCB algorithms.
result Regret scales logarithmically with constants matching those of an optimal centralized agent.

While Gaussian probability densities are omnipresent in applied mathematics, Gaussian cumulative probabilities are hard to calculate in any but the univariate case. We study the utility of Expectation Propagation (EP) as an approximate integration method for this problem. For rectangular integration regions, the approx…

2011-11-29abs ↗pdf ↗

This work tackles multivariate CDFs and copulas using tensor factorization.

problem Learning multivariate distributions, especially for mixed random variables, is challenging.
method Introducing a low-rank model for efficient sampling, inference, and uncertainty quantification.
result The proposed model outperforms traditional methods in various applications.

This paper analyzes OCBA algorithms' convergence rates for DEDS optimization.

problem Optimizing discrete-event dynamic systems with limited computing resources.
method Characterizes convergence rates of two OCBA algorithms under different performance measures.
result OCBA algorithms achieve optimal convergence rates under probability of correct selection and expected opportunity cost measures.

This paper introduces a new metric, ULI, for RL that ensures both cumulative and instantaneous performance.

problem High-stakes applications require RL algorithms to avoid playing bad policies.
method Introduces uniform last-iterate (ULI) guarantee, a stronger metric capturing both cumulative and instantaneous performance.
result ULI directly implies near-optimal cumulative performance across various metrics, but not the other way around.

Paper tackles online DR-submodular maximization with stochastic constraints.

problem Maximizing utility while adhering to a cumulative resource constraint in an online setting.
method Proposes OLFW algorithm to solve the problem of online continuous DR-submodular maximization with linear stochastic constraints.
result Obtains sub-linear regret and constraint violation bounds.

Bayesian sequence prediction is a simple technique for predicting future symbols sampled from an unknown measure on infinite sequences over a countable alphabet. While strong bounds on the expected cumulative error are known, there are only limited results on the distribution of this error. We prove tight high-probabil…

2013-06-29abs ↗pdf ↗

In this paper we revisit the integral functional of geometric Brownian motion It=0te(μs+σWs)dsI_t= \int_0^t e^{-(μs +σW_s)}ds, where μRμ\in\mathbb{R}, σ>0σ> 0, and (Ws)s>0(W_s )_s>0 is a standard Brownian motion. Specifically, we calculate the Laplace transform in tt of the cumulative distribution function and of the probability density …

2020-01-31abs ↗pdf ↗

We study the volume distribution of nodal domains of random band-limited functions on generic manifolds, and find that in the high energy limit a typical instance obeys a deterministic universal law, independent of the manifold. Some of the basic qualitative properties of this law, such as its support, monotonicity and…

2016-06-18abs ↗pdf ↗

Optimal exit strategies of CPT gamblers in unfair gambles

problem Optimal exit strategies of gamblers with CPT preferences in games with strictly negative expected payoffs
method Formulating the problem as an optimal stopping problem on asymmetric random walks, applying geometric transformation, randomized strategies, and changing the decision variable
result The unfair problem in the infinite time horizon has finite values for a wide range of CPT parameter specifications

The paper extends and applies a new shrinkage prior in Bayesian factor analysis.

problem Estimating the number of factors in sparse Bayesian factor analysis.
method Introduces and extends a generalized cumulative shrinkage process (CUSP) prior.
result Exchangeable spike-and-slab shrinkage priors imply increasing shrinkage as the column index increases.

A new neural network model for ordinal regression.

problem Ordinal regression with non-proportional odds.
method Interpretable neural network for both continuous and discrete responses, training a non-linear neural network as a coefficient function.
result N3^3POM preserves interpretability while offering flexibility.