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

95190285380 · Jun 202019922001200920172026
48 results for negative orthant dependence

The paper explores the relationship between joint mixability and negative dependence structures.

problem Understanding the connection between joint mixability and various negative dependence concepts.
method Analyzes the properties of joint mixes and their relation to negative dependence structures.
result Derives necessary and sufficient conditions for a joint mix to be negatively dependent.

Paper proposes a new method to evaluate joint risk under uncertainty.

problem Evaluating joint risk of multiple insurance risks under dependence uncertainty.
method Axiomatic approach to scalar and vector-valued distortion joint risk measures.
result Established a new scalar distortion joint risk measure with positive homogeneity.

Introduces joint exclusivity (JE), a new form of negative dependence.

problem Negative dependence structures in probability distributions.
method Defines JE by exclusion of the interior of the non-negative orthant, establishes necessary and sufficient conditions for existence, proposes a canonical construction.
result Sharp necessary and sufficient condition for existence of JE random vectors with prescribed marginals.

State spaces of multifactor approximations of nonnegative Volterra processes are linear transformations of the nonnegative orthant.

problem Characterizing state spaces of multifactor approximations of nonnegative Volterra processes.
method Explicit linear transformation of the nonnegative orthant.
result State spaces of multifactor approximations of nonnegative Volterra processes are given by explicit linear transformation of the nonnegative orthant.

A common challenge in estimating parameters of probability density functions is the intractability of the normalizing constant. While in such cases maximum likelihood estimation may be implemented using numerical integration, the approach becomes computationally intensive. The score matching method of Hyvärinen [2005] …

2018-12-26abs ↗pdf ↗

In this paper, we introduce two alternative extensions of the classical univariate Value-at-Risk (VaR) in a multivariate setting. The two proposed multivariate VaR are vector-valued measures with the same dimension as the underlying risk portfolio. The lower-orthant VaR is constructed from level sets of multivariate di…

2011-11-05abs ↗pdf ↗

Develops a new model for measuring extremal dependence in financial markets.

problem Lack of suitable models for studying extremal dependence in financial markets.
method Constructs regular variation models on Rd\mathbb{R}^d and develops a bivariate measure for asymmetry in extremal dependence.
result Rejects the Efficient Tail Hypothesis for China's futures market and identifies profitable investment opportunities.

A new method solves l1-regularized optimization problems efficiently and sparsely.

problem l1-regularized optimization problems in machine learning.
method Orthant Based Proximal Stochastic Gradient Method (OBProx-SG)
result Promotes sparsity of solutions substantially and converges to global optimal solutions.

New algorithm provably converges to second-order stationary points in NMF.

problem Understanding convergence to local minima in NMF.
method Multiplicative weight update dynamics, concurrent updates, and simplex reduction.
result Provable convergence to second-order stationary points.

This paper presents a unified framework for smooth convex regularization of discrete optimal transport problems. In this context, the regularized optimal transport turns out to be equivalent to a matrix nearness problem with respect to Bregman divergences. Our framework thus naturally generalizes a previously proposed …

2016-10-20abs ↗pdf ↗

The standard intensity-based approach for modeling defaults is generalized by making the deterministic term structure of the survival probability stochastic via a common jump process. The survival copula of the vector of default times is derived and it is shown to be explicit and of the functional form as dealt with in…

2010-08-13abs ↗pdf ↗

The SCMU algorithm computes cone factorizations for symmetric cones, improving upon existing methods.

problem Computing cone factorizations for symmetric cones in optimization.
method Introduces and analyzes the symmetric-cone multiplicative update (SCMU) algorithm.
result The SCMU algorithm non-decreases the squared loss objective.

Regular variation provides a convenient theoretical framework to study large events. In the multivariate setting, the dependence structure of the positive extremes is characterized by a measure - the spectral measure - defined on the positive orthant of the unit sphere. This measure gathers information on the localizat…

2019-07-01abs ↗pdf ↗

Study on pairwise counter-monotonicity, a type of negative dependence.

problem Understanding and quantifying extremal negative dependence structures.
method Established stochastic representation and invariance property; showed implications and connections.
result Pairwise counter-monotonicity implies negative association and joint mix dependence.

New DKPP family controls positive and negative dependence in random subsets.

problem Challenges in seamlessly bridging probabilistic models for positive and negative dependence.
method Introduced DKPP family and developed computational methods for probabilistic operations and inference.
result Controllability of positive and negative dependence demonstrated through numerical experiments.

In this letter, we propose a new identification criterion that guarantees the recovery of the low-rank latent factors in the nonnegative matrix factorization (NMF) model, under mild conditions. Specifically, using the proposed criterion, it suffices to identify the latent factors if the rows of one factor are \emph{suf…

2017-09-02abs ↗pdf ↗

A new method speeds up computation of Sinkhorn divergences to linear time.

problem Expensive computation of Sinkhorn divergences for comparing probability distributions.
method Using positive features to approximate ground costs, reducing computation time to linear.
result Sinkhorn divergences can be computed in linear time, scaling as O(nr).

Characterizes symmetric Bernoulli distributions with minimal convex sums.

problem Understanding minimal dependence among Bernoulli random vectors.
method Geometric and algebraic representations of multivariate symmetric Bernoulli distributions.
result Characterizes extremal negative dependence and builds minimal dependence copulas.

Proposes a novel method for generating hard negatives near time series data boundaries.

problem Challenges in generating effective negative samples for time series anomaly detection.
method Reconstruction-driven boundary negative generation framework using reinforcement learning.
result Improves anomaly representation learning and achieves competitive detection performance.

Investigates VaR behavior for sums of one-sided random variables, showing impossibilities and conditions for super-additivity.

problem Investigates the behavior of Value-at-Risk (VaR) for sums of one-sided random variables.
method Analyzes the extremal aggregation behavior of VaR, introduces structural conditions for super-additivity.
result Characterizes when VaR is fully super-additive and provides unified framework for various dependence structures.

Given a knot K in the three-sphere, we address the question: which Dehn surgeries on K bound negative-definite four-manifolds? We show that the answer depends on a number m(K), which is a smooth concordance invariant. We study the properties of this invariant, and compute it for torus knots.

2011-08-24abs ↗pdf ↗

Estimates the dual Thurston norm for foliations on negative curvature 3-manifolds.

problem Bounding the dual Thurston norm of foliations on 3-manifolds of negative curvature.
method Uses constants like injectivity radius, volume, curvature, and mean curvature of foliation leaves to estimate the dual Thurston norm.
result Provides an upper bound estimate on the dual Thurston norm of the Euler class of a foliation.

New confidence intervals improve treatment effect estimation in randomized experiments.

problem Improving confidence intervals for treatment effects in randomized experiments.
method Systematic exploitation of negative dependence or variance adaptivity.
result Achieved nonasymptotic confidence intervals with the same effective sample size as asymptotic ones.

In an equity market model with "Knightian" uncertainty regarding the relative risk and covariance structure of its assets, we characterize in several ways the highest return relative to the market that can be achieved using nonanticipative investment rules over a given time horizon, and under any admissible configurati…

2012-02-14abs ↗pdf ↗

The standard linear and logistic regression models assume that the response variables are independent, but share the same linear relationship to their corresponding vectors of covariates. The assumption that the response variables are independent is, however, too strong. In many applications, these responses are collec…

2019-05-08abs ↗pdf ↗

Study proves uniqueness of corrugated negatively curved immersions in differential geometry.

problem Negatively curved immersions in differential geometry.
method Relative entropy method applied to Gauss-Codazzi system.
result Uniqueness of smooth isometric immersions within corrugated class.

The study addresses negative transfer in multi-output Gaussian processes by proposing latent structures.

problem Negative transfer in multi-output Gaussian processes leading to decreased performance.
method Defining negative transfer, deriving conditions for avoiding it, proposing latent structures.
result Latent structures can avoid negative transfer and scale to large datasets.

We propose to formulate multi-label learning as a estimation of class distribution in a non-linear embedding space, where for each label, its positive data embeddings and negative data embeddings distribute compactly to form a positive component and negative component respectively, while the positive component and nega…

2019-11-17abs ↗pdf ↗

The negative case of the Singular Yamabe Problem concerns the existence and behavior of complete metrics with constant negative scalar curvature on the complement of a closed set in a compact Riemannian manifold which are conformally equivalent to a smooth metric on this compact manifold. When the closed set is a smoot…

1996-01-16abs ↗pdf ↗

Study shows surfaces with similar length spectra are smoothly deformable.

problem Quantifying how similar the length spectra of two negatively curved surfaces are.
method Analyzes marked length spectra of closed negatively curved surfaces and proves smooth deformations.
result Smooth diffeomorphisms exist between surfaces with close length spectra.