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

85169254338 · Jun 202019922001200920172026
48 results for reference measure

Researchers develop a method to infer reference measures from observed functionals.

problem Tackles the challenge of identifying or recovering a reference measure from observed functionals.
method Uses the property of law-invariant functionals defining lower or upper supporting sets in dual spaces of signed measures.
result Illustrates the methodology with examples and develops a modification for Value-at-Risk.

This work extends entropic optimal transport to non-product reference couplings, focusing on Gaussian cases.

problem Finding a diffuse coupling between two measures with non-product reference couplings.
method Reduction of the entropic optimal transport problem to a matrix optimization problem.
result Complete description of the solution for non-product reference couplings, including primal and dual variables.

Mondino and Naber recently proved that finite dimensional RCD\sf RCD spaces are rectifiable. Here we show that the push-forward of the reference measure under the charts built by them is absolutely continuous with respect to the Lebesgue measure. This result, read in conjunction with another recent work of us, has relev…

2016-07-18abs ↗pdf ↗

Study measures gender bias in machine translation using multiple reference points.

problem Measuring and identifying gender bias in machine translation.
method Used an optimal non-biased translator, reference points from occupational statistics and survey.
result Found bias against both genders, but more against women, and found occupations have a greater effect than adjectives.

Decentralized learning achieves centralized performance via Gibbs measures.

problem Achieving centralized performance in decentralized machine learning.
method ERM-RER learning framework with Gibbs measures and relative-entropy regularization.
result Achieving centralized performance with Gibbs measures and specific scaling of regularization factors.

We introduce a weak notion of barycenter of a probability measure μμ on a metric measure space (X,d,m)(X, d, {\bf m}), with the metric dd and reference measure m{\bf m}. Under the assumption that optimal transport plans are given by mappings, we prove that our barycenter B(μ)B(μ) is well defined; it is a probability measur…

2017-03-28abs ↗pdf ↗

Method identifies low-dimensional structure in high-dimensional probability measures.

problem Identifying low-dimensional structure in high-dimensional probability measures.
method Extends prior work on minimizing majorizations of the Kullback-Leibler divergence to identify optimal approximations within a specific class of measures.
result Connection between dimensional logarithmic Sobolev inequality and approximations with the ansatz.

Entropy asymmetry affects regularization in ERM, leading to biased solutions.

problem Analyzing the impact of relative entropy asymmetry in ERM regularization.
method Examined Type-I and Type-II ERM-RER, comparing their solutions and properties.
result Type-II ERM-RER regularization introduces a strong bias against training data.

A novel approach to computing barycenters on graph-supported probability measures.

problem Computing weighted averages of measures on graphs.
method Dynamic optimal transport formulation on the simplex, gradient descent on the probability simplex.
result Intrinsic gradient descent provides a coherent framework for synthesizing and analyzing measures on graphs.

A framework for robust exploration in reinforcement learning under ambiguity.

problem Optimal stopping under ambiguity in reinforcement learning.
method Continuous-time robust reinforcement learning framework using gg-expectation and backward stochastic differential equations.
result Constructs a robust exploratory stopping time approximating the optimal stopping time under ambiguity.

In the presence of model risk, it is well-established to replace classical expected values by worst-case expectations over all models within a fixed radius from a given reference model. This is the "robustness" approach. We show that previous methods for measuring this radius, e.g. relative entropy or polynomial diverg…

2015-10-06abs ↗pdf ↗

Optimizes a portfolio for an investor preferring accepted securities over a reference security.

problem Investor preference for a set of securities over a reference security with constraints.
method Mean-variance optimization with Sharpe Ratio performance measurement.
result Derives an optimal portfolio that maximizes returns while minimizing risk.

We study coherent risk measures which are time-consistent for multiple filtrations. We show that a coherent risk measure is time-consistent for every filtration if and only if it is one of four main types. Furthermore, if the risk measure is strictly monotone it is linear, and if the reference probability space is not …

2010-07-05abs ↗pdf ↗

New measures on orbit spaces for orthogonal groups identified.

problem Characterizing measures on orbit spaces of orthogonal groups.
method Constructing Hilbert measures on orbit spaces of coregular representations of orthogonal groups.
result Hilbert measures have singularities if and only if the number of copies equals the dimension.

Adjusted for chance measures are widely used to compare partitions/clusterings of the same data set. In particular, the Adjusted Rand Index (ARI) based on pair-counting, and the Adjusted Mutual Information (AMI) based on Shannon information theory are very popular in the clustering community. Nonetheless it is an open …

2015-12-03abs ↗pdf ↗

We show how risk measures originally defined in a model free framework in terms of acceptance sets and reference assets imply a meaningful underlying probability structure. Hereafter we construct a maximal domain of definition of the risk measure respecting the underlying ambiguity profile. We particularly emphasise li…

2017-03-03abs ↗pdf ↗

Stability of hypersurface immersions in Riemannian manifolds proved for LpL^p perturbations.

problem Stability of isometric immersions of hypersurfaces in Riemannian manifolds under LpL^p perturbations of their fundamental forms.
method Young measure approach, relaxation of energy, regularity result for immersions.
result Sequence of immersions converges to an isometric immersion with the reference shape operator.

Deep kernel learning refers to a Gaussian process that incorporates neural networks to improve the modelling of complex functions. We present a method that makes this approach feasible for problems where the data consists of line integral measurements of the target function. The performance is illustrated on computed t…

2019-09-04abs ↗pdf ↗

A new approach is presented to describe the change in the statistics of the log return distribution of financial data as a function of the timescale. To this purpose a measure is introduced, which quantifies the distance of a considered distribution to a reference distribution. The existence of a small timescale regime…

2005-09-30abs ↗pdf ↗

New regularization method reduces support of empirical risk minimization solutions.

problem Regularization in empirical risk minimization with relative entropy.
method Introduces Type-II regularization, characterizes solutions, analyzes properties of relative entropy.
result Type-II regularization collapses solution support into reference measure's support.

Paper tackles measure estimation in barycentric coding model.

problem Estimating an unknown measure in the barycentric coding model.
method Geometric, statistical, and computational insights; quadratic optimization problem; empirical i.i.d. samples algorithm.
result Proves precise rates of convergence for algorithm, ensuring statistical consistency.

Model risk has a huge impact on any risk measurement procedure and its quantification is therefore a crucial step. In this paper, we introduce three quantitative measures of model risk when choosing a particular reference model within a given class: the absolute measure of model risk, the relative measure of model risk…

2013-07-02abs ↗pdf ↗

The study introduces measures of collective mobility from aggregated OD data.

problem Understanding large-scale mobility patterns from aggregated data.
method Developed a framework using synthetic and real data to interpret network-level mobility.
result Aggregated mobility measures reveal network structure and flow constraints.

The paper proposes a new method to measure risk with fine-grained tail sensitivity.

problem Risk measures that do not account for tail sensitivity are insufficient for machine learning systems.
method The approach involves specifying a reference distribution with desired tail behavior and constructing risk measures compatible with this upper probability.
result Risk measures with fine-grained tail sensitivity can replace the expectation operator in machine learning systems.

This article considers the quasi-local energy in reference to a general static spacetime. We follow the approach developed by the authors in [19, 20, 7, 9] and define the quasi-local energy as a difference of surface Hamiltonians, which are derived from the Einstein-Hilbert action. The new quasi-local energy provides a…

2016-04-11abs ↗pdf ↗

The paper introduces a new method to measure the shape relations between biological objects using r-parallel sets.

problem The influence of neighboring objects on the shape and function of biological objects.
method The authors develop a theory based on spatial point processes to measure the geometrical interaction between objects.
result The proposed measures provide detailed information about the shape of individual objects and their interactions.

We investigate the low-dimensional structure of deterministic transformations between random variables, i.e., transport maps between probability measures. In the context of statistics and machine learning, these transformations can be used to couple a tractable "reference" measure (e.g., a standard Gaussian) with a tar…

2017-03-17abs ↗pdf ↗

Proves sufficiency of countable test plans for BV functions on metric spaces.

problem Recovering BV functions and their measures on arbitrary metric spaces.
method Proves sufficiency of countable test plans on arbitrary metric measure spaces and geodesics on CD(K,N){\sf CD}(K,N) spaces.
result Countable test plans are sufficient for BV functions and their measures on metric spaces.

The paper provides precise estimates for isoperimetric inequalities on weighted manifolds.

problem Quantitative isoperimetric inequalities on weighted Riemannian manifolds.
method Analyzes L1L^1, LpL^p, and W2W_2 estimates for the push-forward of measures.
result Close approximation of the guiding function's push-forward to Gaussian measure.

We introduce Gaussian-type measures on the manifold of all metrics with a fixed volume form on a compact Riemannian manifold of dimension 3\geq 3. For this random model we compute the characteristic function for the L2L^2 (Ebin) distance to the reference metric. In the Appendix, we study Lipschitz-type distance betwee…

2013-09-05abs ↗pdf ↗

This paper improves indoor positioning accuracy by deploying reference nodes to ensure Line-of-Sight.

problem Systematic bias errors in indoor positioning due to non-LoS propagation.
method Model indoor service area as a graph, partition into cliques for reference nodes, set minimum distance and angle parameters.
result Guaranteed LoS to reference nodes improves indoor positioning accuracy and precision.

Active learning aims to train a classifier as fast as possible with as few labels as possible. The core element in virtually any active learning strategy is the criterion that measures the usefulness of the unlabeled data based on which new points to be labeled are picked. We propose a novel approach which we refer to …

2017-06-23abs ↗pdf ↗

We develop a tractable model of realization utility that studies the role of reference-dependent S-shaped preferences in a dynamic investment setting with reinvestment. Our model generates both voluntarily realized gains and losses. It makes specific predictions about the volume of gains and losses, the holding periods…

2014-08-12abs ↗pdf ↗

New algorithm improves signal reconstruction from noisy measurements with side information.

problem Reconstructing unknown signals from noisy linear measurements with side information.
method Integrates side information into approximate message passing (AMP) and tracks performance using state evolution.
result AMP-SI performance is accurately predicted by state evolution.

Bayesian approach to robust risk measures under model uncertainty.

problem Representing robust risk measures as a single probability measure.
method Introducing two types of risk measures and analyzing their relation to robust risk measures.
result Robust risk measures can be represented by a mixture probability measure, a Bayesian approach.

Study dynamic risk measures with distributional uncertainty using optimal transport.

problem Risk robustification under distributional uncertainty in Markovian models.
method Characterize risk measures via convex monotone semigroups and optimal transport costs.
result Identify generator and correction terms for dynamic risk measures under different scaling regimes.