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

111221332442 · Jun 202019922001200920172026
48 results for Non-convex risk measures

The paper explores non-convex risk measures and their characterizations.

problem Characterizing non-convex risk measures without convexity or weak convexity.
method Characterizes monetary risk measures as lower envelopes of families of convex or coherent risk measures, considering law-invariance and SSD-consistency.
result Unified representation theorems for law-invariant risk measures, including VaR.

The aims of this study are twofold. First, we consider an optimal risk allocation problem with non-convex preferences. By establishing an infimal representation for distortion risk measures, we give some necessary and sufficient conditions for the existence of optimal and asymptotic optimal allocations. We will show th…

2015-03-15abs ↗pdf ↗

The family of admissible positions in a transaction costs model is a random closed set, which is convex in case of proportional transaction costs. However, the convexity fails, e.g. in case of fixed transaction costs or when only a finite number of transfers are possible. The paper presents an approach to measure risks…

2019-02-02abs ↗pdf ↗

Optimal algorithm identifies best arm for risk measures in heavy-tailed distributions.

problem Identifying the arm with smallest CVaR, VaR, or weighted sum of CVaR and mean from heavy-tailed distributions.
method Multi-armed bandit best-arm identification framework, solving non-convex optimization problem.
result Optimal δ-correct algorithm with matching lower bound on expected samples.

Algorithm finds near-optimal VaR portfolios using MILP, improving risk management.

problem Computing optimal VaR portfolios is hard due to non-convexity and combinatorial nature.
method Formulates VaR portfolio problem as MILP, uses alternate formulations for guarantees.
result Near-optimal VaR portfolios with near-optimality guarantees.

Optimal risk sharing without convex preferences using aggregate convexity.

problem Risk sharing among non-convex preferences.
method Aggregate convexity principles and Lyapunov convexity, combined with approximation arguments for law invariant risk measures.
result Derivation of a computationally tractable formula for the conjugate of the value function.

Paper analyzes SGHMC for non-convex optimization with discontinuous gradients.

problem Training neural networks with ReLU activation.
method Non-asymptotic convergence analysis of SGHMC with discontinuous gradients.
result Explicit upper bounds for expected excess risk in non-convex optimization.

Continuous-time mirror descent solves sparse phase retrieval efficiently.

problem Recovering sparse signals from magnitude-only measurements.
method Continuous-time mirror descent applied to unconstrained empirical risk minimization problem.
result Mirror descent recovers kk-sparse vectors with minimum non-zero entry order of x2/k\| \mathbf{x}^\star \|_2/\sqrt{k} from k2k^2 Gaussian measurements.

Ensuring that classifiers are non-discriminatory or fair with respect to a sensitive feature (e.g., race or gender) is a topical problem. Progress in this task requires fixing a definition of fairness, and there have been several proposals in this regard over the past few years. Several of these, however, assume either…

2019-01-24abs ↗pdf ↗

Paper provides new bounds for risk aggregation and sharing.

problem Quantitative risk management and robust risk aggregation with dependence uncertainty.
method Established new inequality for RVaR, derived extended convolution bounds, and analyzed risk sharing for averaged quantiles.
result Extended convolution bounds for robust risk aggregation and risk sharing, providing sharpness conditions and explicit expressions.

Adaptive sampling for risk-averse learning on hard examples.

problem Training models to perform well on difficult examples in high-stakes applications.
method Adaptive sampling algorithm for stochastically optimizing CVaR, using distributionally robust formulation and regret minimization.
result Empirically demonstrates effectiveness on large-scale convex and non-convex learning tasks.

Most high-dimensional estimation and prediction methods propose to minimize a cost function (empirical risk) that is written as a sum of losses associated to each data point. In this paper we focus on the case of non-convex losses, which is practically important but still poorly understood. Classical empirical process …

2016-07-22abs ↗pdf ↗

Preconditioned non-convex gradient descent improves noisy matrix estimation.

problem Estimating low-rank matrices from noisy measurements.
method Preconditioned non-convex gradient descent for noisy measurements.
result Preconditioned method converges to minimax optimal estimate at a linear rate.

A distributed subgradient method tackles non-convex optimization problems in networks.

problem Solving non-convex optimization problems in distributed networks.
method Proposes a distributed stochastic subgradient method (stoDPSM) with theoretical guarantees.
result Global convergence of stoDPSM using Moreau envelope stationarity measure, and linear convergence under sharpness condition.

New oracles improve stochastic optimization with noisy or biased measurements.

problem Optimizing functions with noisy or biased measurements.
method Introduced biased gradient oracles for stochastic optimization, analyzed RSG and SGD algorithms with these oracles.
result Derived non-asymptotic bounds for convergence rates of algorithms with biased gradient oracles.

New algorithms for differentially private optimization in convex and non-convex settings with near-optimal rates.

problem Differentially private optimization in convex and non-convex settings.
method Developed algorithms for convex and non-convex settings with near-optimal excess population risk.
result Achieved near-optimal rates in near-linear time for convex settings and nearly dimension independent rates for non-convex settings.

Improved algorithm finds second-order stationary points in non-convex optimization.

problem Minimizing non-convex objectives while preserving training data privacy.
method SpiderBoost framework with two gradient oracles: precise and less precise.
result Improved rates for finding second-order stationary points.

New algorithms optimize a soft-robust criterion in reinforcement learning, reducing conservatism.

problem Computing robust policies for high-stakes decisions with limited data.
method Soft-robust criterion using risk measures, two algorithms for optimization.
result Our algorithms produce less conservative solutions than existing methods.

The paper tackles performative risk optimization under weak convexity assumptions.

problem Optimizing performative risk in a closed-loop prediction system with weak convexity.
method Relaxing convexity assumptions to maintain optimization feasibility.
result Iterative optimization methods remain applicable even with weakened convexity conditions.

Novel framework for portfolio selection considering utility and risk.

problem Maximizing utility subject to risk constraints with various utility and risk functionals.
method General framework accommodating non-concave utilities and non-convex risk measures. Characterization of well-posedness using a simple either-or criterion.
result Minimal condition for well-posedness: either utility or risk must be sensitive to large losses.

A new framework for portfolio diversification is introduced which goes beyond the classical mean-variance approach and portfolio allocation strategies such as risk parity. It is based on a novel concept called portfolio dimensionality that connects diversification to the non-Gaussianity of portfolio returns and can typ…

2019-06-03abs ↗pdf ↗

Boosted Difference of Convex Functions Algorithm solves VaR constrained portfolio optimization.

problem Designing VaR optimal portfolios under financial regulations.
method Boosted Difference of Convex Functions Algorithm (BDCA) with a novel line search framework.
result BDCA linearly converges to a Karush-Kuhn-Tucker point for VaR constrained portfolio problems.

Deep learning with noisy gradient descent outperforms linear estimators in high dimensions.

problem Theoretical explanation of deep learning's superiority over linear methods.
method Theoretical analysis of excess risk of a deep learning estimator trained by noisy gradient descent.
result Deep learning achieves a faster learning rate than linear estimators, especially in high dimensions.

Investigates conditions for risk or utility functionals to be sensitive to large losses.

problem Conditions for risk or utility functionals to be sensitive to large losses.
method Analyzes sensitivity to large losses for various risk and utility functionals.
result Value at Risk and Expected Shortfall generally fail to be sensitive to large losses, but expected utility functionals and certain adjusted versions are sensitive.

Learning with a {\it convex loss} function has been a dominating paradigm for many years. It remains an interesting question how non-convex loss functions help improve the generalization of learning with broad applicability. In this paper, we study a family of objective functions formed by truncating traditional loss f…

2018-05-21abs ↗pdf ↗

Two-layer ReLU networks outperform kernel methods in teacher-student settings.

problem Understanding the excess risk of two-layer ReLU neural networks in teacher-student models.
method Investigated a two-phase training process for a student network, comparing it to kernel methods.
result The student network reaches near-global optimality and outperforms kernel methods in minimax optimal rate.

We consider the fundamental problem in non-convex optimization of efficiently reaching a stationary point. In contrast to the convex case, in the long history of this basic problem, the only known theoretical results on first-order non-convex optimization remain to be full gradient descent that converges in $O(1/\varep…

2016-03-17abs ↗pdf ↗

Paper studies early-stopped mirror descent for noisy sparse phase retrieval.

problem Recovering a sparse signal from noisy quadratic measurements.
method Early-stopped mirror descent with hyperbolic entropy mirror map.
result Achieves nearly minimax-optimal rate of convergence for kk-sparse signals.

New methods improve convergence in non-convex non-smooth learning problems.

problem Sparse learning from high-dimensional data with non-convex, non-smooth regularizers.
method Stochastic proximal gradient methods with arbitrary sampling.
result Independent sampling improves performance over uniform sampling.

An Euler discretization of the Langevin diffusion is known to converge to the global minimizers of certain convex and non-convex optimization problems. We show that this property holds for any suitably smooth diffusion and that different diffusions are suitable for optimizing different classes of convex and non-convex …

2018-10-29abs ↗pdf ↗

Paper develops robust SGLD for solving non-convex DRO problems.

problem Solving non-convex distributionally robust optimisation problems with adversarially corrupted samples.
method Developed a Stochastic Gradient Langevin Dynamics (SGLD) algorithm with non-asymptotic convergence bounds.
result The robust SGLD estimator outperforms vanilla SGLD in terms of test accuracy.