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

201403604805 · Jun 202019922001200920172026
48 results for concave cost function

The paper analyzes portfolio selection with non-concave utility and transaction costs.

problem Non-concave utility maximization with proportional transaction costs.
method Two-step procedure: asymptotic terminal behavior analysis and discontinuous viscosity solution.
result Optimal portfolio strategies can differ significantly from the frictionless case due to transaction costs.

The market impact (MI) of Volume Weighted Average Price (VWAP) orders is a convex function of a trading rate, but most empirical estimates of transaction cost are concave functions. How is this possible? We show that isochronic (constant trading time) MI is slightly convex, and isochoric (constant trading volume) MI is…

2013-12-11abs ↗pdf ↗

Investigates portfolio selection with transaction costs and stochastic volatility, using deep learning for computation.

problem Optimal portfolio selection with transaction costs and stochastic volatility.
method Two-factor stochastic volatility model, option-implied utility function, deep learning policy iteration.
result Deep learning method effectively computes optimal investment decisions under transaction costs and stochastic volatility.

Investigates how rebalancing frequency and transaction costs affect log-optimal portfolios.

problem Impact of rebalancing frequency and transaction costs on log-optimal portfolios.
method Proved equivalence to concave program, derived optimality conditions, tested using intraday and daily data.
result Transaction costs can cause bankruptcy for frequency-dependent log-optimal portfolios, approximating to quadratic concave program.

Enhances LMC for log-concave sampling, reducing computational cost.

problem High computational cost of LMC for high-dimensional problems.
method Random coordinate descent (RCD) combined with variance reduction techniques (SAGA, SVRG).
result Achieves computational cost reduction compared to classical LMC, same number of iterations as LMC.

Zigzag sampling algorithm efficiently samples from strongly log-concave distributions with low computational cost.

problem Sampling from strongly log-concave distributions efficiently and with low computational complexity.
method Zigzag sampling algorithm with warm start assumption, focusing on gradient evaluations.
result Achieves ε error in chi-square divergence with computational cost of O(κ²d^(1/2)(log(1/ε))^(3/2)) gradient evaluations.

Pushing a little forward an approach proposed by Villani, we are going to prove that in the Riemannian setting the condition 2f<g\nabla^2 f< g implies that ff is cc-concave with respect to the quadratic cost as soon as it has a sufficiently small C1C^1-norm. From this, we deduce a sufficient condition for the optimalit…

2018-02-18abs ↗pdf ↗

Paper proposes efficient cost functions for automated market makers in DeFi.

problem Inefficient and computationally complex cost functions in DeFi.
method Proposes and analyzes constant circle/ellipse based cost functions.
result Proposed cost functions are computationally efficient and robust against attacks.

We study the problem of super-replication for game options under proportional transaction costs. We consider a multidimensional continuous time model, in which the discounted stock price process satisfies the conditional full support property. We show that the super-replication price is the cheapest cost of a trivial s…

2011-03-06abs ↗pdf ↗

A new sampling method for log-concave distributions with warm starts and barriers.

problem Sampling from log-concave distributions constrained by convex bodies with barriers.
method Robust sampling framework using spectral approximations to Hessian of barrier functions.
result Improved mixing times for polytopes and spectrahedra, faster than previous methods.

Explicit robust hedging strategies for convex or concave payoffs under a continuous semimartingale model with uncertainty and small transaction costs are constructed. In an asymptotic sense, the upper and lower bounds of the cumulative volatility enable us to super-hedge convex and concave payoffs respectively. The ide…

2011-03-10abs ↗pdf ↗

We study the problem of the optimal execution of a large trade in the presence of nonlinear transient impact. We propose an approach based on homotopy analysis, whereby a well behaved initial strategy is continuously deformed to lower the expected execution cost. We find that the optimal solution is front loaded for co…

2014-12-16abs ↗pdf ↗

This work overcomes bias in concave multi-objective reinforcement learning.

problem Gradient bias in policy gradient methods for concave scalarized multi-objective reinforcement learning.
method Developed a Natural Policy Gradient (NPG) algorithm with a multi-level Monte Carlo (MLMC) estimator.
result Achieved optimal O~(ε2)\widetilde{\mathcal{O}}(ε^{-2}) sample complexity for computing an εε-optimal policy.

This paper optimizes Bayesian estimation for log-concave models using Langevin Monte-Carlo.

problem Optimizing Bayesian estimators for log-concave models with Langevin Monte-Carlo.
method Quantitative statistical bounds and numerical approximation of Gibbs measures.
result Established optimal numerical strategy and its cost for Bayesian posterior mean approximation.

A new sampling method reduces computational cost for high-dimensional log-concave distributions.

problem High computational cost of ULMC in high dimensions.
method Random Coordinate ULMC (RC-ULMC) selects a single coordinate per iteration.
result RC-ULMC is cheaper than classical ULMC, especially in highly skewed and high-dimensional problems.

The study proves non-existence of concave functions on specific metric spaces.

problem Proving the non-existence of concave functions on certain metric spaces.
method Analogue theorems for Alexandrov spaces and CαC^α-Hölder Riemannian manifolds.
result Proves non-existence of concave functions on complete manifolds with finite volume and specific metric spaces.

A new algorithm reduces online exp-concave optimization runtime.

problem Minimizing regret in online learning with exponentially concave losses.
method LightONS, a variant of Online Newton Step (ONS), reduces runtime to O(d2T+dωTlogT)O(d^2 T + d^ω\sqrt{T \log T}).
result Optimal regret with reduced runtime to O(d2T+dωTlogT)O(d^2 T + d^ω\sqrt{T \log T}).

New saddle network architectures preserve convex-concave geometry in optimization problems.

problem Optimization models with convex x and concave y components.
method Structured separable decomposition and saddle network architectures.
result Proven one-dimensional approximation theorem and high accuracy on various test functions.

New stability bounds for Sinkhorn's algorithm in entropic optimal transport.

problem Stability and convergence of Sinkhorn's algorithm for entropic optimal transport.
method Semiconcavity approach to analyze stability and convergence.
result Exponential convergence of Sinkhorn's algorithm under semiconcavity conditions.

The paper develops inequalities for log-concave functions and related surface areas.

problem Understanding log-concave functions and their inequalities.
method Establishing new inequalities through f-divergences and functional affine surface areas.
result New inequalities on functional affine surface area and bounds for Kullback-Leibler divergence.

The paper provides tight bounds for improving multi-armed bandits problem.

problem Improving multi-armed bandits problem with concave reward functions.
method Upper and lower bounds for randomized online algorithms, providing an O(klogk)O(\sqrt{k} \log k) approximation.
result Achieved nearly-tight approximation guarantees for the improving multi-armed bandits problem.

Geodesic concavity and hypersymplectic structures in G2G2-structures space.

problem Analyzing the geodesic concavity and hypersymplectic structures in the space of closed G2G2-structures.
method Utilising the geodesic constructed in the previous article, we show geodesic concavity and decrease in length of G2G2 Laplacian flow.
result Hitchin's volume functional is geodesically concave and the G2G2 Laplacian flow decreases the length.

Develops a new method for optimizing portfolios in stochastic markets.

problem Optimizing functionally generated portfolios in stochastic portfolio theory.
method Optimizes over a family of rank-based portfolios parameterized by an exponentially concave function.
result Proves existence and uniqueness of the optimization problem and provides stability estimates.

Log-concavity proven for multinomial likelihoods under specific constraints.

problem Log-concavity of multinomial likelihoods under interval censoring constraints.
method Proved log-concavity by showing M-convex subsets of the discrete simplex.
result Likelihood function is completely log-concave.

Spaces of convex and concave functions appear naturally in theory and applications. For example, convex regression and log-concave density estimation are important topics in nonparametric statistics. In stochastic portfolio theory, concave functions on the unit simplex measure the concentration of capital, and their gr…

2019-10-30abs ↗pdf ↗

Paper finds convexity in translating solitons for concave flows.

problem Understanding convexity in translating solitons for concave extrinsic flows.
method Analyzes convexity estimates for translating solitons evolving under concave functions in Rn+1\mathbb{R}^{n+1}.
result Establishes convexity estimates for translating solitons of concave extrinsic geometric flows.

A function is exponentially concave if its exponential is concave. We consider exponentially concave functions on the unit simplex. In a previous paper we showed that gradient maps of exponentially concave functions provide solutions to a Monge-Kantorovich optimal transport problem and give a better gradient approximat…

2016-05-19abs ↗pdf ↗

Study timelike Ricci curvature bounds via optimal transport with Orlicz-type costs.

problem Characterize timelike Ricci curvature bounds.
method Optimal transport with Orlicz-type costs, convexity of relative entropy.
result Characterize timelike Ricci curvature lower bounds via convexity of relative entropy.

We present a simple connection between differential Harnack inequalities for hypersurface flows and natural concavity properties of their time-of-arrival functions. We prove these concavity properties directly for a large class of flows by applying a concavity maximum principle argument to the corresponding level set f…

2019-12-13abs ↗pdf ↗

In fixed income sector, the yield curve is probably the most observed indicator by the market for trading and fifinancing purposes. A yield curve plots interest rates across different contract maturities from short end to as long as 30 years. For each currency, the corresponding curve shows the relation between the lev…

2018-08-10abs ↗pdf ↗

Sharp 2-Wasserstein bounds for DDPMs derived from Föllmer process.

problem Sampling error bounds for DDPMs in 2-Wasserstein distance.
method Lipschitz-type conditions on score function, Föllmer process, and log-concave target distributions.
result Sharp upper bounds for DDPMs in 2-Wasserstein distance, optimal in dimension and steps.

ICCNLS models complex relationships as convex and concave components.

problem Complex input-output relationships with affine ambiguity.
method Sub-gradient constrained affine functions, global orthogonality constraints, L1, L2, and elastic net regularisation.
result Improved predictive accuracy and model simplicity compared to conventional methods.

A convex surface contracting by a strictly monotone, homogeneous degree one function of curvature remains smooth until it contracts to a point in finite time, and is asymptotically spherical in shape. No assumptions are made on the concavity of the speed as a function of principal curvatures.

2004-02-17abs ↗pdf ↗

We analyze the classical model of compound interest with a constant per-period payment and interest rate. We examine the outstanding balance function as well as the periodic payment function and show that the outstanding balance function is not generally concave in the interest rate, but instead may be initially convex…

2018-09-27abs ↗pdf ↗

The overarching goal of this paper is to derive excess risk bounds for learning from exp-concave loss functions in passive and sequential learning settings. Exp-concave loss functions encompass several fundamental problems in machine learning such as squared loss in linear regression, logistic loss in classification, a…

2014-01-18abs ↗pdf ↗