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

78157235313 · Jun 202019922001200920172026
48 results for leverage constraints

Study optimal consumption and investment strategies with leverage constraints using Epstein-Zin utility.

problem Optimal portfolio choice under leverage constraints and Epstein-Zin utility.
method Established viscosity solution to HJB equation, demonstrated smoothness, characterized optimal strategies, derived explicit solutions.
result Explicit solutions for optimal consumption and investment strategies under leverage constraints.

Study proposes a neural network approach for high inflation investment portfolios with leverage constraints.

problem Optimizing investment portfolios with high inflation and bounded leverage constraints.
method Formulated an optimal control problem, established a closed-form solution, and developed a novel LFNN approach.
result The LFNN strategy outperforms a passive benchmark by about 200 bps with a high probability of success.

In this work we consider adversarial contextual bandits with risk constraints. At each round, nature prepares a context, a cost for each arm, and additionally a risk for each arm. The learner leverages the context to pull an arm and then receives the corresponding cost and risk associated with the pulled arm. In additi…

2016-10-17abs ↗pdf ↗

We present a simple agent-based model of a financial system composed of leveraged investors such as banks that invest in stocks and manage their risk using a Value-at-Risk constraint, based on historical observations of asset prices. The Value-at-Risk constraint implies that when perceived risk is low, leverage is high…

2014-07-20abs ↗pdf ↗

Unified approach adjusts classifiers to meet system-level constraints.

problem Multi-class classification under system-level constraints.
method Post-processing approach using linearly constrained stochastic program and entropic regularization.
result Finite-sample guarantees for risk and constraint satisfaction.

Optimizes bank capital structure under Basel III constraints, simplifying complex dynamics.

problem Optimizing risky investments, dividends, and capital structure under Basel III constraints.
method Formulated as a stochastic control problem, reducing dynamics to a one-dimensional process in leverage ratio.
result Simple policy: pay dividends at an upper barrier and recapitalize at the distress boundary.

The paper analyzes CMDPs, balancing exploration and exploitation to avoid constraint violations.

problem Balancing exploration and exploitation in CMDPs to satisfy constraints.
method Two approaches: optimistic planning and incremental updates of primal and dual variables.
result Both approaches achieve sublinear regret on utility and constraint violations, with stronger guarantees for the linear programming approach.

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.

Bayesian algorithms improve crowdsourcing with label and instance constraints.

problem Efficiently labeling large datasets with additional human annotator information.
method Developed Bayesian algorithms for semi-supervised crowdsourced classification under label and instance constraints.
result Improved performance compared to unsupervised crowdsourcing on various datasets.

VRSGT algorithm reduces orthogonality constraints in decentralized optimization.

problem Decentralized optimization with orthogonality constraints.
method VRSGT algorithm with variance reduction and orthogonal techniques.
result VRSGT achieves convergence rate of O(1 / k) for orthogonality constraints.

Paper proposes a new algorithm for graph learning with covariance constraints.

problem Graphical models and factor analysis not jointly leveraged in graph learning processes.
method Penalized maximum likelihood estimation of an elliptical distribution with Riemannian optimization.
result Effectiveness of the proposed approach demonstrated on real-world data sets.

This work proposes an online learning approach to tighten constraints in stochastic control problems.

problem Solving chance-constrained stochastic optimal control problems is computationally challenging.
method Reformulate chance constraints as a binary regression problem and use a GP model to learn constraint-tightening parameters online.
result The approach tightens constraints more effectively, leading to lower costs in numerical experiments.

This work restricts hidden cardinality in causal models to infer causal relations.

problem Causal relations between variables with a common unobserved cause cannot be directly inferred.
method Derive inequality constraints from d-separation in causal models with known cardinalities of unobserved variables.
result Inference of causal relations is possible with additional assumptions about cardinalities.

CANs improve GANs by enforcing structured constraints during training.

problem Generating valid structured objects like molecules and game maps from examples alone.
method Constrained Adversarial Networks (CANs) embed constraints into the model during training, penalizing invalid structures.
result CANs efficiently generate high-quality and novel valid structures.

Peters (2011a) defined an optimal leverage which maximizes the time-average growth rate of an investment held at constant leverage. It was hypothesized that this optimal leverage is attracted to 1, such that, e.g., leveraging an investment in the market portfolio cannot yield long-term outperformance. This places a str…

2011-01-24abs ↗pdf ↗

New methods for efficient exploration under unknown linear constraints in bandits.

problem Optimizing decisions under unknown linear constraints in bandit problems.
method Lagrangian relaxation, computationally efficient extensions of existing methods, constraint-adaptive stopping rule.
result LAGEX achieves asymptotically optimal sample complexity, LATS shows asymptotic optimality up to novel constants.

This paper presents a distributionally robust Q-Learning algorithm (DrQ) which leverages Wasserstein ambiguity sets to provide idealistic probabilistic out-of-sample safety guarantees during online learning. First, we follow past work by separating the constraint functions from the principal objective to create a hiera…

2020-02-07abs ↗pdf ↗

Study integrates reliability constraints into generation planning models.

problem Challenges in integrating reliability constraints with generation planning models.
method Leverages a weighted oblique decision tree (WODT) technique to embed reliability verification constraints.
result Demonstrates effectiveness in achieving reliable and optimal planning solutions.

New method optimizes processes under constraints using bivariate Gaussian models.

problem Optimizing processes with constraints using traditional methods.
method Developed a constrained expected improvement acquisition function using bivariate Gaussian process models.
result Demonstrated improved performance in a manufacturing cure process optimization.

A new algorithm for identifying the best arm in linear feedback with safety constraints.

problem Identifying the best arm in linear feedback with safety constraints.
method A gap-based algorithm that ensures safety while minimizing sample complexity.
result The algorithm achieves meaningful sample complexity while ensuring safety.

We study the constrained linear quadratic regulator with unknown dynamics, addressing the tension between safety and exploration in data-driven control techniques. We present a framework which allows for system identification through persistent excitation, while maintaining safety by guaranteeing the satisfaction of st…

2018-09-26abs ↗pdf ↗

New DAG constraints improve differentiable DAG learning.

problem Recovering DAG structures from observational data is hard due to combinatorial optimization.
method Developed analytic functions to formulate DAG constraints, closed under differentiation, summation, and multiplication.
result Analytic DAG constraints outperform previous methods in various settings.

Solves optimal stopping problem with Poisson constraints using jumps.

problem Optimal stopping with Poisson constraints and jumps.
method Penalized backward stochastic differential equation (PBSDE) with jumps, decomposition method based on Jacod-Pham, comparison theorem of BSDEs with jumps.
result Solves American option pricing in nonlinear markets with Poisson constraints.

Paper studies optimal investing for retirees with risk constraints.

problem Retirees' longevity and living standard risks in a fluctuating market.
method Formulated as a portfolio choice problem under time-varying risk capacity constraint. Derived optimal investment strategy using differential equations. Demonstrated endogenous spending measure and active investment strategy.
result Time-varying risk capacity constraint impacts asset allocation in retirement.

Recent work in learning ontologies (hierarchical and partially-ordered structures) has leveraged the intrinsic geometry of spaces of learned representations to make predictions that automatically obey complex structural constraints. We explore two extensions of one such model, the order-embedding model for hierarchical…

2017-08-01abs ↗pdf ↗

We propose a method to model multi-agent behaviors with limited observation and mechanical constraints.

problem Modeling real-world multi-agent behaviors with limited observation and mechanical constraints.
method Decentralized generative models with partial observation and mechanical constraints based on hierarchical variational recurrent neural networks.
result Our method effectively models and predicts biologically plausible behaviors with minimal constraint violations.

Proposes SPCA to incorporate structural constraints in model identification.

problem Model identification with partial structural knowledge.
method Structural Principal Component Analysis (SPCA) that leverages structural information.
result Demonstrates improved model estimates using synthetic and industrial data.

Graph learning improves FXRP and FXSA with significant statistical arbitrage gains.

problem Improving FXRP and FXSA with complex multi-currency and interest rate relationships.
method Two-step graph learning approach: first, edge-level regression on spatiotemporal graph; second, stochastic optimization with constraints and risk-adjusted return maximization.
result Graph-learning method achieves higher information and Sortino ratios than benchmarks.

VRPG algorithm optimizes convex constraints with non-asymptotic guarantees.

problem Stochastic convex optimization under convex constraints.
method Natural variance reduced proximal gradient (VRPG) algorithm.
result VRPG achieves local minimax lower bound up to constants and log factor of NN.

Bayesian optimization improves with transfer learning for aircraft design.

problem Cold start problem in Bayesian optimization for aircraft design.
method Ensemble of surrogate models using transfer learning in a constrained Bayesian optimization framework.
result Significant improvement in convergence and prediction accuracy.

New framework improves reliability of learned representations by modeling uncertainty and structural constraints.

problem Uncertainty in learned representations treated as deterministic, leading to unreliable models.
method Proposes a principled framework for reliable representation learning with uncertainty-aware regularization and structural constraints.
result Improves stability, calibration, and robustness of learned representations.

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 ↗

C-HMCNN(h) improves HMC classification by leveraging class hierarchy.

problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.

Develops a new solver for optimizing with stochastic dominance constraints.

problem Optimizing with stochastic dominance constraints is computationally expensive and impractical.
method Introduces Light Stochastic Dominance Solver (light-SD) that uses Lagrangian properties and surrogate approximation.
result The light-SD solver demonstrates superior performance on various problems.

Enhances flexibility in data reweighting with optimal transport and maximum entropy principles.

problem Adapting empirical distributions to predefined constraints on moments, tail behavior, etc.
method Nonparametric distributional constraints, maximum entropy principle, optimal transport.
result Maximum entropy weight adjusted empirical distribution close to a specified distribution in optimal transport metric.