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

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for REST endpoints

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.

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 ↗

Paper identifies resting positions using EGG, ECG, respiration rate, and SpO2.

problem Identifying the resting position for health monitoring.
method Hybrid stacked ensemble machine learning model combining Decision tree, Random Forest, and Xgboost.
result 100% accurate prediction of resting positions.

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.

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.

BrainSurfCNN predicts task contrasts from resting-state fingerprints, improving accuracy over baseline.

problem Predicting task-evoked activity from resting-state functional connectivity.
method Surface-based convolutional neural network (BrainSurfCNN) with reconstructive-contrastive loss.
result Significantly improved accuracy in predicting task contrasts over baseline.

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 ↗

REST improves robustness and efficiency of sleep monitoring models.

problem Noise and energy efficiency in deep learning models for home health monitoring.
method Adversarial training and spectral/sparsity regularization.
result REST models achieve 19x parameter reduction and 15x MFLOPS reduction with 17x energy reduction and 9x faster inference.

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 ↗

The paper tackles rested bandits with non-decreasing and concave rewards, deriving lower bounds and an efficient algorithm.

problem Studying the sample complexity and optimal strategies for rested bandits with specific reward properties.
method Deriving regret lower bounds and designing an efficient algorithm R-ed-UCB with theoretical and empirical analysis.
result An efficient algorithm R-ed-UCB with a regret bound of O~(T23)\widetilde{\mathcal{O}}(T^{\frac{2}{3}}) under certain conditions.

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.

Study on spin-zero rest-mass fields using conformal geometric method.

problem Wellposedness of Cauchy and Goursat problems for spin-n/2n/2 zero rest-mass equations.
method Conformal geometric method, energy equalities, partial conformal compactification.
result Proves wellposedness of Cauchy and Goursat problems and establishes field decays.

Graph-Triggered Bandits unify rested and restless bandits with graph-defined arm interactions.

problem Modeling sequential decision-making problems with evolving arm rewards.
method Graph-Triggered Bandits (GTBs) framework that generalizes rested and restless bandits using a graph.
result Rested and restless bandits are special cases of GTBs for suitable graphs.

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 ↗

Improved diffusion models achieve state-of-the-art likelihoods in image density estimation.

problem Improving likelihood-based performance of diffusion models.
method Joint optimization of noise schedule and model parameters, using signal-to-noise ratio simplification.
result State-of-the-art likelihoods on image density estimation benchmarks, faster optimization.

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 ↗

Proposes SOVR loss to improve adversarial robustness by increasing logit margins.

problem Adversarial training's difficulty in robustness against sophisticated attacks.
method Introduces SOVR loss function that switches from cross-entropy to one-vs-the-rest loss for important samples.
result SOVR loss increases logit margins of important samples, improving robustness against Auto-Attack.

Training of one-vs.-rest SVMs can be parallelized over the number of classes in a straight forward way. Given enough computational resources, one-vs.-rest SVMs can thus be trained on data involving a large number of classes. The same cannot be stated, however, for the so-called all-in-one SVMs, which require solving a …

2016-11-25abs ↗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.

Machine learning techniques have gained prominence for the analysis of resting-state functional Magnetic Resonance Imaging (rs-fMRI) data. Here, we present an overview of various unsupervised and supervised machine learning applications to rs-fMRI. We present a methodical taxonomy of machine learning methods in resting…

2018-12-30abs ↗pdf ↗

Stochastic encoding improves gender classification of brain networks from UK Biobank data.

problem Complexity and bias in interpreting deep learning models of brain connectivity.
method Stochastic encoding in ensemble of CNNs, multivariate balancing algorithm.
result AUROC of 0.8459, with resting-state data more accurate than task data.