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

Trend · papers per month

4591136181 · Jun 202019922001200920182026
48 results for proportion constraints

Estimates labels from bagged data with label proportion constraints.

problem Estimating individual labels from aggregated data with label proportion constraints.
method Relaxed proportion constraints, bag differences constraints, intuitive formulation and algorithm.
result Achieves high accuracy in various domains (income level, sentiment analysis, geographical differences in dialect).

This paper optimizes insurance reinsurance design under solvency constraints.

problem Optimizing risk transfer from an insurance company to a reinsurer under solvency constraints.
method Martingale method to derive optimal reinsurance design maximizing terminal value of surplus.
result Optimal reinsurance designs include a combination of proportional and stop-loss protection.

A framework estimates categorical distributions under constraints, ensuring generality and uniqueness.

problem Estimating categorical distributions summarizing sample data under marginal constraints.
method Theoretical framework + Iterative Proportional Fitting (IPF) to estimate the distribution.
result A unique categorical distribution of Maximum Entropy under marginal constraints exists and is estimated.

Duality for robust hedging with proportional transaction costs of path dependent European options is obtained in a discrete time financial market with one risky asset. Investor's portfolio consists of a dynamically traded stock and a static position in vanilla options which can be exercised at maturity. Both the stock …

2013-02-04abs ↗pdf ↗

The method integrates survival constraints into NMF for identifying survival-associated gene clusters.

problem Understanding and interpreting high-dimensional biological data for disease markers.
method Cox proportional hazards regression integrated with NMF via proportional hazards non-negative matrix factorization.
result The method can uncover survival-associated gene clusters in cancer gene expression data.

Study examines how insurance affects households prone to proportional losses, especially those near poverty.

problem Impact of insurance on households susceptible to proportional losses, focusing on poverty traps.
method Modelled proportional capital losses with insurance, derived closed formulae and non-local differential equations.
result New formulae and methods to calculate trapping probability, constraints on parameters to prevent certainty of trapping.

In this paper, we work in the framework of the Merton problem but we impose a drawdown constraint on the consumption process. This means that consumption can never fall below a fixed proportion of the running maximum of past consumption. In terms of economic motivation, this constraint represents a type of habit format…

2012-10-18abs ↗pdf ↗

Zipf's law states that the number of firms with size greater than S is inversely proportional to S. Most explanations start with Gibrat's rule of proportional growth but require additional constraints. We show that Gibrat's rule, at all firm levels, yields Zipf's law under a balance condition between the effective grow…

2010-12-01abs ↗pdf ↗

We consider the problem of option hedging in a market with proportional transaction costs. Since super-replication is very costly in such markets, we replace perfect hedging with an expected loss constraint. Asymptotic analysis for small transactions is used to obtain a tractable model. A general expansion theory is de…

2013-09-19abs ↗pdf ↗

A new neural network model for ordinal regression.

problem Ordinal regression with non-proportional odds.
method Interpretable neural network for both continuous and discrete responses, training a non-linear neural network as a coefficient function.
result N3^3POM preserves interpretability while offering flexibility.

Paper solves complex investment-consumption problem with numerical methods.

problem Optimal investment and consumption strategies with proportional transaction costs.
method Monte Carlo simulation and finite difference method for approximating gradients.
result Numerical results validate optimal trading strategies and properties.

Enhanced indexation with sector constraints using SSD for better portfolio performance.

problem Constructing a portfolio that outperforms a market index while respecting sector investment proportions.
method Subset second-order stochastic dominance (subset SSD) applied to asset subset constraints.
result Subset SSD approach outperforms S&P500 and standard SSD approaches.

Analyzes robust martingale selection problem and its relation to no-arbitrage theory.

problem Martingale selection problem in a robust setting.
method Derives conditions for solvability and connects to no-arbitrage theory.
result Obtains versions of the Fundamental Theorem of Asset Pricing in various market conditions.

We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic topic models, STC relaxes the normalization constraint of admixture proportions and the constraint of defining a normalized likelihood functio…

2012-02-14abs ↗pdf ↗

This paper optimizes dividend payout rates with a drawdown constraint in a stochastic model.

problem Optimizing dividend payout rates while avoiding drawdowns in a stochastic model.
method Solving a path-dependent stochastic control problem using Hamilton-Jacobi-Bellman equations and PDE methods.
result Explicit characterization of an optimal feedback control strategy, including two free boundaries and the running maximum surplus process.

Study shows how capital constraints can lead to systemic crises in financial systems.

problem Impact of regulatory capital constraints on fire sales and financial stability.
method Mean field game model with banks adjusting holdings via trading strategies under regulatory constraints.
result Capital constraints can lead to simultaneous defaults in a substantial proportion of the banking system.

Study callable convertible bonds with liquidity constraints, generalizing previous work.

problem Callable convertible bond problem with liquidity constraints.
method Introduced a new technique to handle non-ordered payoff situations.
result Complete solution to callable convertible bond problem with liquidity constraint.

New insights into using IPF for inferring dynamic networks from marginals.

problem Inferring dynamic networks from time-aggregated adjacency matrices and time-varying marginals.
method Identifying a generative network model and establishing its maximum likelihood estimates via IPF, with convergence guarantees for sparse data.
result IPF provides principled estimation of dynamic networks from marginals under certain conditions, with structure-dependent error bounds and guaranteed convergence for sparse data.

The paper introduces a new divergence for portfolio management to outperform a benchmark.

problem Maximizing expected utility of outperformance over a benchmark with constraints.
method Uses αα-Bregman-Wasserstein divergence to penalize underperformance more than overperformance.
result Proves existence and uniqueness of optimal portfolio strategy and conditions for constraints binding.

Optimal dividend strategy with constraints on drawdown and ratcheting rates.

problem Maximizing discounted utility of dividends until bankruptcy with drawdown and ratcheting constraints.
method Formulated as a stochastic control problem, solved via Hamilton-Jacobi-Bellman variational inequality.
result Optimal dividend rate ctc^*_t depends on current surplus and historical maximum of dividend rate, with specific rules for different surplus levels.

The paper tackles imbalanced classification under operational constraints, proposing a framework to maximize sensitivity.

problem Detecting minority class observations under severe class imbalance and operational constraints.
method Formal classification framework under capacity constraints, maximizing sensitivity while respecting a user-defined label limit.
result The optimal classifier under capacity constraints is equivalent to the Bayes classifier with reweighted prior probabilities.

Algorithm learns optimal pricing for diverse consumers with limited stock.

problem Maximizing revenue from personalized pricing with limited inventory.
method Primal-dual learning algorithm that learns dual optimal solution.
result Near-optimal performance with independent regret rate of dimensionality.

EGMU optimizes portfolios using KL divergence, ensuring positive solutions.

problem Constructing multi-factor target-exposure portfolios efficiently and accurately.
method Convex optimization framework minimizing KL divergence, with explicit solvers.
result Established feasibility and uniqueness of strictly positive solutions under convex-hull conditions.

Develops a framework for optimal investment in assets with different liquidity constraints.

problem Optimal investment-consumption problem for a utility-maximizing investor with lower-bound constraints.
method Generalized martingale approach and decomposition of the problem into subproblems.
result Explicit formulas for optimal strategies derived for power-utility functions.

Flexics samples patterns with guarantees, addressing flexibility and accuracy issues.

problem Pattern explosion and limited sampling accuracy with existing methods.
method Leverages SAT sampling and pattern mining algorithms to support flexible quality measures and constraints.
result Flexics provides strong guarantees on sampling accuracy while being flexible and efficient.

For utility maximization problems under proportional transaction costs, it has been observed that the original market with transaction costs can sometimes be replaced by a frictionless "shadow market" that yields the same optimal strategy and utility. However, the question of whether or not this indeed holds in general…

2011-11-28abs ↗pdf ↗

Study shows how varying levels of supervision and orthonormality constraints affect generalization errors in subspace fitting.

problem Effects of varying levels of supervision and orthonormality constraints on generalization errors in subspace fitting.
method Flexible family of problems connecting unsupervised and supervised subspace fitting tasks, explored over a supervision-orthonormality plane.
result Generalization errors of subspace fitting problems follow double descent trends as they become more supervised and less orthonormally constrained.

The paper calculates bounds for risk metrics and entropies under partial information constraints.

problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.

The paper tackles fair and diverse data summarization using DPPs.

problem Tackles bias in data summarization methods.
method Uses determinantal measures of diversity and corresponding distributions (DPPs) to incorporate fairness constraints.
result Developed a fast sampler for constrained determinantal distributions that is provably good under certain conditions.

A new algorithm for decentralized learning in heterogeneous networks reduces sub-optimality over time.

problem Learning in decentralized heterogeneous networks with local data streams and nonlinear constraints.
method Functional variant of stochastic primal-dual method with greedy subspace projection.
result The HALK algorithm achieves O(T)\mathcal{O}(\sqrt{T}) sub-optimality reduction and constraint satisfaction.

Study best arm identification in restless bandits with unknown TPMs.

problem Identify the best arm with fixed confidence in restless bandits with unknown TPMs.
method Proposed a policy for best arm identification and proved its expected stopping time matches the lower bound.
result The state-action visitation proportions match the optimal proportions under any asymptotically optimal policy.