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

18355370 · Jun 202019922001200920172026
48 results for Dual Attainment

We prove dual attainment for multi-asset financial derivatives pricing.

problem Model-independent pricing and hedging of complex financial derivatives.
method Established duality and attained optimizers for multimarginal, multi-asset martingale optimal transport.
result Existence of dual optimizers under mild conditions for arbitrary numbers of assets and time periods.

The Lebesgue property (order-continuity) of a monotone convex function on a solid vector space of measurable functions is characterized in terms of (1) the weak inf-compactness of the conjugate function on the order-continuous dual space, (2) the attainment of the supremum in the dual representation by order-continuous…

2013-05-10abs ↗pdf ↗

Unified Kantorovich duality for multimarginal optimal transport on Polish spaces.

problem Optimal transport of multiple probability distributions.
method Unified Kantorovich duality theory for multimarginal optimal transport on general Polish product spaces.
result Unified duality theory for multimarginal optimal transport, extending classical two-marginal conjugacy.

The paper explores traveling along broken geodesics in Finsler submersions.

problem Analyzing the attainable sets of analytic vector fields in Finsler submersions.
method Investigates the dual leaves and attainable sets of horizontal broken geodesics.
result Proves that in compact Finsler manifolds with positive flag curvature, the attainable sets coincide with orbits.

Study investigates duality and dual optimizers for various transport problems.

problem Existence and characterization of dual optimizers for adapted transport problems.
method Minimal assumptions, including causal and bicausal settings, are considered.
result No-arbitrage assumption leads to multicausal couplings and equivalent robust superhedging price computation.

We explore the robust replication of forward-start straddles given quoted (Call and Put options) market data. One approach to this problem classically follows semi-infinite linear programming arguments, and we propose a discretisation scheme to reduce its dimensionality and hence its complexity. Alternatively, one can …

2016-03-21abs ↗pdf ↗

Random extrapolation speeds up coordinate descent for sparse and dense data.

problem Efficiently solving primal-dual coordinate descent for sparse and dense data.
method Adapts to sparsity and uses large step sizes for dense data, proving linear convergence under metric subregularity.
result Linear convergence under metric subregularity and optimal sublinear convergence rates in general convex-concave problems.

We consider a discrete-time, generically incomplete market model and a behavioural investor with power-like utility and distortion functions. The existence of optimal strategies in this setting has been shown in a previous paper under certain conditions on the parameters of these power functions. In the present paper w…

2014-05-15abs ↗pdf ↗

Algorithm optimizes constrained reinforcement learning with dual variables.

problem Minimizing convex functional subject to convex constraint in large state spaces.
method VPDPO algorithm using Lagrangian and Fenchel duality.
result Achieves sublinear regret and constraint violation, globally optimal policy.

We generalize the Riesz potential of a compact domain in Rm\mathbb{R}^{m} by introducing a renormalization of the rαmr^{α-m}-potential for α0α\le0. This can be considered as generalization of the dual mixed volumes of convex bodies as introduced by Lutwak. We then study the points where the extreme values of the (renorm…

2010-08-16abs ↗pdf ↗

Local mappings relate dual and primal factor graphs for efficient marginal probability estimation.

problem Efficient estimation of marginal probabilities in statistical physics models.
method Local mappings based on Fourier transform of local factors, applied to Ising, Potts, and clock models.
result Local extrema of fixed points are at phase transition points, and the mapping facilitates efficient estimation.

Maximum Likelihood Estimators (MLE) has many good properties. For example, the asymptotic variance of MLE solution attains equality of the asymptotic Cram{é}r-Rao lower bound (efficiency bound), which is the minimum possible variance for an unbiased estimator. However, obtaining such MLE solution requires calculating t…

2018-05-18abs ↗pdf ↗

Unified algorithm for efficient pure exploration using dual variables.

problem Efficiently achieving a specific goal through adaptive experimentation.
method Introducing dual variables to derive optimal allocation conditions, leading to Information-Directed Selection.
result Top-two Thompson sampling attains asymptotic optimality for Gaussian best-arm identification.

In this paper, we study the problem of expected utility maximization of an agent who, in addition to an initial capital, receives random endowments at maturity. Contrary to previous studies, we treat as the variables of the optimization problem not only the initial capital but also the number of units of the random end…

2004-05-14abs ↗pdf ↗

A new approach to risk-sensitive reinforcement learning tackles computational challenges.

problem Computational challenges in estimating risk-sensitive policies for MDPs with finite state and action spaces.
method Proposes a new risk measure called 'caution' and uses a stochastic primal-dual method with KL divergence.
result Demonstrates improved reliability in reward accumulation without additional computational costs.

New method for tensor completion using nonconvex dual total variation.

problem Tensor completion from partial measurements with exponential-family noise.
method Proposed dual-TV (DTV) regularizers for tensor completion under exponential-family noise.
result Theoretical upper bounds on recovery error for tensor completion.

TiAda adapts adaptive gradient methods for nonconvex minimax optimization.

problem Nonconvex minimax optimization challenges in achieving convergence.
method TiAda is a time-scale adaptive GDA algorithm for nonconvex minimax optimization.
result TiAda achieves near-optimal complexities in deterministic and stochastic settings.

Paper develops efficient estimator for Hawkes processes using representer theorem.

problem Estimating latent triggering kernels for Hawkes processes from event sequences.
method Penalized least squares minimization in RKHS framework.
result Efficient estimator with competitive accuracy and improved computational efficiency.

Every element in the first cohomology group of a 3--manifold is dual to embedded surfaces. The Thurston norm measures the minimal `complexity' of such surfaces. For instance the Thurston norm of a knot complement determines the genus of the knot in the 3--sphere. We show that the degrees of twisted Alexander polynomial…

2005-05-26abs ↗pdf ↗

Develops an online method for solving constrained optimization problems with debiasing techniques.

problem Online inference of solutions to constrained optimization problems with equality and inequality constraints.
method Stochastic Sequential Quadratic Programming (SSQP) with momentum debiasing.
result Achieves global almost-sure convergence and local asymptotic normality with optimal primal-dual limiting covariance.

The gain-loss ratio is known to enjoy very good properties from a normative point of view. As a confirmation, we show that the best market gain-loss ratio in the presence of a random endowment is an acceptability index and we provide its dual representation for general probability spaces. However, the gain-loss ratio w…

2012-09-28abs ↗pdf ↗

Algorithm learns a single neuron robustly to shifts and adversarial noise.

problem Learning a single neuron robustly to distributional shifts and adversarial label noise.
method Designs a computationally efficient algorithm using primal-dual framework.
result Recover a vector satisfying a risk bound under adversarial conditions.

We consider a utility-maximization problem in a general semimartingale financial model, subject to constraints on the number of shares held in each risky asset. These constraints are modeled by predictable convex-set-valued processes whose values do not necessarily contain the origin; that is, it may be inadmissible fo…

2011-02-02abs ↗pdf ↗

Two flat sub-Lorentzian problems on Martinet distribution differ in attainable set intersections.

problem Flat sub-Lorentzian structures on Martinet distribution.
method Analysis of attainable sets, optimal trajectories, sub-Lorentzian distances and spheres.
result The attainable set for the first problem intersects with the Martinet plane, while for the second it does not.

Unified market making controls risk, arbitrage, and volatility surfaces.

problem Market making risk, arbitrage, and volatility surface consistency.
method Constrained RL and stochastic control for risk-sensitive execution and hedging.
result Agent achieves positive P&L with zero calendar and butterfly violations.

The paper explores fairness in machine learning, focusing on Equalized Odds.

problem Whether Equalized Odds fairness can always be achieved and if it leads to better prediction performance.
method Analyzes the attainability and optimality of Equalized Odds fairness in various settings.
result Equalized Odds can be achieved under certain conditions and can lead to better prediction performance.

This paper analyzes M-estimators under infinite-variance noise in high dimensions.

problem High-dimensional M-estimation with infinite-variance noise.
method Study of the Fenchel conjugate domain and its impact on risk.
result Exact risk of M-estimators under infinite-variance noise is derived.

The study examines conditions for achieving a simple lower bound in estimating mean from samples.

problem Achieving a simple lower bound for estimating the mean of a distribution.
method Analyzes conditions for nearly attaining Le Cam's two-point testing lower bound for mean estimation.
result An algorithm nearly attains the two-point testing rate for mixtures of symmetric, log-concave distributions with a common mean.

The paper explores transferability of adversarial examples between convex and 01 loss models, finding non-transferability due to different decision boundaries caused by outliers.

problem Transferability of adversarial examples between convex and 01 loss models.
method Empirical study of transferability between linear 01 loss and convex (hinge) loss models, and between neural networks with different activation functions.
result Adversarial examples are non-transferable between convex and 01 loss models due to different decision boundaries caused by outliers.

AOPU stabilizes NN training by approximating natural gradient, improving stability and convergence.

problem Stability and interpretability in online NN training for industrial soft sensors.
method AOPU truncates gradient backpropagation, optimizing trackable parameters, and approximating natural gradient.
result AOPU achieves stable convergence and superior performance on chemical process datasets.

New method for adaptive estimation and inference in econometric models without knowing smoothness.

problem Adaptive estimation and inference in ill-posed linear inverse problems with unknown smoothness.
method Discrepancy principle-based framework for adaptive hyperparameter selection.
result Achieves optimal rates in weak and strong metrics for linear functionals.

Dual spherical conchoidal motion has been defined by Yapar. In this work, we define this motion on a dual hyperbolic unit sphere in the dual Lorentzian space with dual signature, and the results carried to the Lorentzian lines space by means of the Study s mapping. We also obtain the study maps of the orbits drawn on t…

2013-11-10abs ↗pdf ↗

A pricing principle is introduced for non-attainable claims in incomplete markets.

problem Pricing non-attainable contingent claims in incomplete markets.
method Distorted Radon-Nikodym derivative and Tsallis relative entropy over a family of equivalent martingale measures.
result The pricing principle is closely related to backward stochastic differential equations and is arbitrage-free and time-consistent.

Study of curves in dual space with constant curvature and torsion.

problem Classifying curves in dual space with specific geometric properties.
method Defined curvature and torsion for curves in dual space, classified curves with constant properties, and proved existence theorems.
result Established fundamental theorem of existence for dual curves with prescribed curvature and torsion.