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

4182122163 · Jun 202019922001200920172026
48 results for Incomplete constraints

Study optimal investment and consumption in incomplete markets with nonlinear expectations.

problem Utility maximization in incomplete markets with general constraints.
method Utilizes gg-martingale method to solve optimization problem for various utility functions.
result Characterizes optimal investment-consumption strategy through quadratic BSDE solutions.

Investigates optimal consumption and investment strategies with constraints in incomplete markets.

problem Optimal consumption and investment under constraints in incomplete markets.
method Characterizes optimal strategies via a quadratic BSDE, using martingale optimality criterion and Lyapunov functions.
result Obtains the verification theorem for optimal strategies in unbounded cases.

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.

MUSIC learns coupled systems with sparse data and incomplete physics.

problem Learning coupled systems with incomplete physical constraints and missing data.
method Sparsity induced multitask neural network framework integrating partial physical constraints with data-driven learning.
result MUSIC accurately learns solutions to complex coupled systems under data-scarce and noisy conditions.

Efficiently verifies neural networks by handling neuron splits, improving speed and accuracy.

problem Handling neuron split constraints in incomplete neural network verification.
method β-CROWN, which optimizes parameters β to encode neuron splits and uses them in bound propagation.
result β-CROWN significantly speeds up verification while maintaining high accuracy.

We consider the problem of utility maximization for small traders on incomplete financial markets. As opposed to most of the papers dealing with this subject, the investors' trading strategies we allow underly constraints described by closed, but not necessarily convex, sets. The final wealths obtained by trading under…

2005-08-24abs ↗pdf ↗

Bayesian method infers transition matrices from incomplete graph data with topological constraints.

problem Inference of transition matrices from incomplete graph data with topological constraints.
method Bayesian approach using repeated interactions and a topological prior.
result Higher accuracy in inferring transition probabilities, improving downstream tasks.

The paper explores geometric relationships in manifolds with curvature constraints, proving new inequalities and rigidity results.

problem Understanding geometric features of manifolds with curvature constraints.
method Comparison theorems and spacetime harmonic functions.
result Partial resolution of Gromov's conjecture and new characterizations of geometries.

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 ↗

Proposes CRG_IMSC for better clustering of multi-view data.

problem Lack of effective connectivity in clustering results.
method Directly obtains clustering result with nonnegative constraint; constructs connectivity matrix based on spectral clustering result; uses multiplicative update algorithm.
result Improves clustering performance on benchmark datasets.

Unified physics-informed learning method improves generalization performance.

problem Lack of theoretical analysis for hybrid settings with incomplete physical constraints.
method Unified residual form unifying collocation and variational methods, establishing generalization performance governed by affine variety dimension.
result Generalization performance is determined by affine variety dimension, not just the number of parameters.

Subbagging estimation for big data reduces memory usage while maintaining statistical consistency.

problem Memory constraints in analyzing massive datasets.
method Randomly subsample the data, aggregate estimators from subsamples, and use incomplete U-statistics theory.
result Subbagging estimator achieves N\sqrt{N}-consistency and asymptotic normality under certain conditions.

TCRI improves domain generalization by enforcing conditional independence constraints.

problem Limitations of existing domain generalization methods due to incomplete constraints.
method TCRI implements regularizers motivated by conditional independence constraints.
result TCRI achieves cross-domain stability and outperforms baselines in worst-domain accuracy.

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 ↗

We investigate the ergodic problem of growth-rate maximization under a class of risk constraints in the context of incomplete, Itô-process models of financial markets with random ergodic coefficients. Including {\em value-at-risk} (VaR), {\em tail-value-at-risk} (TVaR), and {\em limited expected loss} (LEL), these cons…

2007-06-04abs ↗pdf ↗

Paper uses deep learning to price and hedge options in incomplete markets.

problem Incomplete markets lack unique no-arbitrage solutions for pricing and hedging European options.
method Constrained deep learning approach with a single neural network representing option prices and hedging strategies.
result Constrained networks produce superior P&L distributions compared to unconstrained networks.

We offer mathematical tractability and new insights for a framework of exponential utility with non-negative consumption, a constraint often omitted in the literature giving rise to economically unviable solutions. Specifically, using the Kuhn-Tucker theorem and the notion of aggregate state price density (Malamud and …

2011-06-15abs ↗pdf ↗

Optimizes portfolios with constraints and stochastic factors, deriving explicit solutions.

problem Optimizing expected utility in an incomplete market with stochastic factors and convex constraints.
method Fundamental duality results and HJB PDE, derived condition for exponential affine solutions.
result Explicit expressions for optimal allocations and Riccati ODE solutions in specific markets.

Embedding models, which learn latent representations of users and items based on user-item interaction patterns, are a key component of recommendation systems. In many applications, contextual constraints need to be applied to refine recommendations, e.g. when a user specifies a price range or product category filter. …

2019-06-21abs ↗pdf ↗

This paper solves a utility maximization problem under utility-based shortfall risk constraint, by proposing an approach using Lagrange multiplier and convex duality. Under mild conditions on the asymptotic elasticity of the utility function and the loss function, we find an optimal wealth process for the constrained p…

2015-01-29abs ↗pdf ↗

We maximize the expected utility of terminal wealth in an incomplete market where there are cone constraints on the investor's portfolio process and the utility function is not assumed to be strictly concave or differentiable. We establish the existence of the optimal solutions to the primal and dual problems and their…

2010-10-19abs ↗pdf ↗

PAIR-CI calibrates CI tests for causal discovery with incomplete data.

problem Miscalibration of CI tests when imputing incomplete data.
method Integrates multiple imputation directly into the inferential procedure via a paired permutation design.
result PAIR-CI reduces false positive rates to below 5% in simulations.

Algorithm identifies intended fairness constraints from expert demonstrations for fair clustering.

problem Fair clustering challenges due to incomplete fairness constraints.
method Algorithm identifies fairness metric from expert demonstrations and generates clusters.
result Algorithm identifies and generates fair clusters from limited expert demonstrations.

Study optimal portfolio management with periodic evaluations in stochastic models, considering convex constraints.

problem Optimal portfolio management under ratio-type periodic evaluations in stochastic factor models with convex trading constraints.
method Transformed infinite horizon optimal control problem into an auxiliary terminal wealth optimization problem. Introduced an auxiliary unconstrained optimization problem in a modified market model. Used martingale duality approach to establish dual minimizer and optimal unconstrained wealth process.
result Derived and verified the optimal constrained portfolio process for the original problem over an infinite horizon.

New method clusters strong and weak views effectively, improving performance by up to 40%.

problem Clustering incomplete multi-view data with unbalanced incompleteness.
method View evolution scheme and weighted multi-view subspace clustering.
result Improves clustering performance by up to 40% on three metrics.

In human perception and cognition, a fundamental operation that brains perform is interpretation: constructing coherent neural states from noisy, incomplete, and intrinsically ambiguous evidence. The problem of interpretation is well matched to an early and often overlooked architecture, the attractor network---a recur…

2019-06-08abs ↗pdf ↗

Solves VaR-constrained portfolio optimization in markets with stochastic volatility.

problem Optimizing portfolio in markets with stochastic volatility under VaR constraints.
method Dynamic programming approach to Heston's stochastic volatility model.
result Optimal investment strategy linked to unconstrained problem via a vega-neutral derivative.

We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single satisfying assignment. Our first CSP solver, called Perturbed Blief …

2014-01-26abs ↗pdf ↗

Develops GNNs for incomplete graphs, improving learning from missing node attributes.

problem Learning from incomplete graphs with missing node attributes.
method Introduces PaGNNs with novel partial aggregation functions for incomplete graph data.
result Demonstrates effectiveness and efficiency of PaGNNs on various datasets.

Study optimal liquidation with incomplete trend information and multiplicative price impact.

problem Optimal liquidation of assets with incomplete trend information and multiplicative price impact.
method Singular stochastic control problem with finite-fuel constraint and partial observation. Equivalent three-dimensional degenerate problem under full information. Two-dimensional optimal stopping problem with belief-dependent free boundary.
result Optimal execution rule and value function expressed in terms of a nonlinear integral equation, solved through Monte-Carlo method.