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

93186278371 · Jun 202019922001200920172026
48 results for Maximum Probability Theorem

MPT improves CNN and energy-based models' OOD detection and generalization.

problem Challenging out-of-distribution detection in computer vision.
method Applying Maximum Probability Theorem as a regularization scheme in CNN and energy-based models.
result MPT-based regularization strategy stabilizes and improves generalization and robustness of base models.

We present a theoretical framework of probabilistic learning derived by Maximum Probability (MP) Theorem shown in the current paper. In this probabilistic framework, a model is defined as an event in the probability space, and a model or the associated event -- either the true underlying model or the parameterized mode…

2019-10-21abs ↗pdf ↗

We consider the smoothing probabilities of hidden Markov model (HMM). We show that under fairly general conditions for HMM, the exponential forgetting still holds, and the smoothing probabilities can be well approximated with the ones of double sided HMM. This makes it possible to use ergodic theorems. As an applicatio…

2009-10-24abs ↗pdf ↗

We characterize the asymptotic performance of nonparametric one- and two-sample testing. The exponential decay rate or error exponent of the type-II error probability is used as the asymptotic performance metric, and an optimal test achieves the maximum rate subject to a constant level constraint on the type-I error pr…

2019-08-27abs ↗pdf ↗

Deep neural networks can approximate any target probability distribution given certain conditions.

problem Approximating complex probability distributions with deep neural networks.
method Proving the existence of a deep neural network mapping that approximates a target distribution under various integral probability metrics.
result Upper bounds on the size of the neural network in terms of dimension and approximation error for different metrics.

General equilibrium equations in economics play the same role with many-body Newtonian equations in physics. Accordingly, each solution of the general equilibrium equations can be regarded as a possible microstate of the economic system. Since Arrow's Impossibility Theorem and Rawls' principle of social fairness will p…

2015-05-22abs ↗pdf ↗

Quantum method generates unbiased samples from discrete graphical models.

problem Sampling from discrete graphical models is challenging and intractable in high dimensions.
method Embedding graphical models into unitary operators and using quantum circuits.
result Provably generates unbiased and independent samples from general discrete factor models.

Proposes a guaranteed regularization method for maximum likelihood estimation using gauge symmetry in Kullback-Leibler divergence.

problem Overfitting in maximum likelihood estimation.
method Introduces a regularization approach based on gauge symmetry in Kullback-Leibler divergence.
result The method provides a theoretically guaranteed optimal model without frequent hyperparameter tuning.

The paper reinterprets Bayesian priors and posteriors using Riemannian manifolds.

problem The dependence of maximum a posteriori estimates on parametrization.
method Assuming a Riemannian manifold with Fisher metric, the paper reinterprets priors and posteriors as distributions over probability distributions, making estimates independent of parametrization.
result A maximum a posteriori estimate independent of parametrization is defined.

A maximum principle for C^0 null hypersurfaces is obtained and used to derive a splitting theorem for spacetimes which contain null lines. As a consequence of this null splitting theorem, it is proved that an asymptotically simple vacuum (Ricci flat) spacetime which contains a null line is isometric to Minkowski space.

1999-09-27abs ↗pdf ↗

We present a novel synthesis of Fisher information and asset pricing theory that yields a practical method for reconstructing the probability density implicit in security prices. The Fisher information approach to these inverse problems transforms the search for a probability density into the solution of a differential…

2003-02-27abs ↗pdf ↗

MEP-Net uses MEP to generate solutions from limited data.

problem Generating solutions to scientific problems with incomplete information.
method Combines MEP with neural networks to learn complex distributions from moment constraints.
result Demonstrates MEP-Net's effectiveness in modeling biochemical reaction networks and generating complex distributions.

According to a classical result of E.~Calabi any hyperbolic affine hypersphere endowed with its natural Hessian metric has a non-positive Ricci tensor. The affine hyperspheres can be described as the level sets of solutions to the "hyperbolic" toric Kähler-Einstein equation eΦ=detD2Φe^Φ = \det D^2 Φ on proper convex cones. We…

2016-04-14abs ↗pdf ↗

New algorithms minimize MMD to approximate probability measures efficiently.

problem Approximating probability measures by representative point sets.
method Sequential greedy minimization of maximum mean discrepancy (MMD) over candidate sets, with mini-batch variants.
result Consistency of proposed algorithms and mini-batch variants established.

New method calibrates reference distributions for bounded support.

problem Lack of principled method for bounded-support statistical reference distributions.
method Formulated maximum entropy on projective space of nonnegative measures.
result Prescribed acceptance region uniquely determines deformation parameter.

Unified view of KL-divergence and IPMs via DRE, with new DRM metrics.

problem Unified understanding of KL-divergence and IPMs.
method Unified representation via maximum likelihood density-ratio estimation (DRE).
result Unified form of IPMs and novel DRM metrics.

Modified lognormal distribution with flexible tails for skewed data.

problem Skewed and fat-tailed data in natural and engineering datasets.
method Developed a family of three-parameter non-Gaussian probability density functions based on generalized kappa-exponential and kappa-logarithm functions.
result Closed-form analytic expressions for statistical functions and maximum-likelihood estimation.

The paper classifies translation surfaces in a specific hyperelliptic component and finds the maximum number of disjoint geodesics.

problem Classifying and understanding translation surfaces in a specific hyperelliptic component.
method Analyzing geodesics and Euclidean structures on hyperelliptic surfaces.
result A classification theorem for translation surfaces in Hhyp(4)\mathcal{H}^{\mathrm{hyp}}(4) and the maximum number of disjoint geodesics.

We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach provides an interesting alternative to the well-known graph cut paradigm in that it …

2008-10-24abs ↗pdf ↗

We present a new geometric unfolding of a prototype problem of optimal control theory, the Mayer problem. This approach is crucially based on the Stokes Theorem and yields to a necessary and sufficient condition that characterizes the optimal solutions, from which the classical Pontryagin Maximum Principle is derived i…

2018-12-19abs ↗pdf ↗

Maximizing withdrawal success in a pooled annuity fund with multiple annuitants.

problem Optimizing withdrawal success in a pooled annuity fund with homogeneous annuitants.
method Maximizing the probability of completing withdrawals until death over portfolio weight functions.
result Increasing the number of annuitants can significantly increase the maximum probability of withdrawal success.

New bounds for optimal transport using Gaussian processes and rate-distortion functions.

problem Finding bounds for entropic optimal transport with mutual information constraints.
method Lifting technique to construct a Gaussian process and applying the majorizing measure theorem.
result Maximum expected inner product is equivalent to a truncated integral involving the rate-distortion function.

New causal versions of MaxEnt and PIR avoid paradoxical probability updates.

problem Paradoxical probability updates in causal MaxEnt and PIR.
method Separate constraints into cause-specific and mechanism-specific restrictions.
result Causal MaxEnt avoids paradoxical updates and aligns with Information Geometric Causal Inference.

Paper introduces GSPMs for robust probability metrics.

problem Lack of well-established convergence behavior for probability metrics.
method Introduces Generalized Sliced Probability Metrics (GSPMs) based on generalized Radon transform.
result GSPMs converge to global optimum under mild assumptions for generative modeling.

The paper solves portfolio selection for complex preferences in continuous time.

problem Dynamic portfolio selection for nonlinear preferences with time inconsistency.
method Stochastic maximum principle and verification theorems for equilibrium strategies.
result Equilibrium strategies derived in closed form for CRRA and CARA preferences.

We provide a probabilistic approach to studying minimal surfaces in three-dimensional Euclidean space. Following a discussion of the basic relationship between Brownian motion on a surface and minimality of the surface, we introduce a way of coupling Brownian motions on two minimal surfaces. This coupling is then used …

2008-05-05abs ↗pdf ↗