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

Trend · papers per month

166332497663 · Jun 202019922001200920172026
48 results for concave functions

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.

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.

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.

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.

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 ↗

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 ↗

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 ↗

We analyze a reweighted version of the Kikuchi approximation for estimating the log partition function of a product distribution defined over a region graph. We establish sufficient conditions for the concavity of our reweighted objective function in terms of weight assignments in the Kikuchi expansion, and show that a…

2014-10-26abs ↗pdf ↗

A new algorithm uses concavity in Gaussian processes to optimize decisions in bandit problems.

problem Optimizing decisions in sequential problems with context-dependent rewards.
method Proposes a UCB algorithm using a shape-constrained reward function estimator based on a Gaussian Process model with concavity constraints.
result Derives regret bounds for the proposed UCB algorithm.

The paper extends risk measures to two-step approximations and studies log-concave distributions.

problem Extending classical risk measures to two-step approximations.
method Optimization problem for determining optimal regime thresholds and values for log-concave distributions.
result Conditions for the uniqueness of regime changing in log-concave distributions.

Study minimax risk of score estimation for log-concave distributions.

problem Minimizing risk in score estimation for log-concave distributions.
method Developed subclasses of log-concave densities and constructed a locally adaptive, multiscale estimator.
result Established minimax rates for score estimation over specific subclasses of log-concave densities.

Optimizes investment under uncertain time horizons with non-concave utility.

problem Optimizing investment decisions with non-concave utility and uncertain time horizons.
method Established necessary and sufficient conditions for optimality, suggested recursive procedure for non-concave utility.
result Optimal investment strategies under uncertain time horizons exhibit multimodal distribution, indicating flexibility in switching between local maximizers.

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 ↗

Improves SGM convergence bounds in W2-distance without strict assumptions.

problem Convergence bounds for SGMs in W2-distance require stringent assumptions.
method Novel framework using the OU process and PDE analysis.
result Log-concavity evolves from weak to strong over time.

A generalized optimistic method for saddle point problems with improved complexity.

problem Solving convex-concave saddle point problems efficiently.
method Proposes a generalized optimistic method that includes the optimistic gradient method as a special case, handling constrained saddle point problems with composite objective functions and arbitrary norms.
result Best-known global iteration complexity bounds for first-, second-, and higher-order methods.

Traditional dictionary learning methods are based on quadratic convex loss function and thus are sensitive to outliers. In this paper, we propose a generic framework for robust dictionary learning based on concave losses. We provide results on composition of concave functions, notably regarding super-gradient computati…

2017-11-02abs ↗pdf ↗

Paper proposes an algorithm to solve complex minimax problems efficiently.

problem Stochastic nonconvex-concave minimax problems in various fields.
method Accelerated first-order regularized momentum descent ascent algorithm (FORMDA).
result Achieves best-known complexity bound of ildeO(ε6.5) ilde{\mathcal{O}}(\varepsilon ^{-6.5}) for single-loop algorithms.

The problem behind this paper is the proper measurement of the degree of quality/acceptability/distance to arbitrage of trades. We are narrowing the class of coherent acceptability indices introduced by Cherny and Madan (2007) by imposing an additional mathematical property. For this, we introduce the notion of a conca…

2011-04-04abs ↗pdf ↗

We analyze different re-ranking algorithms for diversification and show that majority of them are based on maximizing submodular/modular functions from the class of parameterized concave/linear over modular functions. We study the optimality of such algorithms in terms of the `total curvature'. We also show that by adj…

2019-06-26abs ↗pdf ↗

It was recently proved that embedded solutions of Euclidean hypersurface flows with speeds given by concave (convex), degree one homogeneous functions of the Weingarten map are interior (exterior) non-collapsing. These results were subsequently extended to hypersurface flows in the sphere and hyperbolic space. In the f…

2013-10-02abs ↗pdf ↗