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.

169,181 papers · 148 categories

Trend · papers per month

3671107142 · May 202619922001200920182026
48 results for Choquet's capacitability theorem

New method for superhedging without assuming continuous claims.

problem Superhedging without assuming upper semicontinuous contingent claims.
method Established a generalized duality for model-free superhedging using Choquet's capacitability theorem.
result Generalized duality for superhedging given marginal distributions without continuity assumptions.

Choquet regularization improves exploration in RL.

problem Improving exploration in reinforcement learning.
method Introducing Choquet regularizers to measure and manage exploration, reformulating RL problems and deriving explicit solutions.
result Explicit optimal distributions and Choquet regularizers for various exploratory samplers.

The paper introduces risk consistency properties for credit ratings.

problem Promoting prudent investment decisions in credit ratings.
method Introducing and studying risk consistency properties in the framework of Choquet rating criteria.
result Characterization of Choquet risk measures and rating criteria satisfying risk consistency properties.

Study on risk measures using distorted Choquet integrals with random distortions.

problem Developing risk measures under random distortions of capacities.
method Introducing and analyzing randomly distorted Choquet integrals with respect to a distorted capacity, establishing properties and providing representations.
result Representation of comonotonic additive conditional risk measures using G-randomly distorted Choquet integrals.

Paper proposes a new classifier for gender detection in mobile telematics.

problem Detecting gender through mobile telematics data.
method Choquet fuzzy integral vertical bagging classifier combining random forest and rough set theory.
result Choquet fuzzy integral vertical bagging classifier outperforms other classifiers.

In this paper, we define a new capacity which allows us to control the behaviour of the Dirichlet spectrum of a compact Riemannian manifold with boundary, with "small" subsets (which may intersect the boundary) removed. This result generalizes a classical result of Rauch and Taylor ("the crushed ice theorem"). In the s…

2005-04-08abs ↗pdf ↗

Motivated by recent work of Choquet-Bruhat, Chrusciel, and Martin-Garcia, we prove monotonicity properties and comparison results for the area of slices of the null cone of a point in a Lorentzian manifold. We also prove volume comparison results for subsets of the null cone analogous to the Bishop-Gromov relative volu…

2010-08-03abs ↗pdf ↗

Expands learning paradigm to stochastic orders using Choquet-Toland distance and Variational Dominance Criterion.

problem Learning high-dimensional distributions with stochastic orders.
method Introduces Choquet-Toland distance and Variational Dominance Criterion, uses input convex maxout networks (ICMNs).
result Proposes surrogates for Choquet-Toland distance and Variational Dominance Criterion with parametric rates.

Study transverse measures on infinite type hyperbolic surfaces.

problem Characterize the cone of transverse measures on infinite type hyperbolic surfaces.
method Use inverse limits and geodesic laminations to describe and construct cones of transverse measures.
result Explicit descriptions and bases of cones of transverse measures exist for many laminations.

This paper reviews incompatibilities of comonotonic risk measures.

problem Incompatibilities of comonotonic risk measures with central properties.
method Literature review and Choquet representation of comonotonic additive risk measures.
result Comonotonic additive risk measures cannot be surplus invariant.

Paper tackles inventory management with deep learning, improving performance and adherence to constraints.

problem Managing inventory with limited resources and constraints.
method Proposes a novel method to sample from a distribution of possible constraint paths, extends exo-IDP formulation, introduces neural coordinator, and uses modified DirectBackprop algorithm.
result Deep reinforcement learning policies with a neural coordinator outperform classic baselines in terms of performance and adherence to constraints.

Recursive KalmanNet generalizes well in noisy, out-of-distribution scenarios.

problem Generalization in noisy, out-of-distribution scenarios.
method Recurrent neural network guided by a Kalman filter.
result Recursive KalmanNet performs well in scenarios with different temporal dynamics from training data.

A framework for reinforcement learning tackles CVRP with competitive results.

problem Optimizing routes for vehicles with limited capacity.
method Formulates action selection as a mixed-integer optimization problem, uses policy iteration to improve policies.
result Achieves an average gap of 1.7% with state-of-the-art OR methods on CVRP instances.

The paper proves local isometric embeddings for singular metrics near a point.

problem Existence of local isometric embeddings for singular Riemannian metrics.
method Ramified local isometric embeddings using Leray's ramified Cauchy-Kovalevskaya Theorem.
result Existence of local analytic isometric embeddings into Euclidean space.

Sym-NCO leverages symmetricities to improve DRL-NCO performance.

problem Improving neural combinatorial optimization methods.
method Sym-NCO is a regularizer-based training scheme that exploits universal symmetricities in CO problems and solutions.
result Sym-NCO significantly improves DRL-NCO performance across various CO tasks.

New principles for collapsing law-invariant functionals to means, extending beyond convexity.

problem Conditions for law-invariant functionals to reduce to means.
method Establishing collapse to the mean principles for non-convex functionals.
result General principles apply beyond convexity, including quasiconvex and Choquet integrals.

Transformers improve solving mixed-integer programs, especially CLSP.

problem Solving Capacitated Lot Sizing Problem (CLSP) with mixed-integer programming.
method Employing transformer models to predict binary variables in CLSP.
result Transformer model outperforms CPLEX and LSTM in solving CLSP.

The paper bounds solutions to complex optimization problems with uncertain data.

problem Distributionally robust optimization problems with multivariate uncertainty sets.
method Conditions and bounds derived for multivariate and univariate Wasserstein distances, Bregman-Wasserstein divergences, and signed Choquet integrals.
result Computable lower and upper bounds for DRO problems, derived from scalar-valued aggregation functions and Wasserstein distances.

The paper solves an insurance problem using mean-variance and rank-dependent utility theory.

problem Formulating and solving an insurance problem with rank-dependent utility and mean-variance premium principle.
method Formulated as a non-concave maximization problem, then turned into a concave quantile optimization problem, solved using calculus of variations.
result An optimal insurance contract is derived and numerically computed.

A new convex loss function optimizes set predictions with balanced size and coverage.

problem Optimizing set predictions with balanced size and coverage.
method Proposes a convex loss function using Choquet integrals for nondecreasing subset-valued functions.
result Optimal trade-offs between conditional probabilistic coverage and set size.

New insights into risk aversion for complex decision models.

problem Understanding risk aversion in non-monotone decision models.
method Characterization of probabilistic risk aversion for generalized rank-dependent functions.
result Probabilistic risk aversion is determined by the distortion function, which is convex or scaled quantile-spread mixtures.

The notion of maximal extension of a globally hyperbolic space-time arises from the notion of maximal solutions of the Cauchy problem associated to the Einstein's equations of general relativity. In 1969 Choquet-Bruhat and Geroch proved that if the Cauchy problem has a local solution, this solution has a unique maximal…

2013-06-17abs ↗pdf ↗

The paper explores optimal insurance contracts using various deviation measures.

problem Optimal insurance contracts with mean-deviation measures.
method Study of convex signed Choquet integrals and standard deviation as deviation measures, analyzing premium principles like expected value, Value-at-Risk, and Expected Shortfall.
result Characterization of optimal indemnities and deductibles under different premium principles.

New method ranks European countries' innovation performance considering criterion interactions.

problem Lack of consensus on weighting composite innovation indicators.
method Hierarchical-SMAA-Choquet integral approach to rank and benchmark innovation performance.
result Robust measurement of innovation performances in Europe with a hierarchy of interacting composite indicators.

We prove short-time existence for the Einstein-Euler-Entropy system for non-isentropic fluids with data in uniformly local Sobolev spaces. The cases of compact as well as non-compact Cauchy surfaces are covered. The method employed uses a Lagrangian description of the fluid flow which is based on techniques developed b…

2013-01-23abs ↗pdf ↗

The paper finds optimal insurance contracts in behavioral finance, avoiding moral hazard.

problem Finding optimal insurance contracts that avoid moral hazard in a behavioral finance framework.
method Formulated as a non-concave maximization problem involving Choquet expectation, then solved using calculus of variations.
result Optimal contracts are found for certain values of safety loading, with some contracts never optimal for others.