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

78155233310 · Jun 202019922001200920172026
48 results for minimum value

Optimal coupling among random vectors with known statistics and correlation structure found using minimum spanning tree over measure-valued vertices.

problem Finding the optimal coupling among random vectors with known statistics and correlation structure.
method Formulating the problem as a minimum spanning tree over measure-valued vertices and solving it in two steps.
result Optimal coupling found using the minimum spanning tree approach.

New method estimates minimizer and minimum value of a regression function.

problem Estimating minimizer and minimum value of a regression function from noisy data.
method Projected gradient descent with gradient estimated by regularized local polynomial algorithm, followed by a rate optimal nonparametric procedure.
result Achieves minimax optimal rates of convergence for smooth and strongly convex functions.

This paper studies the geometry of minimum-volume confidence sets for multinomial parameters.

problem Determining if minimum-volume confidence sets for multinomial outcomes are disjoint.
method Enumerating and covering the continuous regions of the exact p-value function to study the geometry of minimum-volume confidence sets.
result The geometry of minimum-volume confidence sets for multinomial parameters is studied, providing insights into their structure and properties.

Consider the problem of estimating the minimum entropy of pseudo-Anosov maps on a surface of genus gg with nn punctures. We determine the behaviour of this minimum number for a certain large subset of the (g,n)(g,n) plane, up to a multiplicative constant. In particular it has been shown that for fixed nn, this minimum …

2018-01-05abs ↗pdf ↗

This paper describes an empirical study of shortfall optimization with Barra Extreme Risk. We compare minimum shortfall to minimum variance portfolios in the US, UK, and Japanese equity markets using Barra Style Factors (Value, Growth, Momentum, etc.). We show that minimizing shortfall generally improves performance ov…

2011-02-04abs ↗pdf ↗

Improved portfolio optimization method yields better risk-adjusted returns.

problem Optimizing global minimum variance portfolios with reduced risk.
method k-fold boosted kk-BAHC covariance cleaning procedure for correlation matrices.
result Our method outperforms other filtering methods in Sharpe ratios, despite higher turnover.

It was empirically confirmed by Keskar et al.\cite{SharpMinima} that flatter minima generalize better. However, for the popular ReLU network, sharp minimum can also generalize well \cite{SharpMinimacan}. The conclusion demonstrates that the existing definitions of flatness fail to account for the complex geometry of Re…

2019-03-06abs ↗pdf ↗

Suppose f(x,y)+κ2x2σ2y2f(x,y) + \fracκ{2} \|x\|^2 - \fracσ{2}\|y\|^2 is convex where σ>0σ>0, and the argmin function γ(x)={γ:infyf(x,y)=f(x,γ)}γ(x) = \{ γ: \inf_y f(x,y) = f(x,γ)\} exists and is single valued. We will prove γγ is differentiable almost everywhere. As an application we deduce a minimum principle for certain semiconcave subsolutions.

2018-08-13abs ↗pdf ↗

We present the expected values from p-value hacking as a choice of the minimum p-value among mm independents tests, which can be considerably lower than the "true" p-value, even with a single trial, owing to the extreme skewness of the meta-distribution. We first present an exact probability distribution (meta-distrib…

2016-03-24abs ↗pdf ↗

Study of participating policies with guaranteed minimum interest rate and surrender option.

problem Analyzing the value and optimal surrender strategy of participating policies with minimum interest rate guarantee and surrender option.
method Probabilistic analysis using optimal stopping and free boundary theory.
result Identification of an optimal surrender strategy involving stop-loss and too-good-to-persist boundaries.

Stochastic gradient descent (SGD) has been found to be surprisingly effective in training a variety of deep neural networks. However, there is still a lack of understanding on how and why SGD can train these complex networks towards a global minimum. In this study, we establish the convergence of SGD to a global minimu…

2019-01-02abs ↗pdf ↗

Paper certifies intersection of minimum-volume confidence sets for multinomial outcomes.

problem Certifying intersection of minimum-volume confidence sets for multinomial outcomes.
method Exploits likelihood ordering to induce halfspace constraints, enabling adaptive geometric partitioning and computable bounds on p-values.
result Efficient and provably sound algorithm for certifying intersection, disjointness, or indeterminate result.

In this paper, we define a certain "proportional volume property" for an unit vector field on a spherical domain in S3. We prove that the volume of these vector fields has an absolute minimum and this value is equal to the volume of the Hopf vector field. Some examples of such vector fields are given. We also study the…

2014-08-12abs ↗pdf ↗

We consider the problem of identifying the causal direction between two discrete random variables using observational data. Unlike previous work, we keep the most general functional model but make an assumption on the unobserved exogenous variable: Inspired by Occam's razor, we assume that the exogenous variable is sim…

2016-11-12abs ↗pdf ↗

Characterizes submanifolds with minimum ratio of diameter to focal radius.

problem Finding submanifolds with the minimum ratio of extrinsic diameter to focal radius.
method Combining K. Sakamoto's classification of submanifolds with planar geodesics and A. Schur's Bow Lemma for space curves.
result Essentially round spheres or Veronese embeddings of projective spaces achieve the minimum ratio.

Minimum width for ReLU networks on compact domain is exactly max{d_x, d_y, 2}

problem Characterizing the minimum width for ReLU networks to approximate functions on compact domains
method Analyzing the minimum width for LpL^p approximation of LpL^p functions from [0,1]d[0,1]^d to Rdy\mathbb R^{d_y} using ReLU-like activation functions
result The minimum width for LpL^p approximation on a compact domain is exactly max{d_x, d_y, 2} for ReLU-like activation functions

In this paper we are going to introduce a new nearest neighbours based approach to clustering, and compare it with previous solutions; the resulting algorithm, which takes inspiration from both DBscan and minimum spanning tree approaches, is deterministic but proves simpler, faster and doesnt require to set in advance …

2014-07-11abs ↗pdf ↗

Market strategies minimize Fisher information to minimize risk.

problem Applying minimum Fisher information principle to market dynamics.
method Analytical extension to quantum harmonic oscillator eigenstates and Gibbs distribution.
result Minimizing Fisher information reduces information and risk.

Optimizes bond portfolios to avoid worst-case losses.

problem Finding the worst-case value of a bond portfolio over a range of yield curves and spreads.
method Solves a convex-concave saddle point optimization problem to find the worst-case value and construct a robust portfolio.
result Constructs a bond portfolio that includes the worst-case value, ensuring robustness against market uncertainties.

The Ekeland variational principle implies what can be regarded as a strong version, in the C1C^1 category, of the Yau minimum principle: under the appropriate hypotheses {\it every} minimizing sequence admits a {\it good shadow}, a second minimizing sequence that has good properties and is asymptotic to the original on…

2009-08-27abs ↗pdf ↗

Closed-form solutions derived for perpetual options under insider models.

problem Pricing perpetual American standard and lookback options for insiders.
method Closed-form solutions derived using progressively enlarged filtrations and optimal stopping problems.
result Optimal exercise times determined based on asset price maximum or minimum.

Over the last decade, both the neural network and kernel adaptive filter have successfully been used for nonlinear signal processing. However, they suffer from high computational cost caused by their complex/growing network structures. In this paper, we propose two random Euler filters for complex-valued nonlinear filt…

2018-01-02abs ↗pdf ↗

We study the blow-up behaviour of minimizing sequences for the singular Moser-Trudinger functional on compact surfaces. Assuming non-existence of minimum points, we give an estimate for the infimum value of the functional. This result can be applied to give sharp Onofri-type inequalities on the sphere in the presence o…

2014-08-28abs ↗pdf ↗

In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in some cases. In other cases we estimate upper bounds for these minima leaning on …

2005-12-04abs ↗pdf ↗

The theory of tunnel number 1 knots detailed in our previous paper, The tree of knot tunnels, provides a non-negative integer invariant called the depth of the tunnel. We give various results related to the depth invariant. Noting that it equals the minimum number of Goda-Scharlemann-Thompson tunnel moves needed to con…

2007-08-24abs ↗pdf ↗

Project predicts stock prices for robust portfolio design in Indian sectors.

problem Precise stock price prediction for robust portfolio design.
method Minimum variance and optimal risk portfolio optimization using past stock prices.
result Backtesting shows improved performance of optimized portfolios over equal weight portfolio.