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

3647281,0921,456 · Jun 202019922001200920172026
48 results for upper quadrant modeling

Proposes a method to measure similarity between anomaly scores from different methods.

problem Difficulty in directly comparing anomaly detection methods.
method A measure based on extremal similarity in scoring distributions using a novel upper quadrant modeling approach.
result Demonstrates the ability to detect clusters of anomaly detection algorithms and achieve an accurate ensemble algorithm.

New estimator reveals intraday betas mainly driven by correlations.

problem Intraday fluctuations in market betas due to time-varying volatility.
method Proposes a novel subsampled quadrant estimator for high-frequency financial data.
result Intraday variation in betas primarily driven by intraday variation in correlations.

Gradient boosting decision tree (GBDT) is a widely-used machine learning algorithm in both data analytic competitions and real-world industrial applications. Further, driven by the rapid increase in data volume, efforts have been made to train GBDT in a distributed setting to support large-scale workloads. However, we …

2019-07-03abs ↗pdf ↗

We introduce a new framework for training deep generative models for high-dimensional conditional density estimation. The Bottleneck Conditional Density Estimator (BCDE) is a variant of the conditional variational autoencoder (CVAE) that employs layer(s) of stochastic variables as the bottleneck between the input xx a…

2016-11-25abs ↗pdf ↗

Copula models have become popular in different applications, including modeling shocks, in view of their ability to describe better the dependence concepts in stochastic systems. The class of maxmin copulas was recently introduced by Omladič and Ružić. It extends the well known classes of Marshall-Olkin and Marshall co…

2018-08-23abs ↗pdf ↗

Differential forms and symmetric tensors show contrasting singular behaviors in a specific geometric setting.

problem Exploring differential forms and symmetric tensors on a specific geometric setting.
method Analyzing differential forms and symmetric tensors on the quadrant C2C_2 with subset diffeology.
result Symmetric tensors exhibit singularities that accumulate, while differential forms are smooth.

In this article we consider the Merton problem in a market with a single risky asset and transaction costs. We give a complete solution of the problem up to the solution of a free-boundary problem for a first-order differential equation, and find that the form of the solution (whether the problem is well-posed, whether…

2016-12-02abs ↗pdf ↗

We factorize the Dirac operator on the Connes-Landi 4-sphere in unbounded KK-theory. We show that a family of Dirac operators along the orbits of the torus action defines an unbounded Kasparov module, while the Dirac operator on the principal orbit space -an open quadrant in the 2-sphere- defines a half-closed chain. W…

2018-03-23abs ↗pdf ↗

We exhibit many examples of closed symplectic manifolds on which there is an autonomous Hamiltonian whose associated flow has no nonconstant periodic orbits (the only previous explicit example in the literature was the torus T^2n (n\geq 2) with an irrational symplectic structure). The underlying smooth manifolds of our…

2011-01-26abs ↗pdf ↗

In this paper we introduce some new copulas emerging from shock models. It was shown earlier that reflected maxmin copulas (RMM for short) are not just some specific singular copulas; they contain many important absolutely continuous copulas including the negative quadrant dependent part of the Eyraud-Farlie-Gumbel-Mor…

2018-08-23abs ↗pdf ↗

New insights into tail behavior of heavy-tailed random vectors and processes.

problem Understanding tail behavior of aggregates of heavy-tailed random vectors.
method Analyzing multivariate regularly varying random vectors and Lévy processes.
result More than one large jump can determine tail behavior of aggregates.

GCNs help in diagnosing label scarcity and feature quality on graphs.

problem Understanding when GCNs improve node classification.
method Simulated label scarcity, feature ablation, and per-class analysis.
result GCNs provide largest gains under extreme label scarcity, matching original performance with noisy features, but hurt when homophily is low and features are strong.

Study examines financial market structure changes during the COVID-19 crash using a novel MI approach.

problem Analyzing nonlinear dependencies among major stocks during market crashes.
method Conditional p-threshold mutual information (MI) and Minimum Spanning Tree (MST) framework.
result Financial networks become more integrated during crashes, with increased periphery vulnerability.

Let M be a complete n-dimensional Riemannian spin manifold, partitioned by q two-sided hypersurfaces which have a compact transverse intersection N and which in addition satisfy a certain coarse transversality condition. Let E be a Hermitean bundle with connection on M. We define a coarse multi-partitioned index of the…

2013-08-03abs ↗pdf ↗

Study sets a nontrivial upper limit on return forecasting accuracy.

problem Establishing a practical upper limit for return forecasting accuracy.
method Defined a coin-flip oracle model to theoretically outperform practical models and used its RextOOS2R^2_{ ext{OOS}} as an upper bound.
result Theoretical upper bound on RextOOS2R^2_{ ext{OOS}} is a quadratic function of directional accuracy.

We extend Bayes' theorem for upper probabilities considering likelihood uncertainty.

problem Addressing uncertainty in likelihood for upper probability bounds.
method Generalization of Wasserman and Kadane's result, considering both prior and likelihood uncertainty.
result A sufficient condition for the upper bound to become an equality.

New method improves understanding of machine learning model performance.

problem Understanding how well machine learning models generalize from training data to unseen data.
method Auxiliary Distribution Method to derive new generalization error bounds.
result Upper bounds on generalization errors are tighter and more applicable.

FLAIR measures LP competitiveness in AMMs, improving LP performance evaluations.

problem LP returns are affected by both market risk and competitive strategies.
method Introduces FLAIR metric to quantify LP competitiveness and assesses its impact on LP returns.
result FLAIR captures dynamic behavior of LPs and differentiates between active provisioning strategies.

Upper bound for Hausdorff distance between hyperbolic space and its medianization.

problem Calculating the Hausdorff distance between hyperbolic space and its medianization.
method Using de Sitter space to model finite-dimensional hyperbolic space and its medianization, calculating the Hausdorff distance.
result An upper bound for the Hausdorff distance between hyperbolic space and its medianization is calculated.

Knotted ribbons form an important topic in knot theory. They have applications in natural sciences, such as cyclic duplex DNA modeling. A flat knotted ribbon can be obtained by gently pulling a knotted ribbon tight so that it becomes flat and folded. An important problem in knot theory is to study the minimal ratio of …

2018-09-06abs ↗pdf ↗

New bounds on AE success probability in GP models.

problem Limiting the success of adversarial examples in probabilistic models.
method Investigated upper bounds on AE success probability using Gaussian Processes.
result Proved a new upper bound of AE success probability dependent on perturbation norm, kernel function, and training dataset distance.

Improves conditional coverage of regression models using conformal prediction.

problem Lack of conditional coverage guarantees in conformal prediction methods.
method Proposes a novel algorithm to train a regression function to improve conditional coverage after split conformal prediction.
result Establishes an upper bound for miscoverage gap and proposes an end-to-end algorithm to control it.

Neural networks with rectified linear unit activations are essentially multivariate linear splines. As such, one of many ways to measure the "complexity" or "expressivity" of a neural network is to count the number of knots in the spline model. We study the number of knots in fully-connected feedforward neural networks…

2016-11-29abs ↗pdf ↗

The paper bounds the mean absolute error in DNN vector-to-vector regression.

problem Bounding the mean absolute error in deep neural network based vector-to-vector regression.
method Error decomposition techniques in statistical learning theory and non-convex optimization theory were used to derive upper bounds for approximation, estimation, and optimization errors.
result Theoretical upper bounds for mean absolute error in DNN vector-to-vector regression were derived and validated experimentally.

Improved regret bounds for bandits with expert advice.

problem Optimizing decision-making in environments with expert advice.
method Proved lower and upper bounds for regret in restricted and standard feedback models.
result Proved a new upper bound of order KTln(N/K)\sqrt{K T \ln(N/K)} for the worst-case regret, matching a previously known lower bound.

Sharp upper bounds found for Steklov eigenvalues of a specific hypersurface.

problem Finding upper bounds for Steklov eigenvalues of a specific type of hypersurface.
method Analytical approach to compute upper bounds and prove stability properties.
result Sharp upper bounds Bn(L)B_n(L) and BnB_n for Steklov eigenvalues are derived.

Study proves upper bounds for solutions on Riemannian manifolds.

problem Proving upper bounds for solutions of Leibenson's equation on Riemannian manifolds.
method Proved upper bounds equivalent to a euclidean-type Sobolev inequality.
result Upper bounds for solutions of Leibenson's equation on Riemannian manifolds are equivalent to euclidean-type Sobolev inequalities.

Researchers find a way to price American options without relying on specific asset price models.

problem Determining the upper bound on the price of American options under model uncertainty.
method Using martingale optimal transport problem to describe model uncertainty and proving that optimal exercise schemes must be nonrandomized under certain conditions.
result The price upper bound and its relaxed version coincide under suitable convexity conditions, removing the need for the model-free price upper bound to be nonrandomized.

In a discrete-time financial market, a generalized duality is established for model-free superhedging, given marginal distributions of the underlying asset. Contrary to prior studies, we do not require contingent claims to be upper semicontinuous, allowing for upper semi-analytic ones. The generalized duality stipulate…

2019-09-13abs ↗pdf ↗

New algorithm reduces regret and constraint violation in adversarial CMDP learning.

problem Online learning for episodic stochastically constrained Markov decision processes (CMDPs) with adversarial loss.
method Upper Confidence Primal-Dual Reinforcement Learning (UC-PDL) algorithm.
result Achieves O~(LSAT)\widetilde{\mathcal{O}}(L|\mathcal{S}|\sqrt{|\mathcal{A}|T}) upper bounds of both regret and constraint violation.

Upper bounds for Steklov eigenvalues derived from intersection indices.

problem Finding upper bounds for Steklov eigenvalues of submanifolds in Euclidean space.
method Using intersection indices of submanifolds and their boundaries.
result Explicit upper bounds involving intersection index, volume, and dimensional constants.

We obtain upper bounds for the eigenvalues of the Schrödinger operator L=Δg+qL=Δ_g+q depending on integral quantities of the potential qq and a conformal invariant called the min-conformal volume. Moreover, when the Schrödinger operator LL is positive, integral quantities of qq which appear in upper bounds, can be repla…

2012-10-29abs ↗pdf ↗