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

226452678904 · Jun 202019922001200920172026
48 results for de Finetti's problem

Optimizes dividend payouts with fixed costs and regime switching.

problem Maximizing dividends with fixed transaction costs and regime switching.
method Identifies optimal dividend strategy as a two-barrier impulsive strategy.
result Explicit determination of optimal strategy for various drift and volatility scenarios.

We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically rewritten as procedures that do not modify non-local state. Along the way, we pro…

2009-12-06abs ↗pdf ↗

LLMs encode latent topic distributions, suggesting Bayesian inference.

problem Capturing topic structure from large language models.
method Connecting LLM optimization to implicit Bayesian inference and de Finetti's theorem.
result LLMs recover latent topic distributions, matching LDA-generated topics.

Bayesian model improves classification performance with flexible uncertainty modeling.

problem Improving classification performance with flexible uncertainty modeling.
method Combines Gaussian process and Dirichlet process priors for latent function and link function, respectively.
result Outperforms standard logistic regression on simulated data.

This thesis explores supervised classification methods using Bayesian and exchangeability theories.

problem Assigning objects into predefined classes using training data and auxiliary information.
method Bayesian inductive theories and exchangeabilities (de Finetti and partition exchangeability).
result Optimal classifiers for different scenarios of object features and categories.

New algorithms use offline data to improve online decision-making with latent states.

problem Accelerating online sequential decision-making with latent states in offline data.
method Design end-to-end latent bandit algorithms for linear latent contextual bandits, learning latent subspace offline and using it online.
result Proves minimax optimal regret guarantees for online algorithms and practical efficiency.

Framework for systemic risk modeling using jointly exchangeable arrays.

problem Systemic risk in insurance portfolios with interactions.
method Jointly exchangeable arrays, central limit theorems, simulation-based validation.
result Asymptotic approximations for total portfolio losses in large portfolios over long time horizons.

New approach to optimal dividend control with mean-variance criterion.

problem Balancing expected dividends and variability in a singular control framework.
method Game-theoretic approach to find time-consistent equilibrium strategies.
result Verification theorem for MV singular dividend control problem.

Optimizes dividend control in a bankruptcy process using a special Levy process.

problem Optimizing dividend payouts in a bankruptcy process.
method Using a non-standard spectrally negative Levy process with endogenous regime switching.
result Optimal dividend control is of the barrier type and the optimal barrier can be identified.

In supervised learning, an inductive learning algorithm extracts general rules from observed training instances, then the rules are applied to test instances. We show that this splitting of training and application arises naturally, in the classical setting, from a simple independence requirement with a physical interp…

2016-05-24abs ↗pdf ↗

We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Mark…

2014-03-17abs ↗pdf ↗

Paper uses bond pricing and convexity adjustments to explain herd immunity paradox.

problem Early onset of herd immunity contradicts R value estimates from early stage growth.
method Utilizes Vasicek's bond pricing formula and de Finetti's Theorem approach.
result Reduces modeling discrepancy to simple convexity formulas.

Study mini-batch SGD noise and its limits, proving complexity guarantees.

problem Analyzing the noise in mini-batch SGD and its impact on optimization.
method Examined the conditional covariance and diffusion limits of SGD under different sampling designs.
result Proved mean-square upper bounds and Fisher van Trees lower bounds for SGD, linking them to effective dimension and condition number.

Bayesian classifiers converge under certain exchangeability conditions with more data.

problem Predictive accuracy of marginal classifiers under varying data conditions.
method Introduced and compared mBpc and sBpc, provided computational scheme for PE sequences, and developed parameter estimation and testing methods.
result mBpc and sBpc converge under PE conditions with increasing data, validating mBpc's use.

Study domination between non-Fuchsian surface group representations and anti-de Sitter geometry.

problem Domination problem between non-Fuchsian representations of closed surface groups.
method Analysis of branched harmonic immersions and construction of anti-de Sitter 3-manifolds.
result Found that representations admitting branched harmonic immersions dominate other representations, and constructed large families of branched anti-de Sitter 3-manifolds.

Paper compares Bayesian and de-biased estimators for low-rank matrix completion.

problem Predict missing entries in partially observed matrices.
method Bayesian and de-biased estimators comparison.
result De-biased estimator performs similarly to Bayesian estimators but is more stable and can outperform in small samples.

X-TFC solves parametric DEs with neural networks and physics constraints.

problem Solving parametric differential equations with physics constraints.
method Combines Theory of Functional Connections and Physics-Informed Neural Networks with a single-layer Extreme Learning Machine.
result Achieves high accuracy with low computational time.

Classical 10d string backgrounds with a 4d de Sitter space-time, D-brane and orientifold sources, are commonly believed to satisfy the following: 1. There is no classical de Sitter solution with parallel sources. 2. Classical de Sitter solutions with intersecting sources are unstable. 3. Classical de Sitter solutions c…

2019-02-26abs ↗pdf ↗

Two problems concerning asymptotically hyperbolic manifolds with an inner boundary are studied. First, we study scalar curvature presciption with either Dirichlet or mean curvature prescription interior boundary condition. Then we apply those results to the Lichnerowicz equation with (future or past) apparent horizon i…

2008-02-22abs ↗pdf ↗

Proves uniqueness of certain spacetime solutions with extremal horizons.

problem Proving uniqueness of extremal Schwarzschild de Sitter spacetime solutions.
method Analytic proof in four and higher dimensions, spectral problem for hyperbolic surfaces.
result Proves extremal Schwarzschild de Sitter solutions are unique up to identifications.

Researchers compute de Rham cohomology of geodesic flow foliations on hyperbolic surfaces.

problem Answering a problem posed by Haefliger and Li about geodesic flow foliations.
method Unitary representation theory of PSL(2, R) and Hodge decompositions of de Rham complexes.
result Computed de Rham cohomology of weak stable foliations for various coefficients.

Study Lorentz harmonic maps and spacelike surfaces in anti-de Sitter space.

problem Analyzing the relationship between Lorentz harmonic maps and spacelike surfaces.
method Using loop group techniques, develop DPW-type representations and solve Cauchy problems.
result Establish a correspondence between Lorentz harmonic maps and spacelike immersions, leading to families of surfaces of constant Gauss curvature.

Dans les années 1940-1970, Alexandrov et l'"École de Leningrad" ont développé une théorie très riche des surfaces singulières. Il s'agit de surfaces topologiques, munie d'une métrique intrinsèque pour laquelle on peut définir une notion de courbure, qui est une mesure de Radon. Cette classe de surfaces a de bonnes prop…

2009-06-18abs ↗pdf ↗

This paper addresses pure gauge questions in the study of (asymptotically) de Sitter spacetimes. We construct global solutions to the eikonal equation on de Sitter, whose level sets give rise to double null foliations, and give detailed estimates for the structure coefficients in this gauge. We show two results which a…

2019-10-13abs ↗pdf ↗

We show that contact homology distinguishes infinitely many tight contact structures on any orientable, toroidal, irreducible 3-manifold. As a consequence of the contact homology computations, on a very large class of toroidal manifolds, all known examples of universally tight contact structures with nonvanishing torsi…

2004-11-25abs ↗pdf ↗

We describe the space of isometric immersions from the Lorentz plane L2L^2 into the 3-dimensional anti-de Sitter space, and solve several open problems of this context raised by M. Dajczer and K. Nomizu in 1981. We also obtain from the above result a description of the space of Lorentzian flat tori isometrically immers…

2009-05-25abs ↗pdf ↗

Locally-verifiable conditions ensure exactness of spline discrete de Rham complex.

problem Ensuring cohomological equivalence of spline discrete complex to continuous de Rham complex.
method Theoretical analysis and locally-verifiable sufficient conditions for exactness.
result Locally-verifiable conditions guarantee exactness of hierarchical B-spline discrete de Rham complex.