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

14294357 · May 202619922001200920172026
48 results for two-step geodesics

The paper extends two-step homogeneous geodesics to homogeneous Finsler spaces.

problem Extending two-step homogeneous geodesics to Finsler spaces.
method Providing sufficient conditions for (α,β)(α,β) spaces and decomposable cubic spaces to have two-step Finsler geodesic orbit spaces.
result Presented examples of two-step Finsler geodesic orbit spaces.

Two Riemannian manifolds are said to have CkC^k-conjugate geodesic flows if there exist an CkC^k diffeomorphism between their unit tangent bundles which intertwines the geodesic flows. We obtain a number of rigidity results for the geodesic flows on compact 2-step Riemannian nilmanifolds: For generic 2-step nilmanifold…

1995-03-15abs ↗pdf ↗

The paper shows how to recover true node positions from a graph or similarity matrix.

problem Recovering true distances and positions from a graph or similarity matrix.
method Two steps: matrix factorisation followed by nonlinear dimension reduction.
result Nonlinear dimension reduction can recover latent positions close to a manifold where geodesic distance is encoded.

We study geodesics of the form γ(t)=π(exp(tX)exp(tY))γ(t)=π(\exp(tX)\exp(tY)), $X,Y\in \fr{g}=\operatorname{Lie}(G)$, in homogeneous spaces G/KG/K, where π:GG/Kπ:G\rightarrow G/K is the natural projection. These curves naturally generalise homogeneous geodesics, that is orbits of one-parameter subgroups of GG (i.e. γ(t)=π(exp(tX))γ(t)=π(\exp (tX)), $X\in …

2016-11-14abs ↗pdf ↗

In this article we show that every geodesic is rank one and the Hessian of Busemann functions is positive definite for a harmonic Damek-Ricci space, a two step solvable Lie group with a left invariant metric. Moreover, the eigenspace of the Hessian of Busemann functions on a Hadamard manifold (M,g)(M,g) corresponding to e…

2017-02-13abs ↗pdf ↗

We construct a pair of compact, eight-dimensional, two-step Riemannian nilmanifolds MM and MM' which are isospectral for the Laplace operator on functions and such that MM has completely integrable geodesic flow in the sense of Liouville, while MM' has not. Moreover, for both manifolds we analyze the structure of t…

2007-10-12abs ↗pdf ↗

We consider semi-supervised regression when the predictor variables are drawn from an unknown manifold. A simple two step approach to this problem is to: (i) estimate the manifold geodesic distance between any pair of points using both the labeled and unlabeled instances; and (ii) apply a k nearest neighbor regressor b…

2016-11-07abs ↗pdf ↗

We consider a method popular in the literature of associating a two-step nilpotent Lie algebra with a finite simple graph. We prove that the two-step nilpotent Lie algebras associated with two graphs are Lie isomorphic if and only if the graphs from which they arise are isomorphic.

2013-10-12abs ↗pdf ↗

Paper introduces new actuarial-consistent valuations for insurance liabilities.

problem Valuation of insurance liabilities considering both financial and actuarial risks.
method Proposes two-step actuarial valuations and actuarial-consistent procedures.
result Actuarial-consistent valuations are equivalent to two-step actuarial valuations under coherence.

Proves conjecture about compatible SKT and balanced metrics on compact solvmanifolds.

problem Compact complex manifolds with both SKT and balanced metrics.
method Shear construction and classification of two-step solvable Lie algebras.
result Proves conjecture for compact two-step solvmanifolds with invariant complex structures.

New method uses Riemannian geometry to improve neural network adversarial attacks.

problem Improving robustness of neural networks against adversarial attacks.
method Proposes a new adversarial attack using Riemannian foliation theory and curvature of data space.
result The new attack is more efficient and accurate compared to existing methods.

A Riemannian Einstein solvmanifold (possibly, any noncompact homogeneous Einstein space) is almost completely determined by the nilradical of its Lie algebra. A nilpotent Lie algebra, which can serve as the nilradical of an Einstein metric solvable Lie algebra, is called an Einstein nilradical. Despite a substantial pr…

2008-05-06abs ↗pdf ↗

A two-step nonparametric method estimates financial systemic risk.

problem Estimating CoVaR due to unobservability of multivariate-quantiles.
method Two-step nonparametric approach using Monte-Carlo simulation and kernel method.
result Consistency and asymptotic normality of the two-step estimator established.

A conjugate Bayesian method detects change points in Hawkes processes efficiently.

problem Non-conjugacy between Hawkes process likelihood and prior causes inefficiency in change point detection.
method Data augmentation to propose a conjugate Bayesian two-step change point detection method.
result The conjugate method is more accurate and efficient than non-conjugate methods.

Let M be a complete Riemannian manifold whose sectional curvature is bounded above by 1. We say that M has positive spherical rank if along every geodesic one hits a conjugate point at t=π. The following theorem is then proved: If M is a complete, simply connected Riemannian manifold with upper curvature bound 1 and po…

2003-05-12abs ↗pdf ↗

Two-step conformal prediction method for adaptive bounding box uncertainties in multi-object detection.

problem Quantifying predictive uncertainty for multi-object detection in safety-critical applications.
method Developed a two-step conformal prediction approach to propagate uncertainty in predicted class labels into bounding box uncertainties, ensuring coverage for incorrectly classified objects.
result Desired coverage levels are satisfied with practically tight predictive uncertainty intervals on real-world datasets.

The paper discusses a new method for constructing two-step Darboux transforms of isothermic surfaces.

problem Constructing two-step Darboux transforms of isothermic surfaces.
method Sym-type construction using parallel sections of the associated family.
result All two-step Darboux transforms of an isothermic surface are given without further integration.

A new Bayesian method optimizes time-dependent expensive functions with lookahead.

problem Maximizing a time-dependent, expensive oracle with limited evaluations.
method Recursive, two-step lookahead expected payoff (r2LEY) acquisition function.
result r2LEY outperforms myopic methods in synthetic and real-world datasets.

We consider evaluation methods for payoffs with an inherent financial risk as encountered for instance for portfolios held by pension funds and insurance companies. Pricing such payoffs in a way consistent to market prices typically involves combining actuarial techniques with methods from mathematical finance. We prop…

2011-09-08abs ↗pdf ↗

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.

The paper discusses polynomial convergence to conical Kähler-Einstein metrics.

problem Understanding the convergence of Kähler-Einstein metrics to conical structures.
method Two-step degeneration theory and algebraic singularity analysis.
result Singular Kähler-Einstein metrics are conical if curvature grows quadratically near a point.

New methods use vector search and nearest-neighbor matching for policy learning in causal inference.

problem Learning optimal policies in causal inference with limited data.
method RAG-based policy learning with vector search and nearest-neighbor matching.
result The methods bound the within-candidate choice regret and evaluate the one-step method directly as a policy.

Bayesian method maps high-dimensional inputs to lower dimensions for efficient multi-fidelity Gaussian Process modeling.

problem Efficiently modeling high-dimensional inputs with low-dimensional latent variables for multi-fidelity Gaussian Processes.
method Bayesian approach with orthonormal projection matrix inference using Markov Chain Monte Carlo (MCMC) and Geodesic Monte Carlo sampling.
result Optimal transformations identified that improve computational efficiency in multi-fidelity Gaussian Process modeling.

Efficiently optimizes constrained problems with two-step lookahead BO.

problem Optimizing constrained problems with limited computational resources.
method Two-step lookahead Bayesian optimization with inequality constraints, using a novel unbiased gradient estimator.
result Significantly improves query efficiency over previous methods.

We address the problem of disentanglement of factors that generate a given data into those that are correlated with the labeling and those that are not. Our solution is simpler than previous solutions and employs adversarial training. First, the part of the data that is correlated with the labels is extracted by traini…

2017-09-01abs ↗pdf ↗

A new training method improves stability and generalization of DeepONets.

problem Training deep operator networks (DeepONets) is challenging due to nonconvex and nonlinear nature.
method Two-step training method: first train trunk network, then branch network. Introduced Gram-Schmidt orthonormalization.
result Generalization error estimate and numerical examples demonstrating effectiveness.

We consider a modified Ricci flow equation whose stationary solutions include Einstein and Ricci soliton metrics, and we study the linear stability of those solutions relative to the flow. After deriving various criteria that imply linear stability, we turn our attention to left-invariant soliton metrics on (non-compac…

2013-09-24abs ↗pdf ↗

Study high-dimensional covariance matrix estimators for complex portfolios, improving financial metrics.

problem Estimating covariance matrices in high-dimensional portfolios with nested and one-factor structures.
method Combining random matrix theory, free probability, deterministic equivalents, and two-step covariance estimators.
result Two-step estimators improve financial metrics in complex and one-factor covariance models.

The paper develops a method for optimal projection selection in high-dimensional classification.

problem High-dimensional classification with latent variable structure.
method Formulates a latent-variable model and proposes a computationally efficient classifier.
result Explicit rates of convergence for excess risk of the proposed classifier are derived and shown to be optimal.

We address the problem of estimating the difference between two probability densities. A naive approach is a two-step procedure of first estimating two densities separately and then computing their difference. However, such a two-step procedure does not necessarily work well because the first step is performed without …

2012-06-30abs ↗pdf ↗

We propose a simple auto-encoder framework for molecule generation. The molecular graph is first encoded into a continuous latent representation zz, which is then decoded back to a molecule. The encoding process is easy, but the decoding process remains challenging. In this work, we introduce a simple two-step decodin…

2019-06-08abs ↗pdf ↗

There has been increasing interest in modelling survival data using deep learning methods in medical research. Current approaches have focused on designing special cost functions to handle censored survival data. We propose a very different method with two steps. In the first step, we transform each subject's survival …

2019-08-06abs ↗pdf ↗

Scaling regression to large datasets is a common problem in many application areas. We propose a two step approach to scaling regression to large datasets. Using a regression tree (CART) to segment the large dataset constitutes the first step of this approach. The second step of this approach is to develop a suitable r…

2017-07-24abs ↗pdf ↗

In this paper, we propose a two-step training procedure for source separation via a deep neural network. In the first step we learn a transform (and it's inverse) to a latent space where masking-based separation performance using oracles is optimal. For the second step, we train a separation module that operates on the…

2019-10-22abs ↗pdf ↗