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

153305458610 · Jun 202019922001200920172026
48 results for Measure Bounds

Study risk-sensitive reinforcement learning with Lipschitz dynamic risk measures, establishing regret bounds.

problem Risk-sensitive reinforcement learning in Markov decision processes.
method Two model-based algorithms for Lipschitz dynamic risk measures, focusing on regret bounds.
result Upper bounds demonstrate optimal dependencies on actions and episodes, reflecting risk sensitivity vs. sample complexity trade-off.

Paper develops a new generalization bound using PAC-Bayes theory and Gibbs distributions.

problem Limits of traditional generalization bounds due to complexity measures.
method Leverages PAC-Bayes bounds with Gibbs distributions to derive a flexible generalization bound.
result Derives a generalization bound that can adapt to both hypothesis class and task complexity.

We estimate risk measures in Markov cost processes with lower and upper bounds.

problem Estimating risk measures in infinite-horizon discounted costs within Markov processes.
method Truncation scheme and lower/upper bounds for CVaR and variance estimation.
result Upper and lower bounds for CVaR and variance estimation match up to logarithmic factors.

In the celebrated book entitled Metric Structures for Riemannian and Non-Riemannian Spaces, so-called Green Book, Gromov presented a problem regarding a metric measure space. Gromov posed the question Bound the expansion coefficient from below in terms of the observable diameter. The overall aim of the current study is…

2016-11-17abs ↗pdf ↗

We study generalizations of Reifenberg's Theorem for measures in Rn\mathbb R^n under assumptions on the Jones' ββ-numbers, which appropriately measure how close the support is to being contained in a subspace. Our main results, which holds for general measures without density assumptions, give effective measure bounds…

2016-12-23abs ↗pdf ↗

Bounds on factual and counterfactual distributions under measurement error in discrete models.

problem Measurement errors in discrete data and their impact on inference.
method Expressing modeling assumptions as linear constraints and using linear programming to derive bounds.
result Sharp bounds on factual and counterfactual distributions for various models, including instrumental variable scenarios.

Sharp upper bounds on inscribed radius for metric spaces with convex boundary.

problem Bounding inscribed radius in metric measure spaces with convex boundary.
method Proves sharp upper bounds on inscribed radius for subsets with convex boundary.
result Sharp upper bounds on inscribed radius for subsets with convex boundary.

Study approximates probability measures using structured classes of functions.

problem Approximating probability measures in Wasserstein-pp distance.
method Structured classes of approximators for functions in Lp(Ω)L_p(Ω), transferring to measures in Wp(Ω)W_p(Ω).
result Linear rate approximation for measures with densities bounded away from zero.

This paper fills in local bounds for Spearman's footrule and Gini's gamma measures of association.

problem Local bounds for bivariate copulas with respect to Spearman's footrule and Gini's gamma measures.
method Computing quasi-copulas that are not copulas for certain values of the measures.
result Presented local bounds for Spearman's footrule and Gini's gamma measures.

If the twist numbers of a collection of oriented alternating link diagrams are bounded, then the Alexander polynomials of the corresponding links have bounded euclidean Mahler measure (see Definition 1.2). The converse assertion does not hold. Similarly, if a collection of oriented link diagrams, not necessarily altern…

2004-12-28abs ↗pdf ↗

Paper finds lower bounds for eigenvalues of Bi-drifted Laplacian on smooth metric measure spaces.

problem Eigenvalue problems for Bi-drifted Laplacian on compact manifolds with boundary conditions.
method Obtained lower bounds using specific curvature conditions.
result Lower bounds for the first eigenvalue of Bi-drifted Laplacian.

Innovative inequalities for divergences with applications in PAC-Bayesian bounds and Monte Carlo.

problem Developing new inequalities for divergences.
method Introducing novel change of measure inequalities for ff-divergences and αα-divergences.
result Applications in PAC-Bayesian bounds and Monte Carlo estimates.

Study shows infinite-dimensional third bounded cohomology for non-orientable surfaces.

problem Understanding the third bounded cohomology of non-orientable surfaces.
method Analyzing measure-preserving homeomorphisms of non-orientable surfaces.
result Third bounded cohomology is infinite-dimensional.

We study convex risk measures describing the upper and lower bounds of a good deal bound, which is a subinterval of a no-arbitrage pricing bound. We call such a convex risk measure a good deal valuation and give a set of equivalent conditions for its existence in terms of market. A good deal valuation is characterized …

2011-08-05abs ↗pdf ↗

The paper proves geometric comparisons on metric measure spaces with integral Bakry-Émery Ricci tensor bounds.

problem Geometric comparisons on metric measure spaces with specific tensor bounds.
method Integral radial Bakry-Émery Ricci tensor bounds and potential function/gradient bounds.
result Diameter and eigenvalue estimates on smooth metric measure spaces.

On a Riemannian metric-measure space, we establish an Alexandrov-Bakelman-Pucci type measure estimate connecting Bakry-Émery Ricci curvature lower bound, modified Laplacian and the measure of certain special sets. We apply this estimate to prove Harnack inequalities for the modified Laplacian operator and fully non-lin…

2011-02-28abs ↗pdf ↗

New algorithms reduce regret in online MDPs by adapting to data and variance.

problem Adapting to both adversarial and stochastic environments in online MDPs.
method Develops algorithms based on global optimization and policy optimization, using optimistic follow-the-regularized-leader with log-barrier regularization.
result Achieves refined data-dependent and variance-dependent regret bounds.

Proposes a learned Bayesian Cramér-Rao bound for unknown measurement models.

problem Computing the Bayesian Cramér-Rao bound requires full knowledge of priors and measurement distributions.
method Introduces a Physics-encoded score neural network to learn priors and measurements.
result Demonstrates improved sample complexity and interpretability through domain knowledge incorporation.

We prove that if (X,d,m)(X,\mathsf d,\mathfrak m) is an essentially non-branching metric measure space with m(X)=1\mathfrak m(X)=1, having Ricci curvature bounded from below by KK and dimension bounded from above by N(1,)N \in (1,\infty), understood as a synthetic condition called Measure-Contraction property, then a sharp isoper…

2018-10-26abs ↗pdf ↗

Causal discovery algorithms infer causal relations from data based on several assumptions, including notably the absence of measurement error. However, this assumption is most likely violated in practical applications, which may result in erroneous, irreproducible results. In this work we show how to obtain an upper bo…

2018-10-18abs ↗pdf ↗

Uniform convergence of metrics on surfaces with bounded curvature measures proved.

problem Proving uniform convergence of metrics on Alexandrov surfaces with bounded integral curvature.
method Weak convergence of measures and analytic approximation of metrics.
result Uniform convergence of metrics on Alexandrov surfaces proved.

New algorithm recovers sparse binary vectors from generalized linear measurements efficiently.

problem Recovering sparse binary vectors from generalized linear measurements.
method Linear estimation algorithm and information theoretic lower bounds.
result Optimal sample complexity of O((k+σ2)logn)O((k+σ^2)\log{n}) for noisy one bit quantized linear measurements.

A new method optimizes robustness measures under input uncertainty using randomized Gaussian process upper confidence bound.

problem Optimizing robustness measures under input uncertainty.
method Randomized robustness measure GP-UCB (RRGP-UCB) that samples β from a chi-squared-based distribution.
result RRGP-UCB provides tight bounds on expected regret.

Sharp bounds found for various risk measures using generalized FGM copulas.

problem Finding sharp bounds for risk measures in high dimensions.
method Proved that generalized FGM copulas form a convex polytope, used this structure to find bounds for risk measures.
result Sharp analytical bounds for convex risk measures in the class of generalized FGM copulas.

Measure contraction property is a synthetic Ricci curvature lower bound for metric measure spaces. We consider Sasakian manifolds with non-negative Tanaka-Webster Ricci curvature equipped with the metric measure space structure defined by the sub-Riemannian metric and the Popp measure. We show that these spaces satisfy…

2015-11-30abs ↗pdf ↗

Study shows volume constraints lead to isoperimetric constant bounds in specific metric spaces.

problem Understanding isoperimetric constants in metric measure spaces with measure contraction property.
method Proves local isoperimetric inequalities on essentially non-branching MCP(K,N) spaces with volume constraints and geometric conditions.
result Establishes bounds on isoperimetric constants in smaller geodesic balls.

In this paper we present some bounds of Hausdorff measures of objects definable in o-minimal structures: sets, fibers of maps, inverse images of curves of maps, etc. Moreover, we also give some explicit bounds for semi-algebraic or semi-Pfaffian cases, which depend only on the combinatoric data representing the objects…

2012-04-25abs ↗pdf ↗

Paper investigates conditions for independence of weak gradients on metric spaces.

problem Dependence of weak gradients on pp in arbitrary metric measure spaces.
method Investigates the Bounded Interpolation Property to ensure independence of weak gradients.
result Bounded Interpolation Property guarantees independence of weak gradients.

Measure contraction properties MCP(K,N)MCP(K,N) are synthetic Ricci curvature lower bounds for metric measure spaces which do not necessarily have smooth structures. It is known that if a Riemannian manifold has dimension NN, then MCP(K,N)MCP(K,N) is equivalent to Ricci curvature bounded below by KK. On the other hand, it was ob…

2014-12-14abs ↗pdf ↗