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

4.2%8.3%12.5%16.7% · Apr 199519922001200920172026
48 results for deviation constraint

New inequality criterion for a mean field equation on spheres.

problem Finding uniqueness in a mean field equation on spheres.
method Established a new Moser-Trudinger-Onofri inequality with a constraint on moments deviation.
result A threshold for deviation is a uniqueness criterion for the mean field equation.

MPC framework reduces execution costs and schedule deviations in trading.

problem Executing large orders in markets under time and liquidity constraints.
method Model Predictive Control (MPC) framework balancing order completion, market impact, and opportunity cost.
result Significant reductions in slippage and schedule shortfall compared to benchmarks.

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.

Stress shocks are often calculated as multiples of the standard deviation of a history set. This paper investigates how many standard deviations are required to guarantee that this shock exceeds any observation within the history set, given the additional constraint of kurtosis. The results of this analysis are then us…

2019-05-24abs ↗pdf ↗

Generative models often misrepresent class frequencies; this paper calibrates them.

problem Miscalibration of class frequencies in generative models.
method Formulated as constrained optimization, using surrogate objectives to approximate constraints.
result Significant reduction in calibration error across various models and applications.

Study a continuous portfolio optimization with a new CVaR-like constraint using martingale approach.

problem Optimizing a portfolio under a new CVaR-like constraint that is not compatible with traditional methods.
method Follows a martingale approach in a complete market setting, solving a convex constrained minimization problem.
result Obtains a tractable and interpretable characterization of the optimal strategy.

Neural networks are increasingly used in complex (data-driven) simulations as surrogates or for accelerating the computation of classical surrogates. In many applications physical constraints, such as mass or energy conservation, must be satisfied to obtain reliable results. However, standard machine learning algorithm…

2019-04-29abs ↗pdf ↗

Optimizes multi-period portfolios with tail-risk constraints using neural networks.

problem Maximizing expected return while managing tail-risk constraints over multiple periods.
method Recurrent neural network approach to approximate optimal policy.
result Validated in financial and insurance models, capturing long-term risk dynamics.

The average portfolio structure of institutional investors is shown to have properties which account for transaction costs in an optimal way. This implies that financial institutions unknowingly display collective rationality, or Wisdom of the Crowd. Individual deviations from the rational benchmark are ample, which il…

2017-03-06abs ↗pdf ↗

Unified framework for unlearning in diffusion models using KL divergence and likelihood constraints.

problem Removing undesirable data or concepts while preserving utility of pretrained models.
method Constrained optimization framework based on reverse and forward KL divergences, and likelihood constraints.
result Our KL-constrained approach achieves superior retention-unlearning tradeoffs compared to weight-based baselines.

The paper analyzes a private likelihood-ratio test for frequency tables under differential privacy constraints.

problem Achieving privacy in statistical data analysis while maintaining statistical utility.
method A rigorous analysis of a private likelihood-ratio (LR) test for goodness-of-fit in frequency tables, considering (ε,δ)(\varepsilon,δ)-differential privacy.
result Characterization of the trade-off between differential privacy parameters (ε,δ)(\varepsilon,δ) and statistical power of the private LR test.

This paper achieves optimal regret bounds for locally private linear contextual bandit.

problem Designing locally private linear contextual bandit algorithms with optimal regret bounds.
method New algorithmic and analytical ideas, including mean absolute deviation analysis and layered principal component regression.
result Achieves an ildeO(T) ilde O(\sqrt{T}) regret upper bound for locally private linear contextual bandit.

Suppose kk centers are fit to mm points by heuristically minimizing the kk-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with p4p\geq 4 bounded moments; in particular, the difference between the sample cost and distribution cost decays with $…

2013-11-08abs ↗pdf ↗

Since their invention, generative adversarial networks (GANs) have become a popular approach for learning to model a distribution of real (unlabeled) data. Convergence problems during training are overcome by Wasserstein GANs which minimize the distance between the model and the empirical distribution in terms of a dif…

2017-09-26abs ↗pdf ↗

This paper provides a non-robust interpretation of the distributionally robust optimization (DRO) problem by relating the distributional uncertainties to the chance probabilities. Our analysis allows a decision-maker to interpret the size of the ambiguity set, which is often lack of business meaning, through the chance…

2019-06-03abs ↗pdf ↗

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 ↗

Social Security and other public policies can be viewed as a series of cash in and outflows that depend on parameters such as the age distribution of the population and the retirement age. Given forecasts of these parameters, policies can be designed to be financially stable, i.e., to terminate with a zero balance. If …

2012-01-30abs ↗pdf ↗

Paper tackles offline CMDP problems with near-optimal algorithm and sample complexity bound.

problem Offline CMDP problems with only offline data available.
method DPDL algorithm using single-policy concentrability coefficient CC^* and deviation control mechanism.
result DPDL algorithm matches sample complexity lower bound with ildeO((1γ)1) ilde{\mathcal{O}}((1-γ)^{-1}) factor.

New method reduces total cost constraints in CBwK to sqrt(T) with fairness application.

problem Maximize rewards while adhering to total cost constraints in CBwK.
method Dual strategy based on projected-gradient-descent updates.
result Total cost constraints reduced to sqrt(T) with poly-logarithmic terms.

Framework generates precise synthetic populations for scalable modeling.

problem Generating accurate synthetic populations without personal data.
method Constraint-programming framework encoding aggregated statistics and structural relations.
result Exact control of demographic profiles without requiring microdata.

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.

A simplified model for fixed income portfolio optimisation.

problem Modeling interest rates and credit risk in fixed income portfolios.
method Proposes a two-factor model for the time evolution of the efficient frontier.
result The efficient frontier is mainly controlled by linear constraints, with standard deviation less important.

Study improves portfolio risk estimation methods using robust covariance and CVaR constraints.

problem Improving portfolio risk estimation in the presence of financial data noise and extreme market conditions.
method Exploration of robust covariance estimators, application of CVaR constraints, use of K-means clustering in optimization.
result Robust covariance estimators can outperform market-weighted benchmarks, especially during bull markets.

We consider adaptive system identification problems with convex constraints and propose a family of regularized Least-Mean-Square (LMS) algorithms. We show that with a properly selected regularization parameter the regularized LMS provably dominates its conventional counterpart in terms of mean square deviations. We es…

2010-12-22abs ↗pdf ↗

New framework guides resource usage to achieve sublinear regret in adversarial settings.

problem Achieving sublinear regret in online decision making with changing reward and cost distributions.
method General primal-dual methods guided by spending plans that ensure balanced resource usage.
result Achieves sublinear regret with respect to spending plans that balance resource usage.

Study large deviations for hypoelliptic diffusion on sub-Riemannian manifolds.

problem Large deviations for hypoelliptic diffusion measures on sub-Riemannian manifolds.
method Rough path theory and manifold-valued Malliavin calculus.
result Proved a large deviation principle for pinned hypoelliptic diffusion measures.

Extends probabilistic approach for Kahler-Einstein metrics on Fano manifolds.

problem Constructing Kahler-Einstein metrics on log Fano manifolds with non-discrete automorphism groups.
method Introduces Gibbs polystability and uses moment map constraint to break symmetry.
result Gibbs polystability conjectured to be equivalent to existence of Kahler-Einstein metric.

We provide a unifying treatment of pathwise moderate deviations for models commonly used in financial applications, and for related integrated functionals. Suitable scaling allows us to transfer these results into small-time, large-time and tail asymptotics for diffusions, as well as for option prices and realised vari…

2018-03-12abs ↗pdf ↗

Importance sampling has become an important tool for the computation of tail-based risk measures. Since such quantities are often determined mainly by rare events standard Monte Carlo can be inefficient and importance sampling provides a way to speed up computations. This paper considers moderate deviations for the wei…

2013-06-27abs ↗pdf ↗

New model tackles real-world distribution mismatches in machine learning.

problem Real-world applications often have training and test distributions that differ.
method Developed a learning model based on information theory using importance sampling.
result The model performs better under large distribution deviations.