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,742 papers · 148 categories

Trend · papers per month

103206308411 · Jun 202019922001200920172026
48 results for Measurement constraint

Counterexample shows state-constrained optimal control problems can have Young measure gaps.

problem Existence of Young measure gaps in state-constrained optimal control problems.
method Provided a counterexample for smooth controllable systems state-constrained to the unit ball.
result Gap occurs in a regular setting with non-convex Lagrangian density.

The paper optimizes stock portfolios with constraints based on performance attribution.

problem Optimizing stock portfolios with performance attribution constraints.
method Minimizes expected tail loss, constrains asset allocation and selection effect, tests on Dow Jones stocks.
result Imposing constraints on asset allocation and selection effect improves portfolio performance.

Study examines how business units can benefit from group cohesion under regulatory constraints.

problem Regulatory constraints limit business units' ability to form a single cohesive group.
method Defined and analyzed cohesive risk measures to minimize capital costs.
result Cohesive risk measures allow groups to achieve minimal capital costs without altering individual liabilities.

This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex transport constraints in addition to having given initial and terminal marginals. Sev…

2018-04-12abs ↗pdf ↗

We show that coherent risk measures are ineffective in curbing the behaviour of investors with limited liability or excessive tail-risk seeking behaviour if the market admits statistical arbitrage opportunities which we term ρρ-arbitrage for a risk measure ρρ. We show how to determine analytically whether such ρρ-ar…

2019-02-26abs ↗pdf ↗

This paper studies the problem of optimal investment with CRRA (constant, relative risk aversion) preferences, subject to dynamic risk constraints on trading strategies. The market model considered is continuous in time and incomplete. the prices of financial assets are modeled by Itô processes. The dynamic risk constr…

2011-06-09abs ↗pdf ↗

Dynamic risk constraints help limit risky behavior in financial portfolios.

problem Static risk measures fail to control tail-risk-seeking traders.
method Introduces dynamic risk constraints applied throughout the trading horizon.
result Dynamic risk constraints can effectively limit risky behavior in portfolios.

Optimal sampling strategy improves prediction accuracy with surrogate variables under measurement constraints.

problem Measurement-constrained datasets and lack of labeled data.
method A-optimality criterion for optimal sampling, leveraging surrogate variables.
result Achieves lower asymptotic variance and reduced empirical mean squared error.

We provide a dynamic programming principle for stochastic optimal control problems with expectation constraints. A weak formulation, using test functions and a probabilistic relaxation of the constraint, avoids restrictions related to a measurable selection but still implies the Hamilton-Jacobi-Bellman equation in the …

2011-05-04abs ↗pdf ↗

This paper explores the nonconvexity of push-forward constraints in machine learning.

problem The nonconvexity of push-forward constraints in machine learning.
method The paper provides sufficient and necessary conditions for the (non)convexity of push-forward functions and maps.
result Push-forward constraints are generally nonconvex, which limits the design of convex optimization problems in machine learning.

Consistent algorithms for multiclass learning with complex metrics and constraints.

problem Learning with complex performance metrics and constraints.
method General framework for designing consistent algorithms by viewing the problem as an optimization over feasible confusion matrices.
result Rates of convergence to the optimal (feasible) classifier, showing asymptotic consistency.

The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod embedding problem to the case of finitely-many marginal constraints. Using the classic…

2015-06-12abs ↗pdf ↗

The paper refines and generalizes worst-case law invariant convex risk measures.

problem Developing robust convex risk measures under uncertainty sets.
method Generalizing closed forms for worst-case law invariant convex risk measures with uncertainty sets based on norms and moment constraints.
result Explicit closed forms for convex risk measures are developed and assessed through numerical simulations.

Develops risk measures for markets with constraints and costs.

problem Risk measures in markets with portfolio constraints and transaction costs.
method Embeds portfolio constraints and transaction costs into securities market; provides comprehensive analysis of risk measures properties.
result Establishes dual representations for convex and quasiconvex risk measures.

This work presents entropic constraints from DAGs with hidden variables.

problem Characterizing causal relations in systems with hidden variables.
method Entropic inequality constraints derived from ee-separation relations.
result These constraints can learn about true causal models from observed data.

The study learns causal graphs from time series data using entropy measures.

problem Learning causal graphs from time series data.
method Constraint-based framework, information-theoretic measures, generalized causation entropy, PC and FCI algorithms.
result The methods effectively construct causal graphs from time series data.

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.

Bayesian inference over admissible histories leads to irreversible kinetics.

problem Modeling irreversible processes in systems with uncertain histories.
method A Gibbs-type measure weighted by energy-dissipation action and observation constraints, interpreted as a Bayesian posterior.
result The measure concentrates on maximum-a-posteriori (MAP) histories, recovering classical deterministic evolution.

Level-set optimization formulations with data-driven constraints minimize a regularization functional subject to matching observations to a given error level. These formulations are widely used, particularly for matrix completion and sparsity promotion in data interpolation and denoising. The misfit level is typically …

2018-11-28abs ↗pdf ↗

Study S-shaped utility maximization with VaR constraint and unobservable drift.

problem Maximizing utility with a Value at Risk (VaR) constraint and unknown drift.
method Bayesian filter, concavification principle, change of measure, semi-closed integral representation, algorithms (Lagrange, simulation, deep neural network).
result Critical wealth level determining solution feasibility and optimal solution existence.

The study connects fairness constraints with optimal transport to derive new insights in classification.

problem Ensuring fairness in classification models without sacrificing performance.
method Using Wasserstein barycenters and optimal transport, the study characterizes optimal classification functions under fairness constraints.
result Maximizing fairness under demographic parity is equivalent to solving a regression problem.

We investigate the structure of good deal bounds, which are subintervals of a no-arbitrage pricing bound, for financial market models with convex constraints as an extension of Arai and Fukasawa (2014). The upper and lower bounds of a good deal bound are naturally described by a convex risk measure. We call such a risk…

2015-06-01abs ↗pdf ↗

Method determines asset prices in incomplete markets to optimize portfolios.

problem Optimizing portfolios in incomplete markets with price constraints.
method Maximum entropy in the mean to adjust distortion function from bid-ask data.
result Prices of assets comply with portfolio optimization constraints.

A constrained informationally efficient market is defined to be one whose price process arises as the outcome of some equilibrium where agents face restrictions on trade. This paper investigates the case of short sale constraints, a setting which despite its simplicity, generates new insights. In particular, it is show…

2014-01-08abs ↗pdf ↗

Pattern sampling has been proposed as a potential solution to the infamous pattern explosion. Instead of enumerating all patterns that satisfy the constraints, individual patterns are sampled proportional to a given quality measure. Several sampling algorithms have been proposed, but each of them has its limitations wh…

2016-10-28abs ↗pdf ↗

We study power utility maximization for exponential Lévy models with portfolio constraints, where utility is obtained from consumption and/or terminal wealth. For convex constraints, an explicit solution in terms of the Lévy triplet is constructed under minimal assumptions by solving the Bellman equation. We use a nove…

2009-12-09abs ↗pdf ↗

The paper analyzes extreme risk measures with limited distributional information.

problem Investigating risk measures under partial knowledge of distribution moments and shape.
method Employing probability inequalities and modified Schwarz inequality to derive bounds on distortion risk measures.
result Unified framework for calculating best- and worst-case scenarios of distortion risk measures.

We provide analytical results for a static portfolio optimization problem with two coherent risk measures. The use of two risk measures is motivated by joint decision-making for portfolio selection where the risk perception of the portfolio manager is of primary concern, hence, it appears in the objective function, and…

2019-03-25abs ↗pdf ↗

Develops methods for fair classification under linear disparity constraints.

problem Disparate impacts of machine learning algorithms on protected groups.
method Bayes-optimal fair classification methods via pre-, in-, and post-processing.
result Explicit forms of Bayes-optimal fair classifiers under linear disparity measures.

We study the problem of portfolio insurance from the point of view of a fund manager, who guarantees to the investor that the portfolio value at maturity will be above a fixed threshold. If, at maturity, the portfolio value is below the guaranteed level, a third party will refund the investor up to the guarantee. In ex…

2011-02-22abs ↗pdf ↗

We propose an iterative gradient-based algorithm to efficiently solve the portfolio selection problem with multiple spectral risk constraints. Since the conditional value at risk (CVaR) is a special case of the spectral risk measure, our algorithm solves portfolio selection problems with multiple CVaR constraints. In e…

2014-10-20abs ↗pdf ↗

Paper finds inequalities for eigenvalues of buckling problems on special metric spaces.

problem Eigenvalue inequalities for buckling problems of drifting Laplacian.
method Investigated on bounded domains in complete smooth metric measure spaces (SMMSs) with special functions.
result General inequalities for eigenvalues derived under curvature constraints.

The paper extends localisation technique to multiple constraints in Euclidean spaces.

problem Proving log-concavity of conditional measures in decomposed convex sets.
method Defining partitions of maximal closed convex sets and proving log-concavity of conditional measures.
result Existence of a partition and log-concavity of conditional measures for almost every set of the partition.