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

481216 · Jun 202619922001200920172026
48 results for co-primary endpoints

Proposes a new framework for evaluating diagnostic models with multiple co-primary endpoints.

problem Overoptimistic assessments of predictive performance in automated medical testing devices.
method Multiple testing framework for diagnostic accuracy studies with co-primary endpoints, using a parametric simultaneous test procedure and Bayesian approach to determine optimal number of models.
result Our approach leads to a better final diagnostic model and increased statistical power.

Prove Gromov's Euclidean endpoint C0C^0 rigidity conjecture for positive mass theorem.

problem Prove Gromov's Euclidean endpoint C0C^0 rigidity conjecture for positive mass theorem.
method Prove Gromov's Euclidean endpoint C0C^0 rigidity conjecture for positive mass theorem.
result Prove Gromov's Euclidean endpoint C0C^0 rigidity conjecture for positive mass theorem.

In Carnot-Caratheodory or sub-Riemannian geometry, one of the major open problems is whether the conclusions of Sard's theorem holds for the endpoint map, a canonical map from an infinite-dimensional path space to the underlying finite-dimensional manifold. The set of critical values for the endpoint map is also known …

2015-03-12abs ↗pdf ↗

The paper finds curves minimizing elastic energy pinned at endpoints.

problem Finding curves that minimize elastic energy with fixed endpoints.
method Applying the shooting method to identify and classify critical points.
result Critical points consist of wavelike elasticae, and minimizers have no loops or interior inflection points.

FlexServe simplifies deployment of PyTorch models as REST endpoints.

problem Lack of control over model evolution and strict security requirements in operational environments.
method Developed FlexServe, a library to deploy multi-model ensembles with flexible batching.
result Rapid deployment of PyTorch models without intermediate transformations.

It is well known that plane curves with the same endpoints are homotopic. An analogous claim for plane curves with the same endpoints and bounded curvature still remains open. In this work we find necessary and sufficient conditions for two plane curves with bounded curvature to be deformed, one to another, by a contin…

2014-04-16abs ↗pdf ↗

Let M be a possibly non compact smooth manifold. We study genericity in the C^k-topology (3<=k<=+infty) of nondegeneracy properties of semi-Riemannian geodesic flows on M. Namely, we prove a new version of the Bumpy Metric Theorem for a such M and also genericity of metrics that do not possess any degenerate geodesics …

2010-08-30abs ↗pdf ↗

Given a rank-two sub-Riemannian structure (M,Δ)(M,Δ) and a point x0Mx_0\in M, a singular curve is a critical point of the endpoint map F:γγ(1)F:γ\mapstoγ(1) defined on the space of horizontal curves starting at x0x_0. The typical least degenerate singular curves of these structures are called \emph{regular singular curves}; the…

2018-10-30abs ↗pdf ↗

The paper classifies and analyzes the stability of elastic curves with fixed endpoints.

problem Classification and stability of pinned elasticae.
method Critical points of the length-penalized elastic bending energy among planar curves with fixed endpoints.
result Explicit parametrization and classification of all critical points with a threshold parameter \(\hatλ \simeq 0.70107\).

New models for short rates show longer periods at higher rates.

problem Modeling longer periods of higher interest rates.
method Developed a class of time-homogeneous one-factor Markov diffusion models with specific boundary conditions.
result Explicit expressions for bond prices and transition densities in new probability measure.

For a Riemannian manifold (M,g)(M,g) with strictly convex boundary M\partial M, the lens data consists in the set of lengths of geodesics γγ with endpoints on M\partial M, together with their endpoints (x,x+)M×M(x_-,x_+)\in \partial M\times \partial M and tangent exit vectors (v,v+)TxM×Tx+M(v_-,v_+)\in T_{x_-} M\times T_{x_+} M. We show …

2014-12-04abs ↗pdf ↗

We investigate the evolution of open curves with fixed endpoints under the curve shortening flow, which evolves curves in proportion to their curvature. Using a distance comparison of Huisken, we determine the long-term behavior of open curves with fixed endpoints evolving in certain convex domains on surfaces of const…

2012-08-16abs ↗pdf ↗

Study on Hausdorff dimension of lamination endpoints for fully irreducible automorphisms.

problem Hausdorff dimension of lamination endpoints for fully irreducible automorphisms of free groups.
method Analysis of attracting laminations and ending laminations, using properties of hyperbolic surfaces and free-by-cyclic groups.
result For fully irreducible automorphisms, the set of endpoints of the ending lamination has Hausdorff dimension 0.

Proves Morse index theorem for geodesics in conic Finsler manifolds.

problem Geodesic index theorem in conic Finsler manifolds with variable endpoints.
method Proves Morse index theorem for geodesics connecting submanifolds in a C7C^7 manifold with a C6C^6 conic pseudo-Finsler metric.
result Establishes the Morse index theorem for geodesics in conic Finsler manifolds.

We prove that the curvature flow of an embedded planar network of three curves connected through a triple junction, with fixed endpoints on the boundary of a given strictly convex domain, exists smooth until the lengths of the three curves stay far from zero. If this is the case for all times, then the evolution exists…

2013-01-15abs ↗pdf ↗

TA-CQR predicts regression intervals with exact coverage, splitting miscoverage between endpoints.

problem Predicting regression intervals with exact coverage under reporting constraints.
method TA-CQR uses tail allocation to parameterize the oracle, estimating the allocation by searching quantile cores and applying nonnegative additive split-conformal calibration.
result TA-CQR achieves exact finite-sample marginal coverage under exchangeability, with theoretical guarantees on calibration and length.

QGMS framework detects market endpoints using geometric patterns.

problem Identifying market endpoints in large-scale movements.
method Hybrid of geometric pattern recognition and quantitative modeling.
result Consistently identifies market endpoints before major reversals.

We review and organize some results describing the behavior of a Teichmüller geodesic and draw several applications: 1) We show that Teichmüller geodesics do not back track. 2) We show that a Teichmüller geodesic segment whose endpoints are in the thick part has the fellow travelling property. This fails when the endpo…

2010-11-27abs ↗pdf ↗

Study Dirac operators on finite warped cylinders with gauge fields.

problem Characterize spectral flow on finite warped cylinders with gauge fields.
method Identify endpoint operators, derive determinant characterization, introduce regularized APS conditions.
result Regularized APS conditions admit a spectral-flow framework, matching zero-mode sets.

The study of smoothing arcs and curves on surfaces, proving tautness and arc length spectrum properties.

problem Analyzing the geometric and combinatorial effects of smoothing intersections in arcs or curves.
method Geometric and combinatorial analysis, proving tautness and arc length spectrum properties.
result Shortest arcs with self-intersections have exactly or at most one more self-intersection than the self-intersection number.

We investigate the Tits boundary of locally compact CAT(0) 2-complexes. In particular we show that away from the endpoints, a geodesic segment in the Tits boundary is the ideal boundary of an isometrically embedded Euclidean sector. As applications, we provide sufficient conditions for two points in the Tits boundary t…

2003-03-11abs ↗pdf ↗

The paper computes a knot's Kauffman bracket polynomial using recursive concatenation of a 4-tangle shadow.

problem Computing the Kauffman bracket polynomial for complex knots.
method Recursive concatenation of a 4-tangle shadow, followed by a closure operation and polynomial computation.
result A method to compute the Kauffman bracket polynomial for knots formed from 4-tangle shadows.

A tangle is an oriented 1-submanifold of the cylinder whose endpoints lie on the two disks in the boundary of the cylinder. Using an algebraic tool developed by Lescop, we extend the Burau representation of braids to a functor from the category of oriented tangles to the category of Z[t,t^{-1}]-modules. For (1,1)-tangl…

2012-03-20abs ↗pdf ↗

We propose a non-parametric link prediction algorithm for a sequence of graph snapshots over time. The model predicts links based on the features of its endpoints, as well as those of the local neighborhood around the endpoints. This allows for different types of neighborhoods in a graph, each with its own dynamics (e.…

2012-06-27abs ↗pdf ↗

Let M be a possibly noncompact manifold. We prove, generically in the C^k-topology (k=2,...,\infty), that semi-Riemannian metrics of a given index on M do not possess any degenerate geodesics satisfying suitable boundary conditions. This extends a result of Biliotti, Javaloyes and Piccione for geodesics with fixed endp…

2009-10-21abs ↗pdf ↗

A new sampler for FLMs improves token-level decoding controls.

problem Sampling from FLMs using standard methods collapses marginals and produces invalid sequences.
method Samples clean one-hot endpoints from FLM token marginals and uses Ornstein-Uhlenbeck bridges conditioned on these endpoints.
result The method preserves token-wise posterior-predictive marginals and improves quality-diversity tradeoff.

ACP-UCB1 ranks arms based on upper-tail performance, improving stochastic bandit algorithms.

problem Stochastic bandit algorithms often favor arms with strong upper-tail performance, which is not well-addressed by classical mean-reward criteria.
method ACP-UCB1 combines an adaptive conformal estimate of the upper endpoint with a UCB-type optimism bonus.
result ACP-UCB1 achieves logarithmic upper-quantile regret with per-arm contribution \(O( icefrac{\log n}{Δ_j^{\mathrm{ACP}}})\).

The focal locus ΣXΣ_X of an affine variety XX is roughly speaking the (projective) closure of the set of points OO for which there is a smooth point xXx \in X and a circle with centre OO passing through xx which osculates XX in xx. Algebraic geometry interprets the focal locus as the branching locus of the endpoi…

2000-05-10abs ↗pdf ↗

QDSB accelerates Schrödinger bridge learning with quantized approximations.

problem Learning generative models from unpaired samples.
method Quantized diffusion Schrödinger bridges (QDSB) using anchor-quantized distributions and cell-wise sampling.
result QDSB achieves sample quality similar to existing methods but with significantly less computational time.

The multi dimensional string objects are introduced as a new alternative for an application of string models for time series forecasting in trading on financial markets. The objects are represented by open string with 2-endpoints and D2-brane, which are continuous enhancement of 1-endpoint open string model. We show ho…

2016-07-18abs ↗pdf ↗

Improved Strichartz estimates for Schrödinger equation on negatively curved manifolds.

problem Improving Strichartz estimates for Schrödinger equation on negatively curved compact manifolds.
method Analyzing the Schrödinger equation on negatively curved compact manifolds, obtaining improved Strichartz estimates.
result Improved Strichartz estimates, including no-loss estimates for hyperbolic surfaces.

WEINCE improves contrastive learning by correcting softmax biases.

problem Softmax in InfoNCE can lead to misaligned statistical assumptions in contrastive learning.
method WEINCE uses anchor-wise online batch statistics to blend softmax logits with an endpoint shortfall correction.
result WEINCE yields consistent improvements in frozen-feature evaluation across five vision benchmarks.

Study on straight-line flows for generative modeling with theoretical obstructions.

problem Existence and obstructions of straight-line flows in generative modeling.
method Characterizations of straight-line flows through PDEs involving conditional statistics of stochastic processes.
result Sharp dichotomy in the existence of straight-line flows for targets with well-separated modes.

We study the local geometry of the space of horizontal curves with endpoints freely varying in two given submanifolds P\mathcal P and Q\mathcal Q of a manifold M\mathcal M endowed with a distribution $\mathcal D\subset T\M$. We give a different proof, that holds in a more general context, of a result by Bismut (Larg…

1999-11-26abs ↗pdf ↗