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,657 papers · 148 categories

Trend · papers per month

4794140187 · Jun 202019922001200920172026
48 results for probabilistic proof

Probabilistic proof of smooth boundaries in optimal stopping problems.

problem Continuous differentiability of time-dependent optimal boundaries in optimal stopping problems.
method Local probabilistic arguments for a wider range of conditions.
result First probabilistic proof of continuous differentiability under general conditions.

New bound on partition function proves Kähler-Einstein stability.

problem Proving Kähler-Einstein metrics on complex manifolds.
method Quantitative bound on partition function, connecting probabilistic and quantization approaches.
result Direct analytic proof of Kähler-Einstein stability for uniformly Gibbs stable manifolds.

This research simplifies verification of machine learning systems using reparameterization.

problem Reduce or eliminate serious bugs in machine learning systems.
method Use proof assistants to construct machine-checked proofs of correctness, leveraging reparameterization to handle probabilistic claims.
result Demonstrates broad applicability of reparameterization to verify different types of machine learning systems.

We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem appears to be new but is closely related to results achieved by other investigators.

2007-10-16abs ↗pdf ↗

New theorem connects probabilistic permanental point processes to Monge-Ampère equation.

problem Probabilistic interpretation of Monge-Ampère equation boundary value problem.
method Large deviation principles and optimal transport theory.
result Explicit rate function for permanental point processes large deviation.

In general, gradient estimates are very important and necessary for deriving convergence results in different geometric flows, and most of them are obtained by analytic methods. In this paper, we will apply a stochastic approach to systematically give gradient estimates for some important geometric quantities under the…

2013-12-23abs ↗pdf ↗

NP-HMC extends HMC for nonparametric models in probabilistic programming.

problem Inference for nonparametric models in probabilistic programming.
method Introduces NP-HMC, a generalization of HMC for nonparametric models using tree representable functions.
result Empirically shows significant performance improvements over existing approaches.

Hybrid Bayesian neural networks use function uncertainty for probabilistic inference.

problem Uncertainty in neural network weights is hard to specify and interpret.
method Integrates probabilistic layers with standard deterministic layers for function uncertainty.
result Improves probabilistic inference by encoding function uncertainty.

This paper introduces a neural operator for probabilistic conditioning.

problem Probabilistic conditioning of random variables XX given YY.
method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.

New scoring rules improve probabilistic classification model evaluation.

problem Traditional scoring rules misalign with the preference for correct classifications.
method Introduces Penalized Brier Score (PBS) and Penalized Logarithmic Loss (PLL) to modify proper scoring rules.
result PBS and PLL better identify optimal checkpoints and early stopping points, leading to superior F1 scores.

Simplifies efficient estimation via automatic differentiation and probabilistic programming.

problem Constructing efficient estimators for complex statistical models.
method Automatic differentiation applied to statistical functionals, avoiding the need to derive efficient influence functions.
result Users can generate efficient estimators with minimal code, simplifying the process for non-experts.

We present a derivation and theoretical investigation of the Adams-Bashforth and Adams-Moulton family of linear multistep methods for solving ordinary differential equations, starting from a Gaussian process (GP) framework. In the limit, this formulation coincides with the classical deterministic methods, which have be…

2016-10-26abs ↗pdf ↗

Invites probabilistic approach to Kähler-Einstein metrics via random point processes.

problem Constructing Kähler-Einstein metrics on complex projective algebraic manifolds.
method Large N-limit from random point processes defined by algebro-geometric data; variational approach for positive Ricci curvature.
result Convergence of metrics to Kähler-Einstein metrics under specific conditions.

This work proposes an unsupervised neural network framework for solving combinatorial optimization problems on graphs.

problem Challenges in neural networks solving combinatorial optimization problems without labeled instances.
method Inspired by Erdos' probabilistic method, a neural network parametrizes a probability distribution over sets, optimizing it to find low-cost integral solutions.
result The method provides valid solutions to the maximum clique problem and local graph clustering, achieving competitive results.

We prove that on a closed surface of genus gg, the cardinality of a set of simple closed curves in which any two are non-homotopic and intersect at most once is g2log(g)\lesssim g^2 \log(g). This bound matches the largest known constructions to within a logarithmic factor. The proof uses a probabilistic argument in graph th…

2018-07-16abs ↗pdf ↗

Novel technique reduces Bayesian network complexity while preserving inference accuracy.

problem Complexity reduction in Bayesian networks for efficient inference.
method Directed convex hull structure and polynomial-time algorithm for identifying minimum localized networks.
result High dimension reduction capability and improved inference efficiency in real networks.

We study a "div-grad type" sub-Laplacian with respect to a smooth measure and its associated heat semigroup on a compact equiregular sub-Riemannian manifold. We prove a short time asymptotic expansion of the heat trace up to any order. Our main result holds true for any smooth measure on the manifold, but it has a spec…

2017-06-08abs ↗pdf ↗

Elton P. Hsu used probabilistic method to show that the asymptotic Dirichlet problem is uniquely solvable under the curvature conditions Ce2ηr(x)KM(x)1-C e^{2-η}r(x) \leq K_M(x)\leq -1 with η>0η>0. We give an analytical proof of the same statement. In addition, using this new approach we are able to establish two boundary Harnack i…

2014-01-10abs ↗pdf ↗

The purpose of this paper is to give a new proof of results of Moscovici and Stanton on the orbital integrals associated with eta invariants on compact locally symmetric spaces. Moscovici and Stanton used methods of harmonic analysis on reductive groups. Here, we combine our approach to orbital integrals using the hypo…

2016-03-16abs ↗pdf ↗

We prove that on a closed, orientable surface of genus gg, a set of simple loops with the property that no two are homotopic or intersect in more than kk points has cardinality kgk+1logg\lesssim_k g^{k+1} \log g. The bound matches the size of the largest known construction to within a factor of klogg\sim_k \log g. It generaliz…

2018-11-04abs ↗pdf ↗

Deep neural nets solve high-dim PDEs with boundary conditions.

problem Solving high-dimensional elliptic PDEs with boundary conditions.
method Probabilistic representation and sampling method for deep neural networks.
result Deep neural networks can approximate solutions to the Poisson equation on finite domains.

This paper includes a proof of well-posedness of an initial-boundary value problem involving a system of degenerate non-local parabolic PDE which naturally arises in the study of derivative pricing in a generalized market model. In a semi-Markov modulated GBM model the locally risk minimizing price function satisfies a…

2015-06-04abs ↗pdf ↗

New OLO algorithms use Stein's method for better performance tradeoffs.

problem Achieving optimal tradeoffs in adversarial online linear optimization.
method Operationalizing Stein's method for computationally efficient OLO algorithms.
result Additively sharp upper bounds on regret and total loss.

The new field of adaptive data analysis seeks to provide algorithms and provable guarantees for models of machine learning that allow researchers to reuse their data, which normally falls outside of the usual statistical paradigm of static data analysis. In 2014, Dwork, Feldman, Hardt, Pitassi, Reingold and Roth introd…

2016-10-31abs ↗pdf ↗

Probabilistic deep learning uses neural networks and models to handle uncertainty.

problem Handling uncertainty in deep learning models.
method Two approaches: probabilistic neural networks and deep probabilistic models.
result TensorFlow Probability library supports both approaches.

DLPM replaces Gaussian noise with α-stable noise in DDPM, improving data distribution coverage and robustness.

problem Handling mode collapse and class imbalance in datasets with heavy-tailed noise.
method Extending DDPM to use α-stable noise, simplifying the process with elementary proof techniques.
result DLPM yields better coverage of data distribution tails, improved robustness to unbalanced datasets, and faster computation times.

Proposes a new metric learning method for image recognition.

problem Improving image recognition performance using learned distance representations.
method Introduces a Generalized Hybrid Metric Loss (GHM-Loss) to learn hybrid proximity features combining geometric and probabilistic spaces.
result Demonstrates superior performance compared to existing methods on public datasets.

There is an increasing interest in estimating expectations outside of the classical inference framework, such as for models expressed as probabilistic programs. Many of these contexts call for some form of nested inference to be applied. In this paper, we analyse the behaviour of nested Monte Carlo (NMC) schemes, for w…

2016-12-03abs ↗pdf ↗

CheXpert++ improves CheXpert's accuracy and usability for medical radiology reports.

problem Infeasibility of obtaining ground truth labels for medical data.
method BERT-based approximation of CheXpert, addressing speed, differentiability, and probabilistic output.
result Achieves 99.81% parity with CheXpert, significantly faster, differentiable, and probabilistic.

We introduce the notion of a stochastic probabilistic program and present a reference implementation of a probabilistic programming facility supporting specification of stochastic probabilistic programs and inference in them. Stochastic probabilistic programs allow straightforward specification and efficient inference …

2020-01-08abs ↗pdf ↗

Recent advances in statistical inference have significantly expanded the toolbox of probabilistic modeling. Historically, probabilistic modeling has been constrained to (i) very restricted model classes where exact or approximate probabilistic inference were feasible, and (ii) small or medium-sized data sets which fit …

2019-08-09abs ↗pdf ↗

The main result of this paper is a probabilistic proof of the penalty method for approximating the price of an American put in the Black-Scholes market. The method gives a parametrized family of partial differential equations, and by varying the parameter the corresponding solutions converge to the price of an American…

2014-10-06abs ↗pdf ↗